Find the maximum k-disjoint coverage sets in WSN using genetic algorithm

A major concern in wireless sensor networks is to maximise network lifetime (in terms of rounds) while maintaining a high quality of service (QoS), which includes target coverage and network connectivity. This paper generalises the searching procedure to maximise the total number of rounds. A novel searching algorithm is proposed on the basis of improved NSGA-II to select the optimal coverage set which includes two competing objectives, the coverage rate and the number of working nodes. As another new contribution, we apply the novel algorithm in the k-disjoint coverage sets problem. All the sensors are divided into k-disjoint sets, guaranteeing each set with full coverage. By alternating coverage subsets and using only one at each round, the maximum network lifetime is achieved. Numerical and simulation results are provided to examine our analysis for wireless sensor networks.

[1]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[2]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[3]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[4]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[5]  Nathan Ickes,et al.  Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks , 2001, MobiCom '01.

[6]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[8]  M. Hefeeda,et al.  Probabilistic Coverage in Wireless Sensor Networks , 2007 .

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

[10]  Deborah Estrin,et al.  ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.

[11]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[12]  Thomas Bäck,et al.  Optimal Mutation Rates in Genetic Search , 1993, ICGA.

[13]  Mani Srivastava,et al.  Energy-aware wireless microsensor networks , 2002, IEEE Signal Process. Mag..

[14]  S.A. Khan,et al.  Analyzing & Enhancing energy Efficient Communication Protocol for Wireless Micro-sensor Networks , 2005, 2005 International Conference on Information and Communication Technologies.

[15]  Jang-Ping Sheu,et al.  Probabilistic Coverage Preserving Protocol with Energy Efficiency in Wireless Sensor Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[16]  Mani B. Srivastava,et al.  Critical density thresholds for coverage in wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[17]  Sarah Cook,et al.  A compact vision sensor for weld pool surface sensing , 2006, Int. J. Model. Identif. Control..

[18]  Azzedine Boukerche,et al.  A coverage-preserving scheme for wireless sensor network with irregular sensing range , 2007, Ad Hoc Networks.

[19]  Prasant Mohapatra,et al.  Power conservation and quality of surveillance in target tracking sensor networks , 2004, MobiCom '04.

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

[21]  Gianluca Antonelli,et al.  Coordinated Control of Mobile Antennas for Ad-Hoc Networks in Cluttered Environments , 2006, IAS.

[22]  Kalyanmoy Deb,et al.  MULTI-OBJECTIVE FUNCTION OPTIMIZATION USING NON-DOMINATED SORTING GENETIC ALGORITHMS , 1994 .

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

[24]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[25]  Di Tian,et al.  A node scheduling scheme for energy conservation in large wireless sensor networks , 2003, Wirel. Commun. Mob. Comput..