XTC: a practical topology control algorithm for ad-hoc networks
- 10 June 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The XTC ad-hoc network topology control algorithm intro- duced in this paper shows three main advantages over previously proposed algorithms. First, it is extremely simple and strictly lo- cal. Second, it does not assume the network graph to be a Unit Disk Graph; XTC proves correct also on general weighted net- work graphs. Third, the algorithm does not require availability of node position information. Instead, XTC operates with a general notion of order over the neighbors' link qualities. In the special case of the network graph being a Unit Disk Graph, the resulting topology proves to have bounded degree, to be a planar graph, and—on average-case graphs—to be a good spanner.Keywords
This publication has 21 references indexed in Scilit:
- Ad-hoc networks beyond unit disk graphsPublished by Association for Computing Machinery (ACM) ,2003
- Worst-Case optimal and average-case efficient geometric ad-hoc routingPublished by Association for Computing Machinery (ACM) ,2003
- DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKSInternational Journal of Foundations of Computer Science, 2003
- Distributed topology control for power efficient operation in multihop wireless ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Topology control of multihop wireless networks using transmit power adjustmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networksPublished by Association for Computing Machinery (ACM) ,2001
- Unidirectional links prove costly in wireless ad hoc networksPublished by Association for Computing Machinery (ACM) ,1999
- Minimum energy mobile wireless networksIEEE Journal on Selected Areas in Communications, 1999
- Optimal Transmission Ranges for Randomly Distributed Packet Radio TerminalsIEEE Transactions on Communications, 1984
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982