Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A Load-Aware Matching Game for Node Association in Wireless Ad-Hoc Networks

  • Conference paper
  • First Online:
Applications of Computing and Communication Technologies (ICACCT 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 899))

  • 777 Accesses

Abstract

In this paper, a load aware matching game to achieve stable one-to-one matching of senders and receivers is proposed, when distance between sender and receiver, and busyness level of receivers are taken into account. We have formulated matching game for the network formation where the nodes are capable of load sharing, selfish behaviour of node that maximize their individual utility and agreeing to cooperate in pair. Sender keeps changing one hop receiver that assist in load balancing of the network. Busyness level of receiver is introduced into matching game to initiate competition between the proposing senders. Distance is introduced to instigate competition between the receivers. The proposed matching game theoretic models compared with the state of art load balancing model for ad hoc networks in the terms of lifetime of the network and standard deviation of the load. Simulation results have shown that the proposed LAMG performs better as compared with GLBR in the terms of network lifetime and standard deviation of the load.

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 EPUB and 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

References

  1. Aggelou, G.: Mobile Ad Hoc Networks: From Wireless LANs to 4G Networks. Tata McGraw-Hills, New York (2009)

    Google Scholar 

  2. Chlamtac, I., Conti, M., Liu, J.J.N.: Mobile ad hoc networking: imperatives and challenges. Ad Hoc Netw. 1(1), 13–64 (2003)

    Article  Google Scholar 

  3. Srinivasan, V., Nuggehalli, P., Chiasserini, C.F., Rao, R.R.: Cooperation in Wireless Ad Hoc Networks. In: IEEE INFOCOM 2003, pp. 1–10 (2003)

    Google Scholar 

  4. Srivastava, V., et al.: Using game theory to analyze wireless ad hoc networks. IEEE Commun. Surv. Tutor. Fourth Q. 7(4), 46–56 (2005)

    Article  MathSciNet  Google Scholar 

  5. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Amer. Math. Monthly 69(1), 9–15 (1962)

    Article  MathSciNet  Google Scholar 

  6. Varan, B., Yener, A.: Matching games for ad hoc networks with wireless energy transfer. IEEE Trans. Green Commun. Netw. 1(4), 503–515 (2017)

    Article  Google Scholar 

  7. Jorswieck, E.A.: Stable matchings for resource allocation in wireless networks. In: Proceedings of the 17th International Conference on Digital Signal Processing, pp. 1–8, July 2011

    Google Scholar 

  8. El-Bardan, R,. Saad, W., Brahma, S., Varshney, P.K.: Matching theory for cognitive spectrum allocation in wireless networks. In: Proceedings of the 50th Conference Information Science and Systems, Princeton, NJ, USA, pp. 466–471, March 2016

    Google Scholar 

  9. Namvar, N., Afghah, F.: Spectrum sharing in cooperative cognitive radio networks: a matching game framework. In: Proceedings of the 49th Annual Conference on Information Systems and Sciences, Baltimore, MD, USA, pp. 1–5, March 2015

    Google Scholar 

  10. Hamidouche, K., Saad, W., Debbah, M.: Many-to-many matching games for proactive social-caching in wireless small cell networks. In: Proceedings of the 12th International Symposium on Modelling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), pp. 569–574, May 2014

    Google Scholar 

  11. Semiari, O., Saad, W., Valentin, S., Bennis M., Maham, B.: Matching theory for priority-based cell association in the downlink of wireless small cell networks. In: 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Florence, pp. 444–448 (2014)

    Google Scholar 

  12. Karaoglu, B., Heinzelman, W.: Cooperative load balancing and dynamic channel allocation for cluster-based mobile ad hoc networks. IEEE Trans. Mob. Comput. 14(5), 951–963 (2015)

    Article  Google Scholar 

  13. Tian, H., Jiang, F., Cheng, W.: A game theory based load-balancing routing with cooperation stimulation for wireless ad hoc networks. In: 2009 11th IEEE International Conference on High Performance Computing and Communications, Seoul, pp. 266–272 (2009)

    Google Scholar 

  14. Hasanpour, M., Shariat, S., Barnaghi, P., et al.: Quantum load balancing in ad hoc networks. Quantum Inf. Process. 16, 148 (2017)

    Article  Google Scholar 

  15. El-Hajj, A.M., Dawy, Z., Saad, W.: A stable matching game for joint uplink/downlink resource allocation in OFDMA wireless networks. In: Proceedings of the IEEE International Conference on Communications (ICC), Ottawa, ON, June 2012

    Google Scholar 

  16. Hou, T.C., Li, V.O.: Transmission range control in multihop packet radio networks. IEEE Trans. Commun. 34(1), 38–44 (1986)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India

    Upasana Dohare & D. K. Lobiyal

Authors
  1. Upasana Dohare
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. K. Lobiyal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Upasana Dohare .

Editor information

Editors and Affiliations

  1. Ministry of Skill Development, Delhi, India

    Ganesh Chandra Deka

  2. School of Science and Technology, Nottingham Trent University, Nottingham, UK

    Omprakash Kaiwartya

  3. Department of Computer Science, Shyama Prasad Mukherji College, University of Delhi, Delhi, India

    Pooja Vashisth

  4. Department of Computer Science, North Campus, University of Delhi, Delhi, India

    Priyanka Rathee

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dohare, U., Lobiyal, D.K. (2018). A Load-Aware Matching Game for Node Association in Wireless Ad-Hoc Networks. In: Deka, G., Kaiwartya, O., Vashisth, P., Rathee, P. (eds) Applications of Computing and Communication Technologies. ICACCT 2018. Communications in Computer and Information Science, vol 899. Springer, Singapore. https://doi.org/10.1007/978-981-13-2035-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2035-4_22

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2034-7

  • Online ISBN: 978-981-13-2035-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation