10-02-2012, 12:57 PM
Traffic-Aware Dynamic Routing
Hello,
I am Final year M .Tech Student .I need an source code for the Traffic-Aware Dynamic Routing in java platform.could any one please help me .Because i am getting my review within 10 days.
Thankyou.
Abstract
The congestion problem in Wireless Sensor Networks (WSNs) is quite different from that in traditional networks. Most current congestion control algorithms try to alleviate the congestion by reducing the rate at which the source nodes inject packets into the network. However, this traffic control scheme always decreases the throughput so as to violate fidelity level required by the applications. In this project, we present a solution that sufficiently exerts the idle or under-loaded nodes to alleviate congestion and improve the overall throughput in WSNs. To achieve this goal, a traffic-aware dynamic routing (TADR) algorithm is proposed to route packets around the congestion areas and scatter the excessive packets along multiple paths consisting of idle and under-loaded nodes. Utilizing the concept of potential in classical physics, our TADR algorithm is designed through constructing a hybrid virtual potential field using depth and normalized queue length to force the packets to steer clear of obstacles created by congestion and eventually move toward the sink.
Regards
Manikandan
Hello,
I am Final year M .Tech Student .I need an source code for the Traffic-Aware Dynamic Routing in java platform.could any one please help me .Because i am getting my review within 10 days.
Thankyou.
Abstract
The congestion problem in Wireless Sensor Networks (WSNs) is quite different from that in traditional networks. Most current congestion control algorithms try to alleviate the congestion by reducing the rate at which the source nodes inject packets into the network. However, this traffic control scheme always decreases the throughput so as to violate fidelity level required by the applications. In this project, we present a solution that sufficiently exerts the idle or under-loaded nodes to alleviate congestion and improve the overall throughput in WSNs. To achieve this goal, a traffic-aware dynamic routing (TADR) algorithm is proposed to route packets around the congestion areas and scatter the excessive packets along multiple paths consisting of idle and under-loaded nodes. Utilizing the concept of potential in classical physics, our TADR algorithm is designed through constructing a hybrid virtual potential field using depth and normalized queue length to force the packets to steer clear of obstacles created by congestion and eventually move toward the sink.
Regards
Manikandan