Energy-Efficient SINR-Based Routing for Multi-hop Wireless Networks.
In this paper, we develop an energy-efficient routing scheme that takes into account the interference created by existing flows in the network. The routing scheme chooses a route such that the network expends the minimum energy satisfying with the minimum constraints of flows. Unlike previous works, we explicitly study the impact of routing a new flow on the energy consumption of
the network. Using implementation. We show that the routes chosen by our algorithm (centralized and distributed) are more energy efficient than the state of the art.
Algorithm / Technique used:
Energy Efficient Routing Technique.
Energy-efficient routing algorithms find the route that minimizes the overall energy consumption. Recently, there has also been an effort to use cross-layer information in order to optimize the efficiency of wireless networks. For example, opportunistic scheduling at the medium access control (MAC) layer can use physical layer information to maximize the overall throughput transmitted through the system. Routing and congestion control at the network layer can use physical layer information to satisfy quality-of-service (QoS) requirements or to minimize energy consumption
Interference can make a significant impact on the performance of multi-hop wireless networks. Researchers have studied interference-aware topology control recently. In this we study routing problems in a multi-hop wireless network using directional antennas with dynamic traffic. We present new definitions of link and path interference that are suitable for designing better routing algorithms. We then formulate and optimally solve two power constrained minimum interference single path routing problems. Routing along paths found by our interference-aware algorithms tends to have less channel collisions and higher network throughput. Our algorithms can reduce average path interference by 40% or more at the cost of a minor power increase. solving the power constrained minimum interference node-disjoint path routing problem.
Under certain assumptions on how links are scheduled, we can show that our proposed algorithm is asymptotically (in time) optimal in terms of minimizing the average energy consumption. We also develop a distributed version of the algorithm. Our algorithm automatically detours around a congested area in the network, which helps mitigate network congestion and improve overall network performance.
Â¢ System : Pentium IV 2.4 GHz.
Â¢ Hard Disk : 40 GB.
Â¢ Floppy Drive : 1.44 Mb.
Â¢ Monitor : 15 VGA Colour.
Â¢ Mouse : Logitech.
Â¢ Ram : 256 Mb.
Â¢ Operating system : - Windows XP Professional.
Â¢ Coding Language : - Java.
Â¢ Tool Used : - Eclipse.
Download Full Paper