The simulation modelling and performance analysis of low earth orbit satellite communication networks for personal communications

This paper extends previous research efforts related to the simulation performance modelling and analysis of satellite communication networks. Specifically, the use of low earth orbit (LEO) satellite networks for personal communications is examined. Six different satellite constellation configurations are investigated in a packet‐switched operating environment. Performance metrics examined are the end‐to‐end packet delay and the utilization of satellite channels in the dynamic environment. Realistic and accurate models of the physical satellite network and its terrestrial transmitters require that numerous operating characteristics and assumptions be specified. These are based on proposed design requirements of commercial systems, such as Iridium. Via the use of simulation, we show the relative delay and utilization performance of differing satellite network architectures. From these simulation models, mathematical metamodels are derived for the system delays. These innovative models are used to predict the delay performance of different network architectures not previously simulated. Comparison of these metamodels with simulation results show that metamodels provide an accurate means for performance prediction. Copyright © 1999 John Wiley & Sons, Ltd.     

Performance modeling and optimization of multiple‐objective cross‐layer design in multi‐flow ad‐hoc networks

In ad‐hoc wireless networks, to achieve good performance, multiple parameters need to be optimized jointly. However, existing literature lacks a design framework that investigates the synchronic impact of several parameters on overall system performance. Among several design parameters, energy conservation, end‐to‐end delay minimization, and improved throughput are considered most important for efficient operation of these networks. In this paper, we propose a novel scheme for multiple‐objective cross‐layer optimization capable of optimizing all these performance objectives simultaneously for reliable, energy‐efficient, and timely transmission of continuous media information across the network. The three global criteria considered for optimization are incorporated in a single programming problem via linear scalarization. Besides, we employ standard convex optimization method and Lagrangian technique to solve the proposed problem to seek optimality. Extensive simulation results are generated accounting for several topologies with multiple concurrent flows in the network. These results are used to validate the analytical results and demonstrate the efficiency of the proposed optimization model. Efficiency of the model is verified by finding the set of Pareto‐optimal solutions plotted in three‐dimensional objective space. These solution points constituting the Pareto front are used as the best possible balance points among maximum throughput, maximum residual energy, and least network delay. Finally, to emphasize the effectiveness and supremacy of our proposed multiple‐objective cross‐layer design scheme, we compare it with the conventional multiple‐objective genetic algorithm. Simulation results demonstrate that our method provides significant performance gain over the genetic algorithm approach in terms of the above specified three objectives.     

双层卫星网络中的自适应路由算法

The rapid advancement of communication and satellite technology drives broadband satellite networks to carry different traffic loads. However, traffic class routing of satellite cannot be provided by the existing 2 layerd satellite networks. In this paper, a 2 layered satellite network composed of low Earth orbit and medium Earth orbit satellite networks is presented, and a novel Self adapting Routing Protocol (SRP) is developed. This scheme aims to adopt self adapting routing algorithm to support different traffic classes. Meanwhile, the path discovery processing is invoked independently for each individual origin/destination pair. Simulation results are provided to evaluate the performance of the new scheme in terms of end to end delay, normalized data throughput, delay jitter and delivery ratio.     

Low‐jitter slot assignment algorithm for deadline‐aware packet transmission in wireless video surveillance sensor networks

This work presents a distributed time‐slot assignment algorithm which adopts TDMA as Medium Access Control, specially suited to support applications with strict delay, jitter, and throughput requirements characterized by convergecast traffic pattern in sensor networks. (e.g. wireless video surveillance sensor networks). The proposed algorithm has three characteristics: (1) every node is guaranteed a path to the base station for its data delivery. In the path, sufficient resource is reserved and weighted fairness can be achieved. (2) It uses cascading time‐slot assignment and jitter minimization algorithm in each node to minimize jitter and end‐to‐end delay. (3) Nodes are only active during their scheduled slots and sleep otherwise. This offers energy saving by reducing idle listening and avoiding overhearing. The performance of the proposed algorithm is evaluated over simulations and analyzed theoretically in comparison with existing slot assignment algorithm. The results show that our algorithm provides lower end‐to‐end delay, jitter, and higher throughput. Copyright © 2010 John Wiley & Sons, Ltd.     

