Skip to main content
SpringerLink
Log in

Application of Asynchronous Weak Commitment Search in Self Organized Cognitive Radio Networks

  • Published:
International Journal of Wireless Information Networks Aims and scope Submit manuscript

Abstract

This article presents a distributed solution to autonomous quality of service provision. This method paves the way for decentralized and autonomous quality of service (QoS) provision in capillary networks that reach end nodes at Internet of Things, when, due to any reason, central management is either unavailable or not efficient. As case studies, cognitive spatial reuse time division access and code division multiple access communication networks are investigated. Based on asynchronous weak commitment search the task of QoS provision is distributed among different network nodes. This application of artificial intelligence in wireless and mobile communications can be used in home automation and networking, and vehicular technology. Extensions of this approach can be used in self organizing networks, specifically for machine to machine communications.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara, “The distributed constraint satisfaction problem: formalization and algorithms,” IEEE Transactions on Knowledge and Data Engineering, vol. 10, pp. 673–685, September–October 1998.

  2. M. Yokoo, Distributed constraint satisfaction: foundations of cooperation in multi-agent systems. Springer series on agent technology, Berlin, New York: Springer, 2000.

    Google Scholar 

  3. J. R. Marden and A. Wierman, “Overcoming limitations of game-theoretic distributed control,” IEEE transactions on automatic control, vol. 58, pp. 1402–1415, June 2013.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. Phunchongharn and E. Hossain, “Distributed robust scheduling and power control for cognitive spatial-reuse TDMA networks,” IEEE Journal on Selected Areas in Communications, vol. 30, pp. 1934–1946, 2012.

    Article  Google Scholar 

  5. A. Bayesteh, H. Nikopour, M. Taherzadeh, H. Baligh, and J. Ma, “Low complexity techniques for SCMA detection,” in 2015 GLOBECOM Workshops, pp. 1–6, 2015.

  6. D. I. Kim, L. B. Le, and E. Hossain, “Joint rate and power allocation for cognitive radios in dynamic spectrum access environment,” IEEE Transactions on Wireless Communications, vol. 7, pp. 5517–5527, December 2008.

    Article  Google Scholar 

  7. L.-C. Wang and A. Chen, “On the coexistence of infrastructure-based and ad hoc connections for a cognitive radio system,” in 1st International Conference on Cognitive Radio Oriented Wireless Networks and Communications (CrownCom), pp. 1–5, June 2006.

  8. F. P. Kelly, A. Maulloo, and D. Tan, “Rate control for communication networks: shadowing prices, proportional fairness, and stability,” Journal of Operations Research, vol. 49, pp. 237–252, March 1998.

    Article  MATH  Google Scholar 

  9. I. Muscalagiu, J. M. Vidal, V. Cretu, P. H. Emil, and M. Panoiu, “The effects of agent synchronization in asynchronous search algorithms,” in Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications, pp. 1–5, May–June 2007.

  10. K. Hirayama and H. Yokoo, “The effect of nogood learning in distributed constraint satisfaction,” in Proceedings of the 20th IEEE International Conference on Distributed Computing Systems, pp. 169–177, 2000.

  11. M. Yokoo, “Algorithms for distributed constraint satisfaction problems: A review,” Autonomous Agents and Multi-Agent Systems, no. 3, pp. 198–212, 2000.

    Article  Google Scholar 

  12. A. Meisels, Distributed Search by Constrained Agents, Algorithms, Performance, Communication. London: Springer, 2008.

    MATH  Google Scholar 

  13. M. Silaghi and B. Faltings, “Asynchronous aggregation and consistency in distributed constraint satisfaction,” Artificial Intelligence, vol. 161, pp. 25–54, January 2005.

    Article  MATH  MathSciNet  Google Scholar 

  14. C. Fernandez, R. Bejar, B. Krishnamachari, and C. Gomes, “Communication and computation in discsp algorithms,” in International Conference on Principles and Practice of Constraint Programming, 2002.

Download references

Author information

Authors and Affiliations

  1. California State University Long Beach, Long Beach, CA, USA

    Shabnam Sodagari

Authors
  1. Shabnam Sodagari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shabnam Sodagari.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sodagari, S. Application of Asynchronous Weak Commitment Search in Self Organized Cognitive Radio Networks. Int J Wireless Inf Networks 24, 404–412 (2017). https://doi.org/10.1007/s10776-017-0347-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10776-017-0347-2

Keywords

Search

Navigation