SCAR: A Coding-Aware Routing Protocol with Self-Recommendation in Static Wireless Ad Hoc Networks
There have been researchers working on the design of coding-aware routing protocols to exploit the power of network coding in static wireless ad hoc networks. However, most of them have overlooked the fact that routing decisions for multiple flows need to be coordinated in order to achieve maximum t...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Computer Networks and Communications |
| Online Access: | http://dx.doi.org/10.1155/2014/637278 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849691444770504704 |
|---|---|
| author | Jin Wang Cenzhe Zhu Teck Yoong Chai Wai-Choong Wong |
| author_facet | Jin Wang Cenzhe Zhu Teck Yoong Chai Wai-Choong Wong |
| author_sort | Jin Wang |
| collection | DOAJ |
| description | There have been researchers working on the design of coding-aware routing protocols to exploit the power
of network coding in static wireless ad hoc networks. However, most of them have overlooked the fact that routing decisions for multiple flows need to be coordinated in order to achieve maximum throughput. A mechanism to alter prior routing decisions is mandatory for this purpose. In this paper, we propose Self-recommendation coding-aware routing (SCAR), to provide such a mechanism. With intermediate nodes sensing the arrival of new flows, they can send self-recommendations to source nodes, triggering a route-change procedure. In the route-change procedure, adjustments are applied to the route metrics so that the newly recommended route can be fairly weighed without bias. A thorough analysis of coding structures is carried out, and a series of indicators are devised to predict how much throughput benefits we can gain from the mere knowledge of the topology. The rationale behind the protocol design and the effectiveness of the indicators are further justified by a series of simulations. Results show that SCAR can exploit coding opportunities better and provide higher throughput than other coding-aware routing protocols. It is also
shown that the opportunity of throughput gain is ubiquitous and it is tested on many typical topologies. |
| format | Article |
| id | doaj-art-e8961ad8dec648b09a7eb8db2f45c356 |
| institution | DOAJ |
| issn | 2090-7141 2090-715X |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Computer Networks and Communications |
| spelling | doaj-art-e8961ad8dec648b09a7eb8db2f45c3562025-08-20T03:21:02ZengWileyJournal of Computer Networks and Communications2090-71412090-715X2014-01-01201410.1155/2014/637278637278SCAR: A Coding-Aware Routing Protocol with Self-Recommendation in Static Wireless Ad Hoc NetworksJin Wang0Cenzhe Zhu1Teck Yoong Chai2Wai-Choong Wong3National University of Singapore, 119613, SingaporeNational University of Singapore, 119613, SingaporeInstitute for Infocomm Research, 138632, SingaporeNational University of Singapore, 119613, SingaporeThere have been researchers working on the design of coding-aware routing protocols to exploit the power of network coding in static wireless ad hoc networks. However, most of them have overlooked the fact that routing decisions for multiple flows need to be coordinated in order to achieve maximum throughput. A mechanism to alter prior routing decisions is mandatory for this purpose. In this paper, we propose Self-recommendation coding-aware routing (SCAR), to provide such a mechanism. With intermediate nodes sensing the arrival of new flows, they can send self-recommendations to source nodes, triggering a route-change procedure. In the route-change procedure, adjustments are applied to the route metrics so that the newly recommended route can be fairly weighed without bias. A thorough analysis of coding structures is carried out, and a series of indicators are devised to predict how much throughput benefits we can gain from the mere knowledge of the topology. The rationale behind the protocol design and the effectiveness of the indicators are further justified by a series of simulations. Results show that SCAR can exploit coding opportunities better and provide higher throughput than other coding-aware routing protocols. It is also shown that the opportunity of throughput gain is ubiquitous and it is tested on many typical topologies.http://dx.doi.org/10.1155/2014/637278 |
| spellingShingle | Jin Wang Cenzhe Zhu Teck Yoong Chai Wai-Choong Wong SCAR: A Coding-Aware Routing Protocol with Self-Recommendation in Static Wireless Ad Hoc Networks Journal of Computer Networks and Communications |
| title | SCAR: A Coding-Aware Routing Protocol with Self-Recommendation in Static Wireless Ad Hoc Networks |
| title_full | SCAR: A Coding-Aware Routing Protocol with Self-Recommendation in Static Wireless Ad Hoc Networks |
| title_fullStr | SCAR: A Coding-Aware Routing Protocol with Self-Recommendation in Static Wireless Ad Hoc Networks |
| title_full_unstemmed | SCAR: A Coding-Aware Routing Protocol with Self-Recommendation in Static Wireless Ad Hoc Networks |
| title_short | SCAR: A Coding-Aware Routing Protocol with Self-Recommendation in Static Wireless Ad Hoc Networks |
| title_sort | scar a coding aware routing protocol with self recommendation in static wireless ad hoc networks |
| url | http://dx.doi.org/10.1155/2014/637278 |
| work_keys_str_mv | AT jinwang scaracodingawareroutingprotocolwithselfrecommendationinstaticwirelessadhocnetworks AT cenzhezhu scaracodingawareroutingprotocolwithselfrecommendationinstaticwirelessadhocnetworks AT teckyoongchai scaracodingawareroutingprotocolwithselfrecommendationinstaticwirelessadhocnetworks AT waichoongwong scaracodingawareroutingprotocolwithselfrecommendationinstaticwirelessadhocnetworks |