Mobility in Wireless Sensor Networks

Abstract

Wireless Sensor Networks (WSNs) are poised to significantly enhance a number of missions in the military, civilian, and industrial arenas. Recently, there has been a significant interest in the design of algorithms for exploiting sensor mobility. The motivation of these designs is mainly to enhance coverage in the deployment field. Broadly speaking, there are three standard notions of coverage in sensor networks: blanket, barrier, and event coverage. Blanket coverage refers to the case where every point in the sensor network needs to be covered. Barrier coverage refers to the case where every intrusion path in the sensor network needs to be covered. Event coverage refers to the case where events in the sensor network need to be covered as and when they occur. In this chapter, we present a survey of mobility algorithms for enhancing blanket, barrier, and event coverage in wireless sensor networks. The key metrics emphasized for evaluation of these algorithms are: quality of coverage, movement distance minimization, communication overhead, and energy constraints. We also highlight open issues in mobility in wireless sensor networks, including some discussions on uncontrolled sensor mobility. © 2013 Elsevier Inc.

Department(s)

Computer Science

Keywords and Phrases

Algorithms; Coverage; Deployment; Mobility; Security; Sensor mobility; Wireless sensor networks

International Standard Serial Number (ISSN)

0065-2458

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Elsevier, All rights reserved.

Publication Date

01 Jan 2013

Link to Full Text

Share

 
COinS