Distributed topology control algorithm based on one- and two-hop neighbors’ information for ad hoc networks

In this paper, we present a topology control algorithm for ad hoc networks. By considering the weight of the links, each node orders its one-hop neighbors in an ordered list and then the ordered lists are exchanged between the neighbors. This information enables the nodes to compute their transmissi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computer communications Ročník 32; číslo 2; s. 368 - 375
Hlavní autori: Kadivar, Mehdi, Shiri, M.E., Dehghan, Mehdi
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Kidlington Elsevier B.V 12.02.2009
Elsevier
Predmet:
Ad hoc networks
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Distributed algorithms
Energy efficient
Exact sciences and technology
Software
Theoretical computing
Topology control
Topology control
Ad hoc networks
Distributed algorithms
Energy efficient
Euclidean theory
Distributed system
Energy savings
Weighted graph
Loss factor
Network topology
Distributed algorithm
Distributed control
Wireless network
Metric
Transmission loss
Ad hoc network
ISSN:0140-3664, 1873-703X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we present a topology control algorithm for ad hoc networks. By considering the weight of the links, each node orders its one-hop neighbors in an ordered list and then the ordered lists are exchanged between the neighbors. This information enables the nodes to compute their transmission radius on the basis of its one- and two-hop neighbors’ information. We demonstrate that compared to the best known algorithms, the degree and transmission radius of the nodes in the topology produced by the proposed algorithm are smaller. In addition to Euclidean graphs, the algorithm works correctly on general weighted graphs. Also an extension of our algorithm is proposed which adapts its topology to network changes. Finally, we use the four metrics, node degree, transmission radius, the power stretch factor and, packet loss ratio to measure the performance improvements of the presented algorithms through simulations.
ISSN:0140-3664
1873-703X
DOI:10.1016/j.comcom.2008.11.014