A Delay Constraint Minimum Cost Routing Algorithm for Mobile Satellite Networks

Mobile satellite networks can augment terrestrial wireless networks to provide global services to users regardless of their location. However, traffic on inter-satellite links changes with the satellite´s mobility and the communication, especial quality of service (QoS) guarantee, becomes difficultly, since the change may cause violation of QoS requirements of on-going calls. In this paper, by exploiting the predictive nature of the mobile satellite topology, a novel satellite networks delay constraint minimum cost routing (SDCMCR) algorithm, which can obtain a path to satisfy the delay constraint as well as the minimization of influence caused by the handover, is proposed. This algorithm gives attention to the network performances both of service interrupting and blocking. Moreover it has a low computing complexity. Correlative simulation indicates that this novel algorithm is superior to other current algorithm in respect of computing complexity and service blocking probability etc