We focus on interference mitigation and energy conservation within a single wireless body area network (WBAN). We adopt two-hop communication scheme supported by the the IEEE 802.15.6 standard (2012). In this paper, we propose a dynamic channel allocation scheme, namely DCAIM to mitigate node-level interference amongst the coexisting regions of a WBAN. At the time, the sensors are in the radius communication of a relay, they form a relay region (RG) coordinated by that relay using time division multiple access (TDMA). In the proposed scheme, each RG creates a table consisting of interfering sensors which it broadcasts to its neighboring sensors. This broadcast allows each pair of RGs to create an interference set (IS). Thus, the members of IS are assigned orthogonal sub-channels whereas other sonsors that do not belong to IS can transmit using the same time slots. Experimental results show that our proposal mitigates node-level interference and improves node and WBAN energy savings. These results are then compared to the results of other schemes. As a result, our scheme outperforms in all cases. Node-level signal to interference and noise ratio (SINR) improved by 11dB whilst, the energy consumption decreased significantly. We further present a probabilistic method and analytically show the outage probability can be effectively reduced to the minimal.
Authors of @cite_13 consider a sensor network with slot based transmission scheme. This work provides an analytical framework to optimize the size of relay-zone around each source node. Authors of @cite_8 propose a resource allocation scheme for interference mitigation among multiple coexisting WBANs. Each pair of interfering WBANs form an interference region. However, the nodes belonging to this region are later allocated orthogonal sub-channels. Whilst, other nodes that do not belong to this region transmit using the same time slot.
@cite_13 @cite_8
2083602816 1922004315 2292788438 2061634004 2096287546 2040452784 1889296357 2156149655 2038464572 2151090982 2159297871 2051376838 2024516306 1992806133 2003424643 2540490069 2950588791 2046388897 2635604129 2156919687
In this paper, a dynamic resource allocation scheme is proposed to avoid interference amongst coexisting Wireless Body Area Networks (WBAN). In the proposed scheme, each WBAN generates a table consisting of interfering nodes from coexisting WBANs in its vicinity. Then each WBAN broadcasts this table to its neighbors, which allows for efficient interpretation of an Interference Region (IR) between each pair of WBANs. The nodes in the IR are later allocated orthogonal sub-channels; whilst nodes that do not exist in the IR can potentially transmit in the same time interval. We further demonstrate a precise trade- off between the minimum interference level and spatial reuse. Simulation results show that our proposed scheme has far better spectral efficiency compared to the conventional orthogonal schemes, whilst maintaining an acceptable interference level. We also provide mathematical analysis on the proposed scheme to validate its efficiency for increasing spectral efficiency and avoiding interference. To further reduce the interference level, we propose a probabilistic approach, and analytically show that the outage probability can be effectively reduced at the cost of very small change in the spatial reuse factor. Index Terms—Wireless Body Area Networks, Spectral Effi- ciency, IEEE 802.15.6, Interference Mitigation In this paper, we study the interference mitigation scheme in a network with multiple co-located wireless body area networks (WBANs). Each WBAN consists of a coordinator and multiple sensor nodes. Interference happens when multiple nodes transmit to their coordinators at the same time. Our objective is twofold: firstly we want to construct an interference-free time slot schedule for all the nodes in the network; secondly we want to minimize the transmission cycle of all the nodes. Towards such goal, we map different time slots to distinct colors and propose a WBAN distributed coloring (DC) algorithm to find a color assignment for each node in the network. To implement the algorithm, the coordinators need to exchange messages for multiple rounds to achieve a non-conflict coloring scheme distributively. The simulation results show that on average the proposed algorithm has a significant performance gain over existing schemes. In this paper, we propose a distributed multi-hop interference avoidance algorithm, namely, IAA to avoid co-channel interference inside a wireless body area network (WBAN). Our proposal adopts carrier sense multiple access with collision avoidance (CSMA CA) between sources and relays and a flexible time division multiple access (FTDMA) between relays and coordinator. The proposed scheme enables low interfering nodes to transmit their messages using base channel. Depending on suitable situations, high interfering nodes double their contention windows (CW) and probably use switched orthogonal channel. Simulation results show that proposed scheme has far better minimum SINR (12dB improvement) and longer energy lifetime than other schemes (power control and opportunistic relaying). Additionally, we validate our proposal in a theoretical analysis and also propose a probabilistic approach to prove the outage probability can be effectively reduced to the minimal. In small cell networks (SCNs) co-channel interference is an important issue, and necessitates the use of interference mitigation strategies that allocate resources efficiently. This work discusses a distributed utility-based algorithm for downlink resource allocation (i.e., power and scheduling weights per carrier) in multicarrier SCNs. The proposed distributed downlink resource allocation (DDRA) algorithm aims to maximize the sum utility of the whole system. To achieve this goal, each base station (BS) selects the resource allocation strategy to maximize a surplus function comprising both, own cell utility and interference prices (that reflect the interference that is caused to neighboring cells). Two different utility functions are considered: max-rate and proportional fair-rate. For performance evaluation, a SCN deployed in a single story WINNER office building is considered. Simulation results show that the proposed algorithm is effective in enhancing not only the sum data rate of a SCN, but also the degree of fairness in resource sharing among users. We study the use of wireless relay channel in a one-hop sensor network with random packet arrival. Exploiting regular sensor nodes to serve in a wireless relay channel can increase the overall network capacity. However, due to asynchronous source transmission, the relays interfere with each other's transmission and reception. The fundamental trade-off between these two issues leads us to an optimization problem in which we find the optimum relay zone radius to maximize the overall sum rate of the network. We also propose a MAC protocol to choose the optimum number of sources allowed to transmit under this setting. The overall system capacity is proven to increase significantly under the proposed scheme, compared with cases where relay nodes are not exploited or where the relay zone radius is suboptimal In this paper, coexistence of multiple mobile wireless body area networks (WBANs), where there is no coordination between WBANs, is investigated for the case where the WBAN-of-interest employs cooperative communications. A decode-and-forward protocol with two dual-hop links, two relays and selection combining (SC) at the hub (or gateway device) is chosen for the WBAN-of-interest. A suitable time-division-multiple-access (TDMA) scheme is used, enabling intra-network and inter-network operation, to allocate slots for each Tx Rx link packet transmission. Realistic channel models are employed with various amounts of shadowing, small-scale fading and white noise introduced between WBANs. For the WBAN-of-interest, many hours of measured channel gain data is employed to emulate the channel for this WBAN. It is found that the chosen cooperative communications provides significantly better co-channel interference mitigation than single-link star topology WBAN communications in a mobile, dynamic, scenario, hence the signal-to-interference-plus-noise ratio (SINR) for 10 outage probability at the hub is greatly improved by up-to 12 dB. It is also demonstrated that the location of the hub, given three typical locations, has significant impact on the performance of the cooperative WBAN communications. In this paper, we study resource allocation for multiuser multiple-input–single-output secondary communication systems with multiple system design objectives. We consider cognitive radio (CR) networks where the secondary receivers are able to harvest energy from the radio frequency when they are idle. The secondary system provides simultaneous wireless power and secure information transfer to the secondary receivers. We propose a multiobjective optimization framework for the design of a Pareto-optimal resource allocation algorithm based on the weighted Tchebycheff approach. In particular, the algorithm design incorporates three important system design objectives: total transmit power minimization, energy harvesting efficiency maximization, and interference-power-leakage-to-transmit-power ratio minimization. The proposed framework takes into account a quality-of-service (QoS) requirement regarding communication secrecy in the secondary system and the imperfection of the channel state information (CSI) of potential eavesdroppers (idle secondary receivers and primary receivers) at the secondary transmitter. The proposed framework includes total harvested power maximization and interference power leakage minimization as special cases. The adopted multiobjective optimization problem is nonconvex and is recast as a convex optimization problem via semidefinite programming (SDP) relaxation. It is shown that the global optimal solution of the original problem can be constructed by exploiting both the primal and the dual optimal solutions of the SDP-relaxed problem. Moreover, two suboptimal resource allocation schemes for the case when the solution of the dual problem is unavailable for constructing the optimal solution are proposed. Numerical results not only demonstrate the close-to-optimal performance of the proposed suboptimal schemes but unveil an interesting tradeoff among the considered conflicting system design objectives as well. In this paper, a cooperative two-hop communication scheme, together with opportunistic relaying (OR), is applied within a mobile wireless body area network (WBAN). Its effectiveness in interference mitigation is investigated in a scenario where there are multiple closely-located networks. Due to a typical WBAN's nature, no coordination is used among different WBANs. A suitable time-division-multiple-access (TDMA) scheme is adopted as both an intra-network and also an internetwork access scheme. Extensive on-body and off-body channel gain measurements are employed to gauge performance, which are overlaid to simulate a realistic WBAN working environment. It is found that opportunistic relaying is able to improve the signal-to-interference-plus-noise ratio (SINR) performance at an outage probability of 10 by an average of 5 dB, and it is also shown that it can reduce level crossing rate (LCR) significantly at low SINRs. Furthermore, this scheme is more efficient when on-body channels fade more rapidly. We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters deployed around strategic locations and base-stations (BSs) whose locations are relatively flexible. Within a sensor cluster, there are many small sensor nodes (SNs) that capture, encode and transmit relevant information from the designated area, and there is at least one application node (AN) that receives raw data from these SNs, creates a comprehensive local-view, and forwards the composite bit-stream toward a BS. In practice, both SN and AN are battery-powered and energy-constrained, and their node lifetimes directly affect the network lifetime of WSNs. In this paper, we focus on the topology control process for ANs and BSs, which constitute the upper tier of a two-tiered WSN. We propose approaches to maximize the topological network lifetime of the WSN, by arranging BS location and inter-AN relaying optimally. Based on an algorithm in Computational Geometry, we derive the optimal BS locations under three topological lifetime definitions according to mission criticality. In addition, by studying the intrinsic properties of WSNs, we establish the upper and lower bounds of their maximal topological lifetime. When inter-AN relaying becomes feasible and favorable, we continue to develop an optimal parallel relay allocation to further prolong the topological lifetime of the WSN. An equivalent serialized relay schedule is also obtained, so that each AN only needs to have one relay destination at any time throughout the mission. The experimental performance evaluation demonstrates the efficacy of topology control as a vital process to maximize the network lifetime of WSNs. Wireless sensor networks are susceptible to interference that can disrupt sensor communication. In order to cope with this disruption, we explore channel surfing, whereby the sensor nodes adapt their channel assignments to restore network connectivity in the presence of interference. We explore two different approaches to channel surfing: coordinated channel switching, where the entire sensor network adjusts its channel; and spectral multiplexing, where nodes in a jammed region switch channels while nodes on the boundary of a jammed region act as radio relays between different spectral zones. For spectral multiplexing, we have devised both synchronous and asynchronous strategies to facilitate the spectral scheduling needed to improve network fidelity when sensor nodes operate on multiple channels. In designing these algorithms, we have taken a system-oriented approach that has focused on exploring actual implementation issues under realistic network settings. We have implemented these proposed methods on a testbed of 30 Mica2 sensor nodes, and the experimental results show that these strategies can each repair network connectivity in the presence of interference without introducing significant overhead. A scheme for two-hop relay-assisted cooperative communications integrated with transmit power control, based on simple channel prediction, is presented. A large set of empirical on- and inter-body channel data is employed to model various scenarios of wireless body area network (WBAN) communica- tions, from one isolated WBAN up to 10 closely located WBANs coexisting. Our study shows that relay assisted power control can reduce approximately 60 circuit power consumption from that of constant transmission at 0 dBm, without much loss in reliability. Further, interference mitigation is significantly enhanced over constant transmission at −5 dBm, with similar power consumption. Such performance is maintained from 2 to 10 closely-located WBANs coexisting. And the joint algorithm works best for one isolated WBAN. A trade-off between power saving and interference mitigation is motivated, taking remaining sensor-battery level, amount of interference and on-body channel quality into account. Index Terms—Cooperative communications, interference mit- igation, transmit power control, wireless body area networks. This paper presents a novel Medium Access Control (MAC) protocol named ALOHA and Q-Learning based MAC with Informed Receiving (ALOHA-QIR) for Wireless Sensor Networks (WSNs). This scheme is implemented by combining frame based Slotted ALOHA and Q-Learning. ALOHA based schemes have the benefits of simplicity, low computation and overheads, but suffer collisions from the blind transmission strategy. By considering the previous transmission experience, Q-Learning offers nodes certain intelligence to access slots with a lower probability of collision. During data transmissions, receivers are informed by transmitters about their future slot selections so that the receivers can turn off their radio in other slots to save energy. Compared with basic Slotted ALOHA, ALOHA-QIR obtains significant improvements in throughput, delay and energy efficiency. This paper investigates the use of full duplex relaying (FDR) in cognitive radio systems. Cognitive full duplex relay networks (CogFRNs) offer the advantage not only of increasing spectral efficiency by spectrum sharing but also of extending coverage through the use of relays. Concurrent transmissions at the source and relay in CogFRNs can overcome a loss of resource efficiency in a way that conventional half duplex relay (HDR) systems cannot. However, in CogFRNs, the primary user experiences interference from the secondary source and relay simultaneously due to the effects of full duplexing. Satisfying the interference constraint by simply reducing transmission power results in performance degradation for the secondary user. What is therefore needed is a way to optimize the transmission powers at the secondary source and relay. To address this need, we propose an optimal power allocation scheme based on minimizing the outage probability in CogFRNs. We then analyze the outage probability of the secondary user in the noise-limited and interference-limited environments. In addition, we also propose an outage-constrained power allocation scheme which does not require the instantaneous channel state information (CSI) for the link between the primary and secondary users. Simulation results show that the proposed schemes achieve performance improvement in terms of outage probability. Because of the asynchronization between primary and secondary wireless networks, the synchronization between primary users (PUs) and secondary users (SUs) can be hardly guaranteed in nontime-slotted cognitive radio networks (CRNs). In this paper, we propose a novel framework for multichannel nontime-slotted CRNs, where the PUs randomly access and leave the licensed channels. Since the PUs cannot distinguish between primary and secondary signals, the PUs may sense a busy channel when the PUs start to reactivate during the SUs' transmission, thus generating a collision or entering the backoff stage. To guarantee the high-throughput transmission of the PUs and increase the channel utilization of the SUs, in this paper, we propose the wireless full-duplex spectrum sensing (FD-SS) scheme for SUs in multichannel nontime-slotted CRNs. Using our developed FD-SS scheme, the SUs can timely sense the PUs' reactivation during the same time when the SUs are transmitting their signals. Then, based on our proposed wireless FD-SS scheme, we further develop and analyze the wireless full-duplex cognitive medium access control (FDC-MAC) protocol for multichannel nontime-slotted CRNs. We conduct extensive numerical analyses, showing that our developed FD-SS scheme and FDC-MAC protocol can efficiently guarantee the high-throughput transmission of the PUs and increase the channel utilization of the SUs without requiring the synchronization between the PUs and the SUs over the multichannel nontime-slotted CRNs. To support long-term pervasive healthcare services, communications in Wireless Body Area Networks (WBANs) need to be both reliable and energy-efficient. As a cooperative transmission method, relay transmission scheme works effectively in resisting shadowing effect and improving reliability in WBANs. However, the extra energy consumption introduced by relay transmission is very high, which can shorten the lifetime of the whole network. In this paper, temporal and spatial correlation models for on-body channels are first presented to better characterize the slow fading effect of on-body channels. Then a prediction-based dynamic relay transmission (PDRT) scheme that makes full use of the correlation characteristics of on-body channels is proposed. In the PDRT scheme, “when to relay” and “who to relay” are decided in an optimal way based on the last known channel states. Moreover, neither extra signaling procedure nor dedicated channel sensing period is needed. Simulation results show that the PDRT scheme achieves significant performance improvement in energy efficiency, as well as ensuring the transmission reliability. In this paper, we study resource allocation for a multicarrier-based cognitive radio (CR) network. More specifically, we investigate the problem of secondary users’ energy-efficiency (EE) maximization problem under secondary total power and primary interference constraints. First, assuming cooperation among the secondary base stations (BSs), a centralized approach is considered to solve the EE optimization problem for the CR network where the primary and secondary users are using either orthogonal frequency-division multiplexing (OFDM) or filter bank based multicarrier (FBMC) modulations. We propose an alternating-based approach to solve the joint power-subcarrier allocation problem. More importantly, in the first place, subcarriers are allocated using a heuristic method for a given feasible power allocation. Then, we conservatively approximate the nonconvex power control problem and propose a joint successive convex approximation-Dinkelbach algorithm (SCADA) to efficiently obtain a solution to the nonconvex power control problem. The proposed algorithm is shown to converge to a solution that coincides with the stationary point of the original nonconvex power control subproblem. Moreover, we propose a dual decomposition-based decentralized version of the SCADA. Second, under the assumption of no cooperation among the secondary BSs, we propose a fully distributed power control algorithm from the perspective of game theory. The proposed algorithm is shown to converge to a Nash-equilibrium (NE) point. Moreover, we propose a sufficient condition that guarantees the uniqueness of the achieved NE. Extensive simulation analyses are further provided to highlight the advantages and demonstrate the efficiency of our proposed schemes. Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule transmission in slots to avoid collision, however these methods often lack scalability when implemented in networks subject to node failures and dynamic topology. This paper reports a distributed algorithm for TDMA slot assignment that is self-stabilizing to transient faults and dynamic topology change. The expected local convergence time is O(1) for any size network satisfying a constant bound on the size of a node neighborhood. In this paper we consider a simple cooperative network consisting of a source, a destination and a cluster of decode-and-forward relays characterized by the half-duplex constraint. At each time-slot the source and (possibly) one of the relays transmit a packet to another relay and the destination, respectively. When the source and a relay transmit simultaneously, inter-relay interference is introduced at the receiving relay. In this work, with the aid of buffers at the relays, we mitigate the detrimental effect of inter-relay interference through either interference cancellation or mitigation. More specifically, we propose the min-power opportunistic relaying protocol that minimizes the total energy expenditure per time slot under an inter-relay interference cancellation scheme. The min-power relay-pair selection scheme, apart from minimizing the energy expenditure, also provides better throughput and lower outage probability than existing works in the literature. The performance of the proposed scheme is demonstrated via illustrative examples and simulations in terms of outage probability and average throughput. This paper characterizes the performance in terms of queueing stability of a network composed of multiple MIMO transmitter-receiver pairs taking into account the dynamic traffic pattern and the probing feedback cost. We adopt a centralized scheduling scheme that selects a number of active pairs in each time-slot. We consider that the transmitters apply interference alignment (IA) technique if two or more pairs are active, whereas in the special case where one pair is active point-to-point MIMO singular value decomposition (SVD) is used. We consider a time-division duplex (TDD) system where transmitters acquire their channel state information (CSI) by decoding the pilot sequences sent by the receivers. Since global CSI knowledge is required for IA, the transmitters have also to exchange their estimated CSIs over a backhaul of limited capacity (i.e. imperfect case). Under this setting, we characterize in this paper the stability region of the system under both the imperfect and perfect (i.e. unlimited backhaul) cases, then we examine the gap between these two resulting regions. Further, under each case we provide a centralized probing policy that achieves the max stability region. These stability regions and scheduling policies are given for the symmetric system, where all the path loss coefficients are equal to each other, as well as for the general system. For the symmetric system, we provide the conditions under which IA yields a queueing stability gain compared to SVD. Under the general system, the adopted scheduling policy is of a high computational complexity for moderate numbers of pairs, consequently we propose an approximate policy that has a reduced complexity but that achieves only a fraction of the system stability region. A characterization of this fraction is provided. In a heterogeneous wireless sensor network (WSN), relay nodes (RNs) are adopted to relay data packets from sensor nodes (SNs) to the base station (BS). The deployment of the RNs can have a significant impact on connectivity and lifetime of a WSN system. This paper studies the effects of random deployment strategies. We first discuss the biased energy consumption rate problem associated with uniform random deployment. This problem leads to insufficient energy utilization and shortened network lifetime. To overcome this problem, we propose two new random deployment strategies, namely, the lifetime-oriented deployment and hybrid deployment. The former solely aims at balancing the energy consumption rates of RNs across the network, thus extending the system lifetime. However, this deployment scheme may not provide sufficient connectivity to SNs when the given number of RNs is relatively small. The latter reconciles the concerns of connectivity and lifetime extension. Both single-hop and multihop communication models are considered in this paper. With a combination of theoretical analysis and simulated evaluation, this study explores the trade-off between connectivity and lifetime extension in the problem of RN deployment. It also provides a guideline for efficient deployment of RNs in a large-scale heterogeneous WSN.