Quantitative Survivability Analysis Using Probability Model Checking: A Study of Cluster-Based Vehicle Networks with Dual Cluster Heads

As an important part of future 5G wireless networks,a vehicular network demands safety,reliability and connectivity.In this context,networking survivability is usually considered an important metric to evaluate network performance.In this paper,we propose a survivability model for vehicle communication networking based on dual cluster heads,wherein a backup cluster head(CH)will be activated if the primary CH fails,thereby effectively enhancing the network lifetime.Additionally,we introduce a software rejuvenation strategy for the prime CH to further improve the survivability of the entire network.Using the Probabilistic Symbolic Model Checker(PRISM),we verify and discuss the proposed survivability model via numerical simulations.The results show that network survivability can be effectively improved by introducing an additional CH and further enhanced by adopting the software rejuvenation technique.     

On Minimizing Delay with Probabilistic Splitting of Traffic Flow in Heterogeneous Wireless Networks

In the paper,we propose a framework to investigate how to effectively perform traffic flow splitting in heterogeneous wireless networks from a queue point.The average packet delay in heterogeneous wireless networks is derived in a probabilistic manner.The basic idea can be understood via treating the integrated heterogeneous wireless networks as different coupled and parallel queuing systems.The integrated network performance can approach that of one queue with maximal the multiplexing gain.For the purpose of illustrating the effectively of our proposed model,the Cellular/WLAN interworking is exploited.To minimize the average delay,a heuristic search algorithm is used to get the optimal probability of splitting traffic flow.Further,a Markov process is applied to evaluate the performance of the proposed scheme and compare with that of selecting the best network to access in terms of packet mean delay and blocking probability.Numerical results illustrate our proposed framework is effective and the flow splitting transmission can obtain more performance gain in heterogeneous wireless networks.     

Energy efficient fault-tolerant multipath routing scheme for wireless sensor networks

In wireless sensor network （MSN）, reliability is the main issue to design any routing technique. To design a comprehensive reliable wireless sensor network, it is essential to consider node failure and energy constrain as inevitable phenomena. In this paper we present energy efficient node fault diagnosis and recovery for wireless sensor networks referred as energy efficient fault tolerant multipath routing scheme for wireless sensor network. The scheme is based on multipath data routing. One shortest path is used for main data routing in our scheme and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic on main channel. Shortest pat data routing ensures energy efficient data routing. Extensive simulation results have revealed that the performance of the proposed scheme is energy efficient and can tolerates more than 60% of fault.     

Secure Data Sharing and Retrieval Using Attribute-Based Encryption in Cloud-Based OSNs

The Online social networks （OSNs） offer attractive means for social interactions and data sharing, but also raise a number of security and privacy issues. Since the OSNs service provider is always semi-trusted, current solutions propose to encrypt data before sharing. However, data encryption causes a lot of inconveniences and large overheads for data dissemination and data retrieval. In this paper, we propose a secure data sharing and retrieval scheme in cloud-based OSNs. Based on ciphertext-policy attribute-based encryption, our scheme achieves multi- party access control, which allows data owners to outsource encrypted data to the OSNs service provider for sharing, and enables data disseminators to disseminate the data owners＇ data by customizing new access policy. Our scheme also provides searchable encryptlon scheme to support fast searches in massive amount of encrypted data from both data owners and data disseminators. Further, our scheme preserves the privacy of data owners and data retrievers during the data sharing and retrieval processes. In addition, the computation overhead of data retrievers is reduced by delegating most of the decryption operations to the OSNs service provider. The security and performance analysis results indicate that our scheme is secure and privacy-preserving.     

OpenFIow-Based Control Architecture for the Mobile FreeSpace Optical Networks

Mobile free space optical networks have aroused much attention due to the ability of providing high speed connectivity over long distance using the wireless laser links,while requiring relatively high available bandwidth resource and less energy consumption.However,maintaining the network with laserlinks is quite challenging due to a number of issues,such as the link fragility,the difficulty in pointingand tracking of the link,which also raises the great difficulty in the control of the network.In this paper,we present the methodology for the deployment of the mobile freespace optical networks based on our proposed OpenFlow-based control architecture.In addition,a new routing scheme is proposed and demonstrated on the testbed based on this control architecture.Delivery ratio,average delivery delay and time complexity are given to verify the performance of the OpenFlow-based control architecture.     

Cross-layer resource allocation for QoS guarantee with finite queue constraint in multirate OFDMA wireless networks

