Title :
Routing tree implementation based on semi-matching algorithm(s)
Author :
Benkic, Karl ; Peulic, Aleksandar
Author_Institution :
Meas. & Regul. Equip. Manuf., Metreld.d., Horjul, Slovenia
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 :
resource allocation; routing protocols; telecommunication network topology; trees (mathematics); wireless sensor networks; Hungarian method; bottle necks; load balancing; network lifetime; parent-child vertexes; red spots; routing protocol; semi-matching algorithm; virtual routing tree topology; wireless sensor network; Volume measurement; Wireless sensor networks; optimal semi-matching; routing; wireless sensor networks;
Conference_Titel :
Telecommunications Forum (TELFOR), 2013 21st
Conference_Location :
Belgrade
Print_ISBN :
978-1-4799-1419-7
DOI :
10.1109/TELFOR.2013.6716353