Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Contention-Aware Cooperative Routing in Wireless Mesh Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jin Zhang ; Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong, China ; Qian Zhang

Cooperative communication is a new physical layer technique which improves link capacity by exploiting broadcast nature and spatial diversity of wireless channel. The introduction of cooperative communication in wireless networks changes the traditional definition of link and the contention relationship among links. In this paper, we focus on cooperative communication aware routing protocol design in wireless mesh networks, targeting at maximizing the overall end-to-end throughput of the whole network and meanwhile taking contention relationship among multiple links into consideration. We propose a routing metric called contention-aware cooperative metric (CCM) and prove that CCM has the isotonic property. Therefore, efficient algorithms such as Dijkstra or Bellman-Ford can be used to find CCM-based minimum cost paths. Based on CCM, we propose a routing protocol called Contention-aware Cooperative Routing (CCR) which can be implemented in both link-state and distance-vector routing protocols. Extensive simulations are conducted on ns-2 to evaluate the performance of our novel routing metric and routing protocol. The results show that CCR achieves significant throughput gain compared with hop- count-based routing and ETT-based routing. The end-to-end delay is also dramatically reduced under CCR routing.

Published in:

Communications, 2009. ICC '09. IEEE International Conference on

Date of Conference:

14-18 June 2009