面向射频能量捕获传感网的高吞吐量负载均衡的节点接入方案

由于传统无线传感器网络更换传感器电池较为麻烦或不具可行性,其实际应用范围受到很大的限制。考虑具有射频能量捕获能力的无线传感器网络,已知能量源、节点、基站(即汇聚节点)的部署位置,研究如何安排各个节点的接入基站,在满足基站负载平衡约束的情况下最大化整个网络节点的总吞吐量。首先,建立能量捕获传感网的能量捕获模型和信息传输模型,并将该节点接入问题建模为0-1整数规划问题;然后,针对该问题提出一种复杂度较低的算法和一种复杂度略高的贪婪式算法。仿真结果表明,与低复杂度算法相比,贪婪式算法所得到的节点接入方案具有更高的网络总吞吐量,但其复杂度略高,因此可用于节点数目较少的场景,而低复杂度算法可用于节点数目较多的场景。     

CCMAC: Coordinated cooperative MAC for wireless LANs

In wireless LANs, throughput is one of, if not the most, important performance metric. This metric becomes more critical at the bottleneck area of the network, which is normally the area around the Access Point (AP). In this paper, we propose CCMAC, a coordinated cooperative MAC for wireless LANs. It is designed to improve the throughput performance in the region near the AP through cooperative communication, where data is forwarded through a two-hop high data rate link instead of a low data rate direct link. The most unique feature is that, it can coordinate nodes to perform concurrent transmissions which can further increase the throughput. To optimize the performance, the coordination problem is formulated as a Partially Observable Markov Decision Process and solved by a Reinforcement Learning algorithm. Through analysis and simulation, we show that CCMAC can significantly shorten the transmission time for stations with low data rate links to the AP and CCMAC has better throughput performance than other MAC protocols, such as CoopMAC and legacy IEEE 802.11.     

Channel measurement-based access point selection in IEEE 802.11 WLANs

With the wide deployment of IEEE 802.11 Wireless Local Area Networks, it has become common for mobile nodes (MNs) to have multiple access points (APs) to associate with. With the Received Signal Strength Indicator (RSSI)-based AP selection algorithm, which is implemented in most commercial IEEE 802.11 clients, the AP with the best signal strength is selected regardless of the candidate AP’s available throughput, resulting in unbalanced distribution of clients among the APs in the network. Several studies have shown performance improvement in not just the new MN (nMN), but also the network as a whole when the selection process considers the current load status of candidate APs. However, the proposed algorithms in these studies assume that there are no hidden terminal problems that severely affect the performance of the network. Hidden terminal problems frequently occur in wireless networks with unlicensed frequencies, like IEEE 802.11 in the 2.4 GHz band. Moreover, none of the previous studies have considered frame aggregation, a major improvement in transmission efficiency introduced and widely deployed with the IEEE 802.11n standard. In this paper, we propose a new AP selection algorithm based on the estimation of available throughput calculated with a model based on the IEEE 802.11 distributed coordination function in consideration of hidden terminal problems and frame aggregation. The proposed algorithm is evaluated through extensive simulation, and the results show that the nMN with the proposed AP selection algorithm can achieve up to 55.84% and 22.31% higher throughput compared to the traditional RSSI-based approach and the selection algorithm solely based on the network load, respectively.     

基于节点合作的Ad hoc网多信道MAC协议

针对Ad hoc网络的多信道隐藏终端问题,提出一种基于邻居节点合作通告机制的异步多信道媒介访问控制协议。该协议通过空闲邻居节点向未收到信道协商控制帧的节点发送通告广播帧,从而有效地解决了多信道隐藏终端问题。仿真结果表明,与IEEE 802.11、MMAC协议相比,该协议在提高网络平均吞吐量的同时,还能降低数据包平均延迟。     

面向工业无线汇聚网络的高吞吐率MAC协议

汇聚网络是工业传感器网络的常用拓扑形式。汇聚网络的隐藏终端是影响网络吞吐率的重要因素,目前常用信道预留机制来加以解决。此外,随着物理层数据传输速率的不断提高,相对短报文的现象日渐突出,使得用于信道预留的控制报文的开销相对增加。现有的IEEE802.11 DCF不能同时有效应对这两个现象。提出了取消信道预留方式来克服相对短报文问题,而对于由于信道预约取消所导致的隐藏终端问题,则以随机发送机制解决。为了获得最优的发送概率,设计了APCSMA协议,该协议以最大化节点吞吐率为目标,提出吞吐率最大化的必要条件,基于该必要条件,在主干扰模型下推导出节点均匀分布情况下的最优报文发送概率。从理论上分析了协议的网络吞吐率、延迟和能量效率。仿真结果和分析表明,APCSMA协议对于工业无线汇聚网络具有广泛的适用性。     

