A novel hidden station detection mechanism in IEEE 802.11 WLAN

The popular IEEE 802.11 wireless local area network (WLAN) is based on a carrier sense multiple access with collision avoidance (CSMA/CA), where a station listens to the medium before transmission in order to avoid collision. If there exist stations which can not hear each other, i.e., hidden stations, the potential collision probability increases, thus dramatically degrading the network throughput. The RTS/CTS (request-to-send/clear-to-send) frame exchange is a solution for the hidden station problem, but the RTS/CTS exchange itself consumes the network resources by transmitting the control frames. In order to maximize the network throughput, we need to use the RTS/CTS exchange adaptively only when hidden stations exist in the network. In this letter, a simple but very effective hidden station detection mechanism is proposed. Once a station detects the hidden stations via the proposed detection mechanism, it can trigger the usage of the RTS/CTS exchange. The simulation results demonstrate that the proposed mechanism can provide the maximum system throughput performance.     

Distributed code assignments for CDMA packet radio networks

Code-division multi-access (CDMA) techniques allow many users to transmit simultaneously in the same band without substantial interference by using approximately orthogonal (low cross-correlation) spread-spectrum waveforms. Two-phase algorithms have been devised to assign and reassign spread-spectrum codes to transmitters, to receivers and to pairs of stations in a large dynamic packet radio network in polynomial times. The purpose of the code assignments is to spatially reuse spreading codes to reduce the possibility of packet collisions and to react dynamically to topological changes. These two-phase algorithms minimize the time complexity in the first phase and minimize the number of control packets needed to be exchanged in the second phase. Therefore, they can start the network operation in a short time, then switch to the second phase with the goal of adapting to topological changes. A pairwise code-assignment scheme is proposed to assign codes to edges. Simulations based on well-controlled topologies (sparse topologies) show that the scheme requires much fewer codes than transmitter-based code assignment, while maintaining similar throughput performance     

Assigning codes in wireless networks: bounds and scaling properties

In the Code Division Multiple Access (CDMA) framework, collisions that can occur in wireless networks are eliminated by assigning orthogonal codes to stations, a problem equivalent to that of coloring graphs associated to the physical network. In this paper we present new upper and lower bounds for two versions of the problem (hidden and primary collision avoidance – HPCA – or hidden collision avoidance only – HCA). In particular, optimal assignments for special topologies and heuristics for general topologies are proposed. The schemes show better average results with respect to existing alternatives. Furthermore, the gaps between the upper bound given by the heuristic solution, the lower bound obtained from the maximumclique problem, and the optimal solution obtained by branch and bound are investigated in the different settings. A scaling law is then proposed to explain the relations between the number of codes needed in Euclidean networks with different station densities and connection distances. The substantial difference between the two versions HPCA and HCA of the problem is investigated by studying the probabilistic distribution of connections as a function of the distance, and the asymptotic size of the maximum cliques.     

基于载波监听的Ad Hoc网络双信道接入协议研究

双信道接入协议在解决隐终端和暴露终端问题上具有独特的优势.基于报文监听的Ad Hoc网络双信道接入协议无法消除数据报文的冲突.本文对基于载波监听的Ad Hoc网络双信道接入协议进行了研究,提出了DCMA载波监听信道接入协议.其中DCMA_CSBI通过载波监听和BI控制报文完全解决了隐终端和暴露终端问题.文章通过仿真对DCMA协议的性能进行了分析和比较.分析结果表明DCMA_CSBI是一种非常高效实用的Ad Hoc网络双信道接入协议,载波监听对Ad Hoc网络信道接入协议而言是至关重要的.     

TCP Throughput Enhancement over Wireless Mesh Networks

TCP is the predominant technology used on the Internet to support upper layer applications with reliable data transfer and congestion control services. Furthermore, it is expected that traditional TCP applications (e.g., Internet access) will continue to constitute the major traffic component during the initial deployment of wireless mesh networks. However, TCP is known for its poor throughput performance in wireless multihop transmission environments. For this article, we conducted simulations to examine the impact of two channel interference problems, the hidden terminal and exposed terminal, on TCP transmissions over wireless mesh networks. We also propose a multichannel assignment algorithm for constructing a wireless mesh network that satisfies the spatial channel reuse property and eliminates the hidden terminal problem. The simulation results demonstrate the effectiveness of the proposed approach in improving the performance of TCP in wireless multihop networks.     

