适用于无线视频传输的动态调度机制

对于无线网络传输实时高清视频时延高的问题,提出了一种增强型混合协调功能(EHCF)的动态调度机制。首先,利用截断和扩展信标间隔以适应视频数据的突发性;然后,根据站点数据缓存量大小来判断各站点传输需求,并由此划分在当前信标间隔中的优先级;其次,利用传输需求门限值和差值门限来评估高优先站点的传输需求权重;最后,根据评估结果为各站点分配信道资源。在基于H.264的视频传输仿真实验中,该机制以22 Mb/s的传输速度且网络站点个数相同时与传统的IEEE 802.11e中混合协调功能(HCF)相比,时延下降幅度最高为87.6%,最低为54.3%。仿真结果表明,EHCF机制在无线视频传输中能有效提高网络的实时性。     

TRAP: a high performance protocol for wireless local area networks

The fixed number of available random addresses for randomly addressed polling (RAP) poses a significant problem in terms of scalability in case of many active stations. In such cases, the protocol's performance is significantly degraded. In this paper, we propose a TDMA-based randomly addressed polling (TRAP) protocol. The protocol employs a variable-length TDMA-based contention stage with the length based on the number of active stations. At the beginning of each polling cycle, the base station invites all active mobile stations to register their intention to transmit via transmission of a short pulse. The base station uses the aggregate received pulse in order to obtain an estimate of the number of contending stations and schedules the contention stage to comprise an adequate number of time slots for these stations to successfully register their intention to transmit. Then it transmits a READY message carrying the number of time slots P. Each mobile station calculates a random address in the interval [0…P−1], transmits its registration request in the respective time slot and then the base station polls according to the received random addresses. Simulation results are presented that reveal the superiority of TRAP against the RAP protocol in case of medium and high offered loads. Furthermore, the implementation of the proposed protocol is much simpler than that of CDMA-based versions of RAP, since no extra hardware is needed for the orthogonal reception of the random addresses.     

IEEE 802.16e休眠模式算法的研究和改进

IEEE 802.16e为移动站点提供了大范围的无线接入,为了减少移动站点的功率消耗,它提出了一种节能机制休眠模式.移动站点在休眠间隔后进入监听间隔,检查其间是否有数据分组到达.如果有,它将进入清醒状态接收数据,否则,继续进入休眠间隔.草案中所提出的休眠模式指数增长算法在低业务量情况下,响应时间过长.文中提出了线性增长算法解决这一问题,理论分析了该算法的两个性能指标平均响应时间和平均能量消耗.并结合仿真实验,对比了这两种算法的性能,证实了后者具有较好的性能.进一步分析了休眠模式各个参数对上述两个性能指标的影响,对参数值的选取有重要帮助.     

一种由接收端发起的无线传感器网络MAC协议

在无线传感器网络(Wireless sensor networks,WSN)中,现有的基于接收节点发起的异步MAC层协议,在计算接收节点唤醒时刻时,多采用维持邻居节点的伪随机唤醒时间表的方法。在网络动态负载条件下,此方法不能动态地改变节点唤醒间隔,从而带来较高的数据传输冲突率及较大的数据传输延时。为了解决此问题,本文提出一种新协议HELD-MAC(High energy efficiency and　low delay MAC),保证节点之间具有不同的唤醒时间,同时能够准确预测接收端唤醒时刻,而且接收端可以根据网络负载情况动态改变唤醒间隔。同时为了减轻能量黑洞问题,协议根据节点的剩余能量,自适应地改变节点的最小唤醒间隔。通过仿真对HELD-MAC进行评估,与RI-MAC,PW-MAC等对比,在数据传输延时、能量消耗、网络吞吐量和传输碰撞方面具有较大优势。     

Quorum-based power-saving multicast protocols in the asynchronous ad hoc network

