Header menu link for other important links
Coverage area maximization by heterogeneous sensor nodes with minimum displacement in mobile networks
Published in IEEE Computer Society
Pages: 1 - 6
Given a random deployment of heterogeneous mobile nodes having different sensing ranges, this paper addresses the problem of covering a region using minimum number of nodes with minimum displacement. We propose an energy-efficient and light-weight self-organized distributed greedy heuristic to maximize area coverage such that the amount of computation, rounds of communication, and the distance traversed by a node, can be reduced utilizing minimal number of nodes. Extensive simulation studies on random deployment of nodes with sufficient node density over a 2-D area, show that our proposed technique results hole free area coverage with small number of nodes with minimum possible displacement, both in turn help to prolong the network lifetime. © 2015 IEEE.
About the journal
JournalData powered by TypesetInternational Symposium on Advanced Networks and Telecommunication Systems, ANTS
PublisherData powered by TypesetIEEE Computer Society