A scalable joint routing and scheduling scheme for large-scale wireless sensor networks

The multihop configuration of a large-scale wireless sensor network enables multiple simultaneous transmissions without interference within the network. Existing time division multiple access (TDMA) scheduling schemes exploit gain based on the assumption that the path is optimally determined by a routing protocol. In contrast, our scheme jointly considers routing and scheduling and introduces several new concepts. We model a large-scale wireless sensor network as a tiered graph relative to its distance from the sink, and introduce the notion of relay graph and relay factor to direct the next-hop candidates toward the sink fairly and efficiently. The sink develops a transmission and reception schedule for the sensor nodes based on the tiered graph search for a set of nodes that can simultaneously transmit and receive. The resulting schedule eventually allows data from each sensor node to be delivered to the sink. We analyze our scheduling algorithm both numerically and by simulation, and we discuss the impact of protocol parameters. Further, we prove that our scheme is scalable to the number of nodes, from the perspectives of mean channel capacity and maximum number of concurrent transmission nodes. Compared with the existing TDMA scheduling schemes, our scheme shows better performance in network throughput, path length, end-to-end delay, and fairness index.     

Cross-layer resource allocation over wireless relay networks for quality of service provisioning

The authors propose a physical-datalink cross-layer resource allocation scheme over wireless relay networks for quality-of-service (QoS) guarantees. By integrating information theory with the concept of effective capacity, the proposed scheme aims at maximizing the relay network throughput subject to a given delay QoS constraint. This delay constraint is characterized by the so-called QoS exponent thetas, which is the only requested information exchanged between the physical layer and the datalink layer in our cross-layer design based scheme. Over both amplify-and-forwards (AF) and decode-and-forward (DF) relay networks; the authors develop the associated dynamic resource allocation algorithms for wireless multimedia communications. Over DF relay network, the authors also study a fixed power allocation scheme to provide QoS guarantees. The simulations and numerical results verify that our proposed cross-layer resource allocation can efficiently support diverse QoS requirements over wireless relay networks. Both AF and DF relays show significant superiorities over direct transmissions when the delay QoS constraints are stringent. On the other hand, the results demonstrate the importance of deploying the dynamic resource allocation for stringent delay QoS guarantees.     

支持紧急通信的无线认知网络频谱接入方法

提出了支持应急通信的无线认知网络机会频谱接入模型。首先按照离散时间完全和限定(k=1)服务两级轮询策略实现主用户和次用户对频谱的共享。其次,通过在数据确认中捎带轮询列表信息方式实现数据传输和用户调度的并行处理,减少用户切换造成的时延浪费。通过建模分析得出网络吞吐量及用户平均等待时延的精确解析,结果表明本方案能有效抑制次用户对主用户通信质量的影响,又能增加网络吞吐量并为通信业务提供时延保障。     

Distributed Proportional Fair Scheduling for IEEE802.11 Wireless LANs

In the time varying wireless channel, opportunistic scheduling is one of the important techniques to achieving the rich diversities inherent in wireless communications. However, most existing scheduling schemes require centralized scheduling and little work has been done on developing distributed algorithms The proportional fair scheduling is one of the representative opportunistic scheduling for centralized networks. In this paper, we propose distributed proportional fair scheduling (DPFS) scheme for wireless LAN network. In the proposed DPFS scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed DPFS using extensive simulation and simulation results show that DPFS obtains higher network throughput than conventional scheduling schemes while maintaining fairness among users.     

分布式队列服务算法在无线网状网包调度中的应用

根据无线网状网的包调度特点,结合已有的差分队列服务算法和分布式贝尔曼-福特算 法,将有线网络中的差分队列服务算法改进为分布式队列服务算法（DQS）,使之实用于无 线网状网中多任务条件下实现系统的吞吐量最大化。仿真实验证明了DQS算法能有效地避免 传统多径传输中的按“类”或 “流”来进行调度的缺陷,有效地减少了数据包的端到端 延时和缓冲区需求,尤其是DQS算法的实际平均吞吐量性能有了很大的提高。     