On energy‐efficient performance‐guaranteed channel assignment in cognitive radio‐based wireless mesh networks

In recent years, in order to make efficient use of spectrum resources, much attention has been given to solving the problem of channel assignment in cognitive radio‐based wireless mesh networks (CR‐WMNs). Current approaches focus mainly on avoiding interference in order to enhance performance in terms of throughput. WMNs are intended to provide low‐cost multimedia communication. Therefore, in order to provide low‐cost real‐time communication, channel assignment in CR‐WMNs should take into consideration not only the issue of throughput, but also energy consumption and delays. In this paper, we first define an optimization problem to maximize the end‐to‐end throughput per unit of energy consumption while minimizing, as well as guaranteeing, the delay constraint specified for a data stream. Based on this, we then propose a novel distributive heuristic channel assignment approach to solve the optimization problem in a self‐organized manner. Finally, we present the simulation results to evaluate the performance of the proposed solution in terms of end‐to‐end throughput per unit of energy consumption and delays. Copyright © 2015 John Wiley & Sons, Ltd.     

Performance characteristics of cascaded delay‐line node architectures in single‐path interconnection networks

Internally buffered multistage interconnection network architectures have been widely used in parallel computer systems and large switching fabrics. Migration from electrical domain to optical domain has raised the necessity of developing node architectures with optical buffers. Cascaded fibre delay line architectures can be seen as possible realizations of output and shared buffering in a 2 × 2‐switching element. These approaches can be used as buffered node architecture in a Banyan like interconnect. In this paper, we investigate and compare these approaches by using simulation methods. Different performance metrics, such as normalized throughput, average packet delay, packet loss rate and buffer utilization have been used under uniform and non‐uniform traffic models. Results show that the TC‐chain node Banyan network offer an improved normalized throughput and average packet delay performances under both traffic models without disrupting first‐in‐first‐out order of arrivals. The switched delay‐line requires fewer switching elements than TC and TTC architectures but at the cost of high packet delay. Copyright © 2004 John Wiley & Sons, Ltd.     

Transport layer protocols and architectures for satellite networks

Designing efficient transmission mechanisms for advanced satellite networks is a demanding task, requiring the definition and the implementation of protocols and architectures well suited to this challenging environment. In particular, transport protocols performance over satellite networks is impaired by the characteristics of the satellite radio link, specifically by the long propagation delay and the possible presence of segment losses due to physical channel errors. The level of impact on performance depends upon the link design (type of constellation, link margin, coding and modulation) and operational conditions (link obstructions, terminal mobility, weather conditions, etc.). To address these critical aspects a number of possible solutions have been presented in the literature, ranging from limited modifications of standard protocols (e.g. TCP, transmission control protocol) to completely alternative protocol and network architectures. However, despite the great number of different proposals (or perhaps also because of it), the general framework appears quite fragmented and there is a compelling need of an integration of the research competences and efforts. This is actually the intent of the transport protocols research line within the European SatNEx (Satellite Network of Excellence) project. Stemming from the authors' work on this project, this paper aims to provide the reader with an updated overview of all the possible approaches that can be pursued to overcome the limitations of current transport protocols and architectures, when applied to satellite communications. In the paper the possible solutions are classified in the following categories: optimization of TCP interactions with lower layers, TCP enhancements, performance enhancement proxies (PEP) and delay tolerant networks (DTN). Advantages and disadvantages of the different approaches, as well as their interactions, are investigated and discussed, taking into account performance improvement, complexity, and compliance to the standard semantics. From this analysis, it emerges that DTN architectures could integrate some of the most efficient solutions from the other categories, by inserting them in a new rigorous framework. These innovative architectures therefore may represent a promising solution for solving some of the important problems posed at the transport layer by satellite networks, at least in a medium‐to‐long‐term perspective. Copyright © 2006 John Wiley & Sons, Ltd.     

Queuing network models for delay analysis of multihop wireless ad hoc networks

