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.
Other studies as in @cite_11 analyze performance parameters of a reference WBAN in the presence of another interfering network. Moreover, these parameters have been improved by adoption of an optimized time hopping code assignment strategy. Works in @cite_6 consider a WBAN where the coordinator periodically polls its sensors. The nodes however calculate SINR then select the modulation scheme according to the experienced channel quality. Authors of @cite_4 propose a single-relay cooperative scheme. Where a set of relays computes individually the required transmission power to participate in the cooperative communication. Eventually, the best relay is selected in a distributed fashion.
@cite_4 @cite_6 @cite_11
2156149655 2035002549 2032297769
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. 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. 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 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. Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space-time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of M available relays and then uses this "best" relay for cooperation between the source and the destination. We develop and analyze a distributed method to select the best relay that requires no topology information and is based on local measurements of the instantaneous channel conditions. This method also requires no explicit communication among the relays. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space-time coding for M relay nodes is required, such as those proposed by Laneman and Wornell (2003). The simplicity of the technique allows for immediate implementation in existing radio hardware and its adoption could provide for improved flexibility, reliability, and efficiency in future 4G wireless systems. 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. Secure communications can be impeded by eavesdroppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay network can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jamming scheme is proposed that shows significant improvement in terms of secrecy rate compared to the approach without jamming. Furthermore, the case involving an eavesdropper with unknown CSI is also investigated in this paper. Simulation results show that the secrecy rate is dramatically increased when inactive nodes in the relay network participate in cooperative jamming. In this paper, we investigate achievable rates for data transmission from sources to sinks through multiple relay networks. We consider myopic coding, a constrained communication strategy in which each node has only a local view of the network, meaning that nodes can only transmit to and decode from neighboring nodes. We compare this with omniscient coding, in which every node has a global view of the network and all nodes can cooperate. Using Gaussian channels as examples, we find that when the nodes transmit at low power, the rates achievable with two-hop myopic coding are as large as that under omniscient coding in a five-node multiple relay channel and close to that under omniscient coding in a six-node multiple relay channel. These results suggest that we may do local coding and cooperation without compromising much on the transmission rate. Practically, myopic coding schemes are more robust to topology changes because encoding and decoding at a node are not affected when there are changes at remote nodes. Furthermore, myopic coding mitigates the high computational complexity and large buffer memory requirements of omniscient coding We study relay selection with the physical-layer network coding (PNC), which is a major decode-and-forward (DF)-based bidirectional protocol. We consider a network consists of two different end-sources and multiple relays, where each relay adopts XOR-encoding to combine two received symbols from the two end-sources. For this network, we propose a relay selection scheme by modifying the well-known selection cooperation (SC) to use in the PNC protocol, and it is referred to as SC-PNC. The SC-PNC consists of two phases: a multiple access channel (MAC) phase and a broadcast channel (BC) phase. In the MAC phase, a set of relays that correctly decode two received symbols from the two end-sources is determined; in the BC phase, among the relays in the determined set, a single best relay is selected such that the minimum mutual information of the two links from each relay to the two end-sources is maximized. Finally, we derive the exact outage probability of the SC-PNC in closed-form. Motivated by limited computational resources in sensor nodes, the impact of complexity constraints on the communication efficiency of sensor networks is studied. A single-parameter characterization of processing limitation of nodes in sensor networks is invoked. Specifically, the relaying nodes are assumed to "donate" only a small part of their total processor time to relay other nodes information. The amount of donated processor time is modelled by the node's ability to decode a channel code reliably at given rate R. Focusing on a four node network, with two relays, prior work for a complexity constrained single relay network is built upon. In the proposed coding scheme, the transmitter sends a broadcast code such that the relays decode only the "coarse" information, and assist the receiver in removing ambiguity only in that information. Via numerical examples, the impact of different power constraints in the system, ranging from per node power bound to network wide power constraint is explored. As the complexity bound R increases, the proposed scheme becomes identical to the recently proposed achievable rate by Gupta & Kumar (2003). Both discrete memoryless and Gaussian channels are considered. We investigate strategies for user cooperation in the uplink of a synchronous direct-sequence code-division multiple-access (DS CDMA) network employing nonorthogonal spreading codes and analyze their performance. We consider two repetition-based relay schemes: decode-and-forward (DAF) and amplify-and-forward (AAF). Focusing on the use of linear multiuser detectors, we first present cooperation strategies, i.e., signal processing at both the relay nodes and the base station (BS), under the assumption of perfectly known channel conditions of all links; then, we consider the more practical scenario where relays and BS have only partial information about the system parameters, which requires blind multiuser detection methods. We provide performance analysis of the proposed detection strategies in terms of the (asymptotic) signal-to-(interference plus noise) ratio and the bit error rate, and we show that AAF achieves a full second-order diversity when a minimum mean-square-error detector is employed at both the relay side and the BS. A simple, yet effective, partner selection algorithm is also presented. Finally, a thorough performance assessment is undertaken to study the impact of the multiple-access interference on the proposed cooperative strategies under different scenarios and system assumptions Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of multihopping, but in addition to having the relays successively decode the message, the transmitters cooperate and each receiver uses several or all of its past channel output blocks to decode. For the compress-and-forward scheme, the relays take advantage of the statistical dependence between their channel outputs and the destination's channel output. The strategies are applied to wireless channels, and it is shown that decode-and-forward achieves the ergodic capacity with phase fading if phase information is available only locally, and if the relays are near the source node. The ergodic capacity coincides with the rate of a distributed antenna array with full cooperation even though the transmitting antennas are not colocated. The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, single-bounce fading, certain quasi-static fading problems, cases where partial channel knowledge is available at the transmitters, and cases where local user cooperation is permitted. The results further extend to multisource and multidestination networks such as multiaccess and broadcast relay channels. We investigate a relay network where the source can potentially utilize an untrusted non-regenerative relay to augment its direct transmission of a confidential message to the destination. Since the relay is untrusted, it is desirable to protect the confidential data from it while simultaneously making use of it to increase the reliability of the transmission. We first examine the secrecy outage probability (SOP) of the network assuming a single antenna relay, and calculate the exact SOP for three different schemes: direct transmission without using the relay, conventional non-regenerative relaying, and cooperative jamming by the destination. Subsequently, we conduct an asymptotic analysis of the SOPs to determine the optimal policies in different operating regimes. We then generalize to the multi-antenna relay case and investigate the impact of the number of relay antennas on the secrecy performance. Finally, we study a scenario where the relay has only a single RF chain which necessitates an antenna selection scheme, and we show that unlike the case where all antennas are used, under certain conditions the cooperative jamming scheme with antenna selection provides a diversity advantage for the receiver. Numerical results are presented to verify the theoretical predictions of the preferred transmission policies. In this paper, we study the joint allocation of three types of resources, namely, power, subcarriers and relay nodes, in multi-relay assisted dual-hop cooperative OFDM systems. All the relays adopt the amplify-and-forward protocol and assist the transmission from the source to destination simultaneously but on orthogonal subcarriers. The objective is to maximize the system transmission rate subject to individual power constraints on each node or a total network power constraint. We formulate such a problem as a subcarrier-pair based resource allocation that seeks the joint optimization of subcarrier pairing, subcarrier-pair-to-relay assignment, and power allocation. Using a dual approach, we solve this problem efficiently in an asymptotically optimal manner. Specifically, for the optimization problem with individual power constraints, the computational complexity is polynomial in the number of subcarriers and relay nodes, whereas the complexity of the problem with a total power constraint is polynomial in the number of subcarriers.We further propose two suboptimal algorithms for the former to trade off performance for complexity. Simulation studies are conducted to evaluate the average transmission rate and outage probability of the proposed algorithms. The impact of relay location is also discussed. Recent information theoretical results have shown a considerable improvement in the performance of communication systems through the use of relaying and cooperation. Despite a collection of strong information theoretical results on the relay channel, there has been almost no attention to real code design for the relay channel. In this paper, we present a powerful modular code design approach for the relay channel and corresponding decoding algorithms based on the factor graph representation of the code. For most of the relay channel conditions, the constructed codes with a low-complexity simple relay protocol outperforms any possible code design for the direct channel by achieving an E sub b N sub 0 below the minimum required E sub b N sub 0 of single-link transmission. Moreover, the designed codes achieve a gap of less than 1 dB (at a BER of 10 sup -6 ) to the Shannon limit for the relay channel with a code length of only 2 spl times 10 sup 4 bits. This work presents joint iterative power allocation and interference suppression algorithms for spread spectrum networks with multiple relays and the amplify and forward cooperation strategy. A joint constrained optimization framework that considers the allocation of power levels across the relays subject to individual and global power constraints and the design of linear receivers for interference suppression is proposed. Constrained minimum mean-squared error (MMSE) expressions for the parameter vectors that determine the optimal power levels across the relays and the parameters of the linear receivers are derived. In order to solve the proposed optimization problems efficiently, stochastic gradient (SG) algorithms for adaptive joint iterative power allocation, and receiver and channel parameter estimation are developed. The results of simulations show that the proposed algorithms obtain significant gains in performance and capacity over existing cooperative and non-cooperative schemes. The use of multi-user detection (MUD) in a cooperative CDMA network is investigated for the uplink in synchronous CDMA systems. Suppose that, at any instant in time, part of the users serve as sources while the others serve as relays. The proposed MUD scheme decorrelates the sources' messages at the destination with the help of precoding at the relays. Three cooperation methods are considered: (1) transmit beamforming, (2) selective relaying and (3) distributed space- time coding. The optimal weighting factors of each method are determined by taking the quality of the source-to-relay and or the relay-to-destination links into account. We show that significant improvements in terms of the spatial diversity and multiple-access interference (MAI) mitigation can be attained when precoding is employed at the relays to aid the decorrelation at the destination. The advantages are even more pronounced when selective relaying is combined with the other two schemes. Wireless networks suffer from battery discharging specially in cooperative communications when multiple relays have an important role but they are energy-constrained. To overcome this problem, energy harvesting from Radio Frequency signals is applied to charge the node battery. These intermediate nodes have the ability to harvest energy from the source signal and use the harvested energy to transmit information to the destination. Simultaneous energy harvesting and data transmission can be done in multi-relay systems. Each relay dedicates a part of time or power for energy harvesting, and the remainder part is devoted for data transmission. Based on time or power division, 2 relaying protocols known as time switching based relaying protocol or power splitting based relaying protocol exist. These 2 protocols can also be applied in delay-limited and delay-tolerant transmission systems. The previous works have assumed a single relay or single antenna for energy harvesting, but in this paper, the proposed method is concentrated on improving the throughput by using multiple antennas in multi-relay system. Two strategies of selecting the signal of multiple antennas for transmission known as maximum ratio transmit and Antenna selection has been used in this paper. Maximum ratio transmit combines the signals of antennas but Antenna selection selects the antenna with maximum signal-to-noise ratio. According to our simulation results, when using multi-antenna relays, ability of energy harvesting is increased compared with single-relay or single-antenna system and thus the system performance will be improved considerably. Also, maximum ratio transmit method has better performance compared with Antenna Selection one. In this paper, a two-hop amplify-and-forward cooperative diversity system using OFDM modulation was considered. We proposed an associated waterfllling power allocation scheme under separate power constraints at source and relay, which allocated source and relay power in an associated fashion. The scheme first allocated power to subcarriers uniformly, then gave an approximate equivalent channel gain model, and last employed the classic waterfilling algorithm to optimize the power allocation at relay and source, respectively. Moreover, we investigated the subcarrier pairing problem and presented a modified sorted subcarrier pairing algorithm, which considered the effect of source-destination link as well as source-relay link. The simulation results show that the associated waterfilling power allocation scheme and the modified sorted subcarrier pairing algorithm both could achieve higher average rate alone, and that the combination of them could improve the performance further. In this paper, we propose a new relaying scheme, referred to as priority-based max-link relay selection, for buffer-aided decode-and-forward cooperative networks. We give the first priority to the relay buffers having status full, the second priority to the relay buffers having status empty, and the third priority to the relay buffers having status neither full nor empty. The best relay node is selected corresponding to the link having the highest channel gain among the links within a priority class. By adopting a Markov chain approach to analyze the state transition matrix that models the evolution of the buffers status, we derive analytical expressions for the outage probability and the average bit error rate. Analytical expressions for the steady-state probability vector are also obtained, and through these expressions, it is shown that states with the same probabilities can be grouped, thus reducing the size of the state transition matrix. We propose a general state-grouping-based method to obtain the reduced state transition matrix, which in turn reduces the computational complexity in obtaining the steady-state distribution. Our analytical and simulation results demonstrate that the proposed relaying scheme has better performance gain over the conventional max-link scheme.