Opportunistic Routing With Congestion Diversity in Wireless Ad Hoc Networks
Categories: IEEE based on NETWORKS, JAVA PROJECTS Tags: ad hoc, ieee, java, network
- Description
- Reviews (0)
Product Description
Opportunistic Routing With Congestion Diversity in Wireless Ad Hoc Networks
While ensuring bounded expected delay, the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links is considered. Each packet transmission can be overheard by a random subset of receiver nodes among which the next relay is selected opportunistically. Balancing the trade-off between routing the packets along the shortest paths to the destination and distributing the traffic according to the maximum back pressure is the main challenge in the design of minimum-delay routing policies.
The proposed system provides a systematic development of a distributed opportunistic routing policy with congestion diversity (D-ORCD) by combining the important aspects of shortest path and backpressure routing. D-ORCD uses a measure of draining time to opportunistically identify and route packets along the paths with an expected low overall congestion.
D-ORCD with single destination is proved to ensure a bounded expected delay for all networks and under any admissible traffic, so long as the rate of computations is sufficiently fast relative to traffic statistics.Opportunistic Routing With Congestion Diversity in Wireless Ad Hoc Networks.
The proposed system also provides a practical implementation of D-ORCD which empirically optimizes critical algorithm parameters and their effects on delay as well as protocol overhead. Realistic QualNet simulations for 802.11-based networks demonstrate a significant improvement in the average delay over comparable solutions in the literature.
Be the first to review “Opportunistic Routing With Congestion Diversity in Wireless Ad Hoc Networks” Cancel reply
Related Products

ComputationalDynamicTrustModel
Sold By Final year Student Project
An Efficient File Hierarchy Attribute Based Encryption Scheme in Cloud Computing
Sold By Final year Student Project
Conjunctive Keyword Search With Designated Tester and Timing Enabled Proxy Re‐Encryption Function for E‐Health Clouds
Sold By Final year Student Project
data driven semi global alignment approach for detecting masquerade
Sold By Final year Student Project
CloudArmor: Supporting Reputation‐Based Trust Management for Cloud Services
Sold By Final year Student Project
An Efficient Privacy‐Preserving Ranked Keyword Search Method
Sold By Final year Student Project
Dynamic and Public Auditing with Fair Arbitration for Cloud Data
Sold By Final year Student Project
Reviews
There are no reviews yet. Add a review