On Random Routing in Wireless Sensor Grids: A Mathematical Model for Rendezvous Probability and Performance Optimization
Source: Reed Elsevier
Random routing protocols in Wireless Sensor Networks (WSNs) forward packets to randomly selected neighbors. These packets are 'Agents' carrying information about events or 'Queries' seeking such information. A novel mathematical framework is proposed for analyzing random routing protocols. Exact probability of a packet visiting a given node within a given hop count as well as the rendezvous probability of agents and queries meeting at a given node in a 2-D grid-based WSN are derived.