A Routing and Link Scheduling Strategy for Smart Grid NAN Communications

Abstract

As large scale deployment of smart devices in the power grid continues, research efforts need to increasingly focus on efficient communication of generated information. This paper describes a strategy for static routing and scheduling of messages in a multi-hop wireless Smart Grid Neighborhood Area Network (NAN) with multiple source nodes and a common set of destinations or gateways. The problem is formulated as a Mixed Integer Linear Program (MILP) and solved using commercial optimization solver CPLEX. Feasibility of the scheme is demonstrated using different network models, constraints, message injection rates, and initial conditions. It is shown that the proposed approach can be used to generate an optimal link schedule for collecting user-generated bids in a transactive energy market in the least possible time. It is also shown that the methodology is applicable to multiple destination nodes and that their location affects message delivery time.