Greedy backpressure routing for Smart Grid sensor networks

In this paper, a greedy backpressure routing protocol is proposed for multigate mesh networks. This protocol evaluates the greedy backpressure metric (GBM) value of mesh points and routes packets in the direction of the steepest gradient. The GBM value is calculated using a combination of traffic load and the mesh point's hop count to the closest gateway. The proposed routing algorithm can realize the effect of traffic load from all the nodes along the path to each gateway by iteratively updating information from neighbors through periodic beacon exchange. The consideration of incorporating traffic load helps to route packets around congested area. The results indicate that the greedy backpressure multigate mesh routing is capable of achieving significant improvement in the network reliability, latency, and throughput performance.

[1]  Vaduvur Bharghavan,et al.  MCEDAR: multicast core-extraction distributed ad hoc routing , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[2]  Bin Hu,et al.  Multigate Communication Network for Smart Grid , 2011, Proceedings of the IEEE.

[3]  Jongkeun Na,et al.  Greedy Geographic Routing using Dynamic Potential Field for Wireless Ad Hoc Networks , 2007, IEEE Communications Letters.

[4]  Anindya Basu,et al.  Routing using potentials: a dynamic traffic-aware routing algorithm , 2003, SIGCOMM '03.

[5]  Bernhard Plattner,et al.  Density-Based vs. Proximity-Based Anycast Routing for Mobile Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Charles E. Perkins,et al.  Multicast operation of the ad-hoc on-demand distance vector routing protocol , 1999, MobiCom.