Lichun Bao
ABSTRACT
The efficiency of a communication network depends not only on its control protocols, but also on its topology. We propose a distributed topology management algorithm that constructs and maintains a backbone topology based on a minimal dominating set (MDS) of the network. According to this algorithm, each node determines the membership in the MDS for itself and its one-hop neighbors based on two-hop neighbor information that is disseminated among neighboring nodes. The algorithm then ensures that the members of the MDS are connected into a connected dominating set (CDS), which can be used to form the backbone infrastructure of the communication network for such purposes as routing. The correctness of the algorithm is proven, and the efficiency is compared with other topology management heuristics using simulations. Our algorithm shows better behavior and higher stability in ad hoc networks than prior algorithms.
- A. Amis, R. Prakash, T. Vuong, and D.T. Huynh. MaxMin D-Cluster Formation in Wireless Ad Hoc Networks. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), Mar. 1999.Google Scholar
- A.D. Amis and R. Prakash. Load-balancing clusters in wireless ad hoc networks. In Proceedings 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology, pages 25--32, Los Alamitos, CA, Mar. 24--25 2000. Google ScholarDigital Library
- D.J. Baker and A. Ephremides. The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications, COM-29(11):1694--701, Nov. 1981.Google Scholar
- S. Banerjee and S. Khuller. A Clustering Scheme for Hierarchical Control in Multi-hop Wireless Networks. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), Anchorage, Alaska, Apr. 2001.Google ScholarCross Ref
- L. Bao and J.J. Garcia-Luna-Aceves. A New Approach to Channel Access Scheduling for Ad Hoc Networks. In Proc. ACM Seventh Annual International Conference on Mobile Computing and networking, Rome, Italy, Jul. 16--21 2001. Google ScholarDigital Library
- L. Bao and J.J. Garcia-Luna-Aceves. Transmission Scheduling in Ad Hoc Networks with Directional Antennas. In Proc. ACM Eighth Annual International Conference on Mobile Computing and networking, Atlanta, Georgia, USA, Sep. 23--28 2002. Google ScholarDigital Library
- P. Basu, N. Khan, and T. D.C. Little. A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks. In International Workshop on Wireless Networks and Mobile Computing (WNMC2001), Scottsdale, Arizona, Apr. 16--19 2001.Google Scholar
- B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris. Span: an Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks. In Proc. 7th ACM MOBICOM, Rome, Italy, Jul. 2001. Google ScholarDigital Library
- C.C. Chiang, H.K. Wu, W. Liu, and M. Gerla. Routing in clustered multihop, mobile wireless networks with fading channel. In IEEE Singapore International Conference on Networks SICON'97, pages 197--211, Singapore, Apr. 14--17 1997.Google Scholar
- T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, a. Qayyum, and L. Viennot. Optimized Link State Routing Protocol. In IEEE INMIC, Pakistan, 2001. Google ScholarDigital Library
- A. Ephremides, J. E. Wieselthier, and D. J. Baker. A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. of IEEE, 75(1):56--73, Jan. 1987.Google ScholarCross Ref
- M.R. Garey and D.S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. Freeman, Oxford, UK, 1979. Google ScholarDigital Library
- M. Gerla and J.T.C. Tsai. Multicluster, mobile, multimedia radio network. Wireless Networks, 1(3):255--65, 1995. Google ScholarDigital Library
- S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20, (no.4):374--87, Apr. 1998. Springer-Verlag. Google ScholarDigital Library
- L. Hu. Topology control for multihop packet radio networks. IEEE Transactions on Communications, 41(10):1474--81, Oct. 1993.Google ScholarCross Ref
- L. Jia, R. Rajaraman, and T. Suel. An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In Twentieth ACM Symposium on Principles of Distributed Computing PODC'01, Newport, Rhode Island, Aug. 26--29 2001.Google Scholar
- P. Krishna, N. Vaidya, M. Chatterjee, and D. Pradhan. A cluster-based approach for routing in dynamic networks. ACM SIGCOMM Computer Communication Review, pages 49--65, Apr. 1997. Google ScholarDigital Library
- L. Li, V. Bahl, Y.M. Wang, and R. Wattenhofer. Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), Apr. 2001.Google Scholar
- C.R. Lin and M. Gerla. Adaptive Clustering for Mobile Wireless Networks. IEEE Journal on Selected Areas in Communications, 15(7):1265--75, Sep. 1997. Google ScholarDigital Library
- S. Narayanaswamy, V. Kawadia, R. S. Sreenivas, and P. R. Kumar. Power Control in Ad-Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol. In Proceedings of the European Wireless Conference -- Next Generation Wireless Networks: Technologies, Protocols, Services and Applications, pages 156--162, Florence, Italy, Feb. 25--28 2002.Google Scholar
- R. Prakash. Unidirectional links prove costly in Wireless Ad-Hoc Networks. In Proceedings of the Discrete Algorithms and Methods for Mobile Computing and Communications -- DialM, Seattle, WA, Aug. 20 1999. Google ScholarDigital Library
- R. Ramanathan and R. Rosales-Hain. Topology Control of Multihop Wireless Networks using Transmit Power Adjustment. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), page N.A. IEEE, Mar. 26--30 2000.Google ScholarCross Ref
- R. Ramanathan and M. Steenstrup. Hierarchically-organized, multihop mobile wireless networks for quality-of-service support. Mobile Networks and Applications, 3(1):101--19, 1998. Google ScholarDigital Library
- P. Sinha, R. Sivakumar, and V. Bharghavan. Enhancing ad hoc routing with dynamic virtual infrastructures. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), pages 1763--72, Anchorage, AK, USA, Apr. 22--26 2001.Google ScholarCross Ref
- R. Sivakumar, P. Sinha, and V. Bharghavan. CEDAR: a core-extraction distributed ad hoc routing algorithm. IEEE Journal on Selected Areas in Communications, 17(8):1454--65, Aug. 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--57, Mar. 1984.Google ScholarCross Ref
Index Terms
- Topology management in ad hoc networks
Recommendations
Timer-Based CDS Construction in Wireless Ad Hoc Networks
The connected dominating set (CDS) has been extensively used for routing and broadcast in wireless ad hoc networks. While existing CDS protocols are successful in constructing CDS of small size, they either require localized information beyond immediate ...
Topology and mobility considerations in mobile ad hoc networks
A highly dynamic topology is a distinguishing feature and challenge of a mobile ad hoc network. Links between nodes are created and broken, as the nodes move within the network. This node mobility affects not only the source and/or destination, as in a ...
Stable energy-aware topology management in ad hoc networks
The efficiency of a communication network depends not only on its control protocols, but also on the underlying network topology. We propose a distributed topology management algorithm that constructs and maintains a backbone topology based on a minimal ...
Comments