Efficient radio resource allocation is essential to provide quality of service （QoS） for wireless networks. In this article, a cross-layer resource allocation scheme is presented with the objective of maximizing system throughput, while providing guaranteed QoS for users. With the assumption of a finite queue for arrival packets, the proposed scheme dynamically a/locates radio resources based on user＇s channel characteristic and QoS metrics derived from a queuing model, which considers a packet arrival process modeled by discrete Markov modulated Poisson process （dMMPP）, and a multirate transmission scheme achieved through adaptive modulation. The cross-layer resource allocation scheme operates over two steps. Specifically, the amount of bandwidth allocated to each user is first derived from a queuing analytical model, and then the algorithm finds the best subcarrier assignment for users. Simulation results show that the proposed scheme maximizes the system throughput while guaranteeing QoS for users.     

Model for cascading network failures based on the nodes with different tolerance parameter

Cascading failures are common in most of the networks,where traffic is rerouted to bypass malfunctioning routers,eventually leading to an avalanche of overloads on other routers that are not equipped to handle extra traffic,which can result in a congestion regime with degradation in the network performance.In order to investigate how a small shock can trigger avalanches mechanisms affecting a considerable fraction of the network,lots of failure models have been constructed,but they have focused only on the static properties of the network that can not reflect the performance affected by the avalanche exactly.In this paper,we proposed a simple model for cascading failures in the network to explore how the failures can have a great impact on the network performance,and we allocated every node a capacity by tolerance parameter based on the node importance,which is determined by node degree,the number of the shortest paths through a node,and the number of the shortest paths through the neighbors of a node,then we fixed every element a weight to compute the node importance by analytic hierarchy process(AHP)theory.Based on our model,we analyzed the influence of different types of attacks to the network performance,and also tabled some proposals for reducing the damage that the networks suffered from the cascading failures.     

A Novel Probability-Based Handoff Strategy for Multimedia LEO Satellite Communications

A novel bandwidth allocation strategy and a connection admission control technique arc proposed to improve the utilization of network resource and provide the network with better quality of service （QoS） guarantees in multimedia low earth orbit （LEO） satellite networks. Our connection admission control scheme, we call the probability based dynamic channel reservation strategy （PDR）, dynamically reserves bandwidth for real-time services based on their handoff probability. And the reserved bandwidth for real-time handoff connection can also be used by new connections under a certain probability determined by the mobility characteristics and bandwidth usage of the system. Simulation results show that our scheme not only lowers the call dropping probability （CDP） for Class I real-time service but also maintains the call blocking probability （CBP） to certain degree. Consequently, the scheme can offer very low CDP for rcal-time connections while keeping resource utilization high.     

Virtualized Wireless SDNs： Modelling Delay Through the Use of Stochastic Network Calculus

Software-defined networks(SDN)have attracted much attention recently because of their flexibility in terms of network manage-ment.Increasingly,SDN is being introduced into wireless networks to form wireless SDN.One enabling technology for wirelessSDN is network virtualization,which logically divides one wireless network element,such as a base station,into multiple slices,and each slice serving as a standalone virtual BS.In this way,one physical mobile wireless network can be partitioned into multi-ple virtual networks in a software-defined manner.Wireless virtual networks comprising virtual base stations also need to provideQoS to mobile end-user services in the same context as their physical hosting networks.One key QoS parameter is delay.This pa-per presents a delay model for software-defined wireless virtual networks.Network calculus is used in the modelling.In particu-lar,stochastic network calculus,which describes more realistic models than deterministic network calculus,is used.The model en-ables theoretical investigation of wireless SDN,which is largely dominated by either algorithms or prototype implementations.     

joint target delay determination and rate control for real-time videos in heterogeneous wireless networks

In heterogeneous wireless networks with time-varying channels, the video rate is usually adjusted based on the network bandwidth to guarantee ultra-low latency video transmission under an end-to-end target delay constraint. However, the target delay with a fixed value according to historical experience cannot guarantee the quality of video continuously since wireless network bandwidth changes rapidly, especially when the network deteriorates. An alternative scheme is to dynamically set the target delay according to the network status within an acceptable delay range. However, this scheme cannot be ensured in heterogeneous wireless networks with time-varying channels. Thus, to address this issue, a multi-objective optimization algorithm for joint optimization of rate control and target delay is proposed, where the target delay and video rate are jointly adjusted dynamically. Second, to reduce the optimization complexity due to the multi-objective and multi-parameter characteristics, multi-objective optimization algorithm be decomposed and solved by optimizing each independent sub-problem. Finally, the proposed algorithm is verified on a semi-physical simulation platform. Experiments show that the frame loss rate is reduced from 6.65% to 2.06%, and a peak signal-to-noise ratio (PSNR) gain of 18.32% is obtained when the network performance is low.     

