一种SUTN网络中用户接入信道的调度算法

针对多用户的卫星-无人机-地面通信网络(SUTN)的用户接入信道问题,提出基于遍历容量的调度算法(ECSA)。卫星通过空间光通信(FSO)向无人机(UAV)传输数据;UAV采用无线通信射频(RF)链路向用户传输数据。ECSA算法通过推导无人机端和用户端的信噪比,再推导出信噪比的概率密度函数,然后依据概率密度函数计算用户的遍历容量;最后,依据公平原则,并结合用户的遍历容量,计算用户的目标函数,将具有最大的目标函数值的用户优先接入信道。仿真结果表明,相比于轮流调度算法,提出的ECSA算法有效提高了系统容量。     

基于启发式WCA的WMNs多网关选址方法

为了保证可扩展性,分簇是设计无线网格网(WMNs)的必然选择,而多网关选址是分簇规划的核心。分析了WMNs多网关选址的服务质量(QoS)约束条件,以及现有方法的缺陷,提出了一种基于启发式加权分簇算法(WCA)的WMNs多网关选址方法。在节点数量不是非常多的情况下,还提出可以采用基于布尔代数的最优化方法进行WMNs多网关选址,该方法可以提高网络的鲁棒性。算法仿真表明,本文提出的方法取得了良好的效果。     

基于交叉层设计的MIMO Ad—hoc网络的MAC层调度算法

在应用多入多出(MIMO)技术的无线Ad-hoc网络中,基于交叉层优化,设计了介质访问控制(MAC)层的优化调度算法。通过网络层、MAC层及物理层交换关键参数信息,在各无线节点分布式地进行优化调度,以选择发送节点以及在这些节点上进行流分配,选择用于发送数据的天线阵列子集,从而提高整体网络的性能。仿真结果显示,与简单单链路算法相比,交叉层设计优化算法可以显著提高MIMOAd-hoc网络的整体容量。     

基于任务相关性的无线传感器网络任务调度算法

针对现有无线传感器网络中的静态调度算法(SCP算法)在调度具有相关性任务时的缺陷,提出了一种调度簇树并加以研究,在此基础上提出了一种新的基于任务复制的聚簇调度算法(ICS算法).通过与SCP算法进行比较,ICS算法可以在不增加任务的完成时间的同时,减少所需节点的个数,进而减少重复任务的计算和不同节点间的通信开销,以达到降低网络能耗的目的.     

智能反射面辅助的混合FSO/RF系统建模和分析

针对自由空间光(FSO)链路视距受限问题，提出了一种光智能反射面（OIRS）辅助的混合FSO/射频(RF)系统，介绍了系统模型。OIRS用于解决障碍物遮挡问题，其辅助的FSO链路服从几何和抖动误差下的Malaga分布，RF链路服从任意相关的Nakagami-m分布，并在目的节点采用等增益合并接收技术。推导了混合FSO/RF系统的中断概率、平均误码率的闭合表达式，并对中断概率进行渐近分析。仿真结果表明：OIRS辅助的混合FSO/RF系统中断和误码性能取决于质量更差的一条信道，二进制相移键控调制误码性能优于二进制频移键控调制。     

面向无线网络容量和覆盖优化的分组调度算法

为了实现无线网络资源的高效利用,该文基于增强边缘用户调度公平性的目标提出一种通过参数来调节覆盖和容量目标的比例公平(-CCPF)分组调度算法,其可用于网络覆盖和容量优化(CCO)。该文首先证明该算法的收敛性,之后基于业务量分布、功率调整及该分组调度算法提出CCO机制,并在长期演进(LTE)网络下的一个试验的规则场景和一个基于实际网络数据的非规则场景中进行了仿真,验证了该机制能够在覆盖-容量优化机制下,实现更合理的资源利用率(RO),并同比例公平(-PF)算法相比在理论场景和实际场景下平均用户吞吐量分别提升了19%和33%。     

通信网络基于抗毁性的链路容量设计

本文定义了一种基于业务需求对的抗毁性量度，并且提出了一种相应的路径算法。在此基础上描述了通信网络基于抗毁性的链路容量设计方法。文中以一个８节点网络为例，给出了以该算法为基础的链路容量设计的计算机仿真结果。     

光突发交换网络中基于标记可抢占的调度算法

根据光突发交换(OBS)网络核心节点的结构和功能 特点,分析了OBS网络核心节点的数据信道 调度算法,提出了一种新的基于标记可抢占调度算法(LPSA),并讨论和分析了算法的实 现过程。本文算法根据到达核心节点的控制包所属业务等级的突发数据(OB)包占用的网络带 宽决定 数据信道调度的方法,实现了合理的使用数据信道和各业务类别间的业务区分,最终达到改 善OBS网络性能的目的。     

无线传感器网络中AOA节点定位改进算法研究

