Paper Title:
Optimization of Non-Uniform Sensing Coverage for Wireless Sensor Networks
  Abstract

The success of wireless sensor networks (WSN) depends on two factors: 1) how well the service area is monitored by the WSN's capability to sense the intended phenomenon, and 2) the way that the WSN communicates the sensed phenomenon for further analysis by the service center with acceptable time duration. The simultaneous optimization for both the sensing and communication problems is a grand challenge, especially when the service area is harsh and it can't be accessed easily by human. In this paper, we have proposed a non-uniform constructive scheme to sense and communicate the service area through a cell-by-cell, where each cell is selected randomly and the cells may have different sizes. The experimental results demonstrate the feasibility of the non-uniform constructive scheme in selecting and placing sensors to sense and communicate over the service area with minimal uncovered area and minimal overlapped sensors.

  Info
Periodical
Advanced Materials Research (Volumes 230-232)
Edited by
Ran Chen and Wenli Yao
Pages
605-609
DOI
10.4028/www.scientific.net/AMR.230-232.605
Citation
N. Zaeri, S. Habib, "Optimization of Non-Uniform Sensing Coverage for Wireless Sensor Networks", Advanced Materials Research, Vols. 230-232, pp. 605-609, 2011
Online since
May 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Xin Lian Zhou, Bin Xiao, Jing Liang Cheng
Abstract:In mobile wireless sensor networks, sensor nodes may due to their own moves, energy loss, physical damage, errors and failures or other...
617
Authors: Tao Yang, Pan Guo Fan, De Jun Mu
Chapter 2: Mechatronics and Automation
Abstract:Wireless sensor network is always deployed in specific area for intrusion detection and environmental monitoring. The sensor nodes suffer...
503
Authors: Xiang Fu, Chun Ping Lu, Hao Li
Chapter 5: Mechatronics and Automation
Abstract:DGreedy (distributed greedy) algorithm evaluates the priority level in view of remaining energy of terminals, and the relationships between...
440