This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Strong-Incentive, High-Throughput Channel Assignment for Noncooperative Wireless Networks
December 2010 (vol. 21 no. 12)
pp. 1808-1821
ASCII Text
x 
 
Fan Wu, Sheng Zhong, Chunming Qiao, "Strong-Incentive, High-Throughput Channel Assignment for Noncooperative Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 12, pp. 1808-1821, December, 2010.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2010.71,
author = {Fan Wu and Sheng Zhong and Chunming Qiao},
title = {Strong-Incentive, High-Throughput Channel Assignment for Noncooperative Wireless Networks},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {21},
number = {12},
issn = {1045-9219},
year = {2010},
pages = {1808-1821},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.71},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Strong-Incentive, High-Throughput Channel Assignment for Noncooperative Wireless Networks
IS - 12
SN - 1045-9219
SP1808
EP1821
EPD - 1808-1821
A1 - Fan Wu,
A1 - Sheng Zhong,
A1 - Chunming Qiao,
PY - 2010
KW - Communication/networking
KW - algorithm design
KW - economics
KW - security.
VL - 21
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Fan Wu, Shanghai Jiao Tong University, Shanghai
Sheng Zhong, University at Buffalo, State University of New York, Buffalo
Chunming Qiao, University at Buffalo, State University of New York, Buffalo
Channel assignment is a very important topic in wireless networks. In this paper, we study FDMA channel assignment in a noncooperative wireless network, where devices are selfish. Existing work on this problem has considered Nash Equilibrium (NE), which is not a very strong solution concept and may not guarantee a good system performance. In contrast, in this work, we introduce a payment formula to ensure the existence of a Strongly Dominant Strategy Equilibrium (SDSE), a different solution concept that gives participants much stronger incentives. We show that, when the system converges to an SDSE, it also achieves global optimality in terms of system throughput. Furthermore, we extend our work to the case in which some radios have a limited tunability. We show that in such a case, nevertheless, it is generally impossible to have a similar SDSE solution; with additional assumptions on the numbers of radios and the types of channels, etc., we can again achieve an SDSE solution that guarantees optimal system throughput. Besides this extension, we also consider other extensions of our strategic game to achieve throughput fairness and to deal with possibly inconsistent information caused by players joining and leaving. Finally, we evaluate our design with simulated experiments. Numerical results verify that the system does converge to the globally optimal channel assignment with the proposed payment formula, and that the system throughput is significantly higher than that achievable with the random-based and NE-based channel assignment schemes.