The asynchronous PS (Power-Saving) unicast protocol was designed for two PS wireless hosts to transmit the unicast message in the ad hoc network even their clocks are asynchronous. However, as regard to transmit a multicast message among more than two PS hosts, the protocol could not guarantee that all PS hosts can wake up at the same time. Some PS hosts may be in the PS mode when the multicast message is transmitted. Thus, the multicast message should be retransmitted again and again until all PS hosts receive the message. It will increase the energy consumption and the usage of the bandwidth. In this paper, we propose quorum-based PS multicast protocols for PS hosts to transmit multicast messages in the asynchronous ad hoc network. In those protocols, PS hosts use quorums to indicate their wakeup patterns. We introduce the rotation m-closure property to guarantee that m different quorums have the intersection even quorums are rotated due to asynchronous clocks. Thus, m PS hosts adopting m quorums satisfying the rotation m-closure property could wake up simultaneously and receive the multicast message even their clocks are asynchronous. We propose two quorum systems named the uniform k-arbiter and the CRT (Chinese Remainder Theorem) quorum system, which satisfy the rotation m-closure property. As shown in our analysis results, our quorum-based PS multicast protocols adopting those quorum systems can save more energy to transmit multicast messages.     

台区同期线损率标杆值与合理区间计算方法

同期线损率合理值计算是配电台区线损精细化管理的重要组成部分，为定位线损异常台区进而精准降损提供有效的技术支撑。本文将影响线损的复杂因素分解与降维，避免难以准确获取的台区网架参数，建立基于计量偏差、均衡满载工况下的线路传输损耗、负荷特征、基础损耗等台区特性参数的同期线损率计算模型。基于大数据分析，提出特性参数的“双重学习”求解算法，实现每个台区个性化特性参数的求解；通过对同类型台区参数的关联分析，求解各类型台区的特性参数合理区间，实现异常台区的判别和参数合理值学习；最终实现全量台区在不同供电量下的同期线损率标杆值与合理区间智能计算。基于实际应用，验证了算法模型的合理性与有效性。     

An energy-efficient permutation routing protocol for single-hop radio networks

A radio network (RN) is a distributed system where each station or node is a small hand-held commodity device called a station. Typically, each station has access to a few channels for transmitting and receiving messages. By RN(p, k), we denote a radio network with p stations, where each station has access to k channels. In a single-hop RN, every station is within the transmission range of every other station. Each station consumes power while transmitting or receiving a message, even when it receives a message that is not destined for it. It is extremely important that the stations consume power only when it is necessary since it is not possible to recharge batteries when the stations are on a mission. We are interested in designing an energy-efficient protocol for permutation routing, which is one of the most fundamental problems in any distributed system. An instance of the permutation routing problem involves p stations of an RN, each storing n/p items. Each item has a unique destination address which is the identity of the destination station to which the item should be sent. The goal is to route all the items to their destinations while consuming as little energy as possible. We show that the permutation routing problem of n packets on an RN(p, k) can be solved in 2n/k+(p/k)/sup 2/+p+2k/sup 2/ slots and each station needs to be awake for at most 6n/p+2p/k+8k slots. When k/spl Lt/p/spl Lt/n, our protocol is more efficient, both in terms of total number of slots and the number of slots each station is awake compared to a previously published protocol by Nakano et al. (2001).     

电力无线专网中面向安全风险的分布式资源分配方法

针对电力无线专网中强干扰、高故障风险等场景下保障终端通信的问题,提出了一种面向安全风险的高能效分布式资源分配方法。首先,分析基站的能耗组成,建立系统能效最大化的资源分配模型;然后,采用K-means++算法对网络中的基站进行分簇,从而将整个网络划分成多个独立区域,并在各个簇内单独处理高风险基站;其次,在每个簇内,基于基站的风险值对高风险基站进行休眠,并把高风险基站下的用户转移连接到同一簇内的其他基站;最后,在各个簇内进一步优化正常工作基站的传输功率。理论分析和仿真实验结果表明,基站分簇操作大幅降低了基站休眠和功率优化分配的复杂度,并且在关闭了高风险基站之后,整体网络的能效从0.158 9 Mb/J提升至0.195 4 Mb/J。所提的分布式资源分配方法能够有效提高系统的能量效率。     

电力无线专网中面向安全风险的分布式资源分配方法

