Game theory-based attack and defense analysis in virtual wireless networks with jammers and eavesdroppers

Dynamic spectrum sharing and cognitive radio networks were proposed to enhance the Radio Frequency(RF)spectrum utilization.However,there are several challenges to realize them in real systems,such as sensing uncertainty causing issues to licensed users,business models for licensed service providers.Wireless virtualization is regarded as a technology that leverages service level agreements to sublease unused or underutilized RF spectrum that addresses aforementioned issues and helps to significantly enhance the utilization of the RF spectrum,offer improved coverage and capacity of networks,enhance network security and reduce energy consumption.With wireless virtualization,wireless networks'physical substrate is shared and reconfigured dynamically between virtual wireless networks through Mobile Virtual Network Operations(MVNOs).Wireless virtualization with dynamic configurable features of Wireless Infrastructure Providers(WIPs),virtualized wireless networks are vulnerable to a multitude of attacks,including jamming attacks and eavesdropping attacks.This paper investigates a means of defense through the employment of coalition game theory when jammers try to degrade the signal quality of legitimate users,and eavesdroppers aim to reduce secrecy rates.Specifically,we consider a virtual wireless network where MVNO users'job is to improve their Signal to Interference plus Noise Ratio(SINR)while the jammers target to collectively enhance their Jammer Received Signal Strength(JRSS),and an eavesdropper's goal is to reduce the overall secrecy rate.Numerical results have demonstrated that the proposed game strategies are effective(in terms of data rate,secrecy rate and latency)against such attackers compared to the traditional approaches.

Network Virtualization Based Seamless Networking Scheme for Fiber-Wireless （FiWi） Networks

In order to reduce cost and complexity,fiber-wireless(FiWi) networks emerge,combining the huge amount of available bandwidth of fiber networks and the flexibility,mobility of wireless networks.However,there is still a long way to go before taking fiber and wireless systems as fully integrated networks.In this paper,we propose a network visualization based seamless networking scheme for FiWi networks,including hierarchical model,service model,service implementation and dynamic bandwidth assignment(DBA).Then,we evaluate the performance changes after network virtualization is introduced.Throughput for nodes,bandwidth for links and overheads leaded by network virtualization are analyzed.The performance of our proposed networking scheme is evaluated by simulation and real implementations,respectively.The results show that,compared to traditional networking scheme,our scheme has a better performance.

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 management. Increasingly, SDN is being introduced into wireless networks to form wireless SDN. One enabling technology for wireless SDN 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 multiple virtual networks in a software-defined manner. Wireless virtual networks comprising virtual base stations also need to provide QoS to mobile end-user services in the same context as their physical hosting networks. One key QoS parameter is delay. This paper presents a delay model for software-defined wireless virtual networks. Network calculus is used in the modelling. In particular, stochastic network calculus, which describes more realistic models than deterministic network calculus, is used. The model enables theoretical investigation of wireless SDN, which is largely dominated by either algorithms or prototype implementations.

A Distributed Virtual Backbone Formation for Wireless Ad Hoc and Sensor Networks

The virtual backbone is an approach for solving routing problems in wireless ad hoc and sensor networks. A connected dominating set (CDS) was proposed as a virtual backbone to improve the performance of wireless networks. The quality of a virtual backbone is measured not only by approximation factor, which is the ratio of its size to that of minimum CDS, but also time complexity and message complexity. In this paper, a distributed algorithm is presented to construct a minimum CDS for ad hoc and sensor networks. By destroying triangular loops in the virtual backbone, the proposed algorithm can effectively construct a CDS with smaller size. Moreover, our algorithm, which is fully localized, has a constant approximation ratio, linear message and time complexity, and low implementation complexity. The simulation results and theoretical analysis show that our algorithm has better efficiency and performance than conventional approaches.

Energy-efficient low-latency virtual cluster synchronization algorithm based on SMAC protocol in wireless sensor networks

The MAC protocol design for wireless sensor networks has been researched and developed for decades. SMAC protocol is a famous energy-efficient MAC protocol. Based on SMAC protocol, we find that the boundary nodes in the cluster-shaped synchronization structure bring energy consumption seriously, and provide a virtual cluster aggregation (VCA) algorithm. Because the bounder node follows multiple schedules in one cycle, it may deplete earlier and cause segmentation in wireless sensor networks. The algorithm reduces energy consumption of boundary nodes and extends the lifetime of entire sensor network by merging different virtual clusters, but increases the data transmission delay. Because the sensor nodes have the fixed duty cycle, the larger the coverage area of network is, the greater the data transmission delay increases. We propose the dynamic duty cycle (DDC) algorithm to solve this effect. When the network load and data transmission delay increase, the DDC algorithm exponentially changes the duty cycle of the node to reduce latency. The simulation results show that the performance of SMAC with the VCA and DDC algorithm obtains improvement significantly.

Essential Topics on Constructing WCDS-based Virtual Backbone in Wireless Sensor/Mesh Networks

