On Multihop Distances in Wireless Sensor Networks with Random Node Locations

Authors:
Serdar Vural;Eylem Ekici
Affiliations:
University of California, Riverside;The Ohio State University, Columbus
Venue:
IEEE Transactions on Mobile Computing
Year:
2010

Citing 0
Cited 3

A new constructing approach for a weighted topology of wireless sensor networks based on local-world theory for the Internet of Things (IOT)

Computers & Mathematics with Applications
Node Placement Strategy in Wireless Sensor Network

International Journal of Mobile Computing and Multimedia Communications
A stochastic process model of the hop count distribution in wireless sensor networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.