针对电力无线专网中强干扰、高故障风险等场景下保障终端通信的问题，提出了一种面向安全风险的高能效分布式资源分配方法。首先，分析基站的能耗组成，建立系统能效最大化的资源分配模型；然后，采用K-means++算法对网络中的基站进行分簇，从而将整个网络划分成多个独立区域，并在各个簇内单独处理高风险基站；其次，在每个簇内，基于基站的风险值对高风险基站进行休眠，并把高风险基站下的用户转移连接到同一簇内的其他基站；最后，在各个簇内进一步优化正常工作基站的传输功率。理论分析和仿真实验结果表明，基站分簇操作大幅降低了基站休眠和功率优化分配的复杂度，并且在关闭了高风险基站之后，整体网络的能效从0.158 9 Mb/J提升至0.195 4 Mb/J。所提的分布式资源分配方法能够有效提高系统的能量效率。     

接收端发起的异步无线传感器网络MAC协议

为了减少无线传感器网络中由于空闲侦听而产生的能量消耗,在接收端发起的介质访问控制(RI-MAC)协议基础上提出一种新的接收端发起的异步RP-MAC。该协议通过预测接收节点唤醒时间,采用随机数作为唤醒间隔,改进RI-MAC的重传机制,从而减少了空闲侦听和网络冲突。NS2仿真结果表明,改进后的MAC协议在在高负载网络中显著降低了节点工作的占空比,提高了包交付率,从而减少了网络能耗。     

Energy-conservation in 802.11 WLANs via transmission-strategy-aware airtime allocation

In a typical 802.11 wireless local area network (WLAN), different wireless stations may communicate with the access point (AP) with different transmission rates, transmit-power levels, and data payload sizes. Such phenomenon is often referred to as transmission-strategy diversity. In this paper, we study the energy-conservation problem in 802.11 WLANs in the presence of transmission-strategy diversity. This problem is addressed from a unique angle – the system-level fairness which is quite different from most of current research that focuses on improving the performance of each individual wireless station. To emphasize fair energy consumption among contending stations, we introduce a new fairness notion, called energy-conservation fairness, which is in sharp contrast to the conventional throughput fairness and airtime fairness. Another contribution of this paper is an energy-efficient scheme that allocates airtime shares to contending stations so as to achieve combined airtime and energy-conservation fairness. Our simulation results show that, when the energy-conservation fairness is considered, both aggregate system throughput and overall system energy-efficiency can be improved significantly with all contending stations consuming a similar amount of energy.     

Energy-efficient permutation routing in radio networks

A radio network (RN, for short) is a distributed system populated by small, hand-held commodity devices running on batteries. Since recharging batteries may not be possible while on mission, we are interested in designing protocols that are highly energy efficient. One of the most effective energy-saving strategies is to mandate that the stations go to sleep whenever they do not transmit or receive messages. It is well known that a station is expending power while its transceiver is active, that is, while transmitting or receiving a packet. It is perhaps surprising at first that a station is expending power even if it receives a packet that is not destined for it. Since, in single-hop radio networks, every station is within transmission range from every other station, the design of energy-efficient protocols is highly nontrivial. An instance of the permutation routing problem involves p stations of an RN, each storing n/p items. Each item has a unique destination which is the identity of the station to which the item must be routed. The goal is to route all the items to their destinations while expending as little energy as possible. Since, in the worst case, each item must be transmitted at least once, every permutation routing protocol must take n/k time slots. Similarly, each station must be awake for at least n/p time slots to transmit and/or receive packets. Our main contribution is to present an almost optimal energy-efficient permutation routing protocol for a k-channel, a p-station RN that routes n packets in at most (2d+2b+1)n/k+k time slots with no station being awake for more than (4d+7b-1)n/p time slots, where d=[(logp/k)/(logn/p)], b=[(log k)/(logn/p)] and k⩽√(p/2). Since, in most real-life situations, the number n of packets to route, the number p of stations in the RN, and the number k of channels available satisfy the relation k≪p≪n, it follows that d and b are very small     

基于微基站功率分配的异构蜂窝网络能效优化

