This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks
October 2004 (vol. 3 no. 4)
pp. 380-393
ASCII Text
x 
 
Wei Liu, Xiang Chen, Yuguang Fang, John M. Shea, "Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 3, no. 4, pp. 380-393, October, 2004.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2004.33,
author = {Wei Liu and Xiang Chen and Yuguang Fang and John M. Shea},
title = {Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks},
journal ={IEEE Transactions on Mobile Computing},
volume = {3},
number = {4},
issn = {1536-1233},
year = {2004},
pages = {380-393},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2004.33},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks
IS - 4
SN - 1536-1233
SP380
EP393
EPD - 380-393
A1 - Wei Liu,
A1 - Xiang Chen,
A1 - Yuguang Fang,
A1 - John M. Shea,
PY - 2004
KW - Differentiated services
KW - quality of service
KW - multihop mobile ad hoc networks.
VL - 3
JA - IEEE Transactions on Mobile Computing
ER -
 
Wei Liu, IEEE
Xiang Chen, IEEE
Due to the salient characteristics such as the time-varying and error-prone wireless links, the dynamic and limited bandwidth, the time-varying traffic pattern and user locations, and the energy constraints, it is a challenging task to efficiently support heterogeneous traffic with different quality of service (QoS) requirements in multihop mobile ad hoc networks. In the last few years, many channel-dependent mechanisms are proposed to address this issue based on the cross-layer design philosophy. However, a lot of problems remain before more efficient solutions are found. One of the problems is how to alleviate the conflict between throughput and fairness for different prioritized traffic, especially how to avoid the bandwidth starvation problem for low-priority traffic when the high-priority traffic load is very high. In this paper, we propose a novel scheme named Courtesy Piggybacking to address this problem. With the recognition of interlayer coupling, our Courtesy Piggybacking scheme exploits the channel dynamics and stochastic traffic features to alleviate the conflict. The basic idea is to let the high-priority traffic help the low-priority traffic by sharing unused residual bandwidth with courtesy. Another noteworthy feature of the proposed scheme is its implementation simplicity: The scheme is easy to implement and is applicable in networks using either reservation-based or contention-based MAC protocols.

