Name
Abstract | ||
|---|---|---|
Efficient utilization of energy of the network is one of the major issues faced by wireless sensor network, when sensors are placed in a hostile environment. One of the methods to solve this problem is to activate only a few sensors which satisfy the coverage constraints. This can be done by partitioning a set of all sensors into many subsets or sensor covers such that each sensor cover satisfies the coverage constraints and activating them subsequently which leads to increase the network lifetime. A memetic algorithm is proposed in this paper for the Q-Coverage problem where each target can be covered by one or more sensors. The cardinal objective of the proposed algorithm is to maximize the lifespan of the network while satisfying the coverage constraints. The proposed algorithm avoids redundancy and utilizes the available resources to maximize the network lifetime. Simulation results show that our proposed algorithm performs better than the existing algorithms. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/CAMAD.2017.8031629 | 2017 IEEE 22nd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD) |
Keywords | Field | DocType |
Target Coverage Problem,Sensor Scheduling,Q-Coverage Problem,Memetic Algorithm,Wireless Sensor Network | Memetic algorithm,Key distribution in wireless sensor networks,Scheduling (computing),Upper and lower bounds,Computer science,Efficient energy use,Brooks–Iyengar algorithm,Real-time computing,Redundancy (engineering),Wireless sensor network,Distributed computing | Conference |
ISSN | ISBN | Citations |
2378-4865 | 978-1-5090-6303-1 | 0 |
PageRank | References | Authors |
0.34 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| D. Arivudainambi | 1 | 54 | 8.50 |
| Balaji, S. | 2 | 7 | 1.53 |
| R. Pavithra | 3 | 0 | 0.34 |
| R. N. Shakthivel | 4 | 0 | 0.34 |