The Critical Grid Size and Transmission Radius for Local-Minimum-Free Grid Routing InWireless Ad Hoc and Sensor Networks
Source: Oxford University Press
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, the authors investigate two vital parameters of grid routing, called the grid size and the transmission radius.