Fast self-deployment scheme based on grid algorithm in mobile sensor networks
- Authors
- Park, P.-W.; Oh, S.-S.; Min, S.-G.; Ko, D.-S.
- Issue Date
- 2013
- Publisher
- International Information Institute Ltd.
- Keywords
- Coverage speed; Energy Consumption; Grid; Maximum moving round; Sensor
- Citation
- Information (Japan), v.16, no.12 A, pp.8549 - 8554
- Indexed
- SCIE
SCOPUS
- Journal Title
- Information (Japan)
- Volume
- 16
- Number
- 12 A
- Start Page
- 8549
- End Page
- 8554
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/105876
- ISSN
- 1343-4500
- Abstract
- Wireless Sensor Networks (WSNs) has many important issues. Famous issues are self-deployment and Energy problem. Many self-deployment schemes are based on Voronoi algorithm. But Voronoi algorithm has two problems. First problem is hard to search all the area. Second problem is tiny movement in the last part. Tiny movements sharply increase energy consumption. We proposed a scheme with two qualities: full coverage and few numbers of rounds. The simulation results show that our scheme can have a fast, efficient, and full coverage of the area. © 2013 International Information Institute.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.