Performance Analysis of Network Coding Based Two-Way Relay Wireless Networks Deploying IEEE 802.11

In this paper, we investigate the performance analysis of the IEEE 802.11 DCF protocol at the data link layer. We analyze the impact of network coding in saturated and non-saturated traffic conditions. The cross-layer analytical framework is presented in analyzing the performance of the encode-and-forward (EF) relaying wireless networks. This situation is employed at the physical layer under the conditions of non-saturated traffic and finite-length queue at the data link layer. First, a model of a two-hop EF relaying wireless channel is proposed as an equivalent extend multi-dimensional Markovian state transition model in queuing analysis. Then, the performance in terms of queuing delay, throughput and packet loss rate are derived. We provide closed-form expressions for the delay and throughput of two-hop unbalanced bidirectional traffic cases both with and without network coding. We consider the buffers on nodes are unsaturated. The analytical results are mainly derived by solving queuing systems for the buffer behavior at the relay node. To overcome the hidden node problem in multi hop wireless networks, we develop a useful mathematical model. Both models have been evaluated through simulations and simulation results show good agreement with the analytical results.     

Cross-Layer MAC Protocol and Holistic Opportunistic Scheduling with Adaptive Power Control for QoS in WiMAX

Providing quality of service (QoS) to different service classes with integrated real-time and non-real-time traffic is an important issue in broadband wireless access networks. Opportunistic MAC (OMAC) is a novel view of communication over spatiotemporally varying wireless link whereby the multi-user diversity is exploited rather than combated to maximize bandwidth efficiency or system throughput. It combines cross-layer design features and opportunistic scheduling scheme to achieve high utilization while providing QoS support to various applications. Channel characteristics, traffic characteristics and queue characteristics are the essential factors in the design of opportunistic scheduling algorithms. In this paper, we propose a cross-layer MAC scheduling framework in WiMAX point-to-multipoint (PMP) systems and a corresponding opportunistic scheduling algorithm with an adaptive power control scheme to provide QoS support to the heterogeneous traffic. Extensive simulation experiments have been carried out to evaluate the performance of our proposal. The simulation results show that our proposed solution can improve the performance of the WiMAX PMP systems in terms of packet loss rate, packet delay and system throughput.     

Utility Based Short-term Throughput Driven Scheduling Approach for Efficient Resource Allocation in CDMA Wireless Networks

In this paper, we address the problem of efficient recourse allocation in CDMA wireless networks supporting multimedia services with various and often diverse QoS prerequisites, placing special emphasis on real-time services’ essential requirements satisfaction. We first provide an analytical framework for studying real-time users’ short-term delay and throughput properties under fundamental opportunistic scheduling policies. The corresponding results demonstrate that probabilistic delay constraints are insufficient indicators of real-time services’ QoS prerequisites, while probabilistic short-term throughput requirements are more appropriate in asserting their performance expectations. Based on these observations and results, we propose and develop a scheduling policy for efficiently supporting heterogeneous services that include delay-tolerant non-real-time and delay-sensitive real-time services, over a wireless CDMA system under a common utility based framework. A user’s utility characterizes his degree of satisfaction for the received service as well as QoS expectations fulfillment, in a normalized way. Aiming at the maximization of users’ utilities, both non-real-time services’ long-term and real-time services’ short-term throughput QoS requirements are met, under the proposed opportunistic scheduler. Finally, via modeling and simulation it is demonstrated that significant performance improvements concerning both types of services’ QoS requirements satisfaction are achieved through the proposed scheduling approach.     

Transmission scheduling in a multi‐channel wireless network with bidirectional relaying links

