Amazing technological breakthrough possible @S-Logix pro@slogix.in

Office Address

  • #5, First Floor, 4th Street Dr. Subbarayan Nagar Kodambakkam, Chennai-600 024 Landmark : Samiyar Madam
  • pro@slogix.in
  • +91- 81240 01111

Social List

A Routing Model Based on Multiple-User Requirements and the Optimal Solution - 2020

A Routing Model Based on Multiple-User Requirements and the Optimal Solution

Research Area:  Wireless Sensor Networks

Abstract:

To promote the development of high-bandwidth IP networks of nongeostationary Earth orbit (NGEO) satellites, this article designs a new benefit measurement model. Moreover, we propose the class-A QoS benefit criterion (QABC), which is established based on a mathematical model involving the remaining queue length and QoS. The benefit model includes three maximum and minimum conflict subgoals and is designed to avoid the problem that the ant colony algorithm easily falls to local optima. This new model is solved with the wolf colony algorithm, which provides both next-hop selection and bottleneck bandwidth reservation mechanisms. Additionally, many burst flows can occur in satellite networks, and they lead to a slow convergence speed and unnecessary overhead. In this article, the Kalman filter algorithm is used to address these issues. Considering the long-term correlation of satellite traffic, it is feasible to smooth the queue length with a Kalman filter. Finally, the Kalman filter wolf colony algorithm (KFWCA) can solve the conflict problem in the new benefit measurement model. The algorithm is applied in the network simulator NS2.35, and the results verify the effectiveness of load balancing and QoS maximization in a satellite network. The results indicate that the KFWCA yields better performance than other algorithms based on traffic allocation, the average delay, the packet loss rate and other factors, especially under high-traffic conditions.

Keywords:  

Author(s) Name:  Sheng Liu; Di Wu; Lanyong Zhang

Journal name:  IEEE Access

Conferrence name:  

Publisher name:  IEEE

DOI:  10.1109/ACCESS.2020.3014260

Volume Information: