Context‐aware hybrid satellite‐terrestrial broadband access

One of the key performance targets on the European Commission's Digital Agenda is to provide at least 30‐Mbit/s broadband coverage to all European households by 2020. The deployment of existing terrestrial technologies will not be able to satisfy the requirements in the most difficult‐to‐serve locations, either due to a lack of coverage in areas where the revenue potential for terrestrial service providers is too low or due to technological limitations that diminish the available throughput in rural environments. In this paper, we investigate a hybrid broadband system combining satellite and terrestrial access networks. The system design and the key building blocks of the intelligent routing entities (referred to as intelligent gateways) are presented. To justify the hybrid broadband system's performance subjectively, lab trials have been performed with an integrated multiple access network emulator and a variety of typical multimedia applications that have varying requirements. The results of the lab trials suggest that the quality of experience is consistently improved thanks to the utilisation of intelligent gateway devices, when compared with using a single access network at a time.     

Optimized handover and resource management: an 802.21‐based scheme to optimize handover and resource management in hybrid satellite‐terrestrial networks

Satellite communications can provide fourth generation (4G) networks with large‐scale coverage. However, their integration to 4G is challenging because satellite networks have not been designed with handover in mind. The setup of satellite links takes time, and so, handovers must be anticipated long before. This paper proposes a generic scheme based on the Institute of Electrical and Electronics Engineers 802.21 standard to optimize handover and resource management in hybrid satellite‐terrestrial networks. Our solution, namely optimized handover and resource management (OHRM), uses the terrestrial interface to prepare handover, which greatly speeds up the establishment of the satellite link. We propose two mechanisms to minimize the waste of bandwidth due to wrong handover predictions. First, we leverage the support of 802.21 in the terrestrial access network to shorten the path of the signaling messages towards the satellite resource manager. Second, we cancel the restoration of the satellite resources when the terrestrial link rolls back. We use OHRM to interconnect a digital video broadcasting and a wireless 4G terrestrial network. However for the simulation tool, we use a WiMAX as the terrestrial technology to illustrate the schemes. The simulation results show that OHRM minimizes the handover delay and the signaling overhead in the terrestrial and satellite networks. Copyright © 2013 John Wiley & Sons, Ltd.     

On the secrecy performance of integrated satellite‐aerial‐terrestrial networks

This paper investigates secure transmission of an integrated satellite‐aerial‐terrestrial network (ISATN), where multiple eavesdroppers (Eves) attempt to overhear the satellite signals cooperatively. The ISATN adopts an unmanned aerial vehicle (UAV) equipped with multiple antennas as a relay with threshold‐based decode‐and‐forward (DF) protocol. By assuming that perfect instantaneous channel state information (CSI) of the satellite‐UAV link and the statistical CSI of the UAV‐user link are available, we first propose a beamforming (BF) scheme for maximizing the achievable secrecy rate (ASR) of the considered network. Then, we derive the analytical expressions of the secrecy outage probability (SOP) and ergodic secrecy rate (ESR) of the considered system with the BF strategy under an assumption that the satellite‐UAV link undergoes the shadowed‐Rician fading, while the UAV‐user link experiences the correlated Rayleigh fading. Finally, numerical results are given to demonstrate the superiority of the proposed BF scheme against zero forcing (ZF) and maximal ratio transmission (MRT) schemes and the validity of the secrecy performance analysis.     

Leveraging multiuser diversity for adaptive hybrid satellite‐LTE downlink scheduler (H‐MUDoS) in emerging 5G‐satellite network

In order to achieve ubiquitous coverage and service continuity in future 5G network, satellite‐based access is the best solution to complement the terrestrial LTE‐A. In light of this, we introduce a channel‐aware hybrid scheduling technique on the basis of satellite‐LTE spectrum sharing. According to the user‐experienced channel, base stations (eNodeB) and the satellite will work cooperatively. The eNodeB mainly provides service in urban area for high density population. Meanwhile, the satellite will perform either offloading, providing service for under‐served users, or extra coverage for users in rural and remote areas having no coverage of eNodeB. Leveraging the multiuser diversity, we implement a new metrics computation method for hybrid satellite‐LTE downlink scheduler (H‐MUDoS). Compared with other existing schedulers, simulation results clearly demonstrate the high performance of H‐MUDoS in terms of spectral efficiency in addition to improvement of the quality‐of‐service requirements and capacity maximization.     

Use cases and scenarios of 5G integrated satellite‐terrestrial networks for enhanced mobile broadband: The SaT5G approach