基于信号到达角度(AOA)的定位算法是一种常见的无线传感器网络节点自定位算法,算法通信开销低,定位精度较高。由于各种原因,估测的多个节点位置可能存在不可靠位置,提出了一种改进的基于信号到达角的定位方法,通过过滤误差较大的估计位置,来提高定位的精度。仿真结果表明,本文提出的改进算法很好地提高了定位精度。     

基于控制分组收集的数据信道调度算法

在OBS网络中,核心节点的调度算法是影响网络交换性能的重要因素.如何有效地对数据突发(Data Burst)分组进行合理调度,提高信道利用率,减少丢包率是关键问题所在.在讨论了两种数据信道调度算法的基础上提出了一种BHP收集调度算法,该算法在一个收集周期内对到达的多个BHP所对应的突发数据进行集中调度,从而达到合理调度.仿真结果表明BHP收集调度算法比其他两种算法的突发丢失率性能都要好.     

Survivable deployment of cloud-integrated fiber-wireless networks against multi-fiber failure

Cloud-integrated fiber-wireless (FiWi) networks inheriting advantages of optical and wireless access networks have a broad prospect in the future. As various component failures may occur in cloud-integrated FiWi networks, survivability is becoming one of the key important issues. It is necessary to provide survivability strategies for cloud-integrated FiWi networks. Hence, this paper mainly focuses on the survivability of cloud-integrated FiWi networks against multiple fibers failure. Firstly, in this paper, a novel integer linear programming (ILP) solution is proposed to tolerate the failure of multiple distribution fibers with capacity and coverage constraints in the context of urban area. Then, considering the complexity of ILP models, an efficient heuristic scheme is proposed, in order to get the approximate solutions of ILP. Simulation results and analysis give the configurations of optical network units (ONUs) and wireless routers with different constraints and show the network coverage of clients for different number of ONUs and wireless routers with ILP solution and heuristic approach, respectively.     

A genetic algorithm based approach for energy efficient routing in two-tiered sensor networks

Higher power relay nodes can be used as cluster heads in two-tiered sensor networks to achieve improved network lifetime. The relay nodes may form a network among themselves to route data towards the base station. In this model, the lifetime of a network is determined mainly by the lifetimes of these relay nodes. An energy-aware communication strategy can greatly extend the lifetime of such networks. However, integer linear program (ILP) formulations for optimal, energy-aware routing quickly become computationally intractable and are not suitable for practical networks. In this paper, we have proposed an efficient solution, based on a genetic algorithm (GA), for scheduling the data gathering of relay nodes, which can significantly extend the lifetime of a relay node network. For smaller networks, where the global optimum can be determined, our GA based approach is always able to find the optimal solution. Furthermore, our algorithm can easily handle large networks, where it leads to significant improvements compared to traditional routing schemes.     

A distributed activity scheduling algorithm for wireless sensor networks with partial coverage

One of the most important design objectives in wireless sensor networks (WSN) is minimizing the energy consumption since these networks are expected to operate in harsh conditions where the recharging of batteries is impractical, if not impossible. The sleep scheduling mechanism allows sensors to sleep intermittently in order to reduce energy consumption and extend network lifetime. In applications where 100% coverage of the network field is not crucial, allowing the coverage to drop below full coverage while keeping above a predetermined threshold, i.e., partial coverage, can further increase the network lifetime. In this paper, we develop the distributed adaptive sleep scheduling algorithm (DASSA) for WSNs with partial coverage. DASSA does not require location information of sensors while maintaining connectivity and satisfying a user defined coverage target. In DASSA, nodes use the residual energy levels and feedback from the sink for scheduling the activity of their neighbors. This feedback mechanism reduces the randomness in scheduling that would otherwise occur due to the absence of location information. The performance of DASSA is compared with an integer linear programming (ILP) based centralized sleep scheduling algorithm (CSSA), which is devised to find the maximum number of rounds the network can survive assuming that the location information of all sensors is available. DASSA is also compared with the decentralized DGT algorithm. DASSA attains network lifetimes up to 92% of the centralized solution and it achieves significantly longer lifetimes compared with the DGT algorithm.     

Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.     

MST-based topology control with NLOS location error compensation for location-aware networks

The topology control algorithms can improve the network capacity and network lifetime in location-aware networks. The topology control algorithms require accurate locations of mobile nodes or distances between each of the mobile nodes. The IEEE 802.15.4a-based location-aware networks can provide precise ranging distance between two mobile nodes. The mobile nodes can obtain their accurate locations by using accurate ranging distances. However, in the IEEE 802.15.4a networks, the ranging distance has a large measurement error in non-line-of-sight (NLOS) conditions. In this paper, we propose MST-based topology control with NLOS location error compensation algorithm to improve location accuracy and prevent mobile nodes from connecting to unstable links in NLOS condition. Performance evaluation shows the proposed algorithm constructs a topology map which has low location errors with considering the instability of NLOS links in NLOS condition.     

Random Network Coding Based Schemes for Perfect Wireless Packet Retransmission Problems in Multiple Channel Networks

