The performance of wireless body area networks (WBANs) may be degraded due to co-channel interference, i.e., when sensors of different coexisting WBANs transmit at the same time-slots using the same channel. In this paper, we exploit the 16 channels available in the 2.4 GHz unlicensed international band of ZIGBEE, and propose a distributed scheme that opts to avoid interference through channel to time-slot hopping based on Latin rectangles, DAIL. In DAIL, each WBAN's coordinator picks a Latin rectangle whose rows are ZIGBEE channels and columns are time-slots of its superframe. Subsequently, it assigns a unique symbol to each sensor; this latter forms a transmission pattern according to distinct positions of its symbol in the rectangle, such that collisions among different transmissions of coexisting WBANs are minimized. We further present an analytical model that derives bounds on the collision probability of each sensor's transmission in the network. In addition, the efficiency of DAIL in interference mitigation has been validated by simulations.
Other approaches pursued multiple access schemes for interference mitigation. , @cite_5 have proposed a distributed -based beacon interval shifting scheme where, the wake up period of a is made to not overlap with other s by employing carrier sense before a beacon transmission. Whilst, , @cite_1 adopts for scheduling transmissions within a and carrier sensing mechanism to deal with inter- interference. In @cite_9 , many topology-dependent transmission scheduling algorithms have been proposed to minimize the frame length in multihop packet radio networks using and . For single-channel networks, the and the for topology-transparent broadcast scheduling is proposed. The obtains much smaller than the existing scheme while the can even achieve possible performance gain when compared with the . In one-hop rather than multi-hop communication scheme, like , using Latin squares better schedules the medium access and consequently significantly diminishes the inter- interference.
@cite_5 @cite_9 @cite_1
2020650131 2107421266 2167712047 2045567371
The goal of this paper is to establish which practical routing schemes for wireless networks are most suitable for power-limited and bandwidth-limited communication regimes. We regard channel state information (CSI) at the receiver and point-to-point capacity-achieving codes for the additive white Gaussian noise (AWGN) channel as practical features, interference cancellation (IC) as possible, but less practical, and synchronous cooperation (CSI at the transmitters) as impractical. We consider a communication network with a single source node, a single destination node, and N-1 intermediate nodes placed equidistantly on a line between them. We analyze the minimum total transmit power needed to achieve a desired end-to-end rate for several schemes and demonstrate that multihop communication with spatial reuse performs very well in the power-limited regime, even without IC. However, within a class of schemes not performing IC, single-hop transmission (directly from source to destination) is more suitable for the bandwidth-limited regime, especially when higher spectral efficiencies are required. At such higher spectral efficiencies, the gap between single-hop and multihop can be closed by employing IC, and we present a scheme based upon backward decoding that can remove all interference from the multihop system with an arbitrarily small rate loss. This new scheme is also used to demonstrate that rates of O(log N) are achievable over linear wireless networks even without synchronous cooperation. A comprehensive study of the problem of scheduling broadcast transmissions in a multihop, mobile packet radio network is provided that is based on throughput optimization subject to freedom from interference. It is shown that the problem is NP complete. A centralized algorithm that runs in polynomial time and results in efficient (maximal) schedules is proposed. A distributed algorithm that achieves the same schedules is then proposed. The algorithm results in a maximal broadcasting zone in every slot. > In this paper, we propose a cross-layer deflect routing scheme that improves effective throughput of multi-hop millimeter-wave wireless personal area network (mmWave WPAN) system. The upcoming mmWave WPAN is designed to provide Gbps-order transmission capability, targeting applications like high definition TV (HDTV) transmission, high speed wireless docking and gaming etc. Adopting multi-hop relay offers solutions to the issues existing in mmWave WPAN system such as limited coverage range caused by the significant path loss, dramatic communication link change due to the unexpected blockage of the line-of-sight (LOS) path etc. However, multi-hop relay on the other hand decreases the effective throughput because of the required extra time. As a result, the compromised throughput may not be able to support the above applications which are greedy for data rate. Inspired by the fact that the significant path loss of millimeter-wave environment can provide good space isolation, our proposed scheme manages to improve the multi-hop throughput by sharing time slots for relay path with direct path for other transmissions. We also propose two algorithms, namely random fit deflect routing (RFDR) and best fit deflect routing (BFDR), to find the relay path on which the interference due to time slot sharing is low enough to guarantee the concurrent transmissions. Computer simulations show that, in realistic 60GHz environment, the effective multi-hop throughput can be improved up to 45 . The enormous success of advanced wireless devices is pushing the demand for higher wireless data rates. Denser spectrum reuse through the deployment of more access points (APs) per square mile has the potential to successfully meet such demand. In principle, distributed multiuser multiple-input-multiple-output (MU-MIMO) provides the best approach to infrastructure density increase since several access points are connected to a central server and operate as a large distributed multiantenna access point. This ensures that all transmitted signal power serves the purpose of data transmission, rather than creating interference. In practice, however, a number of implementation difficulties must be addressed, the most significant of which is aligning the phases of all jointly coordinated APs. In this paper, we propose AirSync, a novel scheme that provides timing and phase synchronization accurate enough to enable distributed MU-MIMO. AirSync detects the slot boundary such that all APs are time-synchronous within a cyclic prefix (CP) of the orthogonal frequency-division multiplexing (OFDM) modulation and predicts the instantaneous carrier phase correction along the transmit slot such that all transmitters maintain their coherence, which is necessary for multiuser beamforming. We have implemented AirSync as a digital circuit in the field programmable gate array (FPGA) of the WARP radio platform. Our experimental testbed, comprising four APs and four clients, shows that AirSync is able to achieve timing synchronization within the OFDM CP and carrier phase coherence within a few degrees. For the purpose of demonstration, we have implemented two MU-MIMO precoding schemes, Zero-Forcing Beamforming (ZFBF) and Tomlinson-Harashima Precoding (THP). In both cases, our system approaches the theoretical optimal multiplexing gains. We also discuss aspects related to the MAC and multiuser scheduling design, in relation to the distributed MU-MIMO architecture. To the best of our knowledge, AirSync offers the first realization of the full distributed MU-MIMO multiplexing gain, namely the ability to increase the number of active wireless clients per time-frequency slot linearly with the number of jointly coordinated APs, without reducing the per client rate.