Density‐adaptive network reprogramming protocol for wireless sensor networks

Network reprogramming is a process used to update program codes of sensor nodes that are already deployed. To deal with potentially unstable link conditions of wireless sensor networks, the epidemic approach based on 3‐way advertise‐request‐data handshaking is preferred for network reprogramming. Existing epidemic protocols, however, require a long completion period and high traffic overhead in high‐density networks, mainly due to the hidden terminal problem. In this paper, we address this problem by dynamically adjusting the frequency of advertisement messages in terms of the density of sensor nodes, which is the number of sensor nodes in a certain area. We compare the performance of the proposed scheme, called DANP (Density‐Adaptive Network Reprogramming Protocol), with a well‐known epidemic protocol, Deluge. Simulations indicate that, in the grid topologies, DANP outperforms Deluge by about 30% in terms of the completion time and about 50% in terms of the traffic overhead. Significant performance gain is observed in random topologies as well. The performance of DANP is further confirmed via measurements in an experimental test bed. Copyright © 2009 John Wiley & Sons, Ltd.     

基于多信道预约可冲突避免的多址接入协议

本文为多跳分布多无线网络提出了一套灵活而有效的自适应获取冲突避免（AACA）的多址接入协议。在该协议中，各节点竞争公共信道，利用RTS/CTS对话形式来预约各业务信道，成功预约后的分组传输不会受到其他节点的干扰。它使用任意确定数目信道，以异步方式工作，并且使得各节点利用半双工无线电台就可以灵活、简便地实现资源预约。分析和比较结果说明，所提出的多信道预约协议可以有效地解决隐藏终端、暴露终端以及侵入终端的问题。     

On Busy-Tone Based MAC Protocol for Wireless Networks with Directional Antennas

The application of directional antennas in wireless ad hoc networks offers numerous benefits, such as the extended communication range, the increased spatial reuse, the improved capacity and the suppressed interference. However, directional antennas can cause new location-dependent carrier sensing problems, such as new hidden terminal and deafness problems, which can severely degrade the network performance. Recently, a few schemes have been proposed to address these problems. However, most of these existing methods can only partially solve the hidden terminal and deafness problems. Some of them even bring significant performance overhead. In this paper, we propose a novel MAC protocol, in terms of the busy-tone based directional medium access control (BT-DMAC) protocol. In BT-DMAC, when the transmission is in progress, the sender and the receiver will turn on their omni-directional busy tones to protect the on-going transmission. Integrating with the directional network allocation vector (DNAV), the scheme can almost mitigate the hidden terminal problem and the deafness problem completely. We then propose an analytical model to investigate the throughput performance of BT-DMAC. The numerical results show that BT-DMAC outperforms other existing directional MAC schemes. We next evaluate the performance of BT-DMAC through extensive simulation experiments. The results show that our proposed BT-DMAC scheme has superior performance to other existing solutions, in terms of higher throughput.     

Planning reliable UMTS terrestrial access networks

The Universal Mobile Telecommunication System (UMTS) will play a very important role in the telecommunication market of the near future. Due to the wide range of services and the increased transmission capacity, UMTS will become one of the most important access network types. The proposed topology of the UMTS terrestrial access network is tree-like, but the high amount of carried traffic requires a more reliable network structure. We introduce two types of heuristic algorithms to solve this problem, and we plan network topologies having a low magnitude of traffic loss in case of failures. One of our algorithms solves the problem by modifying the tree-topology, while others expand the network by inserting additional links. We show how to find a good compromise between topology refinement and network expansion in the case of realistic network scenarios, and we confirm our results by detailed tests     

分布式认知无线网络中的频谱接入凸规划算法

