The auction algorithm: a distributed relaxation method for the assignment problem
Annals of Operations Research - Special Issue: Parallel Optimization on Novel Computer Architectures
Leader Election in the Presence of Link Failures
IEEE Transactions on Parallel and Distributed Systems
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Strong barrier coverage of wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Unreliable sensor grids: coverage, connectivity and diameter
Ad Hoc Networks
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
| Hi-index | 0.00 |
Technology advancement has allowed submarines to evade standard sonar detection. A viable alternative is to place magnetic or acoustic sensors in close proximity to possible underwater pathways of submarines. This approach may require deploying large-scale underwater sensor networks to form 3-dimensional barriers. We devise an energy-conserving scheme to construct 3-dimensional barriers using mobile sensors. We focus on developing an energy efficient matching of mobile sensors to cover grid points using distributed auction algorithms. Specifically, we attempt to minimize the maximum travel distance for any one sensor to reach its assigned grid point. Through simulation, we show that the distributed auction based approach can offer reduced computation time and similar maximum travel distance as compared to the optimal solution. This provides a promising new approach to constructing barriers in 3- dimensional sensor networks. We, also, demonstrate a useful extension to the traditional Auction algorithm. The extension allows for a larger set of sensors to bid for fewer coverage points. This has implications for reducing the maximal moving distance and limits the impact of sensor failure.