Martin Burkhart
ABSTRACT
Topology control in ad-hoc networks tries to lower node energy consumption by reducing transmission power and by confining interference, collisions and consequently retransmissions. Commonly low interference is claimed to be a consequence to sparseness of the resulting topology. In this paper we disprove this implication. In contrast to most of the related work claiming to solve the interference issue by graph sparseness without providing clear argumentation or proofs, we provide a concise and intuitive definition of interference. Based on this definition we show that most currently proposed topology control algorithms do not effectively constrain interference. Furthermore we propose connectivity-preserving an spanner constructions that are interference-minimal.
- K. Alzoubi, P.-J. Wan, and O. Frieder. Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In Proc. of the 3rd ACM Int. Symposium on Mobile ad hoc networking & computing (MOBIHOC), 2002. Google Scholar
Digital Library
- L. Bao and J. Garcia-Luna-Aceves. Topology Management in Ad Hoc Networks. In Proc. of the 4th ACM Int. Symposium on Mobile Ad-Hoc Networking and Computing (MOBIHOC), 2003. Google ScholarDigital Library
- D. Blough, M. Leoncini, G. Resta, and P. Santi. The K-Neigh Protocol for Symmetric Topology in Ad Hoc Networks. In Proc. of the 4th ACM Int. Symposium on Mobile Ad-Hoc Networking and Computing (MOBIHOC), 2003. Google ScholarDigital Library
- P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with Guaranteed Delivery in ad hoc Wireless Networks. In Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), pages 48--55, 1999. Google ScholarDigital Library
- T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms, chapter 24.2. MIT Press, Cambridge, MA, USA, 1990. Google ScholarDigital Library
- K. Gabriel and R. Sokal. A New Statistical Approach to Geographic Variation Analysis. Systematic Zoology, 18:259--278, 1969.Google Scholar
- T. Hou and V. Li. Transmission Range Control in Multihop Packet Radio Networks. IEEE Transactions on Communications, 34(1):38--44, 1986.Google Scholar
- L. Hu. Topology Control for Multihop Packet Radio Networks. IEEE Trans. on Communications, 41(10), 1993.Google Scholar
- L. Jia, R. Rajaraman, and R. Suel. An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC), pages 33--42, 2001.Google Scholar
- B. Karp and H. Kung. GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In Proc. of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM), pages 243--254, 2000. Google ScholarDigital Library
- V. Kawadia and P. Kumar. Power Control and Clustering in Ad Hoc Networks. In Proc. of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2003.Google Scholar
- F. Kuhn and R. Wattenhofer. Constant-Time Distributed Dominating Set Approximation. In Proc. of the 22nd ACM Symposium on the Principles of Distributed Computing (PODC), 2003. Google ScholarDigital Library
- F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric Routing: Of Theory and Practice. In Proc. of the 22nd ACM Symposium on the Principles of Distributed Computing (PODC), 2003. Google ScholarDigital Library
- N. Li, C.-J. Hou, and L. Sha. Design and Analysis of an MST-Based Topology Control Algorithm. In Proc. of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2003.Google ScholarCross Ref
- X.-Y. Li, G. Calinescu, and P.-J. Wan. Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks. In Proc. of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2002.Google Scholar
- F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald. Energy, Congestion and Dilation in Radio Networks. In Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures, 10-13 Aug. 2002. Google ScholarDigital Library
- D. Peleg. Distributed Computing, A Locality-Sensitive Approach, chapter 5.5. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000. Google ScholarDigital Library
- R. Prakash. Unidirectional Links Prove Costly in Wireless Ad-Hoc Networks. In Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), 1999. Google ScholarDigital Library
- R. Ramanathan and R. Rosales-Hain. Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment. In Proc. of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2000.Google ScholarCross Ref
- V. Rodoplu and T. H. Meng. Minimum energy mobile wireless networks. IEEE J. Selected Areas in Communications, 17(8), 1999. Google ScholarDigital Library
- H. Takagi and L. Kleinrock. Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals. IEEE Transactions on Communications, 32(3):246--257, 1984.Google Scholar
- G. Toussaint. The Relative Neighborhood Graph of a Finite Planar Set. Pattern Recognition, 12(4):261--268, 1980.Google ScholarCross Ref
- Y. Wang and X.-Y. Li. Localized Construction of Bounded Degree Planar Spanner. In Proc. of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003. Google ScholarDigital Library
- R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang. Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks. In Proc. of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 1388--1397, 2001.Google Scholar
Index Terms
- Does topology control reduce interference?
Recommendations
A Link Interference-Avoidance Topology Control Algorithm in Ad Hoc Network
CSSS '12: Proceedings of the 2012 International Conference on Computer Science and Service SystemIn wireless Ad Hoc network, the lower nodes transmitting interference to achieve the control of network conflict is one of the targets of network topology control. Based on the analysis of Ad Hoc network model and network interference model, this paper ...
Comparison of local interference-aware topology control algorithms
PDCS '07: Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and SystemsWireless allows to interconnect a large number of nodes in ad-hoc networks by multipoint channels. Although multipoint communication can reduce data and control traffic significantly, the fact that the transmitting stations are sharing a single channel, ...
Reducing interference in ad hoc networks through topology control
DIALM-POMC '05: Proceedings of the 2005 joint workshop on Foundations of mobile computingTopology control aims to increase the lifetime of an ad hoc network by selecting only a subset of the available links to be used for routing. The tradeoff between keeping the spanner properties of the graph while sparsifying the graph has been well ...
Comments