Ad hoc网络中一种生命周期约束的自适应退避算法

在IEEE 802.11标准定义的BEB退避算法基础上,提出一种生命周期约束的自适应退避算法LCAB,以生命周期代替最大重传次数作为分组丢弃的依据,并根据网络忙闲程度自适应地调整节点执行退避过程的权限,以最大化系统归一化有效吞吐量,适合于ad hoc网络中有严格时延要求的VoIP等实时性业务.构建Markov链模型分析LCAB算法性能,得到系统归一化有效吞吐量表达式.仿真结果表明,理论分析与仿真结果一致,且LCAB算法的归一化有效吞吐量优于BEB算法.     

Quality of service support in IEEE 802.11 wireless ad hoc networks

Supporting Quality of Service (QoS) in wireless networks is a challenging problem. The IEEE 802.11 LAN standard was developed primarily for elastic data applications. In order to support the transmission of real-time data, a polling-based scheme called the point coordination function (PCF) was introduced in IEEE 802.11. However, PCF was not able to meet the desired and practical service differentiation requirements to fulfill the need of real-time data. Therefore, Task Group E of the IEEE 802.11 working group released several IEEE 802.11e drafts, whose main task is to support QoS in IEEE 802.11 LANs. The polling scheme of PCF is extended in IEEE 802.11e into the more complex hybrid coordination function (HCF). We found that HCF has several performance issues that may affect its anticipated performance. In this paper, we address these issues and propose a QoS enhancement over PCF, called enhanced PCF (EPCF) that enables Wireless LAN to send a combination of voice, data and isochronous data packets using the current IEEE 802.11 PCF. First, we compare the performance of the proposed model (EPCF) with the HCF function of the IEEE 802.11e through simulation. Second, we extend the proposed model (EPCF) to work in a multihop wireless ad hoc mode and present the advantages and limitations in this case. Simulation results demonstrate an enhanced performance of our scheme over the legacy PCF and a comparable performance to the IEEE 802.11e HCF in terms of the average delay and system throughput. However, EPCF is much simpler than HCF, provides flow differentiation, and is easy to implement in the current IEEE 802.11 standard.     

The Jamming problem in IEEE 802.11‐based mobile ad hoc networks with hidden terminals: Performance analysis and enhancement

The hidden‐terminal problem significantly degrades the performance of IEEE 802.11 DCF. Many previous works have investigated its influence on the throughput of CSMA‐based medium access control (MAC) protocols, especially IEEE 802.11 DCF. In this paper, we introduce a new Jamming problem for IEEE 802.11‐based mobile ad hoc networks, which is caused by hidden terminals. An analytical model is established for this problem. Based on this model, an adaptive DCF (ADCF), is designed to solve the jamming problem through adaptively adjusting the minimum contention window of hidden terminals. Simulation results effectively demonstrate that the proposed A‐DCF can avoid the jamming and in turn greatly improve channel utilization and throughput. Copyright © 2009 John Wiley & Sons, Ltd.     

Distributed point coordination function for IEEE 802.11 wireless ad hoc networks

The Distributed Point Coordination Function (DPCF) is presented in this paper as a novel Medium Access Control Protocol (MAC) for wireless ad hoc networks. DPCF extends the operation of the Point Coordination Function (PCF) defined in the IEEE 802.11 Standard to operate over wireless networks without infrastructure. In PCF, a central point coordinator polls the users to get access to the channel and data collisions are completely avoided, thus yielding high performance. In order to extend its high performance to networks without infrastructure, the DPCF is proposed in this paper as a combination of the Distributed Coordination Function (DCF) and the PCF. The general idea is to combine a dynamic, temporary, and spontaneous clustering mechanism based on DCF with the execution of PCF within each cluster. The backwards compatibility of DPCF with legacy 802.11 networks is also assessed in this paper. Comprehensive computer-based simulations demonstrate the high performance of this new protocol in both single-hop and multi-hop networks.     

Effectiveness of RTS/CTS handshake in IEEE 802.11 based ad hoc networks