This paper presents initial results available from the European Commission Horizon 2020 5G Public Private Partnership Phase 2 project “SaT5G” (Satellite and Terrestrial Network for 5G). 1 After describing the concept, objectives, challenges, and research pillars addressed by the SaT5G project, this paper elaborates on the selected use cases and scenarios for satellite communications positioning in the 5G usage scenario of enhanced mobile broadband.     

An energy‐aware transmission mechanism for WiFi‐based mobile devices handling upload TCP traffic

This paper presents an energy‐aware transmission mechanism that improves the throughput and reduces the energy consumption of mobile devices in wired‐cum‐wireless TCP networks. The proposed mechanism places an agent at the base station, which identifies the cause of packet losses in the underlying network. When the mobile device acts as a TCP source, it adjusts the size of the congestion window adaptively according to the cause of packet losses with the aids of the agent in order to improve the transmission performance. In addition, the proposed mechanism lets the communication device to stay in sleep mode after completing the transmission in order to reduce the energy consumption. As a result, the cooperation between the mobile device and the agent improves the transmission performance as well as the energy efficiency greatly. To evaluate the performance of the proposed mechanism, we analyzed the effect of TCP on the communication device for mobile devices and present a power model. With extensive simulations based on the power model, we demonstrate that the proposed mechanism significantly improves the transmission performance, and reduces the energy consumption over a wide range of both wired and wireless packet losses. Copyright © 2008 John Wiley & Sons, Ltd.     

Multi‐topology routing based egress selection approach to achieve hybrid intra‐AS and inter‐AS traffic engineering

Hot‐potato routing is a border gateway protocol policy that selects the ‘closest’ egress router in terms of interior gateway protocol cost. This policy imposes inherent interactions between intra‐AS (Autonomous System) and inter‐AS traffic engineering. In light of this observation, we present a hybrid intra‐AS and inter‐AS traffic engineering scheme named egress selection based upon hot potato routing. This scheme involves link weight optimization, which can not only minimize the time that IP (Internet Protocol) packets travel across the network by assigning specified egress router but also balance the load among the internal links of the transit network. Egress selection based upon hot potato routing also incorporates multi‐topology routing technique to address the problem that one set of link weights might not guarantee specified egress routers. Accordingly, we formulate the link weights optimization problem using multi‐topology routing as a mixed integer linear programming model. And we present a new heuristic algorithm to make the problem tractable. Numerical results show that only a few topologies are needed to guarantee specified egress router, and maximum link utilization is also reduced. Copyright © 2014 John Wiley & Sons, Ltd.     

SDN/NFV‐based handover management approach for ultradense 5G mobile networks

With the great increase of connected devices and new types of applications, mobile networks are witnessing exponential growth of traffic volume. To meet emerging requirements, it is widely agreed that the fifth‐generation mobile network will be ultradense and heterogeneous. However, the deployment of a high number of small cells in such networks poses challenges for the mobility management, including frequent, undesired, and ping‐pong handovers, not to mention issues related to increased delay and failure of the handover process. The adoption of software‐defined networking (SDN) and network function virtualization (NFV) technologies into 5G networks offers a new way to address the above‐mentioned challenges. These technologies offer tools and mechanisms to make networks flexible, programmable, and more manageable. The SDN has global network control ability so that various functions such as the handover control can be implemented in the SDN architecture to manage the handover efficiently. In this article, we propose a Software‐Defined Handover (SDHO) solution to optimize the handover in future 5G networks. In particular, we design a Software‐Defined Handover Management Engine (SDHME) to handle the handover control mechanism in 5G ultradense networks. The SDHME is defined in the application plane of the SDN architecture, executed by the control plane to orchestrate the data plane. Simulation results demonstrate that, compared with the conventional LTE handover strategy, the proposed approach significantly reduces the handover failure ratio and handover delay.     

Service‐oriented 5G network architecture: an end‐to‐end software defining approach

With the ever‐increasing mobile demands and proliferation of mobile services, mobile Internet has penetrated into every aspect of human life. Although the 4G mobile communication system is now being deployed worldwide, simply evolving or incrementally improving the current mobile networks can no longer keep the pace with the proliferation of mobile services. Against this background, aiming to achieve service‐oriented 5G mobile networks, this article proposes an end‐to‐end software defining architecture, which introduces a logically centralized control plane and dramatically simplifies the data‐plane. The control plane decomposes the diversified mobile service requirements and, correspondingly, controls the functions and behaviors of data‐plane devices. Consequently, the network directly orients towards services, and the devices are dynamically operated according to the service requirements. Therefore, the proposed architecture efficiently guarantees the end‐to‐end QoS and quality of experience. The challenges and key technologies of our architecture are also discussed in this article. Real traces‐based simulations validate the performance advantages of proposed architecture, including energy efficiency and the whole performance. Copyright © 2015 John Wiley & Sons, Ltd.     