Prototype for Integrating Internet of Things and Emergency Service in an IP Multimedia Subsystem for Wireless Body Area Networks

In recent years, the application of the Internet of Things(Io T) has become an emerging business. The most important concept of next-generation network for providing a common global IT platform is combining seamless networks and networked things, objects or sensors. Also, wireless body area networks(WBANs) are becoming mature with the widespread usage of the Io T. In order to support WBAN, the platform, scenario and emergency service are necessary due to the sensors in WBAN being related to wearer’s life. The sensors on the body detect a lot of information about bioinformatics and medical signals, such as heartbeat and blood.Thus, the integration of Io T and network communication in daily life is important. However, there is not only a lack of common fabric for integrating Io T with current Internet and but also no emergency call process in the current network communication environment. To overcome such situations, the prototype of integrating Io T and emergency call process is discussed. A simulated bootstrap platform to provide the discussion of open challenges and solutions for deploying Io T in Internet and the emergency communication system are analyzed by using a service of 3GPP IP multimedia subsystem. Finally, the prototype for supporting WBAN with emergence service is also addressed and the performance results are useful to service providers and network operators that they can estimate their migration to Io T by referring to this experience and experiment results. Furthermore, the queuing model used to achieve the performance of emergency service in IMS and the delay time of the proposed model is analyzed.     

Load-balance cell association for improving network capacity in heterogeneous cellular networks

Heterogeneous cellular networks improve the spectrum efficiency and coverage of wireless communication networks by deploying low power base station （BS） overlapping the conventional macro cell. But due to the disparity between the transmit powers of the macro BS and the low power BS, cell association strategy developed for the conventional homogeneous networks may lead to a highly unbalanced traffic loading with most of the traffic concentrated on the macro BS. In this paper, we propose a load-balance cell association scheme for heterogeneous cellular network aiming to maximize the network capacity. By relaxing the association constraints, we can get the upper bound of optimal solution and convert the primal problem into a convex optimization problem. Furthermore we propose a Lagrange multipliers based distributed algorithm by using Lagrange dual theory to solve the convex optimization, which converges to an optimal solution with a theoretical performance guarantee. With the proposed algorithm, mobile terminals （MTs） need to jointly consider their traffic type, received signal-to-interference-noise-ratios （SINRs） from BSs, and the load of BSs when they choose server BS. Simulation results show that the load balance between macro and pico BS is achieved and network capacity is improved significantly by our proposed cell association algorithm.     

Survivable Virtual Network Mapping Using Optimal Backup Topology in Virtualized SDN

Software-Defined Network architecture offers network virtualization through a hypervisor plane to share the same physical substrate among multiple virtual networks. However, for this hypervisor plane, how to map a virtual network to the physical substrate while guaranteeing the survivability in the event of failures, is extremely important. In this paper, we present an efficient virtual network mapping approach using optimal backup topology to survive a single link failure with less resource consumption. Firstly, according to whether the path splitting is supported by virtual networks, we propose the OBT-I and OBT-II algorithms respectively to generate an optimal backup topology which minimizes the total amount of bandwidth constraints. Secondly, we propose a Virtual Network Mapping algorithm with coordinated Primary and Backup Topology （VNM-PBT） to make the best of the substrate network resource. The simulation experiments show that our proposed approach can reduce the average resource consumption and execution time cost, while improving the request acceptance ratio of VNs.     

虚拟软件定义网络中采用优化备份拓扑的抗毁虚拟网络映射(英)

Software-Defined Network architecture offers network virtualization through a hypervisor plane to share the same physical substrate among multiple virtual networks.However,for this hypervisor plane,how to map a virtual network to the physical substrate while guaranteeing the survivability in the event of failures,is extremely important.In this paper,we present an efficient virtual network mapping approach using optimal backup topology to survive a single link failure with less resource consumption.Firstly,according to whether the path splitting is supported by virtual networks,we propose the OBT-Ⅰ and OBT-Ⅱ algorithms respectively to generate an optimal backup topology which minimizes the total amount of bandwidth constraints.Secondly,we propose a Virtual Network Mapping algorithm with coordinated Primary and Backup Topology(VNM-PBT)to make the best of the substrate network resource.The simulation experiments show that our proposed approach can reduce the average resource consumption and execution time cost,while improving the request acceptance ratio of VNs.     

Performance analysis and optimization model based on dynamics equation for heterogeneous wireless networks