Solving WPRTPs (wireless packet retransmission problems) using NC (network coding) is increasingly attracting research efforts. However, no work on NC based schemes for WPRTPs in MCNs (multiple channel networks) has been found. In this paper, RNC (random network coding) based schemes for P-WPRTPs (perfect WPRTPs) in MCNs, denoted as MC-P-WPRTPs (multiple channel perfect WPRTPs), are studied by transforming MC-P-WPRTPs into ILP (integer linear programming) problems. The ILP problems corresponding to MC-P-WPRTPs with four typical configurations are derived. Then the corresponding packet retransmission schedule schemes for MC-P-WPRTPs are proposed based on the solutions to the ILP problems and random network coding. To solve the ILP problems efficiently, an algorithm named as progressively fixing algorithm is proposed which recursively reduce the size of the ILP problem by fixing some of the variables according to some criteria. The criteria are related to the solution to the LP problem obtained by relaxing the integral constraints on the variables in the original ILP problem. Simulation results show that the NC based schemes for MC-P-WPRTPs are effective in saving packet retransmissions. In some situations, NC based schemes can save about 50 % packet retransmissions.     

可生存的虚拟网络多层映射方法研究

本文研究了可生存虚拟网络多层映射问题,首先对其建立了整数线性规划模型（ILP）,然后针对较大规模问题提出一种高效的启发式算法VNP-SVNME对其进行求解.实验表明,VNP-SVNME算法的资源映射开销相对ILP仅平均高15%,且优于现有的启发式可生存算法.此外,VNP-SVNME算法的映射时间相对ILP大大降低,可以满足在线虚拟网络映射的需求.     

一种基于位置和DHT的移动ad hoc网络服务发现方案

移动ad hoc网络中要求各节点问在缺乏预备知识的情况下进行相互通讯和协作，因此，对网络中各种服务的自动发现成为了其中的一个关键问题。将各节点的位置信息和DHT技术结合起来．提出了一种高效的面向移动ad hoc网络的服务发现方案。首先直接基于网络的物理拓扑结构来构建一种分布式哈希表．从而有效地消除了现有DHT方案的拓扑结构不匹配问题。然后提出了一种维度映射的方案．以将多维的服务描述信息映射到二维的哈希键值空间上。最后提出一种区域搜索算法，以高效地支持对服务的条件查询。     

Fault-tolerant monitor placement for out-of-band wireless sensor network monitoring

Monitoring a sensor network to quickly detect faults is important for maintaining the health of the network. Out-of-band monitoring, i.e., deploying dedicated monitors and transmitting monitoring traffic using a separate channel, does not require instrumenting sensor nodes, and hence is flexible (can be added on top of any application) and energy conserving (not consuming resources of the sensor nodes). In this paper, we study fault-tolerant out-of-band monitoring for wireless sensor networks. Our goal is to place a minimum number of monitors in a sensor network so that all sensor nodes are monitored by k distinct monitors, and each monitor serves no more than w sensor nodes. We prove that this problem is NP-hard. For small-scale network, we formulate the problem as an Integer Linear Programming (ILP) problem, and obtain the optimal solution. For large-scale network, the ILP is not applicable, and we propose two algorithms to solve it. The first one is a ln(kn) approximation algorithm, where n is the number of sensor nodes. The second is a simple heuristic scheme that has much shorter running time. We evaluate our algorithms using extensive simulation. In small-scale networks, the latter two algorithms provide results close to the optimal solution from the ILP for relatively dense networks. In large-scale networks, the performance of these two algorithms are similar, and for relatively dense networks, the number of monitors required by both algorithms is close to a lower bound.     

Lifetime maximization via cooperative nodes and relay deployment in wireless networks

Extending lifetime of battery-operated devices is a key design issue that allows uninterrupted information exchange among distributed nodes in wireless networks. Cooperative communications has recently emerged as a new communication paradigm that enables and leverages effective resource sharing among cooperative nodes. In this paper, a general framework for lifetime extension of battery-operated devices by exploiting cooperative diversity is proposed. The framework efficiently takes advantage of different locations and energy levels among distributed nodes. First, a lifetime maximization problem via cooperative nodes is considered and performance analysis for M-ary PSK modulation is provided. With an objective to maximize the minimum device lifetime under a constraint on bit-error-rate performance, the optimization problem determines which nodes should cooperate and how much power should be allocated for cooperation. Since the formulated problem is NP hard, a closed-form solution for a two-node network is derived to obtain some insights. Based on the two-node solution, a fast suboptimal algorithm is developed for multi-node scenarios. Moreover, the device lifetime is further improved by a deployment of cooperative relays in order to help forward information of the distributed nodes in the network. Optimum location and power allocation for each cooperative relay are determined with an aim to maximize the minimum device lifetime. A suboptimal algorithm is developed to solve the problem with multiple cooperative relays and cooperative nodes. Simulation results show that the minimum device lifetime of the network with cooperative nodes improves 2 times longer than the lifetime of the non-cooperative network. In addition, deploying a cooperative relay in a proper location leads up to 12 times longer lifetime than that of the non-cooperative network