Towards cooperation fairness in mobile ad hoc networks

Haijin Yan, David K Lowenthal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

For the sustainable operation of ad hoc networks, incentive mechanisms are required to encourage cooperation. More importantly, we must enforce available bandwidth fairness among nodes in ad hoc networks. While such fair sharing of bandwidth in traditional networks is carried out by the dedicated routers with a variety of algorithms, in mobile ad-hoc networks, it must be performed by each node because nodes can act as routers as well as end hosts. Here, we say that bandwidth sharing is fair if a node's available bandwidth is proportional to its forwarding contribution. In this paper we achieve fair bandwidth sharing through a new packet scheduling algorithm, called cooperative queueing, on each node. In cooperative queueing, which is analogous to fair queueing, packet scheduling is based on a new abstraction that we call cooperation coefficient. The cooperation coefficient quantifies how much a given node contributes to and consumes from the ad-hoc network; the larger the cooperation coefficient, the more bandwidth a node can obtain. We exploit the widely used dynamic source routing information to obtain the cooperation coefficient. We evaluate the effectiveness of cooperative queueing with different parameters and network configurations. We demonstrate that our algorithm is able to encourage cooperation and ensure fair sharing of bandwidth between nodes. We show that cooperative queueing is simple and has little overhead.

Original languageEnglish (US)
Title of host publicationIEEE Wireless Communications and Networking Conference, WCNC
Pages2143-2148
Number of pages6
Volume4
StatePublished - 2005
Externally publishedYes
Event2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off - New Orleans, LA, United States
Duration: Mar 13 2005Mar 17 2005

Other

Other2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off
CountryUnited States
CityNew Orleans, LA
Period3/13/053/17/05

Fingerprint

Mobile ad hoc networks
Bandwidth
Ad hoc networks
Routers
Scheduling algorithms
Scheduling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Yan, H., & Lowenthal, D. K. (2005). Towards cooperation fairness in mobile ad hoc networks. In IEEE Wireless Communications and Networking Conference, WCNC (Vol. 4, pp. 2143-2148). [NET39-3]

Towards cooperation fairness in mobile ad hoc networks. / Yan, Haijin; Lowenthal, David K.

IEEE Wireless Communications and Networking Conference, WCNC. Vol. 4 2005. p. 2143-2148 NET39-3.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yan, H & Lowenthal, DK 2005, Towards cooperation fairness in mobile ad hoc networks. in IEEE Wireless Communications and Networking Conference, WCNC. vol. 4, NET39-3, pp. 2143-2148, 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off, New Orleans, LA, United States, 3/13/05.
Yan H, Lowenthal DK. Towards cooperation fairness in mobile ad hoc networks. In IEEE Wireless Communications and Networking Conference, WCNC. Vol. 4. 2005. p. 2143-2148. NET39-3
Yan, Haijin ; Lowenthal, David K. / Towards cooperation fairness in mobile ad hoc networks. IEEE Wireless Communications and Networking Conference, WCNC. Vol. 4 2005. pp. 2143-2148
@inproceedings{30b617ba3fd24e02bbbeece5d4d61b41,
title = "Towards cooperation fairness in mobile ad hoc networks",
abstract = "For the sustainable operation of ad hoc networks, incentive mechanisms are required to encourage cooperation. More importantly, we must enforce available bandwidth fairness among nodes in ad hoc networks. While such fair sharing of bandwidth in traditional networks is carried out by the dedicated routers with a variety of algorithms, in mobile ad-hoc networks, it must be performed by each node because nodes can act as routers as well as end hosts. Here, we say that bandwidth sharing is fair if a node's available bandwidth is proportional to its forwarding contribution. In this paper we achieve fair bandwidth sharing through a new packet scheduling algorithm, called cooperative queueing, on each node. In cooperative queueing, which is analogous to fair queueing, packet scheduling is based on a new abstraction that we call cooperation coefficient. The cooperation coefficient quantifies how much a given node contributes to and consumes from the ad-hoc network; the larger the cooperation coefficient, the more bandwidth a node can obtain. We exploit the widely used dynamic source routing information to obtain the cooperation coefficient. We evaluate the effectiveness of cooperative queueing with different parameters and network configurations. We demonstrate that our algorithm is able to encourage cooperation and ensure fair sharing of bandwidth between nodes. We show that cooperative queueing is simple and has little overhead.",
author = "Haijin Yan and Lowenthal, {David K}",
year = "2005",
language = "English (US)",
volume = "4",
pages = "2143--2148",
booktitle = "IEEE Wireless Communications and Networking Conference, WCNC",

}

TY - GEN

T1 - Towards cooperation fairness in mobile ad hoc networks

AU - Yan, Haijin

AU - Lowenthal, David K

PY - 2005

Y1 - 2005

N2 - For the sustainable operation of ad hoc networks, incentive mechanisms are required to encourage cooperation. More importantly, we must enforce available bandwidth fairness among nodes in ad hoc networks. While such fair sharing of bandwidth in traditional networks is carried out by the dedicated routers with a variety of algorithms, in mobile ad-hoc networks, it must be performed by each node because nodes can act as routers as well as end hosts. Here, we say that bandwidth sharing is fair if a node's available bandwidth is proportional to its forwarding contribution. In this paper we achieve fair bandwidth sharing through a new packet scheduling algorithm, called cooperative queueing, on each node. In cooperative queueing, which is analogous to fair queueing, packet scheduling is based on a new abstraction that we call cooperation coefficient. The cooperation coefficient quantifies how much a given node contributes to and consumes from the ad-hoc network; the larger the cooperation coefficient, the more bandwidth a node can obtain. We exploit the widely used dynamic source routing information to obtain the cooperation coefficient. We evaluate the effectiveness of cooperative queueing with different parameters and network configurations. We demonstrate that our algorithm is able to encourage cooperation and ensure fair sharing of bandwidth between nodes. We show that cooperative queueing is simple and has little overhead.

AB - For the sustainable operation of ad hoc networks, incentive mechanisms are required to encourage cooperation. More importantly, we must enforce available bandwidth fairness among nodes in ad hoc networks. While such fair sharing of bandwidth in traditional networks is carried out by the dedicated routers with a variety of algorithms, in mobile ad-hoc networks, it must be performed by each node because nodes can act as routers as well as end hosts. Here, we say that bandwidth sharing is fair if a node's available bandwidth is proportional to its forwarding contribution. In this paper we achieve fair bandwidth sharing through a new packet scheduling algorithm, called cooperative queueing, on each node. In cooperative queueing, which is analogous to fair queueing, packet scheduling is based on a new abstraction that we call cooperation coefficient. The cooperation coefficient quantifies how much a given node contributes to and consumes from the ad-hoc network; the larger the cooperation coefficient, the more bandwidth a node can obtain. We exploit the widely used dynamic source routing information to obtain the cooperation coefficient. We evaluate the effectiveness of cooperative queueing with different parameters and network configurations. We demonstrate that our algorithm is able to encourage cooperation and ensure fair sharing of bandwidth between nodes. We show that cooperative queueing is simple and has little overhead.

UR - http://www.scopus.com/inward/record.url?scp=24944529574&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24944529574&partnerID=8YFLogxK

M3 - Conference contribution

VL - 4

SP - 2143

EP - 2148

BT - IEEE Wireless Communications and Networking Conference, WCNC

ER -