Skip to main content
SpringerLink
Log in

AMPLE: A Novel Incentive Approach to Adaptive-Width Channel Allocation in Multi-hop, Non-cooperative Wireless Networks

  • Conference paper
Wireless Algorithms, Systems, and Applications (WASA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7405))

  • 1592 Accesses

Abstract

Due to the limitation of radio spectrum resource and fast deployment of wireless devices, careful channel allocation is of great importance for mitigating the performance degradation caused by interference among different users in wireless networks. Most of existing work focused on fixed-width channel allocation. However, latest researches have demonstrated that it is possible to combine contiguous channels for better utilizing the available channels. In this paper, we study the problem of adaptive-width channel allocation in multi-hop, non-cooperative wireless networks from a game-theoretic point of view. We first present a strategic game model for this problem and demonstrate the existence of Nash Equilibrium (NE) in an anarchical scenario. Since a NE is not an ideal solution, we then propose AMPLE, a novel incentive approach to guarantee the system performance at high level. Since the problem of channel allocation in multiple collision domains is NP-complete, we first present an approximate algorithm that gives an allocation with good system performance. We then design a charging scheme that guarantees the system to converge to a Dominant Strategy Equilibrium (DSE), in which it is to the best interest of each node to follow the computed channel allocation, regardless how the others behave. Numerical results verify that AMPLE does prevent nodes’ misbehavior, and achieves much higher average system throughputs than anarchical NEs.

