On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks

Nikhil Singh; Ramavarapu S. Sreenivas

doi:10.1109/WIOPT.2007.4480038

On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper we present a distributed flow-based access scheme for slotted-time protocols, that provides proportional-fairness in ad hoc wireless networks based on the local two-hop information of nodes. We say a medium access control algorithm is proportionally fair with respect to individual endto-end flows in a network, if the product of the end-to-end flow-success probabilities is maximized. The proposed scheme is implemented using a slotted-time protocol - ST-MAC [14]. We then present the preliminary results evaluating the fairness properties of the ST-MAC protocol using ns2 simulations [12].

Original language	English (US)
Title of host publication	Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007
DOIs	https://doi.org/10.1109/WIOPT.2007.4480038
State	Published - 2007
Event	5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007 - Limassol, Cyprus Duration: Apr 16 2007 → Apr 20 2007

Publication series

Name	Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007

Other

Other	5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007
Country/Territory	Cyprus
City	Limassol
Period	4/16/07 → 4/20/07

ASJC Scopus subject areas

Computational Theory and Mathematics
Computer Networks and Communications

Online availability

10.1109/WIOPT.2007.4480038

Library availability

Discover UIUC Full Text

Cite this

Singh, N., & Sreenivas, R. S. (2007). On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks. In Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007 Article 4480038 (Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007). https://doi.org/10.1109/WIOPT.2007.4480038

On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks. / Singh, Nikhil; Sreenivas, Ramavarapu S.
Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007. 2007. 4480038 (Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Singh, N & Sreenivas, RS 2007, On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks. in Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007., 4480038, Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007, 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007, Limassol, Cyprus, 4/16/07. https://doi.org/10.1109/WIOPT.2007.4480038

Singh N, Sreenivas RS. On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks. In Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007. 2007. 4480038. (Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007). doi: 10.1109/WIOPT.2007.4480038

Singh, Nikhil ; Sreenivas, Ramavarapu S. / On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks. Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007. 2007. (Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007).

@inproceedings{fef098484dd641018252a564ae8560b7,

title = "On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks",

abstract = "In this paper we present a distributed flow-based access scheme for slotted-time protocols, that provides proportional-fairness in ad hoc wireless networks based on the local two-hop information of nodes. We say a medium access control algorithm is proportionally fair with respect to individual endto-end flows in a network, if the product of the end-to-end flow-success probabilities is maximized. The proposed scheme is implemented using a slotted-time protocol - ST-MAC [14]. We then present the preliminary results evaluating the fairness properties of the ST-MAC protocol using ns2 simulations [12].",

author = "Nikhil Singh and Sreenivas, {Ramavarapu S.}",

year = "2007",

doi = "10.1109/WIOPT.2007.4480038",

language = "English (US)",

isbn = "1424409616",

series = "Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007",

booktitle = "Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007",

note = "5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007 ; Conference date: 16-04-2007 Through 20-04-2007",

}

TY - GEN

T1 - On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks

AU - Singh, Nikhil

AU - Sreenivas, Ramavarapu S.

PY - 2007

Y1 - 2007

N2 - In this paper we present a distributed flow-based access scheme for slotted-time protocols, that provides proportional-fairness in ad hoc wireless networks based on the local two-hop information of nodes. We say a medium access control algorithm is proportionally fair with respect to individual endto-end flows in a network, if the product of the end-to-end flow-success probabilities is maximized. The proposed scheme is implemented using a slotted-time protocol - ST-MAC [14]. We then present the preliminary results evaluating the fairness properties of the ST-MAC protocol using ns2 simulations [12].

AB - In this paper we present a distributed flow-based access scheme for slotted-time protocols, that provides proportional-fairness in ad hoc wireless networks based on the local two-hop information of nodes. We say a medium access control algorithm is proportionally fair with respect to individual endto-end flows in a network, if the product of the end-to-end flow-success probabilities is maximized. The proposed scheme is implemented using a slotted-time protocol - ST-MAC [14]. We then present the preliminary results evaluating the fairness properties of the ST-MAC protocol using ns2 simulations [12].

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

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

U2 - 10.1109/WIOPT.2007.4480038

DO - 10.1109/WIOPT.2007.4480038

M3 - Conference contribution

AN - SCOPUS:49649129156

SN - 1424409616

SN - 9781424409617

T3 - Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007

BT - Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007

T2 - 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007

Y2 - 16 April 2007 through 20 April 2007

ER -

On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this