针对异构蜂窝网络中微基站密集部署带来能耗不断攀升的问题,对二层异构蜂窝网络能量效率进行了分析,提出一种通过调整微基站发射功率来最大化网络能量效率的方法。首先,利用齐次泊松点过程对异构蜂窝网络进行建模,推导出各层基站的覆盖率;其次,根据能量效率定义,分别推导出网络总功耗和总吞吐量,并给出能量效率的闭式表达式;最后,分析了微基站发射功率对网络能量效率的影响,提出一种能够最大化能量效率的微基站功率优化算法。仿真结果表明,微基站的发射功率对异构蜂窝网络能量效率有显著影响,通过优化微基站发射功率能有效提升异构蜂窝网络能量效率。     

The passport control problem or how to keep a dynamic service system load balanced?

In many real life situations (such as department stores, or passport control booths in airports) parallel queues are formed in front of control stations. Typically, some of the stations are manned while others are not. Classical queuing theory considers the configuration constant, and concentrates on the arrival process. This work explores a new line of research—the case in which the configuration is dynamic, and the customers can plan to cope with anticipated changes. Specifically, as the queues build up, management assigns additional officers to the unmanned stations. When this happens—some people move to the newly manned queues from nearby busy queues. In anticipation, people may prefer to line up in busy queues next to unmanned ones.Mathematically we discuss the problem of dynamic arrangement of the queues in a service system where at any time each server can be in either an active or an inactive mode. A balancing strategy determines how customers will be reallocated when a station becomes active. Given a balancing strategy, we seek a partition of customers to queues that minimizes the maximum wait time of a customer in each of the active stations, thereby keeping the system balanced at all times. We study two balancing strategies that we call Split and Trim. For the Split strategy we discuss a special case (the stations are ordered on a line and a single unmanned station is at one end). We show how an optimal partition can be calculated recursively. We then give partitions that approximate the minimal expected wait time within a factor of 1+O(1/N), under each of these strategies, where N is the number of stations. We obtain similar bounds (to within factor 2) for the case, where the number of active servers can be any 1⩽n⩽N−1, and the balancing strategy is Trim.     

iTPS: an improved location discovery scheme for sensor networks with long-range beacons

In this paper, we present time-based positioning scheme (iTPS), a purely localized location detection scheme for sensor networks with long-range beacons. iTPS relies on time difference of arrival (TDoA) of radio frequency (RF) signals measured locally at each sensor to detect range differences from the sensor to four base stations. These range differences are combined to estimate the sensor location through trilateration. iTPS is an improvement over TPS (Cheng et al., IEEE INFOCOM, 2004), which produces two ambiguous position estimates when sensors are close to any base station. iTPS substantially reduces the number of ambiguous estimates and can improve accuracy. Features of iTPS include low communication overhead for sensors, no requirements for time synchronization, low computational overhead due to simple algebraic operations, and high scalability. We conduct extensive simulation to test iTPS and compare it with TPS. The obtained results show that iTPS is an efficient and effective scheme for location discovery in sensor networks with long-range beacon stations.     

基于能效的异构无线网络联合切换调度和资源分配算法

在宏蜂窝和微蜂窝并存的异构无线网络中,为了提高系统能效,提出了一种联合切换调度和资源分配(JSRA)算法。首先,利用基于微基站睡眠的集中式切换调度算法(CUSA)来确定用户的关联基站,CUSA将微基站用户全部切换到宏基站是否能减少功耗作为判断微基站睡眠的准则;然后,基站采用基于最优信道质量的子载波分配调整(BCSA)算法为用户分配子载波和传输功率,BCSA算法通过调整最大能效用户和最小能效用户之间的子载波分配,保证网络能效逼近最优解。理论分析和实验仿真表明,同单独考虑用户切换或资源分配的三种算法相比,JSRA算法复杂度偏高,但是在用户数为120时网络功耗最多降低44.4%,用户总速率只比一种对比算法略有下降,最多提升80%,网络能效最多提升200%。实验结果表明,JSRA算法能够有效提高异构无线网络的网络能效。     

异构网中具有服务质量约束的高能效微基站部署方法

