GERY - Faculty of Geography Repository
University of Belgrade - Faculty of Geography
    • English
    • Serbian (Cyrillic)
    • Serbian (Latin)
  • English 
    • English
    • Serbian (Cyrillic)
    • Serbian (Latin)
  • Login
View Item 
  •   GERY
  • Geografski fakultet
  • Radovi istraživača
  • View Item
  •   GERY
  • Geografski fakultet
  • Radovi istraživača
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Routing tree implementation based on semimatching algorithm(s)

No Thumbnail
Authors
Benkić, Karl
Peulić, Aleksandar
Conference object (Published version)
Metadata
Show full item record
Abstract
This paper proposes and evaluates the variation of an algorithm for optimal semi-matching, based on the Hungarian method. The proposed algorithm balances the parent-child vertexes in a bipartite graph and can be applied to a wireless sensor network as an algorithm for building virtual routing tree topology. Virtual routing tree topology optimizes the minimum number of message hops to the sink and load balancing. The proposed algorithm runs faster than other compared methods. Virtual topology (spanned tree) is used during very simple routing protocol. Experimental results show that the proposed algorithm preserves the energy, excludes bottle necks, red spots, and expands the lifetime of a network.
Keywords:
routing / optimal semi-matching / wireless sensor networks.
Source:
2013 21st Telecommunications Forum (TELFOR), 2013, 809-+
Publisher:
  • IEEE, New York
Funding / projects:
  • FERI faculty,University of Maribor, Slovenia

WoS: 000349857500187

Scopus: 2-s2.0-84894300803
[ Google Scholar ]
URI
https://gery.gef.bg.ac.rs/handle/123456789/599
Collections
  • Radovi istraživača
Institution/Community
Geografski fakultet
TY  - CONF
AU  - Benkić, Karl
AU  - Peulić, Aleksandar
PY  - 2013
UR  - https://gery.gef.bg.ac.rs/handle/123456789/599
AB  - This paper proposes and evaluates the variation of an algorithm for optimal semi-matching, based on the Hungarian method. The proposed algorithm balances the parent-child vertexes in a bipartite graph and can be applied to a wireless sensor network as an algorithm for building virtual routing tree topology. Virtual routing tree topology optimizes the minimum number of message hops to the sink and load balancing. The proposed algorithm runs faster than other compared methods. Virtual topology (spanned tree) is used during very simple routing protocol. Experimental results show that the proposed algorithm preserves the energy, excludes bottle necks, red spots, and expands the lifetime of a network.
PB  - IEEE, New York
C3  - 2013 21st Telecommunications Forum (TELFOR)
T1  - Routing tree implementation based on semimatching algorithm(s)
SP  - 809
EP  - +
UR  - conv_1517
ER  - 
@conference{
author = "Benkić, Karl and Peulić, Aleksandar",
year = "2013",
abstract = "This paper proposes and evaluates the variation of an algorithm for optimal semi-matching, based on the Hungarian method. The proposed algorithm balances the parent-child vertexes in a bipartite graph and can be applied to a wireless sensor network as an algorithm for building virtual routing tree topology. Virtual routing tree topology optimizes the minimum number of message hops to the sink and load balancing. The proposed algorithm runs faster than other compared methods. Virtual topology (spanned tree) is used during very simple routing protocol. Experimental results show that the proposed algorithm preserves the energy, excludes bottle necks, red spots, and expands the lifetime of a network.",
publisher = "IEEE, New York",
journal = "2013 21st Telecommunications Forum (TELFOR)",
title = "Routing tree implementation based on semimatching algorithm(s)",
pages = "809-+",
url = "conv_1517"
}
Benkić, K.,& Peulić, A.. (2013). Routing tree implementation based on semimatching algorithm(s). in 2013 21st Telecommunications Forum (TELFOR)
IEEE, New York., 809-+.
conv_1517
Benkić K, Peulić A. Routing tree implementation based on semimatching algorithm(s). in 2013 21st Telecommunications Forum (TELFOR). 2013;:809-+.
conv_1517 .
Benkić, Karl, Peulić, Aleksandar, "Routing tree implementation based on semimatching algorithm(s)" in 2013 21st Telecommunications Forum (TELFOR) (2013):809-+,
conv_1517 .

DSpace software copyright © 2002-2015  DuraSpace
About GERY - GEography RepositoRY | Send Feedback

OpenAIRERCUB
 

 

All of DSpaceInstitutions/communitiesAuthorsTitlesSubjectsThis institutionAuthorsTitlesSubjects

Statistics

View Usage Statistics

DSpace software copyright © 2002-2015  DuraSpace
About GERY - GEography RepositoRY | Send Feedback

OpenAIRERCUB