In this paper we analyze the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with stationary nodes. We present an analytical model that takes into account the number of nodes, the random packet arrival process, the extent of locality of traffic, and the back off and collision avoidance mechanisms of random access MAC. We model random access multihop wireless networks as open G/G/1 queuing networks and use the diffusion approximation in order to evaluate closed form expressions for the average end-to-end delay. The mean service time of nodes is evaluated and used to obtain the maximum achievable per-node throughput. The analytical results obtained here from the queuing network analysis are discussed with regard to similarities and differences from the well established information-theoretic results on throughput and delay scaling laws in ad hoc networks. We also investigate the extent of deviation of delay and throughput in a real world network from the analytical results presented in this paper. We conduct extensive simulations in order to verify the analytical results and also compare them against NS-2 simulations.     

A two‐way relay framework based on interference cancellation in wireless networks

The two‐way relay (TWR) protocols are efficient in providing appreciable throughput gains in wireless networks through the use of network coding to combine packets from multiple channels. The key determinant factor in driving the throughput improvement is the degree of simultaneity achieved in the relay scheme. In this paper, we propose a new TWR protocol named interference cancellation TWR (IC‐TWR), which combines network coding, spatial diversity, and IC techniques to arrive at high degree of simultaneity and in the meanwhile to relax the requirement on channel state information as compared with TWR schemes based on amplify‐and‐forward. Numerical analysis shows that the proposed IC‐TWR is uniformly advantageous over the traditional decode‐and‐forward scheme in terms of system throughput and end‐to‐end delay. The proposed scheme may be useful for system designers of high‐speed multimedia applications in wireless mobile networks, wireless cellular networks, wireless sensor networks, and so on. Copyright © 2015 John Wiley & Sons, Ltd.     

On the transmission opportunity and TCP throughput in cognitive radio networks

The characteristics of cognitive radio networks have huge impacts on the end‐to‐end performance of the transmission control protocol (TCP) for secondary users. Thus, the existing TCP throughput expression, widely used in wired and wireless networks, is no longer suitable for cognitive radio networks. In this paper, we derive the transmission opportunity of secondary users, taking into account the dynamics of spectrum availability, the overhead and errors of spectrum sensing, as well as the interaction between TCP and lower layers. The amount of transmission opportunity is expressed in terms of effective data transmission time. On the basis of the analysis of the transmission opportunity, an expression of an effective TCP throughput is then derived. To evaluate this effective TCP throughput expression, two cross‐layer optimization problems are formulated as application examples to maximize the transport layer effective throughput and energy utility, respectively. Simulation results show that our analysis on transmission opportunity is accurate, and the derived effective TCP throughput expression is more precise than existing ones. Copyright © 2012 John Wiley & Sons, Ltd.     

Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks

In wireless networks, throughput optimization is an essential performance objective that cannot be adequately characterized by a single criterion (such as the minimum transmitted or sum-delivered throughput) and should be specified over all source-destination pairs as a rate region. For a simple and yet fundamental model of tandem networks, a cross-layer optimization framework is formulated to derive the maximum throughput region for saturated multicast traffic. The contents of network flows are specified through network coding (or plain routing) in network layer and the throughput rates are jointly optimized in medium access control layer over fixed set of conflict-free transmission schedules (or optimized over transmission probabilities in random access). If the network model incorporates bursty sources and allows packet queues to empty, the objective is to specify the stability region as the set of maximum throughput rates that can be sustained with finite packet delay. Dynamic queue management strategies are used to expand the stability region toward the maximum throughput region. Network coding improves throughput rates over plain routing and achieves the largest gains for broadcast communication and intermediate network sizes. Throughput optimization imposes fundamental tradeoffs with transmission and processing energy costs such that the throughput-optimal operation is not necessarily energy efficient.     

An analytical framework for remote sensing satellite networks based on the model predictive control with convex optimization

In this paper, we consider the problem of maximizing the throughput of remote sensing satellite networks. In such networks, the link capacities and routing matrices are varying over time. We propose a convex optimization‐based analytical framework for the problem. To maximize the network throughput under the premise of satisfying the delay constraint, we formulate the data transmission schedule into an optimization problem aiming at maximizing the delay‐constrained throughput. Considering the fact that the future link capacities cannot be accurately known in the actual situation, we propose a heuristic and distributed framework on the basis of model predictive control for approximately solving the problem. This framework can be used to design remote sensing data transmission schedules under various scenarios. We adopt a generic example to simulate and analyze the framework. The simulation results show that the proposed analytic framework can obtain the approximate solution that is very close to the optimal solution by solving the convex optimization problem step‐by‐step. The heuristic algorithm based on model predictive control can obtain the approximate solution, which is very close to the optimal solution in distributed scenario.     

