scholarly journals Channel-Aware Scheduling algorithms with Channel Prediction for reliable multicast data transmission over geostationary satellite networks

Author(s):  
A. Sali ◽  
G. Acar ◽  
B. Evans ◽  
G. Giambene
Author(s):  
Fabrice Hobaya ◽  
Emmanuel Chaput ◽  
Cedric Baudoin ◽  
Patrick Gelard ◽  
Emmanuel Dubois ◽  
...  

2017 ◽  
Vol E100.B (4) ◽  
pp. 627-637 ◽  
Author(s):  
Wei HAN ◽  
Baosheng WANG ◽  
Zhenqian FENG ◽  
Baokang ZHAO ◽  
Wanrong YU ◽  
...  

2017 ◽  
Vol 1 (1) ◽  
pp. 24
Author(s):  
Prawit Chumchu ◽  
Roksana Boreli ◽  
Aruna Seneviratne

In this paper, we design a new scalable reliable multicast transport protocol for satellite networks (RMT). This paper is the extensions of paper in [18]. The proposed protocoldoes not require inspection and/or interception of packets at intermediate nodes. The protocol would not require anymodification of satellites, which could be bent-pipe satellites or onboard processing satellites. The proposed protocol is divided in 2 parts: error control part and congestion control part. In error control part, we intend to solve feedback implosion and improve scalability by using a new hybrid of ARQ (Auto Repeat Request) and adaptive forward error correction (AFEC). The AFEC algorithm adapts proactive redundancy levels following the number of receivers and average packet loss rate. This leads to a number of transmissions and the number of feedback signals are virtually independent of the number of receivers. Therefore, wireless link utilization used by the proposed protocol is virtually independent of the number of multicast receivers. In congestion control part, the proposed protocol employs a new window-based congestion control scheme, which is optimized for satellite networks. To be fair to the other traffics, the congestion control mimics congestion control in the wellknown Transmission Control Protocol (TCP) which relies on “packet conservation” principle. To reduce feedback implosion, only a few receivers, ACKers, are selected to report the receiving status. In addition, in order to avoid “drop-to-zero” problem, we use a new simple wireless loss filter algorithm. This loss filter algorithm significantly reduces the probability of the congestion window size to be unnecessarily reduced because of common wireless losses. Furthermore, to improve achievable throughput, we employ slow start threshold adaptation based on estimated bandwidth. The congestion control also deals with variations in network conditions by dynamically electing ACKers.


2012 ◽  
Vol 433-440 ◽  
pp. 3553-3559 ◽  
Author(s):  
Qing Quan Cui ◽  
Ya Hui Wang ◽  
Dong Wei ◽  
Shao Jun Zhang

Networked Control System is the focus of current research in control field, and the use of a shared network introduces new challenges, therefore, it is significant to research scheduling algorithms for improving the control and schedule performance of NCS. In the paper, according to the challenges existing in scheduling algorithms, a new scheduling algorithm called Switch scheduling is proposed, and the calculation method of switching conditions is also given. In the proposed algorithm, network-induced delay and network utilization are considered to satisfy the different network condition with appropriate scheduling algorithm. The proposed algorithm improves the network utilization and the efficiency of data transmission, and guarantees the system stability. Finally, a simulation example is conducted to validate the feasibility and superiority of the proposed switch scheduling.


Sign in / Sign up

Export Citation Format

Share Document