Energy-Efficient SINR-Based Routing for Multi-hop Wireless Networks.

Abstract:

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.

Algorithm Description:

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

Existing System:

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 page 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.

Proposed System:


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.


Hardware Requirements:

¢ System : Pentium IV 2.4 GHz.
¢ Hard Disk : 40 GB.
¢ Floppy Drive : 1.44 Mb.
¢ Monitor : 15 VGA Colour.
¢ Mouse : Logitech.
¢ Ram : 256 Mb.


Software Requirements:

¢ Operating system : - Windows XP Professional.
¢ Coding Language : - Java.
¢ Tool Used : - Eclipse.


Download Full Paper
http://cobweb.ecn.purdue.edu/~shroff/Shr...info06.pdf

i want ppt presentation on energy-efficient SINR-Based routing for multihop wireless networks

---

ppt presentation on energy-efficient sinr-based routing for multihop wireless networks

Thanks for the report

---

This article is presented by:
Sungoh Kwon, Samsung Electronics Co., Suwon
Ness B. Shroff, The Ohio State University, Columbus


In this paper, we develop an energy efficient routing scheme that takes into account the interference created by existing flows in the network. Unlike previous works, we explicitly study the impact of routing a new flow on the energy consumption of the network. Under certain assumptions on how links are scheduled, we can show that our proposed algorithm is asymp- totically (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. Using simulations, we show that the routes chosen by our algorithm (centralized and distributed) are more energy efficient than the state of the art.

INTRODUCTION
Over the last several years, multi-hop wireless networks have received considerable attention. These networks are ex- pected to have widespread applicability for the purpose of sensing, communications, and distributed computation . The advantages of these networks are: they do not require a sophisticated infrastructure and can be rapidly deployed; they can be deployed in remote, hostile, or hard to reach areas; they can be used to extend the reach of existing network infrastructure. The evolution of broadband wireless technologies has the potential to significantly extend the scope of applicability of such networks . For example, a wireless mesh network could substitute for a wireline infrastructure in urban areas and offer broadband Internet services. Hence, multi-hop wireless networks may also need to support real-time services that have quality of service (QoS) requirements, as in their wired counterparts. However, unlike wired networks, wireless systems need efficient power management, since transmission power is a precious resource. Even if a wireless system is connected to a power outlet, power is still important as it directly affects the amount of interference created in the network, and thus impacts the overall throughput that the network can sustain. Therefore, power management is a critical component in wireless networks. To minimize the energy (or power) consumed in wireless networks various mechanisms such as power control page link scheduling and energy- efficient routing algorithms have been studied. By appropriately scheduling links for transmission, one can po- tentially reduce the mutual interference imposed by concurrent transmissions in order to get better performance. 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, opportunis- tic 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 QoS requirements or to minimize energy consumption.

For more information about this article,please follow the link:

http://computerportal/web/csdl/doi/10.1109/TMC.2008.165
http://googleurl?sa=t&source=web&cd=3&ve....1.113.214%26rep%3Drep1%26type%3Dpdf&ei=D7imTIT9ONCecdTinKgH&usg=AFQjCNEYivXktRqpNuHqIBUxTorXLVNTtw
http://googleurl?sa=t&source=web&cd=3&ve....1.113.214%26rep%3Drep1%26type%3Dpdf&ei=D7imTIT9ONCecdTinKgH&usg=AFQjCNEYivXktRqpNuHqIBUxTorXLVNTtw

---

[attachment=5413]

Energy-Efficient SINR-Based Routing for Multi-hop Wireless Networks Full report


Sungoh Kwon, Member, IEEE, and Ness B. Shroff, Fellow, IEEE

---

Abstract—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. 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. Using simulations, we show that the routes chosen by our algorithm (centralized and distributed) are more
energy efficient than the state of the art.

http://studentbank.in/report-energy-effi...ull-report