DRP: An energy‐efficient routing protocol for underwater sensor networks

The features of transmissions in underwater sensor networks (UWSNs) include lower transmission rate, longer delay time, and higher power consumption when compared with terrestrial radio transmissions. The negative effects of transmission collisions deteriorate in such environments. Existing UWSN routing protocols do not consider the transmission collision probability differences resulting from different transmission distances. In this paper, we show that collision probability plays an important role in route selection and propose an energy‐efficient routing protocol (DRP), which considers the distance‐varied collision probability as well as each node's residual energy. Considering these 2 issues, DRP can find a path with high successful transmission rate and high‐residual energy. In fact, DRP can find the path producing the longest network lifetime, which we have confirmed through theoretical analysis. To the best of our knowledge, DRP is the first UWSN routing protocol that uses transmission collision probability as a factor in route selection. Simulation results verify that DRP extends network lifetime, increases network throughput, and reduces end‐to‐end delay when compared with solutions without considering distance‐varied collision probability or residual energy.     

Multi‐cost routing for energy and capacity constrained wireless mesh networks

We propose a class of novel energy‐efficient multi‐cost routing algorithms for wireless mesh networks, and evaluate their performance. In multi‐cost routing, a vector of cost parameters is assigned to each network link, from which the cost vectors of candidate paths are calculated using appropriate operators. In the end these parameters are combined in various optimization functions, corresponding to different routing algorithms, for selecting the optimal path. We evaluate the performance of the proposed energy‐aware multi‐cost routing algorithms under two models. In the network evacuation model, the network starts with a number of packets that have to be transmitted and an amount of energy per node, and the objective is to serve the packets in the smallest number of steps, or serve as many packets as possible before the energy is depleted. In the dynamic one‐to‐one communication model, new data packets are generated continuously and nodes are capable of recharging their energy periodically, over an infinite time horizon, and we are interested in the maximum achievable steady‐state throughput, the packet delay, and the energy consumption. Our results show that energy‐aware multi‐cost routing increases the lifetime of the network and achieves better overall network performance than other approaches. Copyright © 2011 John Wiley & Sons, Ltd.     

Efficient REBTA data reporting algorithm for object tracking in wireless sensor networks

Object tracking is widely referred as one of the most interesting applications of wireless sensor networks (WSNs). This application is able to detect and track objects and report information about these objects to a central base station. One of the major drawbacks in the current research in WSNs is the quality of the data reporting where the major research focus is dedicated to localization of objects; however, few of these works were concentrated on the data reporting. An efficient data reporting algorithm for object tracking in WSNs is proposed in this paper. The main objective of this paper is to enhance the WSN lifetime by achieving both minimum energy and balancing such consumption in sensor nodes during reporting operation. Furthermore, in our model, the enhancement of network reliability is considered. Finally, it reduces the effects of congestion by sufficiently utilizing the under loaded nodes to improve the network throughput. This paper formulates the object tracking problem in large‐scale WSN into 0/1 integer linear programming problem, and then proposes a reliable energy balance traffic aware approach to solve the optimization problem. From the obtained simulation results, the proposed solution has proved to be able to enhance the network performance in network lifetime, throughput, end‐to‐end delay, energy balance, and complexity for both homogeneous and heterogeneous networks.     

A methodology to benchmark flexible payload architectures in a megaconstellation use case

This paper proposes a methodology to benchmark satellite payload architectures and find the optimal trade‐offs between high flexibility and low complexity. High flexibility would enable the satellite to adapt to various distributions of user terminals on the ground and fulfill the data rate demand of these users. Besides, low complexity is required to keep satellite networks competitive in the context of emerging 5G networks. To estimate the flexibility of a payload, an indicator to characterize the non‐uniformity of user distributions is proposed. Each benchmarked payload may be characterized by a graph relating the throughput to this parameter further denoted . The payload provides the same throughput trends for different scenarios of user distributions with the same parameter. As a consequence, the average capacity of the system may be estimated by (a) calculating the probability distribution of over the orbit and (b) integrating the throughput based on this payload response. It thus results in a straightforward way for benchmarking payloads directly on an estimation of the averaged capacity, accounting for the user distribution over the earth. A simulation platform has been developed to characterize the payload throughput including the implementation of a resource allocation algorithm that accounts for constraints of various payloads. Using this definition and the developed tool, we benchmark a bent‐pipe architecture, a beam hopping architecture and a hybrid beam‐steering architecture for a LEO megaconstellation use case. The methodology showcases the interest for investigating different payload architectures depending on realistic traffic scenario analysis.     