Non‐cooperative game‐based packet ferry forwarding for sparse mobile wireless networks

In sparse mobile wireless networks, normally, the mobile nodes are carried by people, and the moving activity of nodes always happens in a specific area, which corresponds to some specific community. Between the isolated communities, there is no stable communication link. Therefore, it is difficult to ensure the effective packet transmission among communities, which leads to the higher packet delivery delay and lower successful delivery ratio. Recently, an additional ferry node was introduced to forward packets between the isolated communities. However, most of the existing algorithms are working on how to control the trajectory of only one ferry work in the network. In this paper, we consider multiple ferries working in the network scenario and put our main focus on the optimal packet selection strategy, under the condition of mutual influence between the ferries and the buffer limitation. We introduce a non‐cooperative Bayesian game to achieve the optimal packet selection strategy. By maximizing the individual income of a ferry, we optimize the network performance on packet delivery delay and successful delivery ratio. Simulation results show that our proposed packet selection strategy improves the network performance on packet delivery delay and successful delivery ratio. Copyright © 2013 John Wiley & Sons, Ltd.     

TOPSIS‐based approach for network slice selection in 5G mobile systems

Fifth‐generation (5G) mobile networks can be perceived as highly manageable systems that provide increased performance while supporting a variety of services with widely diverse requirements. Recently, network slicing has been proposed by academia and industry as a resource provisioning technique capable to meet these requirements with reduced operating costs while opening new horizons for network efficiency. The aim of network slice selection function (NSSF) is an optimal selection of network instances serving the users, based on local configuration, and other available information including radio access networks (RANs) performances in the registration area. In this paper, NSSF based on Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) is proposed. Here, the network slices are treated as alternatives while their performance indicators are considered as the criteria for decision making. The influences of various alternative techniques, taking into account all the three stages of decision making process, that is, normalization, weighting, and ranking, are analyzed through the rank reversal phenomenon and computational complexity. Simulation results reveal that the proposed techniques can significantly improve the network slice selection procedure.     

Performance of dead reckoning‐based location service for mobile ad hoc networks

A predictive model‐based mobility tracking method, called dead reckoning, is developed for mobile ad hoc networks. It disseminates both location and movement models of mobile nodes in the network so that every node is able to predict or track the movement of every other node with a very low overhead. The basic technique is optimized to use ‘distance effect’, where distant nodes maintain less accurate tracking information to save overheads. The dead reckoning‐based location service mechanism is evaluated against three known location dissemination service protocols: simple, distance routing effect algorithm for mobility (DREAM) and geographic region summary service (GRSS). The evaluation is done with geographic routing as an application. It is observed that dead reckoning significantly outperforms the other protocols in terms of packet delivery fraction. It also maintains low‐control overhead. Its packet delivery performance is only marginally impacted by increasing speed or noise in the mobility model, that affects its predictive ability. Copyright © 2004 John Wiley & Sons, Ltd.     

A self‐adaptive algorithm for super‐peer selection considering the mobility of peers in cognitive mobile peer‐to‐peer networks

Cognitive peer‐to‐peer networks are obtained from a combination of cognitive networking concepts and peer‐to‐peer networks. These networks are able to improve their performance while operating under dynamic and unknown environments. A cognitive peer‐to‐peer network tries to learn an appropriate configuration for itself considering the unknown physical properties of peers. Cognitive mobile peer‐to‐peer networks refer to cognitive peer‐to‐peer networks which are built over mobile ad hoc networks. In these networks, heterogeneity of the mobility of peers and resource limitation in wireless networks create challenges for network management algorithms. Because of the dynamicity of these networks, the management algorithms should be designated in self‐adaptive manner. In one type of these networks, some peers, called super‐peers, undertake to perform network managerial tasks. The mobility of peers leads to connection failure among peers and reselection of new super‐peers. Therefore, the selection of super‐peers, due to their influential role, requires an algorithm that considers the peers' mobility. Up to now, no self‐adaptive algorithm has been designated for super‐peer selection considering the mobility of peers in a self‐adaptive manner. This paper proposes M‐SSBLA, a self‐adaptive algorithm for super‐peer selection considering the mobility of peers based on learning automata. The proposed algorithm is obtained from cooperation between a learning automata‐based cognitive engine and MIS. MIS is a well‐known super‐peer selection algorithm in mobile peer‐to‐peer networks. We compared the proposed algorithm with recently reported algorithms, especially for a network with high mobility. Simulation results show that the proposed algorithm can cover maximum ordinary‐peer with a few super‐peer and improve robustness against super‐peer failures while decreasing maintenance overhead.     

