The (k,l) Coredian Tree for Ad Hoc Networks

In this paper, we present new efficient strategy for constructing a wireless tree network containing n nodes of diameter Delta while satisfying the QoS requirements such as bandwidth and delay. Given a tree network T, a coredian path is a path in T that minimizes the centdian function, ak-coredian tree is a subtree of T with k leaves that minimizes the centdian function, and a (k, l)-coredian tree is a subtree of T with k leaves and diameter l at most thatminimizes the centdian function. The (k, l)-coredian tree can serve as a backbone for a network, where intermediate nodes belong to the backbone and the leaves serve as the heads of the clusters covering the rest of the network. We show that a coredian path can be constructed at O(Delta)time with O(n) messages and a k-coredian tree can be constructed at O(kDelta) time with O(kn) messages. While a(k, l)-coredian tree can be constructed at O(n2) time with O(n2) messages. A simulation is presented for various values of n and k.

[1]  Edward J. Coyle,et al.  An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[3]  Esther Jennings.  Distributed Algorithm for Finding a Core of a Tree Network , 1995, SOFSEM.

[4]  Jennifer C. Hou,et al.  Maximising alpha-lifetime for wireless sensor networks , 2006, Int. J. Sens. Networks.

[5]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[6]  H. T. Mouftah,et al.  Clusterhead controlled token for virtual base station on-demand in MANETs , 2003, 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings..

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

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

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

[10]  Emilio Carrizosa.  AN AXIOMATIC APPROACH TO THE CENT-DIAN CRITERION / , 1994 .

[11]  Asis Nasipuri,et al.  Mobile Ad Hoc Networks , 2004 .

[12]  Ronald I. Becker,et al.  Efficient algorithms for finding the (k, l)-core of tree networks , 2002, Networks.

[13]  Ronald I. Becker,et al.  The Cent-dian Path Problem on Tree Networks , 2001, ISAAC.

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

[15]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[16]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[17]  Ronald I. Becker,et al.  Algorithms for central-median paths with bounded length on trees , 2007, Eur. J. Oper. Res..

[18]  Shietung Peng,et al.  A Simple Optimal Parallel Algorithm for a Core of a Tree , 1994, J. Parallel Distributed Comput..

[19]  Amit Dvir,et al.  SPLAST: a novel approach for multicasting in mobile wireless ad hoc networks , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[20]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

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

[22]  Shietung Peng,et al.  Efficient algorithms for a constrained k-tree core problem in a tree network , 2006, J. Algorithms.

[23]  Esther Jennings.  Distributed Algorithms for Finding Central Paths in Tree Networks , 1999, Comput. J..

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

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

[26]  Peter J. Slater,et al.  A Linear Algorithm for a Core of a Tree , 1980, J. Algorithms.

[27]  Shietung Peng,et al.  Algorithms for a Core and k-Tree Core of a Tree , 1993, J. Algorithms.

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

[29]  Takeaki Uno,et al.  A Linear Time Algorithm for Finding a k-Tree Core , 1997, J. Algorithms.

[30]  J. J. Garcia-Luna-Aceves,et al.  Hierarchical routing using link vectors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

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

[32]  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.

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

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

[35]  Liang Qin,et al.  Survey on Mobile Ad Hoc Network Routing Protocols and Cross-Layer Design , 2004 .

[36]  Elena Pagani,et al.  Reliable broadcast in mobile multihop packet networks , 1997, MobiCom '97.

[37]  Oded Berman,et al.  Algorithms for path medi-centers of a tree , 1999, Comput. Oper. Res..

[38]  BejeranoYigal.  Efficient integration of multihop wireless and wired networks with QoS constraints , 2004 .

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

[40]  Biing-Feng Wang.  Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel , 1998, IEEE Trans. Parallel Distributed Syst..

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

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