SCHEDULING FOR TARGET AREA COVERAGE PROBLEM AND MAXIMIZING NETWORK LIFETIME OF WIRELESS SENSOR NETWORK |
Author(s): |
| RAMKUMAR.M , K.S.R COLLEGE OF ENGINEERING; N.S. Nithya M.E (Ph.D), K.S.R COLLEGE OF ENGINEERING |
Keywords: |
| Coverage, Scheduling, Sensor deployment, ANT colony algorithm, Wireless sensor network |
Abstract |
|
Network lifetime plays an integral role in setting up an efficient wireless sensor network. The network will deploy sensor nodes at optimal locations and also it schedule the sensor nodes to increase the network lifetime. By using pre-specified sensing range it will identify the optimal deployment locations of the sensor nodes. It uses artificial bee colony algorithm and particle swarm optimization for sensor deployment problem followed by a heuristic for scheduling. In proposed system, using hybrid approach has ANT colony optimization technique is used to provide maximum network lifetime utilization. The comparative study shows that artificial ACO performs better than bee colony algorithm for sensor deployment problem. The proposed heuristic was able to achieve the theoretical upper bound in all the experimented cases. |
Other Details |
|
Paper ID: IJSRDV3I1373 Published in: Volume : 3, Issue : 1 Publication Date: 01/04/2015 Page(s): 852-854 |
Article Preview |
|
|
|
|