Clustering or connected dominating set (CDS) both approaches can establish a virtual backbone (VB) in wireless sensor networks (WSNs) or wireless mesh networks (WMNs). Each cluster consisting of a cluster head (CH) and its neighboring nodes can form a dominating set. After some bridging nodes were selected, cluster heads (CHs) connected through these bridging nodes naturally formed a CDS. Although CDS provides obvious backbone architecture, however, the number of cluster heads and bridging nodes may be too large, this may cause the loss of advantages of virtual backbone. When we effectively reduce their numbers, more effectively WCDS (Weakly Connected Dominating Set) can be fining out. Some essential topics on constructing WCDS-based VB in WSN/WMN are discussed in this paper. From the point of view of three different protocol layers, including network (NWK) layer, MAC layer, and physical (PHY) layer, we explore their cross-layer research topics and design algorithms. For NWK layer, area-based WCDS algorithms and routing strategies including via VB and not via VB are discussed. For MAC layer, a WCDS-based energy-efficient MAC protocol is presented. For PHY layer, battery-aware alternative VB selections and sensor nodes with different transmission ranges are addressed.

Virtual 5G Network Embedding in a Heterogeneous and Multi-Domain Network Infrastructure

The pursuit of the higher performance mobile communications forces the emergence of the fifth generation mobile communication(5G). 5G network, integrating wireless and wired domain, can be qualified for the complex virtual network work oriented to the cross-domain requirement. In this paper, we focus on the multi-domain virtual network embedding in a heterogeneous 5G network infrastructure, which facilitates the resource sharing for diverse-function demands from fixed/mobile end users. We proposed the mathematical ILP model for this problem.And based on the layered-substrate-resource auxiliary graph and an effective six-quadrant service-type-judgment method, 5G embedding demands can be classified accurately to match different user access densities. A collection of novel heuristic algorithms of virtual 5G network embedding are proposed. A great deal of numerical simulation results testified that our algorithm performed better in terms of average blocking rate, routing latency and wireless/wired resource utilization, compared with the benchmark.

A New Distributed Localization Scheme for Wireless Sensor Networks

在无线传感器网络(WSN ) 的节点本地化是被对待一功能目标在纸从一个新奇观点追踪双。与在 WSN 的传统的追踪问题不同，使用静态的地点商品节点估计动人的目标，活动节点被用来帮助未知节点精确地发现他们的位置。一个新节点本地化计划虚拟烽火精力比率本地化(VB-ERL ) 和它为 WSN 的精炼被介绍。在计划，活动节点基于 Gauss-Markov 活动性模型搬到监视者地并且周期性地广播信息包。每个静态的未知节点在它的察觉到的范围收到虚拟烽火和精力，并且由发现一套超球面的交叉估计它的地点。模拟结果证明建议计划是有效的。

Lifetime Optimization via Network Sectoring in Cooperative Wireless Sensor Networks

Employing cooperative communication in multihop wireless sensor networks provides the network with significant energy efficiency. However, the lifetime of such a network is directly dependant upon the lifetime of each of its individual sections (or clusters). Ignoring the fact that those sections close to sink have to forward more data (their own data plus the data received from the previous sections) and hence die sooner with considering equal section sizes, leads to a sub-optimal lifetime. In this paper, we optimize the section sizes of a multihop cooperative WSN so that it maximizes the network lifetime. Simulation results demonstrate a significant lifetime enhancement for the proposed optimal sectoring.

A Sensor Awakening Algorithm for Wireless Multimedia Sensor Networks Three Dimensional Target Tracking

For node awakening in wireless multi-sensor networks, an algorithm is put forward for three dimensional tar- get tracking. To monitor target dynamically in three dimensional area by controlling nodes, we constract vir- tual force between moving target and the current sense node depending on the virtual potential method, then select the next sense node with information gain function, so that when target randomly move in the specific three dimensional area, the maximum sensing ratio of motion trajectory is get with few nodes. The proposed algorithm is verified from the simulations.

A Void Avoidance Scheme for Grid-Based Multipath Routing in Underwater Wireless Sensor Networks

This work proposes a geographic routing protocol for UWSNs based on the construction of a 3D virtual grid structure, called Void-Avoidance Grid-based Multipath Position-based Routing (VA-GMPR). It consists of two main components, the multipath routing scheme and the grid-based void avoidance (GVA) mechanism for handling routing holes. The multipath routing scheme adopts node-disjoint routes from the source to the sink in order to enhance network reliability and load balancing. While the GVA mechanism handles the problem of holes in 3D virtual grid structure based on three techniques: Hole bypass, path diversion, and path backtracking. The performance evaluation of the VA-GMPR protocol was compared to a recently proposed grid-based routing protocol for UWSNs, called Energy-efficient Multipath Geographic Grid-based Routing (EMGGR). The results showed that the VA-GMPR protocol outperformed the EMGGR protocol in terms of packet delivery ratio, and end-to end-delay. However, the results also showed that the VA-GMPR protocol exhibited higher energy consumption compared to EMGGR.

