By Topic

Analysis of connectivity for sensor networks using geometrical probability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jia, W. ; Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon, China ; Wang, J.

Sensors typically have limited power of transmission. Thus desired connectivity probability (CP) between the sensors is critical in the given deployment area. The paper presents a novel approach for analysing the lower bound of CP for sensor networks under uniformly distribution of the sensors in a given area. Initially, the area is divided into a grid (mesh) of blocks. The CP for each small block is then calculated and the small blocks are aggregated into a large one and the desired CP for the entire network is derived progressively. More specifically, given n sensors in each block, the CP is derived by (1) computing the CP of two adjacent blocks using a geometrical probabilistic approach when n=1, which is the precise result; (2) based on (1), the CP for n>1 is derived, which is very close to the simulation results within an error of 1%; (3) progressively deriving the CP of an entire network through aggregations of the small blocks. Simulation results demonstrate the feasibility of the algorithm.

Published in:

Communications, IEE Proceedings-  (Volume:153 ,  Issue: 2 )