A Single Mobile Target Tracking in Voronoi-based Clustered Wireless Sensor Network
1
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
Despite the fact that the deployment of sensor networks and target tracking could both be managed by taking full advantage of Voronoi diagrams, very little few have been made in this regard. In this paper, we designed an optimized barrier coverage and an energy-efficient clustering algorithm for forming Vonoroi-based Wireless Sensor Networks(WSN) in which we proposed a mobile target tracking scheme (CTT&MAV) that takes full advantage of Voronoi-diagram boundary to improve detectability. Simulations verified that CTT&MAV outperforms random walk, random waypoint, random direction and Gauss-Markov in terms of both the average hop distance that the mobile target moved before being detected and lower sensor death rate. Moreover, we demonstrate that our results are robust as realistic sensing models and also validate our observations through extensive simulations.
Abstract
Despite the fact that the deployment of sensor networks and target tracking could both be managed by taking full advantage of Voronoi diagrams, very little few have been made in this regard. In this paper, we designed an optimized barrier coverage and an energy-efficient clustering algorithm for forming Vonoroi-based Wireless Sensor Networks(WSN) in which we proposed a mobile target tracking scheme (CTT&MAV) that takes full advantage of Voronoi-diagram boundary to improve detectability. Simulations verified that CTT&MAV outperforms random walk, random waypoint, random direction and Gauss-Markov in terms of both the average hop distance that the mobile target moved before being detected and lower sensor death rate. Moreover, we demonstrate that our results are robust as realistic sensing models and also validate our observations through extensive simulations.
참고문헌 (13)
- Cardei, M, "Coverage in wireless sensor networks, In handbook of sensor networks: Compact Wireless and Wired Sensing Systems" (2004), CRC Press LLC
- Meguerdichian, S., "Worst and best-case coverage in sensor networks", proceeding of IEEE Transactions on Mobile Computing, 4(1), pp.84~92 (2005)[DOI]
- D. J. Baker, "The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm", IEEE Transactions on Communications, 29(11), pp.1694~1701 (1981)
- A.D. Amis, "Max-Min D-Cluster Formation in Wireless Ad Hoc Networks", Proceedings of IEEE INFOCOM (2000)
- A. Ephremides, "A Design concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling", Proceeding of IEEE, 75, pp.56~73 (1987)
- W.R. Heinzelman, A.C, "Energy-Efficient Communication Protocol for Wireless Microsensor Networks", Proceedings of IEEE HICSS (2000)
- J. Janssen, "Multi-target Data Aggregation and Tracking in Wireless Sensor Networks", proceeding of journal of networks, 3(1) (2008)
- T. He, "Achieving real-time target tracking using wireless sensor networks", Proc. IEEE Real-Time and Embedded Technology and Applications Symposium (2006)
- S. G. Foss, "On a Voronoi Aggregative Process Related to a Bivariate Poisson Process", Advances in Applied Probability, 28(4), pp.965~981 (1996)
- T. Camp, "A Survey of Mobility Models for Ad Hoc Network Research, in Wireless Communication and Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research", Trends and Applications, 2(5), pp.483~502 (2002)
- B. Liang, "Predictive Distance-Based Mobility Management for PCS Networks", Proceedings of IEEE information Communications Conference (INFOCOM 1999) (1999)
- L. Lima, "Random Walks on Sensor Networks", the 5th International Symposium on Modeling and optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt 2007), Limassol, Cyprus (2007)
- C. Bettstetter, "The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks", IEEE Transactions on Mobile Computing, 2(3), pp.257~269 (2003)