Abstract-We study the problem of transmission-side diversity and routing in a static wireless network. It is assumed that each node in the network is equipped with a single omnidirectional antenna and that multiple nodes are allowed to coordinate their transmissions in order to obtain energy savings. We derive analytical results for achievable energy savings for both line and grid network topologies. It is shown that the energy savings of 39% and 56% are achievable in line and grid networks with a large number of nodes, respectively. We then develop a dynamic-programming-based algorithm for finding the optimal route in an arbitrary network, as well as suboptimal algorithms with polynomial complexity. We show through simulations that these algorithms can achieve average energy savings of about 50% in random networks, as compared to the noncooperative schemes.
The problem of energy-efficient routing in wireless networks that support cooperative transmission was formulated in REF .
Cooperative Routing in Static Wireless Networks
IEEE Transactions on Communications
IEEE Transactions on Communications
Computer Science