Effective rules placement approach in energy-constrained software defined wireless community networks

In this paper, we propose an effective approach for rules placement in energy-aware software-defined wireless community networks. It consists of defining accurate routing rules at the control plane based on network characteristics and then placing them in routers and switches located in the data plane. The ultimate goal is to minimize the total energy consumption by taking into account the residual energy and memory capacity constraints of nodes. The energy-efficient routing issue is an np-complete problem. It involves finding a path that optimizes the energy consumption to relay each flow from source to destination. The strategy for defining rules and placing them in routers that guides the routing process can lead to high-energy consumption. Our main interest is in energy-sensitive areas where power supply is sometimes very scarce, insufficient, or irregular. Nodes in this context are likely to operate very often with autonomous energy. Under these operating circumstances, the total energy consumption and the residual energy of each node, are very important metrics in the path calculation for the network and nodes' lifetime considered together. We formalize the problem as an integer linear program and propose a greedy heuristic as solution. Based on the experiments performed, evaluation results show that our solution simultaneously extends the lifetime of the network and nodes compared to Djikstra's algorithm.