Centdian Computation in Cactus Graphs

This paper focuses on the centdian problem in a cactus network where a cactus network is a connected undirected graph, and any two simple cycles in the graph have at most one node in common. The cactus network has important applications for wireless sensor networks when a tree topology might not be applicable and for extensions to the ring architecture. The centdian criterion represents a convex combination of two QoS requirements: transport and delay. To the best of our knowledge, no efficient algorithm has yet been developed for constructing a centdian node in a cactus graph, either sequential or distributed. We first investigate the properties of the centdian node in a cycle graph, and then explore the behavior of the centdian node in a cactus graph. Finally, we present new efficient sequential and distributed algorithms for finding all centdian nodes in a cycle graph and a cactus graph.

[1]  Rex K. Kincaid,et al.  Locating an absolute center on graphs that are almost trees , 1990 .

[2]  Rex K. Kincaid,et al.  A note on locating a central vertex of a 3-cactus graph , 1990, Comput. Oper. Res..

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

[4]  Yue-Li Wang,et al.  A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs , 1999, Inf. Process. Lett..

[5]  Ahmed Helmy,et al.  Efficient geographic routing over lossy links in wireless sensor networks , 2008, TOSN.

[6]  Shay Kutten,et al.  A modular technique for the design of efficient distributed leader finding algorithms , 1990, TOPL.

[7]  Boaz Ben-Moshe,et al.  Efficient algorithms for center problems in cactus networks , 2007, Theor. Comput. Sci..

[8]  Pravin Varaiya,et al.  Wireless token ring protocol-performance comparison with IEEE 802.11 , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[9]  Giovanni Pau,et al.  A Token Passing MAC protocol for Ad Hoc Networks 1 , 2002 .

[10]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

[11]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

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

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

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

[15]  Stavros Tripakis,et al.  A wireless token ring protocol for ad-hoc networks , 2002, Proceedings, IEEE Aerospace Conference.

[16]  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).

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

[18]  Michael Segal,et al.  The (k,l) Coredian Tree for Ad Hoc Networks , 2008, 2008 The 28th International Conference on Distributed Computing Systems Workshops.

[19]  J. Hatzl.  Median problems on wheels and cactus graphs , 2007, Computing.

[20]  Refael Hassin,et al.  Efficient algorithms for optimization and selection on series-parallel graphs , 1986 .

[21]  Arie Tamir,et al.  Sorting weighted distances with applications to objective function evaluations in single facility location problems , 2004, Oper. Res. Lett..

[22]  Rekha Jain,et al.  Wireless Sensor Network -A Survey , 2013 .

[23]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[24]  Rainer E. Burkard,et al.  A linear algorithm for the pos/neg-weighted 1-median problem on a cactus , 2007, Computing.

[25]  Winston Khoon Guan Seah,et al.  A Robust and Energy Efficient Routing Scheme for Wireless Sensor Networks , 2006, 26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06).

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

[27]  Pravin Varaiya,et al.  WTRP - wireless token ring protocol , 2002, IEEE Transactions on Vehicular Technology.

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

[29]  Timothy J. Lowe,et al.  The 1-Center Problem: Exploiting Block Structure , 1988, Transp. Sci..

[30]  Pravin Varaiya,et al.  A wireless token ring protocol for intelligent transportation systems , 2001, ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585).

[31]  Rolf Klein,et al.  Algorithmische Geometrie , 1997 .

[32]  Tamer A. ElBatt,et al.  Joint scheduling and power control for wireless ad hoc networks , 2002, IEEE Transactions on Wireless Communications.

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

[34]  B. R. Badrinath,et al.  On the node-scheduling approach to topology control in ad hoc networks , 2005, MobiHoc '05.

[35]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[36]  Li Jiandong,et al.  Wireless Dynamic Token Protocol for MANET , 2007, 2007 International Conference on Parallel Processing Workshops (ICPPW 2007).

[37]  Janez Zerovnik,et al.  Estimating the traffic on weighted cactus networks in linear time , 2005, Ninth International Conference on Information Visualisation (IV'05).

[38]  Timothy J. Lowe,et al.  Block-vertex duality and the one-median problem , 1985, Networks.

[39]  Yue-Li Wang,et al.  An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs , 2000, Eur. J. Oper. Res..

[40]  Madhumangal Pal,et al.  An Optimal Algorithm to Find Maximum and Minimum Height Spanning Trees on Cactus Graphs , 2008 .

[41]  Sasikanth Avancha,et al.  Security for Sensor Networks , 2004 .

[42]  Duke Lee,et al.  Wireless Token Ring Protocol , 2001 .

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

[44]  Amit Dvir,et al.  Centdian Computation for Sensor Networks , 2010, TAMC.

[45]  Guangbin Fan,et al.  A dynamic token passing MAC protocol for mobile ad hoc networks , 2006, IWCMC '06.

[46]  Mohit Saxena,et al.  SECURITY IN WIRELESS SENSOR NETWORKS - A LAYER BASED CLASSIFICATION , 2007 .

[47]  Anthony Ephremides,et al.  Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks , 2001, Mob. Networks Appl..

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