IEEE 802.11 MAC mainly relies on two techniques to combat interference: physical carrier sensing and RTS/CTS handshake (also known as “virtual carrier sensing”). Ideally, the RTS/CTS handshake can eliminate most interference. However, the effectiveness of RTS/CTS handshake is based on the assumption that hidden nodes are within transmission range of receivers. In this paper, we prove using analytic models that in ad hoc networks, such an assumption cannot hold due to the fact that power needed for interrupting a packet reception is much lower than that of delivering a packet successfully. Thus, the “virtual carrier sensing” implemented by RTS/CTS handshake cannot prevent all interference as we expect in theory. Physical carrier sensing can complement this in some degree. However, since interference happens at receivers, while physical carrier sensing is detecting transmitters (the same problem causing the hidden terminal situation), physical carrier sensing cannot help much, unless a very large carrier sensing range is adopted, which is limited by the antenna sensitivity. In this paper, we investigate how effective is the RTS/CTS handshake in terms of reducing interference. We show that in some situations, the interference range is much larger than transmission range, where RTS/CTS cannot function well. Two independent solutions are proposed in this paper. One is a simple enhancement to the IEEE 802.11 MAC protocol. The other is to utilize directional antennas. Simulation results verify that the proposed schemes indeed can help IEEE 802.11 resolve most interference caused by large interference range.     

IEEE 802.11在无线自组网中的应用研究

深入分析了IEEE 802.11 DCF机制应用于无线自组网存在的固有缺陷及潜在原因,并阐明了数据流竞争、物理层机制对MAC协议性能的影响。IEEE 802.11 DCF是针对全连通adhoc网络结构设计的,分析表明,要在实际的多跳无线自组网中应用还存在很多问题需要解决。在此基础上提出了将IEEE 802.11有效应用于多跳无线自组网的进一步研究方向。     

A smart exponential‐threshold‐linear backoff mechanism for IEEE 802.11 WLANs

Based on the standardized IEEE 802.11 Distributed Coordination Function (DCF) protocol, this paper proposes a new backoff mechanism, called Smart Exponential‐Threshold‐Linear (SETL) Backoff Mechanism, to enhance the system performance of contention‐based wireless networks. In the IEEE 802.11 DCF scheme, the smaller contention window (CW) will increase the collision probability, but the larger CW will delay the transmission. Hence, in the proposed SETL scheme, a threshold is set to determine the behavior of CW after each transmission. When the CW is smaller than the threshold, the CW of a competing station is exponentially adjusted to lower collision probability. Conversely, if the CW is larger than the threshold, the CW size is tuned linearly to prevent large transmission delay. Through extensive simulations, the results show that the proposed SETL scheme provides a better system throughput and lower collision rate in both light and heavy network loads than the related backoff algorithm schemes, including Binary Exponential Backoff (BEB), Exponential Increase Exponential Decrease (EIED) and Linear Increase Linear Decrease (LILD). Copyright © 2011 John Wiley & Sons, Ltd.     

MAC protocols using directional antennas in IEEE 802.11 based ad hoc networks

Using directional antennas can be beneficial for wireless ad hoc networks consisting of a collection of wireless hosts. The most important benefit includes a reduction of the radio interference. Thus, it can significantly increase the spatial reuse, thereby improving the network throughput. To best utilize directional antennas, a suitable Medium Access Control (MAC) protocol must be designed. Current MAC protocols, such as the IEEE 802.11 standard, do not benefit when using directional antennas, because these protocols have been designed for omnidirectional antennas. In this paper, we present modified MAC protocols suitable for 802.11 based ad hoc networks using directional antennas. Our comprehensive simulation results demonstrate the performance improvement obtained with the proposed protocols. Copyright © 2007 John Wiley & Sons, Ltd.     

Increasing fairness and efficiency using the MadMac protocol in ad hoc networks

The IEEE 802.11 MAC layer is known for its unfairness behavior in ad hoc networks. Introducing fairness in the 802.11 MAC protocol may lead to a global throughput decrease. It is still a real challenge to design a fair MAC protocol for ad hoc networks that is distributed, topology independent, that relies on no explicit information exchanges and that is efficient, i.e. that achieves a good aggregate throughput. The MadMac protocol deals with fairness and throughput by maximizing aggregate throughput when unfairness is solved. Fairness provided by MadMac is only based on information provided by the 802.11 MAC layer. MadMac has been tested in many configurations that are known to be unfair and compared with three protocols (IEEE 802.11 and two fair MAC protocols). In these configurations, MadMac provides a good aggregate throughput while solving the fairness issues.     

IEEE 802.11移动自组织网络节点竞争窗口长度的概率分布

 在基于IEEE 802.11的移动自组织网络中,MAC(Medium Access Control)层提供了DCF(Distributed Coordinate Function)以控制节点对无线信道的争用.DCF包括了BEB (Binary Exponential Backoff)算法.该文对BEB的重要参数——竞争窗口CW(Contention Window)进行研究,通过随机建模,导出了竞争窗口长度的概率分布,并进行数值分析.研究结果可应用于IEEE 802.11移动自组织网络.     

A group-based channel assignment protocol for rate separation in IEEE 802.11-based multi-radio multi-rate ad hoc networks

