Domination Algorithms for Lifetime Problems in Self-organizing Ad hoc and Sensor Networks

Wireless sensor networks propound an algorithmic research problems for prolonging life of nodes and network. The domination algorithms can address some of fundamental issues related to lifetime problems in ad hoc and sensor networks. Most of the graph domination problems are NP-complete even with unit-disk-graphs. The investigation of the thesis addresses some of lifetime issues in sensor network with the approximate domination algorithm. In this work, we consider distributed algorithms of some important domination problems namely, maximum domatic partition problem (DPP), maximum connected domatic partition (CDP) problem, minimum connected dominating set (MCDS) problem, node-mobility transparent connected dominating set problem in context of unitdisk graphs and obtain solutions using state-of-the-art principles of well-known MIS (maximal independent sets). We incorporated self-organization feature to domatic partition for sensor networks. Domatic partition problems has variety of applications. In sensor networks our deterministic self-organizing domatic partition algorithm is used to provide maximum cluster lifetime in hierarchical topology control of sensor networks. Minimum connected dominating set is reported to provide a virtual backbone for ad hoc networks. The maximum lifetime of connected dominating set felt constrained to support virtual backbone in sensor networks. We modeled the maximum lifetime connected dominating set as connected domatic partition problem. We introduced a distributed algorithm for connected domatic partition problem. To our knowledge no such connected domatic partition is reported in literature. The minimum connected dominating set has drawn a considerable research interest and several approximation schemes are reported. We have introduced a collaborativecover heuristic and developed a distributed approximation algorithm for minimum connected dominating set problem using it with a single leader having an approximation factor of (4.8+ ln 5)opt+1.2, where opt is the size of any optimal CDS in G. This approximation provides an effective loss-less aggregation backbone for sensor networks. The results show the improvement in prolonging the life of sensor networks. The CDSbackbone gets disturbed by the mobility of nodes. We developed an integrated scheme adapting CDS to the node’s mobility transparently and efficiently. Adapting CDS to node-mobility is carried out by using four steps: i) reinforcing a self-organization to a multi-protocol relay(MPR) based connected dominating set, ii) reinforcing self-reconfiguration of CDS when a node becomes mobile or halts after mobile operation, iii) adapting CDS to mobile-node by tracking of mobile node for its location updates and iv) optimizing location updates using weighted CDS based on a Markov model.

[1]  Stephen T. Hedetniemi,et al.  Towards a theory of domination in graphs , 1977, Networks.

[2]  Weili Wu,et al.  Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks , 2006, J. Glob. Optim..

[3]  Wendi B. Heinzelman,et al.  Prolonging the lifetime of wireless sensor networks via unequal clustering , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[4]  Murat Demirbas,et al.  Trail: A Distance Sensitive WSN Service for Distributed Object Tracking , 2007, EWSN.

[5]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[6]  Chittaranjan A. Mandal,et al.  Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks , 2009, IEEE Transactions on Mobile Computing.

[7]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Roger Wattenhofer,et al.  Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs , 2005, DISC.

[10]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[11]  Cheng Li,et al.  Distributed Minimum-Cost Clustering Protocol for UnderWater Sensor Networks (UWSNs) , 2007, 2007 IEEE International Conference on Communications.

[12]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[13]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[14]  Ding-Zhu Du,et al.  On greedy construction of connected dominating sets in wireless networks , 2005, Wirel. Commun. Mob. Comput..

[15]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

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

[17]  Ossama Younis,et al.  Node clustering in wireless sensor networks: recent developments and deployment challenges , 2006, IEEE Network.

[18]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[19]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[20]  Philippe Jacquet,et al.  Computing Connected Dominated Sets with Multipoint Relays , 2005, Ad Hoc Sens. Wirel. Networks.

[21]  Vishnu Navda,et al.  Efficient gathering of correlated data in sensor networks , 2008, TOSN.

[22]  H. T. Kung,et al.  Efficient location tracking using sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[23]  Imran A. Pirwani,et al.  Energy conservation via domatic partitions , 2006, MobiHoc '06.

[24]  Sayaka Kamei,et al.  A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[25]  Anis Laouiti,et al.  Multipoint relaying for flooding broadcast messages in mobile wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[26]  Majid Sarrafzadeh,et al.  Optimal Energy Aware Clustering in Sensor Networks , 2002 .

