To converge more quickly and effectively—Mean field annealing based optimal path selection in WMN
Introduction
In the last few years, many research works have focused on multi-hop ad hoc networks, in which relaying nodes are in general mobile, and communication needs are primarily between nodes within the same network. However, this type of network does not yet have an impact on our way of using wireless networks. Indeed, wireless mesh network (WMN) [5], [15], a new broadband Internet access technology, which is an alias of wireless ad hoc network in the industry, is drawing significant attention these days and has been focused on by an increasing number of multi-hop wireless deployments and proprietary commercial solutions. Different from ad hoc network, WMN introduces a hierarchy in the network architecture with the implementation of dedicated nodes communicating among each other and providing wireless transport services to data traveling from users to either other users or access points (access points are special wireless routers with a high-bandwidth wired connection with the Internet backbone). In this class of networks, rather than involving pairs of terminal nodes, mostly involve communication to and from wired gateways. Numerous challenges must be overcome to realize the practical benefits of wireless mesh networking. These include high network capacity, service of differentiation support, and secure and reliable communication, and, of principal interest here, quality of service (QoS) routing issues are critical topics for WMNs. Cost-effective resolution to these issues at appropriate levels is essential for widespread general use of wireless mesh networking.
Now most QoS-sensitive applications that attract interest for use in current wired networks would attract interest for wireless mesh networks as well, therefore, providing QoS guarantees is a critical issue for wireless mesh networks and needs to be overcome to realize the practical benefits of wireless mesh networking.
More than one QoS constraint (with or without optimization) often makes the QoS routing (QoSR) problem NP-hard [14]. On one hand, due to the scarce resources and the characters of wireless communication environment, most of the current research on QoS routing in multi-hop ad hoc networks only focus on one single metric, such as delay or hop-count, and deal with the best-effort data traffic [12], [19], only few literatures take the multi-constrained QoS routing into consideration (see Section 2); on the other hand, in wired networks QoS routing has attracted much attention from both academia and industry and representative protocols such as MPLS [8], TRIP [26] and other several schemes (see Section 2) has been provided. However, these complicated protocols either have analyses in specific network models or cannot suit for WMNs with dynamically changing network topology well. Thus, the research on the multi-constrained QoSR in emerging wireless mesh networking is still insufficient.
In this paper, we propose a novel routing scheme based on MFA for multi-constrained routing in WMNs. Specifically, the main contributions of this paper are as follows.
- (1)
We first map the multi-constrained QoSR problem in wireless mesh networks onto the mean field network (MFN).
- (2)
Then a novel mean field annealing based multi-constrained routing algorithm named MFA_RA is proposed. In the proposed algorithm, we utilize a set of deterministic equations to replace the stochastic process in SA to let the annealing be more efficient.
- (3)
We demonstrate the performance of MFA_RA through extensive experiments. Experimental results verify that MFA_RA can find the comparable solutions more quickly than related schemes, and it is a promising multi-constraints QoS routing algorithm with optimization for wireless mesh networks.
The remainder of this paper is organized as follows. In Section 2, related work is discussed in detail. In Section 3, we give the description of the problem and the proposed algorithm. Performance evaluation for the related algorithm is presented in Section 4. Finally, we conclude this paper in Section 5 with a summary and discussion of future work.
Section snippets
Related work
There have been extensive studies on the QoS routing problem in wired or wireless networks [10], [12], [17], [19], [27], [29], [30]. With the bursting of real-time services, such as online multimedia conference and online video game in networks, multi-constrained QoS routing is playing an more and more important role in providing QoS guarantee for service flows with multiple QoS parameters, whose function is to find a feasible path that satisfies multiple constraints. Due to the NP hardness of
Pertinent information
Definition A graph, G = (V, Γ) is used to describe a wireless mesh network with a finite non-empty node set V and a link set Γ. Each member in the link set Γ has two endpoints that can communicate with each other directly. In QoSR with optimization, each link (i, j) ∈ Γ is associated with a primary cost parameter c(i, j) and an m-dimension additive QoS parameters vector w(i, j) = (w1(i, j), w2(i, j), … , wl(i, j), … , wm(i, j)), which is also called QoS metric w(e). Here all parameters are non-negative. Given m-dimension
Performance evaluation
We have carried out many simulations in different scenarios. Wireless mesh networks with different number nodes (routes) (i.e., 10 (36), 20 (725), 30 (11375)) are considered. The performance achieved by MFA_RA is compared to the scheme based on SA proposed in [20] because it shows SA based scheme outperformed other pertinent algorithms there. Moreover, we also compare MFA_RA with other two effective popular techniques, particle swarm optimization (PSO) [25] based scheme and ant colony
Conclusion
Searching for the optimal route that can satisfy more than one QoS parameter simultaneously in wireless mesh networks is an NP-hard combinatorial optimization problem. In this paper, a novel multi-constrained routing scheme named MFA_RA using mean field annealing is proposed. Mean field annealing, which adopts the saddle point approximation, uses a set of deterministic equations to replace the stochastic process in SA. Extensive simulation results show it can converge more quickly and escape
Acknowledgements
This work is supported partially by the national Natural Science Foundation of China (NSFC) under Grant No. 61002016, Zhejiang Provincial Natural Science Foundation of China under Grant No. LY13F010016, Qianjiang Talent Project of Zhejiang Province under Grant No. QJD1302014. The authors would like to thank the anonymous reviewers and Professor Witold Pedrycz for their helpful comments.
Lianggui Liu, Ph.D. He got the Ph.D degree in communications engineering from Nanjing University of Posts & Telecommunications, Nanjing, China, in 2007. He is now an associate professor with the School of Information Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China. He has published more than 30 research papers on communications networks in various prestigious international journals or academic conferences. Professor Liu’s research works focus on wireless mesh
References (33)
- et al.
A randomized algorithm for finding a path subject to multiple QoS requirements
Comput. Networks
(2001) - et al.
INSIGNIA: an IP-based quality of service framework for mobile ad hoc networks
J. Parallel Distrib. Comput.
(2000) - et al.
A genetic algorithm for finding a path subject to two constraints
Appl. Soft Comput.
(2013) - et al.
Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing
(1988) - et al.
Supporting service differentiation for real-time and best-effort traffic in stateless wireless ad hoc networks (SWAN)
IEEE Trans. Mobile Comput.
(2002) - H. Alwan, A. Agarwal, Multi-objective QoS routing for wireless sensor networks, in: H. Nguyen (Ed.), Proc. 2013...
- L. Barolli, A. Koyama, N. Shiratori, A QoS routing method for ad-hoc networks based on genetic algorithm, in: Z....
- et al.
Mesh networks: commodity multihop ad hoc networks
IEEE Commun. Mag.
(2005) - S. Chen, Routing support for providing guaranteed end-to-end quality-of-service [Ph. D. Thesis], in: Engineering...
- et al.
Distributed quality-of-service routing in ad hoc networks
IEEE J. Sel. Areas Commun.
(1999)
MPLS: Technology and Applications
Ant Colony Optimization
A survey on energy-efficient routing techniques with QoS assurances for wireless multimedia sensor networks
IEEE Commun. Surv. Tutorials
A fast hybrid ε-approximation algorithm for computing constrained shortest paths
IEEE Commun. Lett.
A survey of QoS routing solutions for mobile ad hoc networks
IEEE Commun. Surv. Tutorials
Neural networks and physical systems with emergent collective computational abilities
Proc. Natl. Acad. Sci.
Cited by (9)
High-performance global peak tracking technique for PV arrays subject to rapidly changing PSC
2022, Chaos, Solitons and FractalsCitation Excerpt :In our experiments, QAGPTT, EPSO, and DEPSO are practiced on the software platform Matlab 7.0 and run on a computer, the configurations of which include a three GHz Intel processor, three GB of random-access memory, and operation system (Windows 7). We perform Green's Function Monte Carlo operation that has been proven to be effective in [46] when the temperature is initialized as a fixed T. Also, while performing quantum annealing, we use the “plus-minus” method [47] to obtain the feasible neighbors. We obtain the normalized accuracy of the final configuration and total execution time of QAGPTT, EPSO, and DEPSO based on twenty-five independent techniques implementations.
Deployment optimization of multi-hop wireless networks based on substitution graph
2017, Information SciencesCitation Excerpt :Several GA based algorithms, such as GA based on an integer linear programming model [22], a hybrid grouping GA [25], a GA based on Monte Carlo mode [29], and a variable-length GA [3] were proposed respectively. Other intelligent optimization methods have also been applied to the node optimization problem of wireless networks, such as AIA [1], ACO [20,26], ABC [8], SA [15], EC [12], and TS [28] etc. In general, properly designed intelligent algorithm can perform much better than the heuristic algorithm, and the design of intelligent algorithms is determined by the problem size and initial parameters.
Optimal control model for the transmission of novel COVID-19
2021, Computers, Materials and ContinuaDesign and development of unmanned surface vehicle for meteorological monitoring
2020, Intelligent Automation and Soft Computing
Lianggui Liu, Ph.D. He got the Ph.D degree in communications engineering from Nanjing University of Posts & Telecommunications, Nanjing, China, in 2007. He is now an associate professor with the School of Information Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China. He has published more than 30 research papers on communications networks in various prestigious international journals or academic conferences. Professor Liu’s research works focus on wireless mesh networks, opportunistic networks, mobile ad hoc networks, network security and natural computation.
Yuxu Peng, Ph.D. He is now with School of Computer & Communications Engineering, Changsha University of Science & Technology, Changsha 410076, China. His research interest lies in mobile ad hoc networks, wireless mesh networks.
Weiqiang Xu, Ph.D. He got the Ph.D degree in communications engineering from Zhejiang University, Hangzhou, China, in 2006. He is now an associate professor with the School of Information Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China. His research interest includes wireless sensor networks, mobile ad hoc networks.