By Topic

On Multihop Distances in Wireless Sensor Networks with Random Node Locations

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 $13
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)
Vural, S. ; Dept. of Electr. & Comput. Eng., Ohio State Univ., Columbus, OH, USA ; Ekici, E.

Location and intersensor distance estimations are important functions for the operation of wireless sensor networks, especially when protocols can benefit from the distance information prior to network deployment. The maximum multihop distance that can be covered in a given number of hops in a sensor network is one such parameter related with coverage area, delay, and minimal multihop transmission energy consumption estimations. In randomly deployed sensor networks, intersensor distances are random variables. Hence, their evaluations require probabilistic methods, and distance models should involve investigation of distance distribution functions. Current literature on analytical modeling of the maximum distance distribution is limited to 1D networks using the Gaussian pdf. However, determination of the maximum multihop distance distribution in 2D networks is a quite complex problem. Furthermore, distance distributions in 2D networks are not accurately modeled by the Gaussian pdf. Hence, we propose a greedy method of distance maximization and evaluate the distribution of the obtained multihop distance through analytical approximations and simulations.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:9 ,  Issue: 4 )