Why Us? >>

  • - Open Access
  • - Peer-reviewed
  • - Rapid publication
  • - Lifetime hosting
  • - Free indexing service
  • - Free promotion service
  • - More citations
  • - Search engine friendly

Free SCIRP Newsletters>>

Add your e-mail address to receive free newsletters from SCIRP.

 

Contact Us >>

WhatsApp  +86 18163351462(WhatsApp)
   
Paper Publishing WeChat
Book Publishing WeChat
(or Email:book@scirp.org)

Article citations

More>>

Majumder, A., Roy, S. and Kumar Dhar, K. (2013) Design and Analysis of an Adaptive Mobility Management Scheme for Handling Internet Traffic in Wireless Mesh Network. Annual International Conference on Emerging Research Areas and 2013 International Conference on Microelectronics, Communications and Renewable Energy (AICERA/ ICMiCR), 1-6.
http://dx.doi.org/10.1109/aicera-icmicr.2013.6575968

has been cited by the following article:

  • TITLE: Joint Routing and Admission Control in Wireless Mesh Network

    AUTHORS: Fawaz A. Khasawneh, Abderrahmane Benmimoune, Michel Kadoch

    KEYWORDS: Wireless Mesh Network, Markov Decision Process, Multi-Homing, Admission Control, Routing

    JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.9 No.8, August 9, 2016

    ABSTRACT: Wireless Mesh Network is a promising technology with many challenges yet to be addressed. Novel and efficient algorithms need to be developed for routing and admission control with the objective to increase the acceptance ratio of new calls without affecting the Quality of Service (QoS) of the existing calls and to maintain the QoS level provided for the mobile calls. In this paper, a novel Markov Decision-based Admission Control and Routing (MDACR) algorithm is proposed. The MDACR algorithm finds a near optimal solution using the value iteration method. To increase the admission rate for both types of calls, a multi-homing admission and routing algorithm for handoff and new calls is proposed. This algorithm associates the user with two different access points which is beneficial in a highly congested network and proposes a new routing metric to assure seamless handoff in the network. Our proposed algorithm outperforms other algorithms in the literature in terms of handoff delay, blocking probability, and number of hard handoff.