[1] I. Katzela and M. Naghshineh, "Channel Assignment Schemes for Cellular Mobile Telecommunications: A Comprehensive Survey," IEEE Personal Comm., vol. 3, no. 3, pp. 10-31, June 1996.
[2] A. Mishra, S. Banerjee, and W. Arbaugh, "Weighted Coloring Based Channel Assignment for WLANs," Mobile Computer Comm. Rev. (MC2R), vol. 9, no. 3, pp. 19-31, 2005.
[3] A. Mishra, V. Brik, S. Banerjee, A. Srinivasan, and W. Arbaugh, "A Client-Driven Approach for Channel Management in Wireless LAN," Proc. IEEE INFOCOM, 2006.
[4] M. Alicherry, R. Bhatia, and L. Li, "Joint Channel Assignment and Routing for Throughput Optimization in Multi-Radio Wireless Mesh Networks," Proc. ACM MobiCom, Aug./Sept. 2005.
[5] A. Raniwala, K. Gopalan, and T. cker Chiueh, "Centralized Channel Assignment and Routing Algorithms for Multi-Channel Wireless Mesh Networks," ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 8, pp. 50-65, 2004.
[6] M. Kodialam and T. Nandagopal, "Characterizing the Capacity Region in Multi-Radio Multi-Channel Wireless Mesh Networks," Proc. ACM MobiCom, 2005.
[7] B. Raman, "Channel Allocation in 802.11-Based Mesh Networks," Proc. IEEE INFOCOM, Apr. 2006.
[8] P. Kyasanur and N. Vidya, "A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver," Proc. Int'l Conf. Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE '05), Aug. 2005.
[9] Y.T. Hou, Y. Shi, and H.D. Sherali, "Optimal Spectrum Sharing for Multi-Hop Software Defined Radio Networks," Proc. IEEE INFOCOM, 2007.
[10] M. Raya, J.-P. Hubaux, and I. Aad, "DOMINO: A System to Detect Greedy Behavior in IEEE 802.11 Hotspots," Proc. ACM MobiSys, 2004.
[11] M. Félegyházi, M. Čagalj, S.S. Bidokhti, and J.-P. Hubaux, "Non-Cooperative Multi-Radio Channel Allocation in Wireless Networks," Proc. IEEE INFOCOM, May 2007.
[12] M. Félegyházi, "Non-Cooperative Behavior in Wireless Networks," PhD dissertation, École Polytechnique Fédérale de Lausanne, Apr. 2007.
[13] M.M. Halldórsson, J.Y. Halpern, L.E. Li, and V.S. Mirrokni, "On Spectrum Sharing Games," Proc. ACM Symp. Principles of Distributed Computing (PODC '04), 2004.
[14] A.B. MacKenzie and S.B. Wicker, "Stability of Multipacket Slotted Aloha with Selfish Users and Perfect Information," Proc. IEEE INFOCOM, Mar. 2003.
[15] M. Čagalj, S. Ganeriwal, I. Aad, and J.-P. Hubaux, "On Selfish Behavior in CSMA/CA Networks," Proc. IEEE INFOCOM, 2005.
[16] J. Konorski, "Multiple Access in Ad-Hoc Wireless Lans with Noncooperative Stations," Proc. Conf. Networking, 2002.
[17] N. Nie and C. Comaniciu, "Adaptive Channel Allocation Spectrum Etiquette for Cognitive Radio Networks," Proc. IEEE DySPAN '05, Nov. 2005.
[18] L. Anderegg and S. Eidenbenz, "Ad Hoc-Vcg: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Seltsh Agents," Proc. ACM MobiCom, June 2003.
[19] V. Srinivasan, P. Nuggehalli, C.-F. Chiasserini, and R. Rao, "Cooperation in Wireless Ad Hoc Wireless Networks," Proc. IEEE INFOCOM, Mar. 2003.
[20] W. Wang, X.Y. Li, and Y. Wang, "Truthful Multicast in Selfish Wireless Networks," Proc. ACM MobiCom, Sept. 2004.
[21] S. Zhong, L. Li, Y.G. Liu, and Y.R. Yang, "On Designing Incentive-Compatible Routing and Forwarding Protocols in Wireless Ad-Hoc Networks," Proc. ACM MobiCom, Aug. 2005.
[22] S. Zhong, J. Chen, and Y.R. Yang, "Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks," Proc. IEEE INFOCOM, Mar. 2003.
[23] W. Wang, S. Eidenbenz, Y. Wang, and X.Y. Li, "Ours: Optimal Unicast Routing Systems in Non-Cooperative Wireless Networks," Proc. ACM MobiCom, Sept. 2006.
[24] N. Salem, L. Buttyan, J. Hubaux, and M. Jakobsson, "A Charging and Rewarding Scheme for Packet Forwarding in Multi-Hop Cellular Networks," Proc. ACM MobiHoc, citeseer.ist.psu.edusalem03charging.html , June 2003.
[25] S. Eidenbenz, G. Resta, and P. Santi, "Commit: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes," Proc. IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '05), Apr. 2005.
[26] S. Zhong and F. Wu, "On Designing Collusion-Resistant Routing Schemes for Non-Cooperative Wireless Ad Hoc Networks," Proc. ACM MobiCom, Sept. 2007.
[27] IEEE 802.11a Working Group, "Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications— Amendment 1: High-Speed Physical Layer in the 5 GHz Band," 1999.
[28] M.J. Osborne and A. Rubenstein, A Course in Game Theory. The MIT Press, 1994.
[29] J. So and N.H. Vaidya, "Multi-Channel Mac for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using a Single Transceiver," Proc. ACM MobiHoc, 2004.
[30] A. Adya, P. Bahl, J. Padhye, A. Wolman, and L. Zhou, "A Multi-Radio Unification Protocol for IEEE 802.11 Wireless Networks," Proc. Int'l Conf. Broadband Networks (BROADNETS '04), 2004.
[31] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms: Section 26.3: Maximum Bipartite Matching, second ed., pp. 664-669. MIT Press and McGraw-Hill, 2001.
[32] S. Kandul, K.C.-J. Lin, T. Badirkhanli, and D. Katabi, "Fatvap: Aggregating AP Backhaul Capacity to Maximize Throughput," Proc. USENIX NSDI '08, Apr. 2008.
[33] G. Bianchi, "Performance Analysis of the IEEE 802.11 Distributed Coordination Function," IEEE J. Selected Areas Comm., vol. 18, no. 3, pp. 535-547, Mar. 2000.

Index Terms:
Communication/networking, algorithm design, economics, security.
Citation:
Fan Wu, Sheng Zhong, Chunming Qiao, "Strong-Incentive, High-Throughput Channel Assignment for Noncooperative Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 12, pp. 1808-1821, Dec. 2010, doi:10.1109/TPDS.2010.71
Usage of this product signifies your acceptance of the Terms of Use.