Several IP-based routing algorithms have been developed for low-Earth orbit (LEO) satellite networks in recent years. The performance of the satellite IP networks can be improved drastically if multiple satellite constellations are used in the architecture. A multilayered satellite IP network is introduced that consists of LEO, medium-Earth orbit (MEO) and geostationary Earth orbit (GEO) satellites. A new multilayered satellite routing (MLSR) algorithm is developed that calculates routing tables efficiently using the collected delay measurements. The performance of the multilayered satellite network and MLSR is evaluated through simulations and analysis.

Satellite networks provide global coverage and support a wide range of services. Since low Earth orbit (LEO) satellites provide short round-trip delays, they are becoming increasingly important for real-time applications such as voice and video traffic. Many applications require a mechanism to deliver information to multiple recipients. A multicast routing algorithm for datagram traffic is introduced for LEO satellite IP networks. The new scheme creates multicast trees by using the datagram routing algorithm. The bandwidth utilization and delay characteristics are assessed through simulations.

To accomplish network layer integration of terrestrial and satellite IP networks, special exterior gateway protocols are needed. In this work, a new exterior gateway protocol called Border Gateway Protocol-Satellite version (BGP-S) is introduced that enables automated discovery of paths that go through the satellite network. This protocol is designed to work in only one terrestrial gateway in every autonomous system and enables the forwarding of discovered paths in the Internet using the BGP-4 protocol.

Satellite networks provide global coverage and support a wide range of services, low Earth orbit (LEO) satellites provide short round-trip delays and are becoming increasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. In this work, a datagram routing algorithm for LEO satellite networks is introduced. The algorithm generates minimum propagation delay paths. The performance of the algorithm is evaluated through simulations. The robustness issues of the algorithm are also discussed.

The geographical connection admission control (GCAC) algorithm is introduced for low Earth orbit (LEO) satellite networks. The GCAC scheme estimates the future handover blocking probability of a new call attempt based on the user location database, in order to decrease the handover blocking. By simulation, it is shown that the proposed GCAC scheme guarantees the handover blocking probability to a predefined target level. Since GCAC algorithm utilizes the user location information, performance evaluation shows that this technique also guarantees the target level of handover blocking probability in the nonuniform traffic pattern.

Satellite networks provide global coverage and support a wide range of services. Low-Earth-orbit (LEO) satellites provide short round-trip delays and are becoming increasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. In this work, a datagram routing algorithm for LEO satellite networks is introduced. The algorithm generates minimum propagation delay paths. The performance of the algorithm is evaluated through simulations and finally robustness issues are discussed.

Next-generation wireless communication is based on a global system of fixed and wireless mobile services that are transportable across different network backbones, network service providers, and network geographical boundaries. One of the most important problems for global wireless service is handoff management. In this paper, a new handoff technique is introduced which supports mobility between dissimilar networks. First, the system architecture is described, based on the concept of a boundary cell region between networks. Then a new inter-system handoff protocol is presented that uses boundary cells that allow the mobile terminal to roam into a different network. The performance of the protocol is analyzed in terms of the additional inter-system handoff signaling time and the minimum boundary cell area threshold for a successful transition within the prescribed time constraints.