A New Approach for Sensor Scheduling in Wireless Sensor Networks Using Simulated Annealing

A sensor network containing many sensors is supposed and each sensor has limited and un-replaceable energy. As each node has various duties, a node's wrong performance leads to energy waste and its omission from the network structure. In this paper, thanks to sensors placement due to increasing of network lifetime, this paper introduces a vigorous algorithm to place sensors to cover maximum areas of network with the lowest cost. This suggested algorithm runs based on simulated annealing (SA) and it can work on networks in which sensors are organized randomly. Since this algorithm analyses sensors' status regularly it can be taken as a dynamic algorithm. The simulation results indicate that proposed algorithm can organize the best areas of networks with numerous sensors through the lowest possible processing, and it significantly enhances the network's lifetime. It also guarantees that during execution procedure, the most possible coverage occurs using the selected sensors.

[1]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[2]  Suman Banerjee,et al.  Node Placement for Connected Coverage in Sensor Networks , 2003 .

[3]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[4]  Jerry D. Cavin.  Advances in distributed sensor technology , 1996, IEEE Parallel & Distributed Technology: Systems & Applications.

[5]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[6]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[7]  Michael Segal,et al.  Dynamic Coverage in Ad-Hoc Sensor Networks , 2005, Mob. Networks Appl..

[8]  Deborah Estrin,et al.  Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks , 2000 .

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

[10]  Krishnendu Chakrabarty,et al.  Sensor placement for effective coverage and surveillance in distributed sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

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

[12]  S. Iyengar,et al.  Multi-Sensor Fusion: Fundamentals and Applications With Software , 1997 .

[13]  Y.T. Hou,et al.  On energy provisioning and relay node placement for wireless sensor networks , 2005, IEEE Transactions on Wireless Communications.

[14]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[15]  Konstantinos Kalpakis,et al.  Topology-aware placement and role assignment for energy-efficient information gathering in sensor networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[16]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).