Using network coding in a wireless network can potentially improve the network throughput. On the other hand, it increases the complexity of resource allocations as the quality of one transmission is affected by the link conditions of the transmitter to multiple receivers. In this work, we study time slot scheduling and channel allocations jointly for a network with bidirectional relaying links, where the two end nodes of each link can exchange data through a relay node. Two scenarios are considered when the relay node forwards packets to the end nodes. In the first scenario, the relay node always forwards network‐coded packets to both end nodes simultaneously; in the second scenario, the relay node opportunistically uses network coding for two‐way relaying and traditional one‐way relaying. For each scenario, an optimization problem is first formulated for maximizing the total network throughput. The optimum scheduling is not causal because it requires future information of channel conditions. We then propose heuristic scheduling schemes. The slot‐based scheduling maximizes the total transmission rate of all the nodes at each time slot, and the node‐based scheduling schedules transmissions based on achievable transmission rates of individual nodes at different channels. The node‐based one has lower complexity than the slot‐based one. Our results indicate that although the node‐based scheduling achieves slightly lower throughput than the slot‐based one, both the proposed scheduling schemes are very effective in the sense that the difference between their throughput and the optimum scheduling is relatively small in different network settings. Copyright © 2015 John Wiley & Sons, Ltd.     

QoS-, Queue-and Channel-Aware Packet Scheduling for Multimedia Services in Multiuser SDMA/TDMA Wireless Systems

With the growing demand for wireless multimedia services and continuing emergence of new multimedia applications, it is necessary for the network to provide various levels of quality of service (QoS) while maximizing the utilization of channel resources. This paper presents an adaptive queuing model and a novel cross-layer packet scheduling algorithm for providing differentiated QoS and effective channel utilization in a space-division-multiple-access/time-division-multiple-access (SDMA/TDMA) system. At the medium access control (MAC) layer, we take into consideration the heterogeneous and bursty nature of multimedia traffic and provide for QoS requirements. At the physical (PHY) layer, we exploit the randomness of the physical channel by incorporating opportunistic scheduling and adopting adaptive modulation and coding (AMC). Performance results obtained by simulations show that by employing the proposed queuing model and packet scheduling algorithm, the system is able to provide for diverse QoS and achieve high throughput.     

An adaptive opportunistic retransmission control scheme environment-aware-based for wireless multimedia Mesh networks

In this paper, we propose an aware-based adaptive opportunistic retransmission control scheme for wireless multimedia Mesh networks. The proposed scheme provides maximum retransmission count optimization based on environment-aware to improve packet relay probability. The scheme discriminates the types of packet loss in wireless link by means of environment information and selects the retransmission count by taking the IEEE 802.11 wireless channel characteristics into consideration. Furthermore, the maximum retransmission count of MAC is adjusted adaptively. Extensive simulations demonstrate that the proposed scheme significantly reduces packet collision probability and packet loss rate, and thus improves network throughput.     

Taking Full Advantage of Multiuser Diversity in Mobile Ad Hoc Networks

Multiuser diversity has been shown to increase the throughput of mobile ad hoc wireless networks (MANETs) when compared to fixed wireless networks. This paper addresses a multiuser diversity strategy that permits one of multiple one-time relays to deliver a packet to its destination. We show that the throughput of the original single one-time relay strategy is preserved by our multi-copy technique. The reason behind achieving the same asymptotic throughput is the fact that, as we demonstrate in this paper, interference for communicating among closest neighbors is bounded for different channel path losses, even when goes to infinity. We show that a significant delay reduction is possible by multi-copy relaying when is finite. Furthermore, we find that the average delay and delay variance for both the one and multi-copy relay strategies scale like and , respectively. We derive an approximation of the delay for multi-copy forwarding scheme and demonstrate that this approximation is very close to simulation results in MANET systems.     

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.     

Performance analysis of slotted ALOHA and network coding for single-relay multi-user wireless networks

Deployment of wireless relay nodes can enhance system capacity, extend wireless service coverage, and reduce energy consumption in wireless networks. Network coding enables us to mix two or more packets into a single coded packet at relay nodes and improve performances in wireless relay networks. In this paper, we succeed in developing analytical models of the throughput and delay on slotted ALOHA (S-ALOHA) and S-ALOHA with network coding (S-ALOHA/NC) for single-relay multi-user wireless networks with bidirectional data flows. The analytical models involve effects of queue saturation and unsaturation at the relay node. The throughput and delay for each user node can be extracted from the total throughput and delay by using the analytical models. One can formulate various optimization problems on traffic control in order to maximize the throughput, minimize the delay, or achieve fairness of the throughput or the delay. In particular, we clarify that the total throughput is enhanced in the S-ALOHA/NC protocol on condition that the transmission probability at the relay node is set at the value on the boundary between queue saturation and unsaturation. Our analysis provides achievable regions in throughput on two directional data flows at the relay node for both the S-ALOHA and S-ALOHA/NC protocols. As a result, we show that the achievable region in throughput can be enhanced by using network coding and traffic control.     

