The Community for Technology Leaders
2016 International Conference on Frontiers of Information Technology (FIT) (2016)
Islamabad, Pakistan
Dec. 19, 2016 to Dec. 21, 2016
ISBN: 978-1-5090-5300-1
pp: 17-22
ABSTRACT
A large number of wireless sensor nodes (SNs) are usually deployed in a remote area, where these nodes accurately monitor the environment and communicate the data collected by the SNs, to a central processing station wirelessly. Since the SNs are powered by batteries, therefore, to prolong the network operating life, they must utilize energy efficiently. In this paper, we propose a method to control scheduling of the SNs in an area to prolong the network life. Probabilistic detection model forms the basis for coverage control algorithm (CCA) in a wireless sensor network (WSN). In this model, each sensor node is assumed to detect an event occurring within its sensing range, with a certain probability. Finally, the effectiveness of this algorithm is verified by comparing it to other algorithms in a simulated experiment.
INDEX TERMS
Wireless sensor networks, Sensors, Monitoring, Time complexity, Wireless communication, Probabilistic logic, Scheduling,Wireless Sensor Networks, Blind Spot, Coverage Control Algorithm, Sensor Nodes
CITATION
Muhammad Uzair Khan, Sarmad Feroze, Muhammad Zia, "Coverage Control Algorithm for Node Scheduling in Wireless Sensor Networks", 2016 International Conference on Frontiers of Information Technology (FIT), vol. 00, no. , pp. 17-22, 2016, doi:10.1109/FIT.2016.012
97 ms
(Ver 3.3 (11022016))