Download now Free registration required
Random routing protocols in sensor networks forward packets to randomly selected neighbors. These packets are agents carrying information about events, or queries seeking such information. The authors derive the probability of a packet visiting a given node in a given step as well as the rendezvous probability of agents and queries within a specific number of hops at a given node(s) in a 2-D grid-based sensor network. The utility of the model is demonstrated by determining the protocol parameters to optimize performance of rumor routing protocol under different constraints, e.g., to evaluate the number of queries and agents to maximize the probability of rendezvous for a given amount of energy.
- Format: PDF
- Size: 627.7 KB