SGDD: self‐managed grid‐based data dissemination protocol for mobile sink in wireless sensor network

The reduction of energy consumption in order to increase network lifetime is one of the most major challenges in the design of wireless sensor networks. During data dissemination, the sensors that are located in the sink's neighborhood are responsible to relay data to the other nodes; hence, their energy is exhausted expeditiously. Therefore, the idea of utilizing mobile sinks can be so advantageous to decrease energy consumption during data dissemination process. In this paper, we propose self‐managed grid‐based data disseminating protocol for mobile sink in wireless sensor networks by using the idea of constructing a virtual grid. In self‐managed grid‐based data disseminating protocol, sink and nodes map their geographical position to a virtual location. In order to increase the performance, we have employed a cell head for each grid cell. Cell heads are selected based on two parameters, centralization and residual energy. Our data dissemination protocol is simple and has low overhead to construct and maintain. Also, we have presented a new method for sink location update, which leads to the least cost in data transfer. Simulation results illustrate that by utilizing hierarchical functionality and determining an optimal size for grid cells, energy consumption is decreased, which leads to increasing network lifetime. Copyright © 2015 John Wiley & Sons, Ltd.     

Throughput enhanced scheduling (TES) scheme for ultra‐dense networks

This paper proposes two novel packet scheduling schemes, called as throughput enhanced scheduling (TES) and TES plus (TES+), for future ultra‐dense networks. These schemes introduce two novel parameters to the scheduling decision making and reformulate the parameters used by the state‐of‐the‐art schemes. The aim is to have a more balanced weight distribution between delay and throughput‐related parameters at scheduling decisions. Also include a new telecommunications related parameter into scheduling decision making that has not been studied by popular schedulers. The performance of novel schemes is compared with well‐known schemes—proportional fairness (PF), exponential/proportional fairness (EXP/PF), and M‐LWDF. For performance evaluation, five performance metrics—average spectral efficiency and delay, quality of service (QoS) violation ratio, jitter, and Jain's fairness index—are investigated. The simulation results show that proposed schemes can outperform all the compared scheduling schemes.     

Performance analysis of a channel allocation scheme for multi‐service mobile cellular networks

This paper presents a new channel allocation scheme, namely the dynamic partition with pre‐emptive priority (DPPP) scheme, for multi‐service mobile cellular networks. The system is modelled by a two‐dimensional Markov process and analysed by the matrix‐analytic method. A pre‐emptive priority (PP) mechanism is employed to guarantee the quality of service (QoS) requirement of the real‐time (RT) traffic at the expense of some degradation of non‐real‐time (NRT) traffic, while the victim buffer compensates the degradation and has no negative impact on the RT traffic. The complete service differentiation between new calls and handoff calls from different traffic classes is achieved by using the dynamic partition (DP) concept with the help of related design parameters. The performance analysis and numerical results show that the DPPP scheme, compared with the existing schemes, is effective and practical in multi‐service environments. Copyright © 2006 John Wiley & Sons, Ltd.     

Design and FPGA implementation of an efficient security mechanism for mobile pay‐TV systems

A mobile pay‐TV service is one of the ongoing services of multimedia systems. Designing an efficient mechanism for authentication and key distribution is an important security requirement in mobile pay‐TV systems. Until now, many security protocols have been proposed for mobile pay‐TV systems. However, the existing protocols for mobile pay‐TV systems are vulnerable to various security attacks. Recently, Wang and Qin proposed an authentication scheme for mobile pay‐TV systems using bilinear pairing on elliptic curve cryptography. They claimed that their scheme could withstand various attacks. In this paper, we demonstrate that Wang and Qin's scheme is vulnerable to replay attacks and impersonation attacks. Furthermore, we propose a novel security protocol for mobile pay‐TV systems using the elliptic curve cryptosystem to overcome the weaknesses of Wang and Qin's scheme. In order to improve the efficiency, the proposed scheme is designed in such a way that needs fewer scalar multiplication operations and does not use bilinear pairing, which is an expensive cryptographic operation. Detailed analyses, including verification using the Automated Validation of Internet Security Protocols and Applications tool and implementation on FPGA, demonstrate that the proposed scheme not only withstands active and passive attacks and provides user anonymity but also has a better performance than Wang and Qin's scheme.     