Today’s IEEE 802.11 devices support multiple channels and data rates. Utilizing multiple channels and data rates can increase the performance of IEEE 802.11 networks. However, the multi-channel design to exploit available channels is one of the challenging issues. Moreover, performance anomaly occurs in IEEE 802.11 multi-rate networks when high-rate and low-rate links share a common channel, which degrades the overall network capacity significantly. In this paper, we introduce an extension of conflict graph, called rate conflict graph (RCG), to understand the performance anomaly problem in IEEE 802.11 multi-rate networks. Then, we propose a group-based channel assignment (GCA) protocol for IEEE 802.11-based multi-radio multi-rate single-hop ad hoc networks. In GCA, each node is equipped with multiple IEEE 802.11 interfaces, and links are subdivided into multiple groups, called component groups, by obeying the interface constraints. Then, GCA utilizes RCG and a heuristic algorithm to separate different data rate links via multiple channels so that the performance anomaly problem is addressed. Our extensive simulation results reveal that GCA achieves improved performance over existing channel assignment protocols designed to consider performance anomaly.     

Achieving performance enhancement in IEEE 802.11 WLANs by using the DIDD backoff mechanism

Wireless local area networks (WLANs) based on the IEEE 802.11 standards have been widely implemented mainly because of their easy deployment and low cost. The IEEE 802.11 collision avoidance procedures utilize the binary exponential backoff (BEB) scheme that reduces the collision probability by doubling the contention window after a packet collision. In this paper, we propose an easy‐to‐implement and effective contention window‐resetting scheme, called double increment double decrement (DIDD), in order to enhance the performance of IEEE 802.11 WLANs. DIDD is simple, fully compatible with IEEE 802.11 and does not require any estimation of the number of contending wireless stations. We develop an alternative mathematical analysis for the proposed DIDD scheme that is based on elementary conditional probability arguments rather than bi‐dimensional Markov chains that have been extensively utilized in the literature. We carry out a detailed performance study and we identify the improvement of DIDD comparing to the legacy BEB for both basic access and request‐to‐send/clear‐to‐send (RTS/CTS) medium access mechanisms. Copyright © 2006 John Wiley & Sons, Ltd.     

A survey on congestion control for mobile ad hoc networks

Congestion control is a key problem in mobile ad hoc networks. The standard congestion control mechanism of the Transmission Control Protocol (TCP) is not able to handle the special properties of a shared wireless multi‐hop channel well. In particular, the frequent changes of the network topology and the shared nature of the wireless channel pose significant challenges. Many approaches have been proposed to overcome these difficulties. In this paper, we give an overview over existing proposals, explain their key ideas and show their interrelations. Copyright © 2007 John Wiley & Sons, Ltd.     

AID‐based backoff for throughput enhancement in 802.11ah networks

IEEE 802.11ah is a WiFi standard developed to address requirements associated with the heterogeneous nature of the Internet of Things. It uses the sub‐1 GHz bands to enable long‐range transmissions for low‐power devices. However, long‐range coverage exacerbates the hidden node problem. To mitigate this problem, sectorization and grouping have been proposed by the standard. In this paper, hierarchical clustering and a modified Welsh‐Powell algorithm are combined to create hidden node‐free groups in a sectorized wireless local area network. An analytical model is developed for a deterministic backoff technique that uses association identifiers to set the backoff in order to eliminate collisions. The performance of the deterministic backoff technique is compared with that of existing schemes. Our results show that this approach results in higher throughput and lower latency than other deterministic backoff techniques.     

A network coding based interference cancelation scheme for wireless ad hoc networks

The performance of wireless networks is limited by multiple access interference (MAI) in the traditional communication approach where the interfered signals of the concurrent transmissions are treated as noise. In this paper, we treat the interfered signals from a new perspective on the basis of additive electromagnetic (EM) waves and propose a network coding based interference cancelation (NCIC) scheme. In the proposed scheme, adjacent nodes can transmit simultaneously with careful scheduling; therefore, network performance will not be limited by the MAI. Additionally we design a space segmentation method for general wireless ad hoc networks, which organizes network into clusters with regular shapes (e.g., square and hexagon) to reduce the number of relay nodes. The segmentation method works with the scheduling scheme and can help achieve better scalability and reduced complexity. We derive accurate analytic models for the probability of connectivity between two adjacent cluster heads which is important for successful information relay. We proved that with the proposed NCIC scheme, the transmission efficiency can be improved by at least 50% for general wireless networks as compared to the traditional interference avoidance schemes. Numeric results also show the space segmentation is feasible and effective. Finally we propose and discuss a method to implement the NCIC scheme in a practical orthogonal frequency division multiplexing (OFDM) communications networks. Copyright © 2009 John Wiley & Sons, Ltd.     