基于隐藏终端的时隙802.15.4网络吞吐量研究

为了提高802.15.4网络吞吐量性能,设计了一种改进的节点状态转换过程,提出了一种考虑隐藏终端问题和重传的节点接入信道模型,并对模型进行分析计算。基于计算结果和信道状态模型分析,对考虑隐藏终端问题的数据碰撞概率、丢包率和网络吞吐量进行推导。最后研究了数据包到达率、退避指数和隐藏终端对网络吞吐量性能的影响。实验表明,模型较好地描述了节点接入信道过程,能够对网络吞吐量进行精准的动态分析。实验结果表明,与无重传机制的802.15.4网络相比,网络吞吐量增加了83.9%左右。与部分条件休眠的方法比较,网络吞吐量平均增加了13.3%,提出的模型能够有效提升网络吞吐量性能。     

对IEEE 802.11 MAC层协议公平性改进的研究

Ad Hoc网络中基于IEEE 802.11的MAC层协议采用CSMA/CA机制,通过侦听只能获取一跳范围内节点的信息,存在隐终端问题,影响了网络流调度的公平性.文中对IEEE 802.11提出了一种修改方案,该方案通过邻居结点间的信息交换,使网络中每个节点具有其二跳范围内所有结点的信息,以发现网络中的隐终端,提高网络流调度的公平性.对比仿真实验结果表明,修改后的IEEE 802.11与原协议的网络吞吐量基本相当,但具有更好的公平性.     

TCP performance optimization in multi-cell WLANs

Though significant attention has been given to understanding the performance of a single-cell WLAN, performance evaluation of a group of interfering basic service sets (BSSs) within an extended service set (ESS) is still an open area. In this paper, we first demonstrate that a severe throughput imbalance occurs between downlink TCP flows even in the simplest of multi-cell WLANs via simulation and real world experiments; then, to solve this unfairness problem, we derive an analytical model that describes the interaction between TCP flows at the MAC layer, and formulate a throughput allocation problem as a nonlinear optimization problem subject to certain fairness requirements. Our formulation considers real world complexity such as hidden terminals, packet transmission retry limit, and the unique characteristics of TCP traffic. Solving our optimization problem yields the optimal MAC layer contention window settings that can lead each TCP flow to its target end-to-end throughput without the need for any per-flow queuing nor modification of the TCP sender. Simulation results show that our approach can achieve a fair allocation on the end-to-end throughput and attest to the accuracy of our proposed method.     

Extending network lifetime for ALLIANCES

ALLIANCES is a newly proposed wireless MAC protocol that exploits the cooperation of source nodes and relay nodes to resolve collisions and further improve throughput. Until now, ALLIANCES did not consider energy, which is the most precious commodity of mobile communications. In this paper, we propose an energy-conserving version of ALLIANCES that introduces a sleep state. Our analytical results show that the energy-conserving model can save at least 54% of energy consumption when compared to the original energy model (referred to as the basic energy model in this paper). Because a relay selection scheme is a significant piece of ALLIANCES, directly affecting the throughput and the energy distribution, we also propose an energy-aware relay selection scheme (ERS). ERS maintains the performance benefits of the previously proposed location relay selection scheme (LRS), but more evenly distributes the amount of energy remaining throughout the network. We implement our energy-conserving model and ERS in the popular network simulator (NS-2) to evaluate and compare the energy remaining at each node and the network’s throughput when using LRS and ERS. Simulation results show that the energy-conserving model can save up to 80% of energy without nodes taking longer to communicate. In addition, using the energy-conserving model, ERS provides 23.3% longer lifetime of the network than LRS, without noticeable throughput degradation.     

Distributed channel assignment algorithms for 802.11n WLANs with heterogeneous clients