In this paper, we propose a model based on dynamics equation for performance analysis and optimization for heterogeneous wireless networks(HWNs). First, the channel occupation state with time of HWNs is modelled by dynamics equation, in which users’ mobility as an important factor affecting system performance is considered. Then the steady state probability distribution of channel occupation is derived. Based on the results, the expression of the throughput of HWNs is deduced, which includes a factor ρ which is the ratio of service arrival rate accessing one of the networks to the total service arrival rate in the overlapping area. And this paper proposes to maximize the throughput of the HWNs by optimizing the factor ρ to efficiently utilize the resources. Simulation results show that the proposed optimization method can effectively improve the throughput and in the meanwhile decrease the blocking probability of the whole system.     

Real-time Business Network Selection Based on Auction Mechanism

In the framework of heterogeneous wireless networks, it is difficult for every user to obtain QoS-based services anywhere at any time. Due to heterogeneous networks, the dynamic network selection scheme needs to achieve seamless mobility, and also supports the optimization of service quality and load balancing. According to different business characteristics, this paper describes different real-time businesses in utility functions, and solves network selection problems for real-time businesses. Based on auction mechanism, it introduces the upset price in order to maximize online profits. Meanwhile, the network selection scheme is also helpful to control network congestion. The study of real-time business network selection based on auction mechanism can not only meet the demands of service quality of multiple real- time applications, but also achieves load balancing between different networks.     

Jitter Detection for Synchronization Control in Wireless Multimedia Sensor Networks

Collaborative in-network processing operations in Wireless multimedia sensor networks （WMSNs） often require effective synchronization control. Extensive researches in the traditional networks mainly focus on the synchronization control with the buffer management in the receiver. However, for WMSNs, the chaotic transport channel and low bandwidth introduce serious jitter. Jitter degrades the timing relationship among packets in a single media stream and between packets from different media streams and, hence, creates multimedia synchronization problems. Moreover, too much jitter will also degrade the performance of the streaming buffer. By only employing the buffer management scheme in the receiver, we can hardly satisfy the synchronization requirement of the in-network processing. In this study, we propose an active jitter detection mechanism for the synchronization control in WMSNs. This mechanism will improve the quality of service in multimedia networking by discarding the jitter-corrupted packets immediately and balancing the delay and jitter actively. We implement the proposed scheme in the practical WMSNs platform. The experiment results show that our scheme can reduce the average packet jitter effectively and improve the synchronization controlling performance significantly.     

Overlay networking： applications and research challenges

Overlay networking is one of the perspective solutions to today‘s Internet challenges. At basic service level, overlay networks can serve as a supplement and enhancement of existing services, such as routing and addressing. At high application level, overlay networks can be used for applications, which are difficult to deploy in existing IP architecture with some specific reasons, e.g., they need high-level information, which is hard to obtain by underlying layers. To address the heterogeneity of today‘s Internet, overlay networks provide ways to service availability and desirable performance while retaining scalability. In contrast to changing the existing network layer, overlay networks allow bootstrapping, which is most important in the development of Internet infrastructure. Various applications of overlay networking are clarified in this paper. Research challenges including routing and searching in overlay networking are also identified.     

Improving Security and Sharing in Online Social Efficiency for Encrypted Data Networks

Despite that existing data sharing systems in online social networks （OSNs） propose to encrypt data before sharing, the multiparty access control of encrypted data has become a challenging issue. In this paper, we propose a secure data sharing scheme in 0SNs based on ciphertext-policy attribute- based proxy re-encryption and secret sharing. In order to protect users＇ sensitive data, our scheme allows users to customize access policies of their data and then outsource encrypted data to the OSNs service provider. Our scheme presents a multiparty access control model, which enables the disseminator to update the access policy of ciphertext if their attributes satisfy the existing access policy. Further, we present a partial decryption construction in which the computation overhead of user is largely reduced by delegating most of the decryption operations to the OSNs service provider. We also provide checkability on the results returned from the OSNs service provider to guarantee the correctness of partial decrypted ciphertext. Moreover, our scheme presents an efficient attribute revocation method that achieves both forward and backward secrecy. The security and performance analysis results indicate that the proposed scheme is secure and efficient in OSNs.     

Multifrequency Networking Solution for TD-SCDMA

This paper introduces the characteristics of TD-SCDMA, and analyzes some networking schemes and methods of multifrequency. For the 5 MHz frequency bandwidth, a frequency planning scheme containing three frequencies is examined, and a simulation model is built to validate the performance of this scheme. Finally, this paper analyzes the advantages and disadvantages of the scheme, and proposes some directions for the future study of networking planning.