Examination of the data rate obtainable with low‐gain non‐tracking antenna applied to user terminal used for mobile communications and broadcasting services provided by quasi‐zenithal satellites

Link budgets between the mobile user terminal and a feeder link station (2‐m‐diameter antenna) through the quasi‐zenithal satellite system (QZSS) (7‐m‐diameter antenna for Tx, 5‐m‐diameter antenna for Rx) under the power flux density (PFD) limit were calculated for the Ka‐ and Ku‐band. The PFD limit for non‐geostationary satellites is applied for frequency sharing between QZSS and geostationary satellites. The maximum data rate in the Ka‐band was 1.7 times higher than in the Ku‐band in the forward link, while the maximum data rate at Ku‐band is nine times higher than that in the Ka‐band in the return link when the transmit power derived from the regulations of the PFD is applied. And it is more than three times higher than that in the Ka‐band when transmit power is fixed to 2W. In the forward link, maximum data rates are 149 kbps in the Ka‐band and 86 kbps in the Ku‐band when the user terminal antenna is non‐tracking (gain at the satellite direction is 7.1 dBi) and the frequency bandwidth per beam is 30 MHz. Required bandwidth per channel for a certain data rate is large, e.g. in Ka‐band, 20.9 MHz for 64 kbps, 125 MHz for 384 kbps, and 326 MHz for 1 Mbps. In the return link, the maximum data rates are 44 kbps in the Ku‐band and 13.6 kbps in the Ka‐band when the user terminal antenna gain in the satellite direction is 7.1 dBi and transmit power is 2 W. Copyright © 2005 John Wiley & Sons, Ltd.     

A novel method for mitigating the effects of dynamic coexistence on the operation of IEEE 802.15.4‐based mobile WSNs

Wireless networks dynamically coexist when their transmission ranges overlap as a result of mobility. Mobile wireless sensor networks (WSNs) may suffer from significant degradation of performance due to the interference caused by dynamic coexistence, which is particularly critical for health monitoring WSNs. In this paper, we propose a novel method to detect and mitigate the harmful effects of dynamic coexistence on the operation of IEEE 802.15.4‐based mobile health monitoring WSNs. IEEE 802.15.4 uses the guaranteed time slots (GTS) mechanism to eliminate contention; however, successful transmissions cannot be guaranteed for coexisting WSNs. We show that using limited clear channel assessments at the beginning of the GTS enables the mobile WSNs to avoid collisions with minimum overhead. This method can also be used in combination with the previously proposed mechanisms for coexistence management. We analytically investigate the effects of using this method on the performance of the dynamically coexisting WSNs. We use OPNET simulation to investigate the coexistence of health monitoring WSNs and also to validate the proposed method. Our results indicate that using the proposed mechanism, 2–10 coexisting mobile WSNs with relatively high transmission rates (20–30% of maximum throughput) can achieve 20–90% higher rates of successful transmissions, with less than 10% increase in power consumption. Copyright © 2014 John Wiley & Sons, Ltd.     

An efficient resource allocation to improve QoS of 5G slicing networks using general processor sharing‐based scheduling algorithm

Fifth generation (5G) slicing is an emerging technology for software‐defined networking/network function virtualization–enabled mobile networks. Improving the utilization and throughput to meet the quality of service (QoS) requirements of 5G slicing is very important for the operators of mobile networks. With growing data traffic from different applications of numerous smart mobile devices having several QoS requirements, we expect networks to face problems of congestion and overload that prevent the effective functioning of a radio access network (RAN). This paper proposes a more effective packet‐based scheduling scheme for data traffic by 5G slicing with two operation modes for improving the resource utilization of 5G cloud RAN and providing an efficient isolation of the 5G slices. These two operation modes are referred to as static sharing resource (SSR) scheme and dynamic sharing resources (DSR) scheme. The SSR scheme is a modified version of an existing method. The goal of this approach is to reallocate the shared available resources of 5G network fairly and maximize the utilization of bandwidth while protecting a 5G slice from overwhelming other 5G slices. Throughput and delays of the system model are also discussed to show its performance limits. On the basis of the simulation outcomes, we observed that the proposed DSR scheme outperforms the SSR scheme in terms of provided delay and throughput. In addition, the token bucket parameters together with the assigned capacity weight for each slice can be selected and configured based on the required QoS. Finally, a good estimate for the maximum delay bounds of the slices is provided by the derived theoretical delay bound.