Calculation of Minimal Dominating Set in Wireless Sensor Network with Host Switch-on/off

This paper proposes a simple and efficient distributed algorithm for calculating minimal dominating set in wireless sensor network. This method can avoid maintaining the connectivities between backbone hosts. Considering that the hosts in mobile networks have different characteristics, this paper proposes a method of calculating minimal dominating set with weight. The nodes can be chosen to form a minimal dominating set when the network topology changes. For the host switch on/off operation, the updating algorithm was provided. The change in the status of a hostaffects only the status of hosts in the restricted vicinity. Simulation results show that the proposed method can ensure fewer dominators but with higher weight to form the minimal dominating set and the nodes can be adaptive to the changes of network topology.

Energy Consumption Power Aware Data Delivery in Wireless Network

In this paper, we present the virtual desktop that uses a novel methodology and related metrics to benchmark thin client based on Data Delivery Networks (DDN) in terms of scalability and reliability. Most studies of the wireless networks mainly focus on system performance and power consumption circuit system;the main target has been separated in terms of Data operation and GUI operation by DDN. The communication protocol for wireless communication may play a major role in energy consumption and other important factors. The portable devices like Personal Digital Assistance (PDA) and others are mainly focusing on the efficient energy consumption (power control) in wireless networks. Here we focus on energy efficiency, algorithmic efficiency, virtualization and resource allocation;these are the main aims of the authors. The foremost research in the direction of wireless computing in saving energy and reducing carbon foot prints is also the challenging part. This is the study proof of brief account of wireless networks.

基站无线回传技术研究

有些场景光纤传输部署困难、成本高、周期长,需研究使用无线传输将基站和核心网连通。首先介绍了无线回传的应用场景,详细论述和对比了实现无线回传的可行技术方案,分析了无线回传中头开销、MTU和时延的影响,为特定场景使用无线回传方案提供了参考。

基于GSA算法的WVN资源映射数学模型

由于传统方法没有从满足成本最小需求角度出发,建立虚拟网络映射目标,导致底层链路利用率较高,剩余带宽较低以及请求接受率不高的问题,于是研究基于GSA算法的无线虚拟网络资源映射数学模型。充分考虑无线虚拟网络资源映射成本、映射收益以及虚拟网络请求接受率建立数学模型,设置节点CPU资源约束、节点映射位置约束、链路带宽资源约束等约束作为约束条件。选取遗传算法与模拟退火算法结合的GSA算法,通过编码、参数初始化、模拟退火操作、选取种群、交叉与变异、退火操作六步骤求解所建立数学模型,实现无线虚拟网络资源的有效映射。实验结果表明,采用上述模型可降低移动网络运营商成本,虚拟网络请求接受率高于92%,提升了虚拟网络资源映射成功率。

基于虚拟网络的无线网络应用

在基于虚拟网络技术的基础上进行无线网络组网,可以将一个传统的独立无线物理网络逻辑划分成不同平面的网络,每个网络平面可以根据企业的具体业务需求实现不同的网络功能,具有良好的扩展性和灵活性,支持跨地域组网,同时降低了企业无线网络的建设成本。多平面的网络相对独立,实现了不同业务之间的安全隔离,大大提高了企业无线网络的安全性。

一种能量均衡的水下无线传感器网络覆盖空洞修补方法

针对现有水下无线传感器网络空洞修补方法需要空洞边界探测、通信和计算开销大、覆盖率和能量均衡性差、水下环境模型过于理想化等问题,考虑水底地形复杂,且通常存在较大障碍物等环境因素,建立了基于能量的节点之间、区域边界、零能量空洞、低能量覆盖洞、水底地形及障碍物作用力等多维度的虚拟力模型,提出了基于上述虚拟力模型和能量均衡的空洞修补算法。该算法不需要精确的空洞边界探测,对水下复杂地形和不同环境具有良好的适应性和鲁棒性。此外,提出的对低能量节点、低能量覆盖洞冗余修补的策略,显著提高了修补后网络能量分布的均衡性,减少了因低能量节点的能量很快耗尽而出现新的覆盖空洞的频率,减少了空洞修补频次,降低了网络维护成本。

无线传感器网络中基于μ律爆炸算子的烟花虚拟力混合覆盖策略

针对烟花算法在无线传感器网络节点部署过程中易陷入局部最优导致节点分布不均匀、后期收敛速度慢等问题,本文提出一种基于μ律爆炸算子的烟花虚拟力混合算法(μFW–VFA).首先,采用μ律特性曲线重新定义爆炸算子,增强烟花间的差异性,通过动态调整μ值使烟花爆炸的数目和幅度随迭代次数动态调整,以平衡烟花局部和全局的寻优能力.其次,引入虚拟力调节停滞烟花内传感器节点的位置信息,加速烟花种群进化,增强算法跳出局部最优的能力,提高算法收敛速度.仿真实验表明,经μFW–VFA部署后,网络的重叠区域和监测盲区显著减少,有效提升了网络覆盖率并压缩节点移动距离.