针对异构密集网络中基站密度增大带来的网络能耗过高问题,提出一种异构网络中高能效的微基站部署方法。首先,考虑微基站候选位置可行性以减轻环境条件的影响;其次,在不同的用户分布状态下对优化目依概率进行加权,增强了对不同用户分布场景的适应性;最后,通过对微基站部署数目、位置和功率配置的联合优化来提升系统能效,并提出了一种高能效的微基站部署算法。仿真表明,与仅优化微基站数量和部署位置的方法相比,所提方法提升能效最高达26%。实验结果表明,相对于不考虑功率的部署方法,所提出的联合优化方法能够有效提升系统能效,同时验证了微基站功率对异构网络能效的影响。     

Analysis of power saving with continuous connectivity

Always-on mobile users need high bandwidth channels with negligible access delay and limited power consumption. Such a continuous connectivity mode requires the management of high-speed channels, which can turn into substantial operational costs (i.e., power consumption rate) even in presence of low traffic, unless a power saving mechanism is enforced. In this paper, we analyze the impact of 3GPP-defined power saving mechanisms on the performance of users with continuous connectivity. We develop a model for packet transmission and operational costs. We model each downlink mobile user’s traffic by means of an M/G/1 queue, and the base station’s downlink traffic as an M/G/1 PS queue with multiple classes and inhomogeneous vacations. The model is validated through packet-level simulations. Our results show that consistent power saving can be achieved in the wireless access network, as high as 75% for mobiles and 55% for base stations.     

Saturated throughput analysis of IEEE 802.11e EDCA

IEEE 802.11e standard has been published to introduce quality of service (QoS) support to the conventional IEEE 802.11 wireless local area network (WLAN). Enhanced distributed channel access (EDCA) is used as the fundamental access mechanism for the medium access control (MAC) layer in IEEE 802.11e. In this paper, a novel Markov chain based model with a simple architecture for EDCA performance analysis under the saturated traffic load is proposed. Compared with the existing analytical models of EDCA, the proposed model incorporates more features of EDCA into the analysis. Firstly, we analyze the effect of using different arbitration interframe spaces (AIFSs) on the performance of EDCA. That is, the time interval from the end of the busy channel can be classified into different contention zones based on the different AIFSs used by different sets of stations, and these different sets of stations may have different transmission probabilities in the same contention zone. Secondly, we analyze the possibility that a station’s backoff procedure may be suspended due to transmission from other stations. We consider that the contention zone specific transmission probability caused by the use of different AIFSs can affect the occurrence and the duration of the backoff suspension procedure. Based on the proposed model, saturated throughput of EDCA is analyzed. Simulation study is performed, which demonstrates that the proposed model has better accuracy than those in the literature.     

A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks

This paper is concerned with reliable multistation series queueing networks. Items arrive at the first station according to a Poisson distribution and an operation is performed on each item by a server at each station. Every station is allowed to have more than one server with the same characteristics. The processing times at each station are exponentially distributed. Buffers of nonidentical finite capacities are allowed between successive stations. The structure of the transition matrices of these specific type of queueing networks is examined and a recursive algorithm is developed for generating them. The transition matrices are block-structured and very sparse. By applying the proposed algorithm the transition matrix of a K-station network can be created for any K. This process allows one to obtain the exact solution of the large sparse linear system by the use of the Gauss–Seidel method. From the solution of the linear system the throughput and other performance measures can be calculated.Scope and purposeThe exact analysis of queueing networks with multiple servers at each workstation and finite capacities of the intermediate queues is extremely difficult as for even the case of exponential operation (service or processing) times the Markovian chain that models the system consists of a huge number of states which grows exponentially with the number of stations, the number of servers at each station and the queue capacity of each intermediate queue of the resulting system. The scope and purpose of the present paper is to analyze and provide a recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks. By applying the proposed algorithm one may create the transition matrix of a K-station queueing network for any K. This process allows one to obtain the exact solution of the resulting large sparse linear system by the use of the Gauss–Seidel method. From the solution of the linear system the throughput and other performance measures of the system can be obtained.