实现虚拟输出队列调度的神经网络方法

基于虚拟输出队列（VOQ）缓存的Crossbar交换结构,提出了一种Hopfield神经网络（HNN）控制的信元交换调度方法.通过选取合适的能量函数,并在其中采用一种新的队列优先级函数,实现了信元的高效交换控制.计算机模拟结果表明,该算法可以将吞吐率提高到0.998,信元丢失率大大降低,时延特性也有很大改善.     

分组交换网络调度算法概述

为了合理利用网络资源,提高网络吞吐率,降低通信时延,需要采取有效的调度算法实现输入端和输出端的匹配.基于VOQ的输入排队交换结构是当前分组交换网络最常用的结构.本文介绍了几种基于VOQ的调度算法:用于单级crossbar的PIM、iRRM和iSLIP算法,以及适用于三级Clos网络的RD和CDDR算法.对每种算法,介绍其基本原理和性能,以及与其他算法的区别.     

多源多中继无线网络中基于随机线性网络编码的调度方案

现有多中继无线网络中传输调度方案主要针对单信源且转发链路状态相同的情况,多采用顺序转发的调度方式,传输效率较低。针对此问题,该文提出一种基于随机线性网络编码的优先级调度方案。该方案在不同的传输阶段,利用信息包接收状态或编码向量之间的线性关系生成反馈信息,计算中继节点的有效信息包数。在转发链路状态不同的情况下,综合考虑各中继节点的有效信息与链路传输可靠性,确定优先级,从而完成调度。该方案实现了多中继对多信源信息的协同转发,在转发链路状态差异较大时,能自适应地选择最优转发节点和路径,提高信息包的传输成功率。仿真结果表明,相比传统基于单信源或顺序调度的方案,该方案能有效提高网络吞吐量,减少重传次数。     

机会波束成形系统中一种新的调度方案

主要研究机会波束成形系统中的调度算法,将宽带无线IP网络调度算法应用于机会波束成形系统。提出了一个保证用户QoS要求的新方案。数值分析表明,所提的方案较之传统的方案在保证系统吞吐量和用户间公平性的同时,也保证了用户的QoS。     

Resource allocation using time division multiple access over wireless relay networks

This article considers a wireless network consisting of multiple sources that communicate with the corresponding destination utilizing a single half-duplex relay, whereas, the sources use the relay opportunistically. By integrating the information theory with the concept of effective capacity, this article proposes a dynamic time allocation strategy over the wireless relay network that aims at maximizing the relay network throughput, subject to a given delay quality of service （QoS） constraint, where time division multiple access （TDMA） is applied in the relay network. The simulation results show that the proposed allocation strategy can significantly improve the effective capacity as compared to the traditional equal time allocation strategy.     

Optimal cooperative strategy based on quantum bat for cognitive radio of energy harvesting

In order to reduce energy consumption and improve spectral efficiency of the cognitive relay wireless communication system in 5G network,an optimal cooperative transmission strategy of information and energy was designed for cognitive relay radio with wireless energy harvesting.For the proposed optimal cooperative strategy,the maximal throughput formula and outage probability of secondary user were deduced.In order to resolve the derived maximum throughput equation,a quantum bat algorithm which was based on the optimization mechanism of quantum computing and bat algorithm was designed to solve the deduced equation,and the optimal cooperative transmission scheme for information and energy could be obtained.Simulation results show that the proposed optimal cooperative strategy not only can meet the information transfer demand of primary user,but also can realize the energy self-supply of the secondary user system and improve the communication quality of the secondary user.The proposed optimal cooperative strategy has a better performance than the cooperative strategy of existing cognitive relay radio for different simulation scenarios.