Weighted Signed Graph (WSG) power-aware routing in distributed wireless networks

In this paper, we propose a Weighted Signed Graph (WSG)-based power-aware routing scheme for distributed wireless networks. It is a practically implementable and self re-configurable distributed solution. It is an alternative and novel method to solve the constraint optimization with network lifetime and throughput in wireless networks. The proposed scheme runs independently on each wireless node and optimizes the network lifetime by invoking power-aware routing schemes. The power-aware routing scheme we propose in this paper is a modified shortest path routing (Distance Vector (DV) Routing) scheme wherein instead of path length, we employ link cost in terms of congestion and battery availability at nodes for route computation. We also propose linear as well as non-linear sectorization of available battery power at a node for sending route update packets. We perform extensive simulation using Java implementation and observe that our scheme minimizes the message passing involved in DV routing deployment. We further observe that the proposed WSG scheme out-performs the basic DV routing in-terms of throughput and lifetime of the network.