The Critical Grid Size and Transmission Radius for Local-Minimum-Free Grid Routing in Wireless Ad Hoc and Sensor Networks
Authors:
- 26 March 2010
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 53 (10) , 1621-1631
Abstract
In grid routing, the plane is tessellated into equal-sized square cells. Two cells are called neighbor cells if they share a common edge, and two nodes are called routing neighbors if they are in neighbor cells and within each other's transmission range. If communication parties are in the same cell, packets can be transmitted directly; otherwise, packets are forwarded to routing neighbors that are in cells closer to destination cells. As a greedy strategy, grid routing suffers the existence of local minima at which no neighbor nodes exist for relaying packets. To guarantee deliverability, in this paper, we investigate two vital parameters of grid routing, called the grid size and the transmission radius. Assume that nodes are represented by a Poisson point process with rate n over a unit-area square, and let l denote the grid size and r the transmission radius. First, we show that if for some constant β and r = √5l, then β = 1 is the threshold for deliverability. In other words, there almost surely do not exist local minima if β > 1 and there almost surely exist local minima if β < 1. Next, for any given β > 1, we give sufficient and necessary conditions to determine the critical transmission radius (CTR) for deliverability. Then, we show that as β ≅ 1.092, the CTR is the minimum over all β > 1. Simulation results are given to validate this theoretical work.Keywords
This publication has 6 references indexed in Scilit:
- A Unified Analytic Framework Based on Minimum Scan Statistics for Wireless Ad Hoc and Sensor NetworksIEEE Transactions on Parallel and Distributed Systems, 2008
- Sharp thresholds For monotone properties in random geometric graphs2004
- Geographic routing without location information2003
- A two-tier data dissemination model for large-scale wireless sensor networks2002
- Online power-aware routing in wireless Ad-hoc networks2001
- A scalable location service for geographic ad hoc routing2000