[1] “Defining Cross-Layer Design for Wireless Networking,” Proc. IEEE Int'l Conf. Comm. (ICC '03), http://www.eas.asu.edu/ junshanICC03panel.html, 2003.
[2] T.S.E. Ng, I. Stoica, and H. Zhang, “Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors,” Proc. IEEE INFOCOM '98 Conf., pp. 1103-1111, 1998.
[3] P. Bhagwat, A. Krishna, and S. Tripathi, “Enhance Throughput over Wireless LANs Using Channel State Dependent Packet Scheduling,” Proc. IEEE INFOCOM '96 Conf., pp. 1133-1140, Mar. 1996.
[4] I. Koutsopoulous and L. Tassiulas, “Channel State-Adaptive Techiniques for Throughput Enhancements in Wireless Broadband Networks,” Proc. IEEE INFOCOM '01 Conf., pp. 757-766, Apr. 2001.
[5] B. Kim, Y. Fang, T.F. Wong, and Y. Kwon, “Dynamic Fragmentation Scheme for Rate-Adaptive Wireless LAN,” Proc. IEEE Int'l Symp. Personal, Indoor, and Mobile Radio Comm. (PIMRC '03), Sept. 2003.
[6] S. Yajnik, J. Sienicki, and P. Agrawal, “Adaptive Coding for Packetized Data in Wireless Networks,” Proc. IEEE Int'l Symp. Personal, Indoor, and Mobile Radio Comm. (PIMRC '95), pp. 338-342, 1995.
[7] M. Elaud and P. Ramanathan, “Adaptive Use of Error-Correction Codes for Real-Time Communication in Wireless Networks,” Proc. IEEE INFOCOM '98 Conf., pp. 548-555, Mar. 1998.
[8] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM '94 Conf., pp. 234-244, Sept. 1994.
[9] D.B. Johnson, D.A. Maltz, and Y.-C. Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” IETF Internet Draft, draft-ietf-manet-dsr-09.txt, Apr. 15 2003.
[10] C.E. Perkins, E.M. Belding-Royer, and S. Das, “Ad Hoc on Demand Distance Vector (AODV) Routing,” RFC 3561, July 2003.
[11] V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, “MACAW: A Media Access Protocol for Wireless LANs,” Proc. ACM SIGCOMM '94 Conf., 1994.
[12] C. Fullmer and J.J. Garcia-Luna-Aceves, “Floor Acquisition Multiple Acess (FAMA) for Packet Radionetworks,” Proc. ACM SIGCOMM '95 Conf., 1995.
[13] IEEE 802.11WG, Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, Standard, IEEE, Aug. 1999.
[14] M. Barry, A.T. Campbell, and A. Veres, “Distributed Control Algorithm for Service Differentiation in Wireless Packet Networks,” Proc. IEEE INFOCOM '01 Conf., 2001.
[15] X. Pallot and L.E. Miller, “Implementing Message Priority Policies over an 802.11 Based Mobile Ad Hoc Network,” Proc. IEEE MILCOM 2001 Conf., Oct. 2001.
[16] Y. Cao and V.O.K. Li, “Scheduling Algorithms in Broad-Band Wireless Networks,” Proc. IEEE, vol. 89, no. 1, pp. 76-87, 2001.
[17] J. Wang and K. Nahrstedt, “Hop-by-Hop Routing Algorithms for Premium-Class Traffic in DiffServ Networks,” Proc. IEEE INFOCOM '02 Conf., 2002.
[18] I. Ada and C. Castelluccia, “Differentiation Mechanisms for IEEE 802.11,” Proc. IEEE INFOCOM '01 Conf., 2001.
[19] E. Modiano, “An Adaptive Algorithm for Optimizing the Packet Size Used in Wireless ARQ Protocols,” Wireless Networks, vol. 5, no. 5, pp. 279-286, 1999.
[20] A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queuein Algorithm,” Proc. ACM SIGCOMM '89 Conf., pp. 3-12, 1989.
[21] L. Zhang, “Virtual Clock: A New Traffic Control Algorithm for Packet Switching Netowrks,” Proc. ACM SIGCOMM '90 Conf., pp. 19-29, 1990.
[22] S. Lu and V. Bharghavan, “Fair Scheduling in Wireless Packet Networks,” IEEE/ACM Trans. Netowrking, vol. 7, no. 4, pp. 473-489, 1999.
[23] C. Fragouli, V. Sivaraman, and M. Srivastava, “Controlled Multimedia Wireless Link Sharing via Enhanced Class-Based Queuing with Channel-State Dependent Packet Scheduling,” Proc. IEEE INFOCOM '98 Conf., pp. 572-580, Mar. 1998.
[24] S. Floyd and V. Jacobson, “Link-Sharing and Resource Management Models for Packet Netwroks,” IEEE/ACM Trans. Networking, vol. 3, pp. 365-386, Aug. 1995.
[25] G. Holland, N. Vaidya, and P. Bahl, “A Rate-Adpative MAC Protocol for Multihop Wireless Networks,” Proc. ACM MOBICOM '01 Conf., 2001.
[26] P. Chevillat, J. Jelitto, A.N. Barreto, and H.L. Truong, “A Dynamic Link Adaptation Algorithm for IEEE 802.11a Wireless LANs,” Proc. IEEE Int'l Conf. Comm. (ICC'03), May 2003.
[27] J. Tourrilhes, “Dwell Adaprtive Fragmentation: How to Cope with Short Dwells Required by Multimedia Wireless LANs,” Proc. IEEE GLOBECOM Conf., 2000.
[28] D. Qiao and S. Choi, “Goodput Enhancement of IEEE 802.11a Wireless LAN via Link Adaptation,” Proc. IEEE Int'l Conf. Comm. (ICC '01), 2001.
[29] K. Balachanran, S.R. Kadaba, and S. Nanda, “Channel Quality Estimation and Rate Adaption for Cellular Mobile Radio,” IEEE J. Selceted Areas in Comm., vol. 17, no. 7, pp. 1244-1256, July 1999.
[30] H. Wang and N. Moayeri, “Finite-State Markov Channel-A Useful Model for Radio Communication Channels,” IEEE Trans. Vehicular Technology, vol. 44, no. 1, Feb. 1995.
[31] http:/www.opnet.com, 2004.
[32] S.-T. Sheu, T. Chen, J. Chen, and F. Ye, “An Improved Data Flushing MAC Protocol for IEEE 802.11 Wireless Ad Hoc Network,” Proc. IEEE Vehicular Technology Conf. (VTC), 2002.
[33] A.S. Tanenbaum, Computer Networks, third ed. Prentice Hall, 1996.
[34] D. Bertsekas and R. Gallager, Data Networks, second ed. Prentice Hall, 1992.
[35] K. Altinkemer, I. Bose, and R. Pal, “Average Waiting Time of Customers in an M/D/k Queue with Nonpreemptive Priorities,” Computers & Operations Research, vol. 25, no. 4, pp. 317-328, 1998.
[36] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, T. Imielinski and H.F.Korth, eds., vol. 353, Kluwer Academic Publishers, 1996.
[37] S. Shakkottai, T.S. Rappaport, and P.C. Karlsson, “Cross-Layer Design for Wireless Networks,” IEEE Comm. Magazine, Oct. 2003.
[38] J. Yoon, M. Liu, and B. Noble, “Sound Mobility Models,” Proc. ACM MOBICOM '03 Conf., Sept. 2003.
[39] G.-S. Ahn, A.T. Campbell, A. Veres, and L.-H. Sun, “Supporting Service Differentiation for Real-Time and Best Effort Traffic in Stateless Wireless Ad Hoc Networks (SWAN),” IEEE Trans. Mobile Computing, vol. 1, no. 3, pp. 192-207, July-Sept. 2002.
[40] J. Gomez and A.T. Campbell, “Havana: Supporting Application and Channel Dependent QOS in Wireless Networks,” ACM J. Wireless Networks (WINET), vol. 9, no. 1, pp. 21-35, Jan. 2003.

Index Terms:
Differentiated services, quality of service, multihop mobile ad hoc networks.
Citation:
Wei Liu, Xiang Chen, Yuguang Fang, John M. Shea, "Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 3, no. 4, pp. 380-393, Oct. 2004, doi:10.1109/TMC.2004.33
Usage of this product signifies your acceptance of the Terms of Use.