针对分布式认知无线网络中所可能存在的多频道隐终端问题,以及分布式协调方法(DCF)在随机冲突下性能下降的问题,该文以最优化网络的效用值为目标,将各个认知节点的接入概率作为求解对象,在分布式认知无线网络中建立了一个通用的凸规划模型。同时,基于凸规划算法,提出了一种分布式的信道接入 (DSAC) 算法对目标问题进行求解,从而决定认知网络中每个节点以及每条链路的接入概率。仿真结果表明,DSAC算法能够在较少的迭代次数内实现收敛;与普通的DCF方法相比,DSAC算法可以有效地提高网络中同时传输的链路个数,提高了频谱利用率以及网络吞吐量。     

Study on coexistence between DCS1800 and TDD-LTE systems in multi-mode terminals

It's well known that the mobile stations will comprise a wide range of radio access technologies (RAT), providing user with flexible and efficient access to multi-media service and high data rate communications. Although much work has been done for coexistence analysis between different systems base stations (BS), most of them have not addressed the interference within multi-mode terminal. Hence, for filling the gap, The authors in the article present coexistence studyies of digital cellular system at 1 800 MHz (DCS1800) and time division duplex long term evolution (TDD-LTE) network in multi-mode terminal with multi-service provisioning. A new system model for coexistence was introduced and how deterministic analysis can be done within the terminal was explained. The interference evaluation model was given based on relations between reference sensitivity and signal-to-noise ratio (SNR), which is also deduced. The system simulation methodology was provided and assumption used in simulation was given. Simulation results were shown with different system parameters. Numeric results indicate that multi-mode terminal is mainly affected by local interference. The minimum antenna isolation required for a health system operation was provided.     

一种适合无线多跳Mesh网络的MAC协议研究

提出了一种适合全分布方式无线多跳网络的MAC层协议,使用带外信号来调度媒体接入,以解决隐藏终端和暴露终端问题。仿真结果显示,网络吞吐量和端到端延迟都得到了明显改善。     

A New MAC Scheme Supporting Voice/Data Traffic in Wireless Ad Hoc Networks

In wireless ad hoc networks, in addition to the well-known hidden terminal and exposed terminal problems, the location-dependent contention may cause serious unfairness and priority reversal problems. These problems can severely degrade network performance. To the best of our knowledge, so far there is no comprehensive study to fully address all these problems. In this paper, a new busy-tone based medium access control (MAC) scheme supporting voice/data traffic is proposed to address these problems. Via two separated narrow-band busy-tone channels with different carrier sense ranges, the proposed scheme completely resolves the hidden terminal and exposed terminal problems. Furthermore, with the use of transmitter busy-tones in the node backoff procedure, the proposed scheme ensures guaranteed priority access for delay-sensitive voice traffic over data traffic. The priority is also independent of the user locations, thus solving the priority reversal problem. The fairness performance for data traffic in a non-fully-connected environment is also greatly improved (as compared with the popular IEEE 802.11e MAC scheme) without the need for extra information exchanges among the nodes.     

A Detection-Switching-Assisted DCF Mechanism for Simulcast WLAN-over-Fiber Based Distributed Antenna Systems

Distributed antenna systems (DASs) using Radio-over-fiber (RoF) links is a promising candidate to provide flexible coverage and high data rates. For simul-cast Wireless local-area network (WLAN) use in RoF sys-tems, the stations covered by different Remote antenna units (RAUs) contend for the wireless medium using Me-dia access control (MAC) mechanism. Severe inter-RAU hidden nodes problem will happen due to the stations in different RAUs cannot detect each other very well. In order to alleviate this inter-RAU collision problem, a promis-ing detection-switching-assisted Distributed coordination function (DCF) mechanism is presented using in the up-link. The control delay issues of the proposed mechanism are also discussed in this paper.     

Rain Scatter Interference in mm-Wave Broadband Fixed Wireless Access Networks Caused by a 2-D Dynamic Rain Environment

The classical Mie scattering theory together with the bistatic radar equation has been applied in this paper to quantify interference levels in broadband fixed wireless access (BFWA) for two different network topologies: mesh and cellular. The complete scattering analysis takes into account the realistic variations of rainfall along the propagation paths and inside the common volume. The interfering element is a rain cell model that follows closely the experimental characteristic dimension, decay and movement obtained in recent research by the authors. The signal-to-interference power ratios (S/I) for two different frequencies, 28 and 42 GHz, and several scattering angles have been calculated. They show that, when two beams cross each other, rain-induced interference must be taken into account for an efficient planning of radio communication systems operating at these millimeter-wave frequencies as well as for an adequate design and implementation of fade mitigation techniques.     

