ACM Home Page
Please provide us with feedback. Feedback
Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks
Full text PdfPdf (187 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing table of contents
Florence, Italy
SESSION: Medium access control table of contents
Pages: 214 - 225  
Year of Publication: 2006
ISBN:1-59593-368-9
Authors
Jingpu Shi  Rice University, Houston, TX
Theodoros Salonidis  Rice University, Houston, TX
Edward W. Knightly  Rice University, Houston, TX
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 134,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1132905.1132929
What is a DOI?

ABSTRACT

Existing multi-channel protocols have been demonstrated to significantly increase aggregate throughput compared to single-channel protocols. However, we show that despite such improvements in aggregate throughput, existing protocols can lead to flow starvation in a multi-hop network, a phenomenon that also occurs with single-channel protocols. In this paper, we devise Asynchronous Multi-channel Coordination Protocol (AMCP), a distributed medium access protocol that not only increases aggregate throughput, but more importantly, addresses the fundamental coordination problems that lead to starvation. Based on AMCP's counter-starvation mechanisms, we analytically derive and experimentally validate an ap-proximate lower bound on the throughput of any flow in an arbitrary topology. We also demonstrate that AMCP can deliver significantly higher per-flow throughput than both IEEE 802.11 and existing multi-channel solutions. In addition to its performance properties, AMCP is both simple in that it operates using the primitives of IEEE 802.11 DCF, and cost-effective in that it requires only a single half-duplex transceiver and no infrastructure support.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
 
4
G. Bianchi. Performance analysis of the IEEE 802.11 distributed coordination function. IEEE Journal on Selected Areas in Communications, 18(3):535--547, March 2000.
 
5
 
6
I. Chlamtac and A. Lerner. Fair Algorithms for Maximal Link Activation in Multihop Radio Networks. IEEE Transactions on Communications, 35, July 1987.
 
7
T.A. ElBatt and A. Ephremides. Joint Scheduling and Power Control for Wireless Ad-hoc Networks. In Proc. IEEE INFOCOM, New York, NY, USA, June 2002.
 
8
A. Ephremides and T.V. Truong. Scheduling Broadcasts in Multihop Radio Networks. IEEE Transactions on Communications, 38(4), April 1990.
 
9
A. Ephremides, J.E. Wieselthier, and D.J. Baker. A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. of IEEE, 75(1):56--73, 1987.
 
10
 
11
J.J. Garcia-Luna-Aceves and Y. Wang. Throughput and Fairness of Collision Avoidance Protocols in Ad Hoc Networks. Ad Hoc Networks: Technologies and Protocols, Kluwer Academic Publishers, 2004.
 
12
M. Garetto, T. Salonidis, and E. Knightly. Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks. In Proc. IEEE INFOCOM, Barcelona, Spain, 2006.
13
 
14
IEEE 802.11 Working Group. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications. 1997.
15
 
16
B. Hajek and G. Sasaki. Link Scheduling in Polynomial Time. IEEE Transactions on Information Theory, 34(5):910--917, September 1988.
17
 
18
N. Jain and S.R. Das. A Multichannel CSMA MAC Protocol with Receiver-Based Channel Selection for Multihop Wireless Networks. In Proc. IC3N, Scottsdale, AZ, USA, October 2001.
19
 
20
A. Kumar, E. Altman, D. Miorandi, and M. Goyal. New insights from a fixed point analysis of single cell IEEE 802.11 WLANs. In Proc. IEEE INFOCOM,Miami,FL, March 2005.
 
21
C.R. Lin. On-demand QoS routing in Multihop mobile networks. In Proc. IEEE INFOCOM, Anchorage, AK, April 2001.
 
22
H. Luo, J. Cheng, and S. Lu. Self-coordinating localized fair queueing in wireless ad hoc networks. IEEE Transaction on Mobile Computing, 3(1), January-March 2004.
23
 
24
A. Nasipuri and S. Das. A Multichannel CSMA MAC Protocol for Multihop Wireless Networks. In Proc. IEEE Wireless Communications and Networking Conference (WCNC), New Orleans, September 1999.
 
25
M.J. Neely, E. Modiano, and C.E. Rohrs. Dynamic Power Allocation and Routing for Time Varying Wireless Networks. IEEE Journal on Selected Areas in Communications, 23(1):89--103, Jan 2005.
26
 
27
28
 
29
S. Sarkar and L. Tassiulas. End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks . In Proc. Control and Decision Conference (CDC), Maui, HI, USA, December 2003.
30
 
31
L. Tassiulas and S. Sarkar. Maxmin fair scheduling in wireless networks. In Proceedings of IEEE INFOCOM '02, New York, NY, June 2002.
 
32
Y.C-. Tseng, C.S-. Hsu, and T.-Y. Hsieh. Power-saving protocols for IEEE 802.11-based Multi-hop Wireless Networks. In Proc. IEEE INFOCOM, New York, NY, USA, June 2002.
 
33
 
34
 
35
C. Zhu and M.S. Corson. QoS routing for mobile ad hoc networks. In Proc. IEEE INFOCOM, NewYork, NY, June 2002.

CITED BY  9

Collaborative Colleagues:
Jingpu Shi: colleagues
Theodoros Salonidis: colleagues
Edward W. Knightly: colleagues