DocumentCode :
2365397
Title :
Self-organizing sensor networks: Coverage problem
Author :
Sheltami, T. ; Mahmoud, Ali ; Alafari, K. ; Shakshuki, E.
Author_Institution :
Comput. Eng., Dept., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia
fYear :
2012
fDate :
28-29 May 2012
Firstpage :
91
Lastpage :
96
Abstract :
The problem of coverage in sensor network can be faced in different fields, each having its own special meaning, terminologies and objectives. However, the ultimate goal of solving a `coverage problem´ is to blanket a specific `region´ with specific `observers´. The region can be planar or volumetric, and the observers can be of limited capabilities. A wireless sensor network is said to provide full coverage in a region if every point in the region is within the monitoring range of some sensors. The main concepts of full coverage will be discussed in this paper.
Keywords :
wireless sensor networks; coverage problem; self-organizing sensor networks; wireless sensor network; Analytical models; Educational institutions; Energy consumption; Satellites; Sensors; Tin; Wireless sensor networks; coverage; energy consumption; sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications (QBSC), 2012 26th Biennial Symposium on
Conference_Location :
Kingston, ON
Print_ISBN :
978-1-4673-1113-7
Electronic_ISBN :
978-1-4673-1112-0
Type :
conf
DOI :
10.1109/QBSC.2012.6221358
Filename :
6221358
Link To Document :
بازگشت