Proceedings ArticleDOI
Coverage area maximization by heterogeneous sensor nodes with minimum displacement in mobile networks
Dibakar Saha,Avirup Das +1 more
- pp 1-6
Reads0
Chats0
TLDR
In this article, the authors 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.Abstract:
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.read more
Citations
More filters
Proceedings ArticleDOI
A Self-organized Reciprocal Control Method for Multi-Agent Coverage
TL;DR: A self-organized reciprocal control method is proposed, which is directly optimized in velocity space, different from the traditional method modeled in configuration space, which considers the reciprocal of neighboring agents that is ignored by most other methods.
Journal ArticleDOI
An adaptive energy efficient flow coverage scheme for mobile crowd sensing in urban streets
TL;DR: A flow coverage scheme is proposed to cover a specific street based on using a modified localisation method that uses a minimal of GPS sensors and utilises the Zigbee technology to communicate and estimate the distance between nodes.
Book ChapterDOI
Random Connected Graph Generation for Wireless Sensor Networks
TL;DR: A fast and light-weight algorithm has been proposed in this paper to produce a random connected graph for a real-time multi-hop wireless sensor networks (WSNs), which has better performance than other existing methods.
Proceedings ArticleDOI
Surveillance of Uneven Surface with Unmanned Aerial Vehicles
TL;DR: This paper focuses on developing distributed algorithms for the reorganization of drones from the initial deployment to maximize the covered area without holes and proposes two algorithms based on Local Voronoi and Virtual Force that result in hole-free maximal compact coverage with limited displacement.
References
More filters
Book ChapterDOI
Self-Organized Node Placement for Area Coverage in Pervasive Computing Networks
Dibakar Saha,Nabanita Das +1 more
TL;DR: Analysis and simulation studies show that proposed algorithm with less neighborhood information and simpler computation solves the coverage problem using minimum number of active nodes, and with minimum displacement in 95 % cases.
Related Papers (5)
Self-organized area coverage in wireless sensor networks by limited node mobility
Dibakar Saha,Nabanita Das +1 more
DEHCIC: A distributed energy-aware hexagon based clustering algorithm to improve coverage in wireless sensor networks
Somaieh Zakariayi,Shahram Babaie +1 more