Utility-Based Opportunistic Routing in Multi-Hop Wireless Networks

2008 The 28th International Conference on Distributed Computing Systems Pub Date : 2008-06-17 DOI:10.1109/ICDCS.2008.90

Jie Wu, Mingming Lu, Feng Li

{"title":"Utility-Based Opportunistic Routing in Multi-Hop Wireless Networks","authors":"Jie Wu, Mingming Lu, Feng Li","doi":"10.1109/ICDCS.2008.90","DOIUrl":null,"url":null,"abstract":"Recently, opportunistic routing (OR) has been widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Previous works either provide heuristic solutions without optimality analysis, or assume that unlimited retransmission is available for delivering a data packet. In this paper, we apply OR to a utility-based routing where the successful delivery of a data packet generates benefit. The objective is to maximize utility, defined as a function of benefit and cost of transmission. As the link reliability of each relay determines eventual packet delivery and hence utility, OR offers the ability to increase reliability through opportunistic relays. We explore the optimality of utility-based routing through OR without allowing retransmission, and observe that the optimal scheme requires exhaustive searching of all paths from source to destination. We then propose a heuristic solution to select relays and determine priorities among them. Finally, we provide distributed implementations for both schemes. Simulations on NS-2 and our customized simulator are conducted to verify the effectiveness of the heuristic compared with the optimal.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"83","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 The 28th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2008.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 83

Abstract

Recently, opportunistic routing (OR) has been widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Previous works either provide heuristic solutions without optimality analysis, or assume that unlimited retransmission is available for delivering a data packet. In this paper, we apply OR to a utility-based routing where the successful delivery of a data packet generates benefit. The objective is to maximize utility, defined as a function of benefit and cost of transmission. As the link reliability of each relay determines eventual packet delivery and hence utility, OR offers the ability to increase reliability through opportunistic relays. We explore the optimality of utility-based routing through OR without allowing retransmission, and observe that the optimal scheme requires exhaustive searching of all paths from source to destination. We then propose a heuristic solution to select relays and determine priorities among them. Finally, we provide distributed implementations for both schemes. Simulations on NS-2 and our customized simulator are conducted to verify the effectiveness of the heuristic compared with the optimal.

查看原文本刊更多论文

多跳无线网络中基于效用的机会路由

近年来，机会路由(opportunistic routing, OR)被广泛用于补偿多跳无线网络的低分组传输率。以前的工作要么提供没有最优性分析的启发式解决方案，要么假设可以无限地重新传输数据包。在本文中，我们将OR应用于基于实用程序的路由，其中数据包的成功传递会产生好处。目标是最大化效用，定义为传输收益和成本的函数。由于每个中继的链路可靠性决定了最终的数据包传递和效用，OR提供了通过机会中继提高可靠性的能力。我们探索了通过OR而不允许重传的基于效用的路由的最优性，并观察到最优方案需要穷举搜索从源到目的的所有路径。然后，我们提出了一种启发式解决方案来选择继电器并确定它们之间的优先级。最后，我们为这两种方案提供了分布式实现。在NS-2和我们定制的模拟器上进行了仿真，验证了启发式算法与最优算法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2008 The 28th International Conference on Distributed Computing Systems

自引率

0.00%

发文量