As the latest IEEE 802.11 standard, 802.11n applies several new technologies, such as multiple input multiple output (MIMO), channel bonding, and frame aggregation to greatly improve the rate, range and reliability of wireless local area networks (WLANs). In 802.11n WLANs, access points (APs) are often densely deployed to provide satisfactory coverage. Thus nearby APs should operate at non-overlapping channels to avoid mutual interference. It is challenging to assign channels in legacy 802.11a/b/g WLANs due to the limited number of channels. Channel assignment becomes more complex in 802.11n WLANs, as the channel bonding in 802.11n allows WLAN stations (APs and clients) to combine two adjacent, non-overlapping 20MHz channels together for transmission. On the other hand, IEEE 802.11n is backward compatible, such that 802.11n clients will coexist with legacy clients in 802.11n WLANs. Legacy clients may affect the performance of nearby 802.11n clients, and reduce the effectiveness of channel bonding. Based on these observations, in this paper, we study channel assignment in 802.11n WLANs with heterogeneous clients. We first present the network model, interference model, and throughput estimation model to estimate the throughput of each client. We then formulate the channel assignment problem into an optimization problem, with the objective of maximizing overall network throughput. Since the problem is NP-hard, we give a distributed channel assignment algorithm based on the throughput estimation model. We then present another channel assignment algorithm with lower complexity, and aim at minimizing interference experienced by high-rate, 802.11n clients. We have carried out extensive simulations to evaluate the proposed algorithms. Simulation results show that our algorithms can significantly improve the network throughput of 802.11n WLANs, compared with other channel assignment algorithms.     

用于传感网功率控制的并行传输MAC 协议

针对无线传感网（WSNs）中节点间不对称的发射功率引起的隐藏节点和暴露节点问题,提出一种用于传感网功率控制的MAC协议（MAC4PC）.该协议采用邻节点向量表对邻节点的状态及当前会话的信息进行记录,并设计了相关的控制帧收发时序和干扰度判断准则,以保证新建立会话与当前会话互不干涉,从而实现暴露节点的并行传输.仿真结果表明,与802.11 DCF协议、SB-FSMA/CA协议以及GLPCB-PMAC协议相比较,MAC4PC协议提高了网络平均吞吐量,降低了节点平均能耗和数据分组的平均传输时延.     

基于径向基神经网络和正则化极限学习机的多标签学习模型*

相比径向基(RBF)神经网络,极限学习机(ELM)训练速度更快,泛化能力更强.同时,近邻传播聚类算法(AP)可以自动确定聚类个数.因此,文中提出融合AP聚类、多标签RBF(ML-RBF)和正则化ELM(RELM)的多标签学习模型(ML-AP-RBF-RELM).首先,在该模型中输入层使用ML-RBF进行映射,且通过AP聚类算法自动确定每一类标签的聚类个数,计算隐层节点个数.然后,利用每类标签的聚类个数通过K均值聚类确定隐层节点RBF函数的中心.最后,通过RELM快速求解隐层到输出层的连接权值.实验表明,ML-AP-RBF-RELM效果较好.     

Error Minimized Extreme Learning Machine With Growth of Hidden Nodes and Incremental Learning

One of the open problems in neural network research is how to automatically determine network architectures for given applications. In this brief, we propose a simple and efficient approach to automatically determine the number of hidden nodes in generalized single-hidden-layer feedforward networks (SLFNs) which need not be neural alike. This approach referred to as error minimized extreme learning machine (EM-ELM) can add random hidden nodes to SLFNs one by one or group by group (with varying group size). During the growth of the networks, the output weights are updated incrementally. The convergence of this approach is proved in this brief as well. Simulation results demonstrate and verify that our new approach is much faster than other sequential/incremental/growing algorithms with good generalization performance.      

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.     

Joint scheduling and routing algorithm with load balancing in wireless mesh network

Wireless mesh network (WMN) is a promising solution for last mile broadband internet access. Mesh nodes or mesh routers are connected via wireless links to form a multi-hop backbone infrastructure and improving throughput is the primary goal. While previous works mainly focused on either link level protocol design or complex mathematical model, in this paper, we investigate the performance gains from jointly optimizing scheduling and routing in a multi-radio, multi-channel and multi-hop wireless mesh network. Then, two optimization objectives are addressed by considering wireless media contention and spatial multiplexing. The first objective is to maximize throughput by exploiting spatial reuse while the second one is to ensure fairness among different links. We design a cross-layer algorithm by considering both MAC layer and network layer. Simulation results show that our joint optimization algorithm can significantly increase throughput as well as fairness.     

Reputation-based role assignment for role-based access control in wireless sensor networks

