An adaptive transmission control algorithm based on TCP （TCP-ATCA） is proposed to reduce the effects of long propagation delay and high link error rate of the satellite network on the performances. The flow control and the error recovery are differentiated by combined dynamic random early detection-explicit congestion notification （DRED-ECN） algorithm, and, moreover, the pertaining congestion control methods are used in TCP-ATCA to improve the throughput. By introducing the entire recovery algorithm, the unnecessary congestion window decrease is reduced, and the throughput and fairness are improved. Simulation results show that, compared with TCP-Reno, TCP-ATCA provides a better throughput performance when the link capacity is higher （ ≥600 packet/s）, and roughly the same when it is lower. At the same time, TCP-ATCA also increases fairness and reduces transmission delay.
Since mobile networks are not currently deployed on a large scale, research in this area is mostly by simulation. Among other simulation parameters, the mobility model plays a very important role in determining the protocol performance in MANET. Based on random direction mobility model, a high dynamic adaptive mobility network model is proposed in the paper. The algorithms and modeling are mainly studied and explained in detail. The technique keystone is that normal distribution is combined with uniform distribution and inertial feedback control is combined with kinematics, through the adaptive control on nodes speed and prediction tracking on nodes routes, an adaptive model is designed, which can be used in simulations to produce realistic and dynamic network scenarios. It is the adaptability that nodes mobile parameters can be adjusted randomly in threedimensional space. As a whole, colony mobility can show some rules. Such random movement processes as varied speed and dwells are simulated realistically. Such problems as sharp turns and urgent stops are smoothed well. The model can be adapted to not only common dynamic scenarios, but also high dynamic scenarios. Finally, the mobility model performance is analyzed and validated based on random dynamic scenarios simulations.
In digital video broadcasting and return channel via satellite (DVB-RCS) systems, the time slot location assigned to a given traffic in multiple frequency-time division multiple access (MF-TDMA) frame has significant effects upon the traffic delay per- formance. This article proposes models to analyze the relationships among frame length, bandwidth assignment (assigned time slot count), time slot location in frame, and traffic delay performance for traffics of constant bit rate (CBR) and variable bit rate (...
A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.