Goodput and throughput comparison of single‐hop and multi‐hop routing for IEEE 802.11 DCF‐based wireless networks under hidden terminal existence

We investigate how multi‐hop routing affects the goodput and throughput performances of IEEE 802.11 distributed coordination function‐based wireless networks compared with direct transmission (single hopping), when medium access control dynamics such as carrier sensing, collisions, retransmissions, and exponential backoff are taken into account under hidden terminal presence. We propose a semi‐Markov chain‐based goodput and throughput model for IEEE 802.11‐based wireless networks, which works accurately with both multi‐hopping and single hopping for different network topologies and over a large range of traffic loads. Results show that, under light traffic, there is little benefit of parallel transmissions and both single‐hop and multi‐hop routing achieve the same end‐to‐end goodput. Under moderate traffic, concurrent transmissions are favorable as multi‐hopping improves the goodput up to 730% with respect to single hopping for dense networks. At heavy traffic, multi‐hopping becomes unstable because of increased packet collisions and network congestion, and single‐hopping achieves higher network layer goodput compared with multi‐hop routing. As for the link layer throughput is concerned, multi‐hopping increases throughput 75 times for large networks, whereas single hopping may become advantageous for small networks. The results point out that the end‐to‐end goodput can be improved by adaptively switching between single hopping and multi‐hopping according to the traffic load and topology. Copyright © 2015 John Wiley & Sons, Ltd.     

Throughput guarantees for multi-priority traffic in ad hoc networks

In this paper, we present MPARC (Multi-Priority Admission and Rate Control), a novel joint admission control and rate policing protocol for multi-priority ad hoc networks. MPARC is based on our novel bandwidth allocation model, which captures the bandwidth allocation for saturated, unsaturated and semi-saturated networks. MPARC guarantees that the throughput of admitted realtime flows will not decrease due to later arriving realtime flows with equal or lower priorities or due to best effort flows. MPARC achieves this goal by performing accurate admission control on every newly arriving realtime flow and appropriate rate policing on all best effort traffic. Through simulation, we demonstrate that MPARC has better performance than existing approaches.     

A roadside unit‐based localization scheme for vehicular ad hoc networks

Vehicular Ad Hoc Networks (VANETs), designed to ensure the safety and comfort of passengers via the exchange of information amongst nearby vehicles or between the vehicles and Roadside Units (RSUs), have attracted particular attention. However, the success of many VANET applications depends on their ability to estimate the vehicle position with a high degree of precision, and thus, many vehicle localization schemes have been proposed. Many of these schemes are based on vehicle‐mounted Global Positioning System (GPS) receivers. However, the GPS signals are easily disturbed or obstructed. Although this problem can be resolved by vehicle‐to‐vehicle communication schemes, such schemes are effective only in VANETs with a high traffic density. Accordingly, this paper presents a VANET localization scheme in which each vehicle estimates its location on the basis of beacon messages broadcast periodically by pairs of RSUs deployed on either side of the road. In addition, three enhancements to the proposed scheme are presented for the RSU deployment, RSU beacon collisions, and RSU failures. Overall, the ns‐2 simulation results show that the localization scheme achieves a lower localization error than existing solutions on the basis of vehicle‐to‐vehicle communications and is robust toward changes in the traffic density and the vehicle speed. Copyright © 2012 John Wiley & Sons, Ltd.     

Ad hoc空间网络密钥管理与认证方案

为了使一组卫星动态配置成一个具有灵活的分布式体系结构的集成网络信息系统，可以采用ad hoc组网方式，这种卫星网络的组网方式带来了新的安全挑战。提出了一个灵活的安全方案，设计了公钥基础设施和认证策略。基于完全分布式的认证中心，可以直接采用几乎所有的标准公钥认证协议。当空间节点的计算能力有限时，设计了一个轻型的基于对称密钥算法和单向散列函数的认证协议，在提供保密性和数据完整性的同时大大减小了计算量。     

车载网络IEEE 802.11p协议的特性研究

为了深入探讨车载网络协议IEEE 802.11p的特性,首先对该协议的物理层、媒体控制访问层及其帧结构进行了详细介绍,然后从工作频率、传输速率及最大功耗等方面与其他短距离无线通信技术进行对比分析,最后归纳出车载网络协议IEEE 802.11p作为一项新的协议标准,在车载网络的实际应用中有着区别于其他无线通信技术的特有优势。因此,对该协议的突破性研究,将有助于车载网络技术在智能交通系统领域走向实用,既具有一定的理论意义,又具有重要的应用前景。