Point-to-Point Routing in Wireless Sensor Networks
The development of in-network storage and in-network process inspires intensive coordination among intelligent sensors. This necessitates point-to-point communication between any pair of nodes. Point-to-point routing, however, is a challenging problem in a wireless sensor network because the network may consist of thousands of nodes with limited resources to maintain routing states. Location aware routing shows its potential in that packets can be delivered based on small constant size routing states. However, location aware routing cannot guarantee packet delivery due to the problem of local minimum. Despite the success of numerous solutions to recover location aware routing from the local minimum, the overhead of complicated recovery schemes is much higher than the simple greedy forwarding in location aware routing. Our study reveal the inherent tradeoff between the quality of routing performance and the size of routing states. We suggest that the key approach to an optimal routing design is how to efficiently encode a network topology into small dimensional coordinates from which hop count distances between pairwise sensors can be accurately recovered. Based on the precisely hop count distance comparison, our proposed topology aware routing can assist the greedy forwarding to find the right neighbor that is one hop closer to the destination, and therefore achieve high success rate of packet delivery.

  • Link quality aware routing in wireless sensor networks: We have implemented the link quality aware routing in TinyOS and evaluated its performance in TOSSIM, a widely used sensor network simulator that can simulate the wireless communication of a sensor network with high fidelity.


  • C. Wang and L. Xiao, Optimizing End to End Routing Performance in Wireless Sensor Networks,DCOSS 2007.
  • C. Wang, G. Zeng, and L. Xiao, Improving End to End Routing Performance of Greedy Forwarding in Wireless Networks,IWQoS 2007.