基于负载均衡的中继选择和频谱转移联合优化策略

针对负载失衡或热点覆盖无线中继网络,提出一种基于负载均衡的自适应中继选择和频谱转移联合优化策略。定义了一种衡量一个站点对周围同频站点干扰程度的干扰容量,为某站点对其他站点的干扰提供了量化分析指标。当用户申请接入时,首先根据各条链路的信道状况选择首选接入站点和备选接入站点,当首选接入站点负载过重而无足够资源使其接入时,对接入备选站点和从与首选站点同扇区的其他站点向首选站点进行频谱转移的性能进行比较,选择一种维持系统性能较好的方式接入。仿真结果表明,所提算法在中心小区的频谱效率和阻塞率都优于单一的基于负载均衡的中继选择策略和单一的基于负载均衡的频谱转移策略,并且平均干扰容量也最低,对周围小区的系统性能影响较小。     

Transmitter-Oriented Code Assignment for Multihop Packet Radio

Quasi-orthogonal codes are assigned to transmitters in a packet radio network such that interference caused by hidden terminals is eliminated. In addition, a handshaking protocol permits random access between nodes. Simple mathematical models and simulation indicate a potential throughput advantage over slotted ALOHA and CSMA.     

Cluster based resource allocation in two‐tier HetNets with hierarchical throughput constraints

Two‐tier heterogeneous networks (HetNets), formed by deploying small cell base stations (SBSs) over existing macrocells, can enhance the network performance in future fifth generation network. However, the cross‐/co‐tier interference in HetNets also will severely influence the user throughput of both tiers. In this paper, we investigate the resource allocation and interference mitigation problem in cluster based orthogonal frequency division multiple access (OFDMA) two‐tier HetNets. In a typical cluster, one SBS is selected as the cluster head to allocate resources among all small cells to guarantee their throughput requirements. Hybrid access policy enables small cells to suppress the cross‐tier interference and earn additional revenue from macrocells, but it also leads to decrease of available resources for small cell users (SUs). To compensate hybrid access SBSs for their resources loss, we impose hierarchical SU throughput constraints on the optimization problem, which guarantee these small cells more resources than closed access ones. Besides, the cross‐tier interference constraint is also considered to protect the transmissions of macrocell users. Accordingly, a subgradient iteration based resource allocation algorithm is proposed. Numerical results show that the proposed algorithm can satisfy SU throughput constraints of all small cells with different access policies and guarantee quality of service requirements of all accessed macrocell users in hybrid access small cells.     

Frequency-hopped multiple access communications with coding andside information

The authors consider frequency-hopped spread-spectrum multiple-access communications using M-ary modulation and error-correction coding. The major concerns are multiple-access interference and the network capacity in terms of the number of users that can transmit simultaneously for a given level of codeword error probability. Block coding is studied in detail. The authors first consider the use of Q-ary Reed-Solomon (RS) codes in combination with M-ary modulation with mismatched alphabets so that Q>M. It is shown that the network capacity is drastically reduced in comparison with the system with matched alphabets. As a remedy, the use of matched M-ary BCH codes is proposed as an alternative to mismatched RS codes. It is shown that when the number of users in the system is large, a BCH code outperforms an RS code with a comparable code rate and decoding complexity. The authors consider the use of a robust technique for generation of reliable side information based on a radio-threshold test. They analyze its performance in conjunction with MFSK and error-erasure correction decoding. It is shown that this nonideal ratio-threshold method can increase the network capacity in comparison with the system with perfect side information     

Two-phase coding multichannel MAC protocol with MAI mitigation for mobile ad hoc networks

This letter introduces a novel multichannel medium access control (MAC) protocol for mobile ad hoc networks (MANETs) based on a scalable two-phase coding scheme, which eliminates the hidden terminal problem (HTP) without exchange of neighborhood information. Furthermore, power control is incorporated to mitigate multiple-access interference (MAI). Simulation results show that significant improvement can be achieved by the proposed protocol over IEEE 802.11 DCF.