Optimization of Actors Placement within Wireless Sensor-Actor Networks

Wireless sensor-actor networks (WSANs) refer to a group of sensors and actors linked by wireless medium to perform distributed sensing and acting tasks. The main communication paradigm in WSANs is based on the sensor-actor coordination. Appropriate actions, which are corresponding to the sensed phenomenon, can't be performed unless the event's information is transmitted from the sensors to actors. One of the main requirements of sensor-actor communication in WSANs is the real-time requirement. Despite the importance of real-time communications in WSANs, to date no significant solution exists for this problem. This paper examines the placement of actors with respect to a real-time communication constraint in the WSANs. We have utilized the genetic algorithm (GA) to search the space with an objective function consisting of a main term (the communication delay) and two competitive terms (cost and accuracy). Our simulation results show that our proposed methodology provides a cost effective and accurate solution for the placement of actors within WSAN when the sensors are densely deployed.

[1]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[2]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Ian F. Akyildiz,et al.  Wireless sensor and actor networks: research challenges , 2004, Ad Hoc Networks.

[4]  D.B. Jourdan,et al.  Layout optimization for a wireless sensor network using a multi-objective genetic algorithm , 2004, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514).

[5]  Jiangchuan Liu,et al.  A real-time communication framework for wireless sensor-actuator networks , 2006, 2006 IEEE Aerospace Conference.

[6]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[7]  Samir Khuller,et al.  The Capacitated K-Center Problem (Extended Abstract) , 1996, ESA.

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

[9]  Roger L. Wainwright,et al.  A genetic algorithm applied to graph problems involving subsets of vertices , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[10]  Dario Pompili,et al.  A distributed coordination framework for wireless sensor and actor networks , 2005, MobiHoc '05.

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

[12]  Samir Khuller,et al.  The Capacitated K-Center Problem , 2000, SIAM J. Discret. Math..

[13]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[14]  Raghupathy Sivakumar,et al.  Hazard avoidance in wireless sensor and actor networks , 2006, Comput. Commun..