Efficient Multipath Routing Scheme for MPTCP-enable Software-Defined Networks

Author(s):  
Khac Tuan Nguyen ◽  
Linh T. Nguyen ◽  
Huu-Tien Vu ◽  
Hai-Chau Le
2016 ◽  
Vol 12 (12) ◽  
pp. 155014771668360
Author(s):  
Zhenhua Yuan ◽  
Chen Chen ◽  
Ye Jin

In this article, we study secure multipath routing with energy efficiency for a wireless sensor network in the presence of eavesdroppers. We consider two objectives: (1) the multipath routing scheme for maximising the energy efficiency with security constraints and (2) the multipath routing scheme for maximising the secrecy capacity. The binary erasure channel model is adopted to describe the wireless channel states among neighbouring nodes. Based on the binary erasure channel model, the problem of multipath routing degrades to a problem of bit allocation for each path. We formulate the problems and find that the problems are both quasi-convex. For the first one, it is a linear fractional optimisation problem. The optimal solution is obtained by the Charnes–Cooper transformation. For the second one, we propose an iterative algorithm to obtain the [Formula: see text]-optimal solution. The performance analysis shows that the probability of the secure bit allocation increases along with the number of multipaths and decreases along with the number of hops per path and eavesdroppers. Simulation results are presented to illustrate the proposed algorithms.


2019 ◽  
Vol 32 (14) ◽  
pp. e4065
Author(s):  
Ying-Dar Lin ◽  
Te-Lung Liu ◽  
Shun-Hsien Wang ◽  
Yuan-Cheng Lai

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Sungwook Kim

Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach. The proposed metaheuristic approach can achieve greater and reciprocal advantages in a hostile dynamic real world network situation. Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem. Simulation results indicate that the proposed paradigm adapts best to the variation of dynamic network situations. The average remaining energy, network throughput, packet loss probability, and traffic load distribution are improved by about 10%, 10%, 5%, and 10%, respectively, more than the existing schemes.


Sign in / Sign up

Export Citation Format

Share Document