An efficient network‐coding based back‐pressure scheduling algorithm for wireless multi‐hop networks

Back‐pressure scheduling has been considered as a promising strategy for resource allocation in wireless multi‐hop networks. However, there still exist some problems preventing its wide deployment in practice. One of the problems is its poor end‐to‐end (E2E) delay performance. In this paper, we study how to effectively use inter‐flow network coding to improve E2E delay and also throughput performance of back‐pressure scheduling. For this purpose, we propose an efficient network coding based back‐pressure algorithm (NBP), and accordingly design detailed procedure regarding how to consider coding gain in back‐pressure based weight calculation and how to integrate it into next hop decision making in the NBP algorithm. We theoretically prove that NBP can stabilize the networks. Simulation results demonstrate that NBP can not only improve the delay performance of back‐pressure algorithm, but also achieve higher network throughput. Copyright © 2016 John Wiley & Sons, Ltd.     

Turbo-coded ARQ schemes for DS-CDMA data networks over fading andshadowing channels: throughput, delay, and energy efficiency

Modified ARQ (automatic-repeat-request) techniques based on turbo coding are investigated for asynchronous DS-CDMA (direct-sequence code-division multiple-access) data networks under shadowing and frequency selective fading channel conditions. The throughput, delay, and energy efficiency performance of standard ARQ, metric combining, and RCPT (rate compatible punctured turbo) coded ARQ schemes are compared via simulations. The RCPT/ARQ schemes are shown to outperform the other two schemes in terms of both throughput and energy efficiency at the cost of larger delay and complexity. In addition, maximum network throughput is investigated for different ARQ schemes under energy constraints     

Empirical evaluation of receiver‐based TCP delay control in CDMA2000 networks

Wide‐area broadband wireless technologies such as CDMA2000 often suffer from variable transfer rate and long latency. In particular, TCP window‐based rate control causes excessive buffering at the base station because of the lower transfer rate of the wireless link than that of the wired backhaul link. This performance characteristic of TCP further increases the end‐to‐end delay, and additional resources are required at the base station. This paper presents a practical mechanism to control the end‐to‐end TCP delay for CDMA2000 networks (or other similar wireless technologies). The key idea is to reduce and stabilize RTT (round‐trip time) by dynamically controlling the TCP advertised window size, based on a runtime measurement of the wireless channel condition at the mobile station. The proposed system has been implemented by modifying the Linux protocol stack. The experiment results, conducted on a commercial CDMA2000 1x network, show that the proposed scheme greatly reduces the TCP delay in non‐congested networks, while not sacrificing the TCP throughput in congested networks. Copyright © 2006 John Wiley & Sons, Ltd.     

Congestion management techniques for disruption‐tolerant satellite networks

Delay and disruption‐tolerant networks are becoming an appealing solution for extending Internet boundaries toward challenged environments where end‐to‐end connectivity cannot be guaranteed. In particular, satellite networks can take advantage of a priori trajectory estimations of nodes to make efficient routing decisions. Despite this knowledge is already used in routing schemes such as contact graph routing, it might derive in congestion problems because of capacity overbooking of forthcoming connections (contacts). In this work, we initially extend contact graph routing to provide enhanced congestion mitigation capabilities by taking advantage of the local traffic information available at each node. However, since satellite networks data generation is generally managed by a mission operation center, a global view of the traffic can also be exploited to further improve the latter scheme. As a result, we present a novel strategy to avoid congestion in predictable delay‐ and disruption‐tolerant network systems by means of individual contact plans. Finally, we evaluate and compare the performance improvement of these mechanisms in a typical low Earth orbit satellite constellation.