Placing and maintaining a core node in wirelessad hoc networks

Wireless ad hoc networks are characterized by several performance metrics, such as bandwidth, transport, delay, power, etc. These networks are examined by constructing a tree network. A core node is usually chosen to be the medianor centerof the multicast tree network with a tendency to minimize a performance metric, such as delay or transport. In this paper, we present a new efficient strategy for constructing and maintaining a core node in a multicast tree for wireless ad hoc networks undergoing dynamic changes, based on local information. The new core ( centdian) function is defined by a convex combination signifying total transport and delay metrics. We provide two bounds of O(d) andO(d + l) time for maintaining the centdian using local updates, where l is the hop count between the new center and the new centdian, and d is the diameter of the tree network. We also show an O(n log n) time solution for finding the centdian in the Euclidian complete network by using the algorithm from [10]. Finally, an extensive simulation for the construction algorithm and the maintenance algorithm is presented along with an interesting observation. Copyright c © 2008 John Wiley & Sons, Ltd.

[1]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[2]  Arie Tamir,et al.  An O(pn2) algorithm for the p-median and related problems on tree graphs , 1996, Oper. Res. Lett..

[3]  Lu Han.  Wireless Ad Hoc Networks , 2020 .

[4]  Dharma P. Agrawal,et al.  Multicast over wireless mobile ad hoc networks: present and future directions , 2003, IEEE Netw..

[5]  Russell R. Barton,et al.  Institute for Operations Research and the Management Sciences , 2004, INFORMS J. Comput..

[6]  R. Ravi.  Steiner Trees and Beyond: Approximation Algorithms for Network Design , 1993 .

[7]  Donghun Lee,et al.  A Novel Communication Architecture to Support Mobile Users in Wireless Sensor Fields , 2007, 2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring.

[8]  Justo Puerto,et al.  The bi-criteria doubly weighted center-median path problem on a tree , 2006, Networks.

[9]  Roger Wattenhofer,et al.  Gathering correlated data in sensor networks , 2004, DIALM-POMC '04.

[10]  J. Halpern.  Finding Minimal Center-Median Convex Combination Cent-Dian of a Graph , 1978 .

[11]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[12]  Jeffrey Scott Vitter,et al.  Approximation Algorithms for Geometric Median Problems , 1992, Inf. Process. Lett..

[13]  G. Winskel.  What Is Discrete Mathematics , 2007 .

[14]  Sandeep K. S. Gupta,et al.  An efficient core migration protocol for QoS in mobile ad hoc networks , 2002, Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326).

[15]  Jon Crowcroft,et al.  Core Based Trees (CBT) An Architecture for Scalable Inter-Domain Multicast Routing , 1993, SIGCOMM 1993.

[16]  Panos M. Pardalos,et al.  Steiner Tree Problems , 2009, Encyclopedia of Optimization.

[17]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[18]  Radha Poovendran,et al.  Maximizing Network Lifetime of Broadcasting Over Wireless Stationary Ad Hoc Networks , 2005, Mob. Networks Appl..

[19]  P.H.J. Chong,et al.  A survey of clustering schemes for mobile ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.

[20]  Robert Benkoczi,et al.  Collection depots facility location problems in trees , 2009, Networks.

[21]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[22]  Mehmet Hakan Karaata,et al.  Self-stabilizing algorithms for finding centers and medians of trees , 1994, PODC '94.

[23]  Konstantinos Kalpakis,et al.  Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks , 2003, Comput. Networks.

[24]  Ki-Il Kim,et al.  A Model to Support Mobile Users in Wireless Sensor Networks , 2007, 2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07).

[25]  Judit Bar-Ilan,et al.  How to Allocate Network Centers , 1993, J. Algorithms.

[26]  Haiyun Luo,et al.  TTDD: Two-Tier Data Dissemination in Large-Scale Wireless Sensor Networks , 2005, Wirel. Networks.

[27]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[28]  Mehmet Hakan Karaata,et al.  Self-Stabilizing Algorithms for Finding Centers and Medians of Trees , 1999, SIAM J. Comput..

[29]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[30]  José A. Moreno-Pérez,et al.  THE 2-FACILITY CENTDIAN NETWORK PROBLEM , 1998 .