[27]  Rajiv Misra,et al.  Efficient clusterhead rotation via domatic partition in self-organizing sensor networks , 2009 .

[28]  Paolo Santi,et al.  Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks , 2002, MobiCom '02.

[29]  János Pach,et al.  Combinatorial Geometry , 2012 .

[30]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[31]  Weili Wu,et al.  Minimum connected dominating sets and maximal independent sets in unit disk graphs , 2006, Theor. Comput. Sci..

[32]  CardeiMihaela,et al.  Improving wireless sensor network lifetime through power aware organization , 2005 .

[33]  Rajiv Misra,et al.  Self-Healing for Self-Organizing Cluster Sensor Networks , 2006, 2006 Annual IEEE India Conference.

[34]  G. Simon,et al.  Simulation-based optimization of communication protocols for large-scale wireless sensor networks , 2003, 2003 IEEE Aerospace Conference Proceedings (Cat. No.03TH8652).

[35]  Wendi B. Heinzelman,et al.  Application-specific protocol architectures for wireless networks , 2000 .

[36]  Sarma B. K. Vrudhula,et al.  Battery lifetime prediction for energy-aware computing , 2002, ISLPED '02.

[37]  Sarma B. K. Vrudhula,et al.  Energy management for battery-powered embedded systems , 2003, TECS.

[38]  Falko Dressler,et al.  Self-Organization in Ad Hoc Networks: Overview and Classification , 2006 .

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

[40]  Fred B. Schneider,et al.  A Theory of Graphs , 1993 .

[41]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[42]  Stefan Schmid,et al.  Algorithmic models for sensor networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[43]  Chittaranjan A. Mandal,et al.  ClusterHead Rotation via Domatic Partition in Self-Organizing Sensor Networks , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[44]  Feng Wang,et al.  On greedy construction of connected dominating sets in wireless networks: Research Articles , 2005 .

[45]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[46]  Deborah Estrin,et al.  Scalable Coordination for Wireless Sensor Networks: Self-Configuring Localization Systems , 2001 .

[47]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[49]  Roger Wattenhofer,et al.  Maximizing the lifetime of dominating sets , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[50]  Jie Wu,et al.  Extended multipoint relays to determine connected dominating sets in MANETs , 2006, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[51]  Makoto Takizawa,et al.  A Survey on Clustering Algorithms for Wireless Sensor Networks , 2010, 2010 13th International Conference on Network-Based Information Systems.

[52]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[53]  Uriel Feige,et al.  Approximating the domatic number , 2000, STOC '00.

[54]  Douglas F. Rall,et al.  Connected Domatic Number in Planar Graphs , 2001 .

[55]  Bohdan Zelinka,et al.  Connected domatic number of a graph , 1986 .

[56]  Wendi B. Heinzelman,et al.  Prolonging the Lifetime of Wireless Sensor Networks via Prolonging the Lifetime of Wireless Sensor Networks via , 2005, IEEE International Parallel and Distributed Processing Symposium.

[57]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[58]  Roger Wattenhofer,et al.  On the locality of bounded growth , 2005, PODC '05.

[59]  Li-Hsing Yen,et al.  Mobility Profiling Using Markov Chains for Tree-Based Object Tracking in Wireless Sensor Networks , 2006, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC'06).

[60]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[61]  Krishna M. Sivalingam,et al.  Data Gathering Algorithms in Sensor Networks Using Energy Metrics , 2002, IEEE Trans. Parallel Distributed Syst..

[62]  R. Misra,et al.  Self-Rotating Cluster Head for Self-Organizing Cluster Sensor Networks , 2006, 2006 International Conference on Advanced Computing and Communications.

[63]  Baruch Awerbuch,et al.  Online tracking of mobile users , 1995, JACM.

[64]  VrudhulaSarma,et al.  Energy management for battery-powered embedded systems , 2003 .

[65]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[66]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

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

[68]  Yu-Chee Tseng,et al.  Efficient in-network moving object tracking in wireless sensor networks , 2006, IEEE Transactions on Mobile Computing.

[69]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[70]  Xiuzhen Cheng,et al.  Connected Dominating Set in Sensor Networks and MANETs , 2004 .