The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2008 vol.57)
pp: 702-715
ABSTRACT
In this paper, we propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). This approach uses an iterative application of a selected local solution. Each application of the local solution enhances the result obtained from the previous iteration, but each is based on a different node priority scheme. Then, we integrate this iterative process into the process for handling dynamic network topology and propose two extensions: cyclic iterative local solution (CILS) and seamless iterative local solution (SILS). CILS offers a natural extension of ILS to the dynamic environment, but suffers from broken CDS and non-adaptiveness. With a novel use of a monotonically increasing sequence number for dynamic node priority, SILS offers an extension with the desirable properties of correctness, progressiveness, locality, and seamlessness. Extensive simulations are conducted, under ns-2 and a custom simulator, to evaluate the effectiveness of the proposed approach in both static and dynamic environments.
INDEX TERMS
Connected dominating set (CDS), dynamic node priority, local solution, mobile ad hoc networks (MANETs), simulation, wireless sensor networks (WSNs)
CITATION
Jie Wu, Fei Dai, Shuhui Yang, "Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks", IEEE Transactions on Computers, vol.57, no. 5, pp. 702-715, May 2008, doi:10.1109/TC.2008.25
REFERENCES
[1] C. Adjih, P. Jacquet, and L. Viennot, “Computing Connected Dominated Sets with Multipoint Relays,” Technical Report 4597, INRIA-Rapport de recherche, Oct. 2002.
[2] C. Adjih, P. Jacquet, and L. Viennot, “Computing Connected Dominated Sets with Multipoint Relays,” http://www.inria.fr/rrrtrr-4597.html, 2002.
[3] K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Frieder, “Geometric Spanners for Wireless Ad Hoc Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 5, pp. 408-421, May 2003.
[4] K.M. Alzoubi, P.J. Wan, and O. Frieder, “Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc '02, pp. 157-164, 2002.
[5] K.M. Alzoubi, P.J. Wan, and O. Frieder, “New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks,” Proc. 35th Hawaii Int'l Conf. System Sciences, 2002.
[6] S. Basagni, M. Mastrogiovanni, A. Panconesi, and C. Petrioli, “Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 4, pp. 292-306, Apr. 2006.
[7] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. & Mobile Computing, special issue on mobile ad hoc networking: research, trends and applications, vol. 2, no. 5, pp. 483-502, 2002.
[8] J. Carle and D. Simplot-Ryl, “Energy-Efficient Area Monitoring for Sensor Networks,” Computer, vol. 37, no. 2, pp. 40-46, Feb. 2004.
[9] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Proc. ACM MobiCom, 2001.
[10] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” ACM Wireless Networks J., vol. 8, no. 5, pp. 481-494, 2002.
[11] V. Chvatal, “A Greedy Heuristic for the Set-Covering Problem,” Math. Operation Research, vol. 4, no. 3, pp. 233-235, 1979.
[12] T. Clausen and P. Jacquet, “Optimized Link State Routing Protocol,” IETF drafts (draft-ietf-MANET-olsr-11.txt), 2003.
[13] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. McGraw-Hill, 2001.
[14] F. Dai and J. Wu, “An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 10, pp. 908-920, Oct. 2004.
[15] B. Das, R. Sivakumar, and V. Bharghavan, “Routing in Ad-Hoc Networks Using a Spine,” Proc. Int'l Conf. Computer Comm. and Networks, 1997.
[16] D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan, “Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons,” Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 717-724, Jan. 2003.
[17] K. Fall and K. Varadham, “The ns Manual,” The VINT Project, http://www.sis.edu/nanam/nsdoc/, 2002.
[18] J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, “Discrete Mobile Centers,” Proc. 17th ACM Symp. Computational Geometry, 2001.
[19] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Algorithmica, vol. 20, no. 4, pp. 374-387, 1998.
[20] D.B. Johnson, Y.-C. Hu, J. Broch, J. Jetcheva, and D.A. Maltz, “The CMU Monarch Project's Wireless and Mobility Extensions to ns,” Proc. 42nd Int'l Eng. Task Force, 1998.
[21] F. Kuhn and R. Wattenhofer, “Constant-Time Distributed Dominating Set Approximation,” Proc. 22nd ACM Int'l Symp. Principles of Distributed Computing, 2003.
[22] H. Lim and C. Kim, “Flooding in Wireless Ad Hoc Networks,” Computer Comm. J., vol. 24, nos. 3-4, pp. 353-363, 2001.
[23] C.R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 15, no. 7, pp. 1265-1275, 1996.
[24] H. Liu, Y. Pan, and J. Cao, “An Improved Distributed Algorithm for Connected Dominating Sets in Wireless Ad Hoc Networks,” Proc. Second Int'l Symp. Parallel and Distributed Processing and Applications, 2004.
[25] W. Lou and J. Wu, “On Reducing Broadcast Redundancy in AdHoc Wireless Networks,” IEEE Trans. Mobile Computing, vol. 1, no. 2, pp. 111-122, Apr.-June 2002.
[26] M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, and D.J. Rosenkrantz, “Simple Heuristics for Unit Disk Graphs,” Networks, vol. 25, pp. 59-68, 1995.
[27] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying for Flooding Broadcast Message in Mobile Wireless Networks,” Proc. 35th Hawaii Int'l Conf. System Sciences, 2002.
[28] P. Sinha, R. Sivakumar, and V. Bharghavan, “CEDAR: A Core-Extraction Distributed Ad Hoc Routing Algorithm,” IEEE J. Selected Areas in Comm., special issue on ad hoc networks, vol.17, no. 8, pp. 1454-1465, Aug. 1999.
[29] P. Sinha, R. Sivakumar, and V. Bharghavan, “Enhancing Ad Hoc Routing with Dynamic Virtual Infrastructures,” Proc. IEEE INFOCOM, 2001.
[30] I. Stojmenovic, “Data Gathering and Activity Scheduling in AdHoc and Sensor Networks,” Proc. Int'l Workshop Theoretical Aspects of Wireless Ad Hoc, Sensor, and Peer-to-Peer Networks, 2004.
[31] I. Stojmenovic, S. Seddigh, and J. Zunic, “Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
[32] H.S. Stone, High-Performance Computer Architecture, third ed. Addison-Wesley, 1993.
[33] P.J. Wan, K. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, 2002.
[34] J. Wu and F. Dai, “A Generic Distributed Broadcast Scheme in AdHoc Wireless Networks,” Proc. 23rd IEEE Int'l Conf. Distributed Computing Systems, 2003.
[35] J. Wu and H. Li, “On Calculating Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,” Proc. Third ACM Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., 1999.
[36] J. Wu and W. Lou, “Forward-Node-Set-Based Broadcast in Clustered Mobile Ad Hoc Networks,” Wireless Networks and Mobile Computing, special issue on algorithmic, geometric, graph, combinatorial, and vector aspects, vol. 3, no. 2, pp. 155-173, 2003.
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool