Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Routing performance in the presence of unidirectional links in multihop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Sparse Power Efficient Topology for Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Localized algorithms for energy efficient topology in wireless ad hoc networks
Mobile Networks and Applications
S-XTC: A Signal-Strength Based Topology Control Algorithm for Sensor Networks
ISADS '07 Proceedings of the Eighth International Symposium on Autonomous Decentralized Systems
An SPT-based topology control algorithm for wireless ad hoc networks
Computer Communications
An adaptive MST-based topology connectivity control algorithm for wireless ad-hoc networks
International Journal of Communication Networks and Distributed Systems
A framework for disaster management using wireless ad hoc networks
Proceedings of the 2011 International Conference on Communication, Computing & Security
Virtual Game-Based Energy Balanced Topology Control Algorithm for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.24 |
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.