[31]  Richard Han,et al.  VLM2: A Very Lightweight Mobile Multicast System for Wireless Sensor Networks ; CU-CS-938-02 , 2002 .

[32]  Aaron Striegel,et al.  A survey of QoS multicasting issues , 2002 .

[33]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[34]  Mirela Ben-Chen,et al.  Distributed computation of virtual coordinates , 2007, SCG '07.

[35]  Nitin H. Vaidya,et al.  Geocasting in mobile ad hoc networks: location-based multicast algorithms , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[36]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[37]  Jonathan Halpern,et al.  THE LOCATION OF A CENTER-MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE* , 1976 .

[38]  Arie Tamir,et al.  Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem , 1998, Discret. Appl. Math..

[39]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[40]  Michael Segal,et al.  Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks , 2007, Networking.

[41]  J. Lansford,et al.  The design and implementation of HomeRF: a radio frequency wireless networking standard for the connected home , 2000, Proceedings of the IEEE.

[42]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[43]  Sandeep K. S. Gupta,et al.  Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[44]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[45]  Matt Welsh,et al.  Ad-hoc multicast routing on resource-limited sensor nodes , 2006, REALMAN '06.

[46]  GuptaHimanshu,et al.  Efficient gathering of correlated data in sensor networks , 2008 .

[47]  Chen Avin,et al.  On the cover time and mixing time of random geometric graphs , 2007, Theor. Comput. Sci..

[48]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[49]  Nicola Santoro,et al.  Distributed algorithms for finding centers and medians in networks , 1984, TOPL.

[50]  John Moy,et al.  Multicast Extensions to OSPF , 1994, RFC.

[51]  Kwang-il Hwang,et al.  Dynamic sink oriented tree algorithm for efficient target tracking of multiple mobile sink users in wide sensor field , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[52]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[53]  Arie Tamir,et al.  A polynomial algorithm for the p-centdian problem on a tree , 1998, Networks.

[54]  Yigal Bejerano.  Efficient integration of multihop wireless and wired networks with QoS constraints , 2004, IEEE/ACM Transactions on Networking.

[55]  Justo Puerto,et al.  Algorithmic results for ordered median problems , 2002, Oper. Res. Lett..

[56]  Radhika Nagpal,et al.  Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network , 2003, IPSN.

[57]  Charles E. Perkins,et al.  Multicast Ad hoc On-Demand Distance Vector (MAODV) Routing , 2000 .

[58]  David Thaler,et al.  Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification , 1997, RFC.

[59]  Michele Zorzi,et al.  On the hop count statistics for randomly deployed wireless sensor networks , 2006, Int. J. Sens. Networks.

[60]  Xiaoyan Hong,et al.  Scalable routing protocols for mobile ad hoc networks , 2002, IEEE Netw..

[61]  Sergey Bereg,et al.  Optimal Facility Location under Various Distance Functions , 1999, WADS.

[62]  Oded Berman,et al.  Medi-centre Location Problems , 1991 .

[63]  Bing-Hong Liu,et al.  Distributed formation of core-based forwarding multicast trees in mobile ad hoc networks , 2006, Telecommun. Syst..

[64]  Akira Miura,et al.  Branch Aggregation Multicast (BAM): An Energy Efficient and Highly Compatible Multicast Protocol for Wireless Sensor Networks , 2006, IEICE Trans. Inf. Syst..

[65]  Justo Puerto,et al.  Locating tree-shaped facilities using the ordered median objective , 2005, Math. Program..

[66]  J. Acimovic,et al.  Adaptive distributed algorithms for power-efficient data gathering in sensor networks , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[67]  S. V. Raghavan,et al.  Survey of multicast routing algorithms and protocols , 2002 .

[68]  Hossam S. Hassanein,et al.  Reliable multicast in wireless ad hoc and sensor networks , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[69]  Prasant Mohapatra,et al.  Efficient overlay multicast for mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[70]  Gabriel Y. Handler,et al.  Medi-Centers of a Tree , 1985, Transp. Sci..

[71]  Roger Wattenhofer,et al.  Convergence to Equilibrium in Local Interaction Games , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.