Many-to-One Deliverability of Greedy Routing in 2-D Wireless Sensor Networks

Free registration required

Executive Summary

In this paper, the authors study deliverability of greedy routing in wireless sensor networks, where nodes are distributed over a disk area according to a homogeneous Poisson point process. In their paper, they model the level of deliverability of a sensor network as the probability that all sensor nodes can successfully send their data to a base station, which is named probability of guaranteed delivery. They study the relationship between the critical transmission power of sensor nodes and the probability of guaranteed delivery, such that when all sensor nodes transmit with a higher power than the critical transmission power, the sensor network can reach the desired probability of guaranteed delivery.

  • Format: PDF
  • Size: 375.7 KB