Greedy Backpressure Routing for Smart Grid Sensor Networks

Published

January 13, 2014

Author(s)

Hamid Gharavi

Abstract

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.

Proceedings Title

IEEE Consumer Communications and Networking Conference

Conference Dates

January 10-13, 2014

Conference Location

Las Vegas, NV

Pub Type

Conferences

Download Paper

Local Download

Keywords

Smart Grid, wireless mesh networks, routing protocols, greedy backpressure, WLAN, IEEE 802.11s

Citation

Gharavi, H. (2014), Greedy Backpressure Routing for Smart Grid Sensor Networks, IEEE Consumer Communications and Networking Conference, Las Vegas, NV, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=915007 (Accessed October 14, 2025)