File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TVT.2013.2282341
- Scopus: eid_2-s2.0-84897003928
- WOS: WOS:000333100700022
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Fairness analysis of routing in opportunistic mobile networks
Title | Fairness analysis of routing in opportunistic mobile networks |
---|---|
Authors | |
Keywords | Fair packet-forwarding strategy fairness opportunistic mobile networks |
Issue Date | 2014 |
Publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=25 |
Citation | IEEE Transactions on Vehicular Technology, 2014, v. 63, p. 1282 – 1295 How to Cite? |
Abstract | Multicopy utility-based forwarding algorithms are popular in opportunistic mobile networks. They aim to gain high system throughput while keeping the cost low. However, most of them ignore the fairness issue on the successful delivery rate among users. In this paper, we analyze the fairness evaluation of the success rate distribution, and we propose a new fair packet-forwarding strategy based on packet priority. We formulate the opportunistic packet-forwarding process as a discrete-time Markov chain and deduce a stationary probability distribution vector. Instead of taking the hill-climbing heuristic on utility comparison, we introduce a lower utility tolerance mechanism for the decision-making process of each node, and we theoretically demonstrate that the proposed mechanism may be used to control the success rate of packet delivery by changing a simple parameter. In addition, we adopt a message-duplication restricting mechanism to adjust the number of replications based on packet priority. Our proposed protocol can work as a plug-in for traditional utility-based forwarding algorithms. The performance is compared with several well-known opportunistic routing protocols via both a synthetic model and real human mobility traces. The results show that our protocol improves the fairness in successful delivery rates among users while maintaining almost the same system throughput. Moreover, it reduces the cost of traditional utility-based forwarding algorithms, rendering our proposed scheme not only fair but efficient as well. |
Persistent Identifier | http://hdl.handle.net/10722/202912 |
ISSN | 2023 Impact Factor: 6.1 2023 SCImago Journal Rankings: 2.714 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, VOK | en_US |
dc.contributor.author | Xu, K | en_US |
dc.contributor.author | FAN, X | en_US |
dc.date.accessioned | 2014-09-19T10:09:54Z | - |
dc.date.available | 2014-09-19T10:09:54Z | - |
dc.date.issued | 2014 | en_US |
dc.identifier.citation | IEEE Transactions on Vehicular Technology, 2014, v. 63, p. 1282 – 1295 | en_US |
dc.identifier.issn | 0018-9545 | - |
dc.identifier.uri | http://hdl.handle.net/10722/202912 | - |
dc.description.abstract | Multicopy utility-based forwarding algorithms are popular in opportunistic mobile networks. They aim to gain high system throughput while keeping the cost low. However, most of them ignore the fairness issue on the successful delivery rate among users. In this paper, we analyze the fairness evaluation of the success rate distribution, and we propose a new fair packet-forwarding strategy based on packet priority. We formulate the opportunistic packet-forwarding process as a discrete-time Markov chain and deduce a stationary probability distribution vector. Instead of taking the hill-climbing heuristic on utility comparison, we introduce a lower utility tolerance mechanism for the decision-making process of each node, and we theoretically demonstrate that the proposed mechanism may be used to control the success rate of packet delivery by changing a simple parameter. In addition, we adopt a message-duplication restricting mechanism to adjust the number of replications based on packet priority. Our proposed protocol can work as a plug-in for traditional utility-based forwarding algorithms. The performance is compared with several well-known opportunistic routing protocols via both a synthetic model and real human mobility traces. The results show that our protocol improves the fairness in successful delivery rates among users while maintaining almost the same system throughput. Moreover, it reduces the cost of traditional utility-based forwarding algorithms, rendering our proposed scheme not only fair but efficient as well. | en_US |
dc.language | eng | en_US |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=25 | en_US |
dc.relation.ispartof | IEEE Transactions on Vehicular Technology | en_US |
dc.rights | IEEE Transactions on Vehicular Technology. Copyright © IEEE. | en_US |
dc.rights | ©2014 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | en_US |
dc.subject | Fair packet-forwarding strategy | - |
dc.subject | fairness | - |
dc.subject | opportunistic mobile networks | - |
dc.title | Fairness analysis of routing in opportunistic mobile networks | en_US |
dc.type | Article | en_US |
dc.identifier.email | Li, VOK: vli@eee.hku.hk | en_US |
dc.identifier.email | Xu, K: kuang@hku.hk | en_US |
dc.identifier.authority | Li, VOK=rp00150 | en_US |
dc.identifier.doi | 10.1109/TVT.2013.2282341 | - |
dc.identifier.scopus | eid_2-s2.0-84897003928 | - |
dc.identifier.hkuros | 240484 | en_US |
dc.identifier.volume | 63 | en_US |
dc.identifier.spage | 1282 | en_US |
dc.identifier.epage | 1295 | en_US |
dc.identifier.eissn | 1939-9359 | - |
dc.identifier.isi | WOS:000333100700022 | - |
dc.identifier.issnl | 0018-9545 | - |