This work was supported in part by China NSF grant 61170236 and 61133006. The opinions, findings, conclusions, and recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the funding agencies or the government.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Second rep. and order and memorandum opinion and order, http://hraunfoss.fcc.gov/edocs_public/attachmatch/FCC-08-260A1.pdf

  2. Anderegg, L., Eidenbenz, S.: Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In: Proceedings of the Ninth International Conference on Mobile Computing and Networking (MobiCom), San Diego, CA (September 2003)

    Google Scholar 

  3. Ben Salem, N., Buttyan, L., Hubaux, J.P., Jakobsson, M.: A charging and rewarding scheme for packet forwarding in multi-hop cellular networks. In: Proceedings of the Fourth ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Annapolis, MD (June 2003)

    Google Scholar 

  4. Bianchi, G.: Performance analysis of the IEEE 802.11 distributed coordination function. IEEE Journal on Selected Areas in Communications 18(3), 535–547 (2000)

    Article  Google Scholar 

  5. Čagalj, M., Ganeriwal, S., Aad, I., Hubaux, J.-P.: On selfish behavior in CSMA/CA networks. In: Proceedings of 24th Annual IEEE Conference on Computer Communications (INFOCOM), Miami, FL (April 2005)

    Google Scholar 

  6. Chandra, R., Mahajan, R., Moscibroda, T., Raghavendra, R., Bahl, P.: A case for adapting channel width in wireless networks. In: Proceedings of ACM SIGCOMM 2008 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Seattle, USA (August 2008)

    Google Scholar 

  7. Deek, L.B., Zhou, X., Almeroth, K.C., Zheng, H.: To preempt or not: Tackling bid and time-based cheating in online spectrum auctions. In: INFOCOM, pp. 2219–2227 (2011)

    Google Scholar 

  8. Eidenbenz, S., Resta, G., Santi, P.: Commit: A sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes. In: Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS), Denver, CO (April 2005)

    Google Scholar 

  9. Félegyházi, M., Čagalj, M., Bidokhti, S.S., Hubaux, J.-P.: Non-cooperative multi-radio channel allocation in wireless networks. In: Proceedings of 26th Annual IEEE Conference on Computer Communications (INFOCOM), Anchorage, AK (May 2007)

    Google Scholar 

  10. Fudenberg, D., Tirole, J.: Game Theory. MIT Press (1991)

    Google Scholar 

  11. Gummadi, R., Balakrishnan, H.: Wireless networks should spread spectrum based on demands. In: Proceedings of ACM Hotnets, Calgary, Canada (October 2008)

    Google Scholar 

  12. Halldórsson, M.M., Halpern, J.Y., Li, L.E., Mirrokni, V.S.: On spectrum sharing games. In: Proceedings of the 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), St. John’s, Canada (July 2004)

    Google Scholar 

  13. Konorski, J.: Multiple Access in Ad-Hoc Wireless LANs with Noncooperative Stations. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds.) NETWORKING 2002. LNCS, vol. 2345, pp. 1141–1146. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. MacKenzie, A.B., Wicker, S.B.: Stability of multipacket slotted Aloha with selfish users and perfect information

    Google Scholar 

  15. Moscibroda, T., Chandra, R., Wu, Y., Sengupta, S., Bahl, P., Yuan, Y.: Load-aware spectrum distribution in wireless lans. In: Proceedings of the 16th International Conference on Network Protocols (ICNP) (October 2008)

    Google Scholar 

  16. Nie, N., Comaniciu, C.: Adaptive channel allocation spectrum etiquette for cognitive radio networks. In: Proceedings of the First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN), Baltimore Harbor, MD (November 2005)

    Google Scholar 

  17. Osborne, M.J., Rubenstein, A.: A Course in Game Theory. MIT Press (1994)

    Google Scholar 

  18. Rahul, H., Edalat, F., Sodini, D.K.C.: Frequency-aware rate adaptation and mac protocols. In: Proceedings of The Fourteenth International Conference on Mobile Computing and Networking (MobiCom), San Francisco, CA (September 2009)

    Google Scholar 

  19. Srinivasan, V., Nuggehalli, P., Chiasserini, C.-F., Rao, R.: Cooperation in wireless ad hoc networks

    Google Scholar 

  20. Wang, W., Eidenbez, S., Wang, Y., Li, X.-Y.: Ours–optimal unicast routing systems in non-cooperative wireless networks. In: Proceedings of The Twelfth International Conference on Mobile Computing and Networking (MobiCom), Los Angeles (September 2006)

    Google Scholar 

  21. Wang, W., Li, X.-Y., Wang, Y.: Truthful multicast in selfish wireless networks. In: Proceedings of the Tenth International Conference on Mobile Computing and Networking (MobiCom), Philadelphia, PA (September 2004)

    Google Scholar 

  22. Wu, F., Singh, N., Vaidya, N., Chen, G.: On adaptive-width channel allocation in non-cooperative, multi-radio wireless networks. In: Proceedings of 30th Annual IEEE Conference on Computer Communications (INFOCOM), Shanghai, China (April 2011)

    Google Scholar 

  23. Wu, F., Vaidya, N.: Small: A strategy-proof mechanism for radio spectrum allocation. University of Illinois at Urbana-Champaign, Tech. Rep. (2010)

    Google Scholar 

  24. Wu, F., Zhong, S., Qiao, C.: Globally optimal channel assignment for non-cooperative wireless networks. In: Proceedings of 27th Annual IEEE Conference on Computer Communications (INFOCOM), Phoenix, AZ (April 2008)

    Google Scholar 

  25. Xu, P., Xu, X., Tang, S., Li, X.-Y.: Truthful online spectrum allocation and auction in multi-channel wireless networks. In: INFOCOM, pp. 26–30 (2011)

    Google Scholar 

  26. Zhong, S., Li, L.E., Liu, Y.G., Yang, Y.R.: On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks–an integrated approach using game theoretical and cryptographic techniques. In: Proceedings of The Eleventh International Conference on Mobile Computing and Networking (MobiCom), Cologne, Germany (September 2005)

    Google Scholar 

  27. Zhong, S., Chen, J., Yang, Y.R.: Sprite, a simple, cheat-proof, credit-based system for mobile ad-hoc networks

    Google Scholar 

  28. Zhong, S., Wu, F.: On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks. In: Proceedings of The Thirteenth International Conference on Mobile Computing and Networking (MobiCom), Montreal, Canada (September 2007)

    Google Scholar 

  29. Zhou, X., Gandhi, S., Suri, S., Zheng, H.: ebay in the sky: Strategy-proof wireless spectrum auctions. In: Proceedings of The Fourteenth International Conference on Mobile Computing and Networking (MobiCom), San Francisco, CA (September 2008)

    Google Scholar 

  30. Zhou, X., Zheng, H.: Trust: A general framework for truthful double spectrum auctions. In: Proceedings of 28th Annual IEEE Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brazil (April 2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University, China

    Chunyang Wu, Fan Wu & Guihai Chen

  2. Department of Computer Science, University of Massachusetts Boston, USA

    Bo Sheng

Authors
  1. Chunyang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fan Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guihai Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bo Sheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electronic Engineering, Shanghai Jiao Tong University, 800 Dongchuan Rd., Minhang District, 200240, Hanghai, China

    Xinbing Wang

  2. Department of Computer Science, University of Houston, 4800 Calhoun Rd., 565 Philip G. Hoffman Hall, 77204-3010, Houston, TX, USA

    Rong Zheng

  3. School of Electronics and Information Engineering, Beijing JiaoTong University, 3 Shangyuan Village, Haidian District, 100044, Beijing, China

    Tao Jing

  4. School of Computer Science and Technology, University of Science and Technology of china, USTC West Campus, P.O. Box 4, 230027, Hefei, Anhui, China

    Kai Xing

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, C., Wu, F., Chen, G., Sheng, B. (2012). AMPLE: A Novel Incentive Approach to Adaptive-Width Channel Allocation in Multi-hop, Non-cooperative Wireless Networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31869-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31868-9

  • Online ISBN: 978-3-642-31869-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation