ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Performance Evaluation of Distance-Hop Proportionality on Geometric Graph Models of Dense Sensor Networks

Nath, Swaprava and Kumar, Anurag (2008) Performance Evaluation of Distance-Hop Proportionality on Geometric Graph Models of Dense Sensor Networks. In: 3rd International Conference on Performance Evaluation Methodologies and Tools (Valuetools' 08), Athens, Greece, Athens, Greece.

[img] PDF
Performance_Evaluation.pdf - Published Version
Restricted to Registered users only

Download (362Kb) | Request a copy


Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes on a region in Euclidean space, e.g., the unit square. After deployment, the nodes self-organise into a mesh topology. In a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this paper, we analyse the performance of this approximation. We show that nodes with a certain hop distance from a fixed anchor node lie within a certain annulus with probability approach- ing unity as the number of nodes n → ∞. We take a uniform, i.i.d. deployment of n nodes on a unit square, and consider the geometric graph on these nodes with radius r(n) = c q ln n n . We show that, for a given hop distance h of a node from a fixed anchor on the unit square,the Euclidean distance lies within [(1−ǫ)(h−1)r(n), hr(n)],for ǫ > 0, with probability approaching unity as n → ∞.This result shows that it is more likely to expect a node, with hop distance h from the anchor, to lie within this an- nulus centred at the anchor location, and of width roughly r(n), rather than close to a circle whose radius is exactly proportional to h. We show that if the radius r of the ge- ometric graph is fixed, the convergence of the probability is exponentially fast. Similar results hold for a randomised lattice deployment. We provide simulation results that il- lustrate the theory, and serve to show how large n needs to be for the asymptotics to be useful.

Item Type: Conference Paper
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 19 Sep 2011 09:50
Last Modified: 19 Sep 2011 09:50
URI: http://eprints.iisc.ernet.in/id/eprint/40580

Actions (login required)

View Item View Item