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
Journal ArticleDOI
A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks
Yi Zou,Krishnendu Chakrabarty +1 more
TL;DR: It is proved that the set of active nodes selected by the proposed approach provides full coverage and connectivity, and an optimal coverage-centric centralized approach based on integer linear programming is described.
Journal ArticleDOI
Stochastic coverage in heterogeneous sensor networks
Loukas Lazos,Radha Poovendran +1 more
TL;DR: This work derives analytical expressions of coverage for heterogeneous sensor networks as a set intersection problem, a problem studied in integral geometry, and compares the theoretical results with the spatial Poisson approximation that is widely used in modeling coverage.
Journal ArticleDOI
An Improved Co-evolutionary Particle Swarm Optimization for Wireless Sensor Networks with Dynamic Deployment
Xue Wang,Sheng Wang,Junjie Ma +2 more
TL;DR: Simulation results demonstrate that the proposed VFCPSO is competent for dynamic deployment in WSNs and has better performance with respect to computation time and effectiveness than the VF, PSO and VFPSO algorithms.
Journal ArticleDOI
A sensor deployment approach using glowworm swarm optimization algorithm in wireless sensor networks
TL;DR: A sensor deployment scheme based on glowworm swarm optimization (GSO) to enhance the coverage after an initial random deployment of the sensors to provide high coverage with limited movement of the sensor nodes.
Journal ArticleDOI
Localized Sensor Area Coverage with Low Communication Overhead
TL;DR: This work proposes several localized sensor area coverage protocols for heterogeneous sensors, each with arbitrary sensing and transmission radii, and has shown robustness in a model with collisions and/or a realistic physical layer.
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