Wireless sensor networks (WSNs) typically consist of large number of sensor nodes, which, depending on the application, are mostly left unattended in open environments for moderately long periods of time. Due to the wireless nature of the medium, it is quite possible that a node can be captured by an adversary, which may lead to its non-cooperative behavior or misbehavior with the rest of the nodes in the network. So, it is necessary to provide a security mechanism in the network that mandates only the authorized nodes to be able to access information. Some of the recent literature suggest using multilevel hierarchical architectures (MHA) in WSN. In such an approach, each group is assigned a task and a different role or level is assigned to nodes within a group. There exists a need for multilevel access control in these types of networks, in order to give authorization based on a node’s role - this is also called role-based access control (RBAC). In this paper, we propose a reputation-based role assigning scheme for RBAC. The main objective of this scheme is to manage reputation locally with minimum communication and delay overhead and to assign appropriate role or level to the deserved nodes in order to increase the throughput of overall network. Other parameters used in our scheme are the bootstrap time and energy. In this paper, we describe our scheme and prove its theoretical correctness. Simulation results show that our scheme leads to an increase in throughput. This scheme leads to increase in throughput by around 32% at the consumption of little more energy.     

Performance analysis of the IEEE 802.11 DCF in the presence of the hidden stations

In this paper, we present an analytical model to evaluate the hidden station effect on the performance of the IEEE 802.11 Distributed Coordination Function (DCF) in both non-saturation and saturation condition. DCF is a random channel-access scheme based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) method and the exponential backoff procedure. DCF is widely used and can support both wireless network with an access point and ad hoc wireless network because of its random channel-access method. On the other hand, this method unavoidably suffers the hidden station effect that causes significant performance degradation. As shown in this paper, hidden stations occur frequently in real-world settings, and the performance impact on the 802.11 DCF is a significant concern, but it has not been adequately studied. We study this problem through a spatial–temporal analysis and a Markov chain model. Our model generalizes the existing work on the performance modeling of 802.11 DCF for both non-saturation and saturation conditions. The scenario of no hidden station can be considered as a special case in our model. The performance of our model is evaluated by comparison with ns-2 simulations.     

存在隐藏终端的IEEE802.11e多跳无线网络模型分析

首次将802.11e的接入机制放入多跳环境中进行仿真分析和定量研究。提出一种新的多跳环境下802.11e网络模型,结合M/G/1/K排队模型,定量分析在隐藏终端影响下802.11e网络的MAC层吞吐率、MAC时延和帧丢失率,研究802.11e在多跳环境下性能表现的内在原因。经过仿真实验结果与数值分析结果的对比,验证了分析模型的准确性;通过有(无)隐藏终端影响下MAC层性能的对比分析,指出了802.11e在多跳无线网络中支持QoS的局限性:受隐藏终端的影响,802.11e对不同接入等级的业务提供QoS区分的性能明显降级。因而有必要研究隐藏终端问题的解决方案,提高802.11e在多跳环境下的性能。     

A token based distributed algorithm for supporting mutual exclusion in opportunistic networks

Opportunistic networks are essentially distributed networks with transient connectivity among nodes. Nodes in opportunistic networks are resource constrained, mobile and opportunistically come in contact with each other. In such a distributed network, nodes may require exclusive access to a shared object or resource. Ensuring freedom from starvation is a challenging problem in opportunistic networks due to limited pairwise connectivity and node failures. In this paper, we review mutual exclusion algorithms proposed for generic mobile ad hoc networks (MANETs) and discuss their applicability to opportunistic networks. Further, we propose a novel token based algorithm¹ and prove its correctness. Simulation results show that our algorithm is communication efficient as compared to other algorithms proposed for generic mobile ad hoc networks. We also propose a timeout based fault detection algorithm that exploits the intercontact time distributions.     

存在隐藏终端的IEEE 802.11e多跳无线网络模型分析*

首次将802.11e的接入机制放入多跳环境中进行仿真分析和定量研究。提出一种新的多跳环境下802.11e网络模型,结合M/G/1/K排队模型,定量分析在隐藏终端影响下802.11e网络的MAC层吞吐率、MAC时延和帧丢失率,研究802.11e在多跳环境下性能表现的内在原因。经过仿真实验结果与数值分析结果的对比,验证了分析模型的准确性;通过有（无）隐藏终端影响下MAC层性能的对比分析,指出了802.11e在多跳无线网络中支持QoS的局限性：受隐藏终端的影响,802.11e对不同接入等级的业务提供QoS区分的性能明显降级。因而有必要研究隐藏终端问题的解决方案,提高802.11e在多跳环境下的性能。