A fixed clustering protocol based on random relay strategy for EHWSN

In Energy Harvesting Wireless Sensor Networks (EHWSN), the communication protocol will directly affect the final performance of the network, so it is necessary to study the communication protocol based on EHWSN. In this paper, for the low-cost fixed clustering problem, a fixed clustering protocol RRCEH is based on random relaying. Our proposed RRCEH abandons the inefficient inter-cluster communication method of the traditional fixed clustering protocol. To coordinate the data upload of the cluster head, RRCEH allocates different random relay vectors to each ring area of the network, and combines all the random relay vectors into a random relay matrix of RRCEH. In each communication round, the cluster head node randomly selects its relay target node to send data according to the probability distribution in the random relay vector in the area. For two different cluster head configuration scenarios, by optimizing the random relay matrix, RRCEH can effectively reduce the network's configuration requirements for cluster head energy harvesting capability, thus reducing the deployment cost of EHWSN.     

Transmission scheduling in a multi‐channel wireless network with bidirectional relaying links

Using network coding in a wireless network can potentially improve the network throughput. On the other hand, it increases the complexity of resource allocations as the quality of one transmission is affected by the link conditions of the transmitter to multiple receivers. In this work, we study time slot scheduling and channel allocations jointly for a network with bidirectional relaying links, where the two end nodes of each link can exchange data through a relay node. Two scenarios are considered when the relay node forwards packets to the end nodes. In the first scenario, the relay node always forwards network‐coded packets to both end nodes simultaneously; in the second scenario, the relay node opportunistically uses network coding for two‐way relaying and traditional one‐way relaying. For each scenario, an optimization problem is first formulated for maximizing the total network throughput. The optimum scheduling is not causal because it requires future information of channel conditions. We then propose heuristic scheduling schemes. The slot‐based scheduling maximizes the total transmission rate of all the nodes at each time slot, and the node‐based scheduling schedules transmissions based on achievable transmission rates of individual nodes at different channels. The node‐based one has lower complexity than the slot‐based one. Our results indicate that although the node‐based scheduling achieves slightly lower throughput than the slot‐based one, both the proposed scheduling schemes are very effective in the sense that the difference between their throughput and the optimum scheduling is relatively small in different network settings. Copyright © 2015 John Wiley & Sons, Ltd.     

Protocol design and data detection for two‐way relay networks with fractional asynchronous delays

In wireless two‐way relay systems, it is difficult to achieve perfect timing synchronization among different nodes. In this paper, we investigate relaying protocol design and data detect schemes for asynchronous two‐way relaying systems to combat the intersymbol interference caused by asynchronous transmission. We consider fractional asynchronous delays and two schemes are proposed based on cyclic prefixed single carrier block transmission, namely, the receiver frequency domain equalization scheme and relay synchronization and network coding (RSNC) scheme. In the receiver frequency domain equalization scheme, the relay simply amplifies the received signal and forwards to the two source nodes, and fractionally spaced frequency domain equalizer (FS‐FDE) is employed at the receiver to recover the transmit data. In the RSNC scheme, the asynchronous signals are resynchronized with an FS‐FDE at the relay node. The output signals of FS‐FDE are then demodulated and network coded before forwarding to the two source nodes. In this RSNC scheme, data detection at the source nodes is the same as that in synchronous networks because the asynchronous signals have already been synchronized at the relay node. Simulation results show that the performance of both schemes is almost the same as in the perfect synchronized two‐way relaying systems. Copyright © 2012 John Wiley & Sons, Ltd.     

Exact SEP and performance bounds for orthogonal space‐time block codes in cooperative multiantenna AF relaying networks

In this paper, we derive a moment generating function (MGF) for dual‐hop (DH) amplify‐and‐forward (AF) relaying networks, in which all nodes have an arbitrary number of antennas, with orthogonal space‐time block code (OSTBC) transmissions over Rayleigh fading channels. We present an exact error rate expression based on the derived MGF and another analytical approach to derive achievable performance bounds as closed‐forms of symbol error rate, outage probability, and normalized channel capacity. Furthermore, we derive the asymptotic behavior of symbol error rate and outage probability. From this asymptotic behavior, it is shown that the diversity order and its dependence on antenna configurations can be explicitly determined. Simulation results are also presented to verify their accuracy by comparing with numerical results and to provide an insight to the relationship between relaying networks' antenna configuration and diversity order. It is confirmed that the transmit antenna gain of the source node and the receive antenna gain of the relay node can be obtained only when the relay is close to the destination, and then, the transmit antenna gain of the relay node and the receive antenna gain of the destination node can be obtained only when the relay is close to the source.     

Exact outage analysis of the effect of co-channel interference on secured multi-hop relaying networks

In this article, the presence of multi-hop relaying, eavesdropper and co-channel interference (CCI) in the same system model is investigated. Specifically, the effect of CCI on a secured multi-hop relaying network is studied, in which the source communicates with the destination via multi-relay-hopping under the presence of an eavesdropper and CCI at each node. The optimal relay at each cluster is selected to help forward the message from the source to the destination. We apply two relay selection approaches to such a system model, i.e. the optimal relay is chosen based on (1) the maximum channel gain from the transmitter to all relays in the desired cluster and (2) the minimum channel gain from the eavesdropper to all relays in each cluster. For the performance evaluation and comparison, we derived the exact closed form of the secrecy outage probability of the two approaches. That analysis is verified by Monte Carlo simulation. Finally, the effects of the number of hops, the transmit power at the source, relays and the external sources, the distance between the external sources and each node in the system, and the location of the eavesdropper are presented and discussed.     

On the energy efficiency of MIMO cooperative relaying networks

Cooperative relaying techniques can greatly improve the capacity of the multiple input and multiple output (MIMO) wireless system. The transmit power allocation (TPA) strategies for various relaying protocols have become very important for improving the energy efficiency. This article proposes novel TPA schemes in the MIMO cooperative relaying system. Two different scenarios are considered. One is the hybrid decode-and-forward (HDF) protocol in which the zero-forcing (ZF) process is operated on relays, and the other is the decode-and-forward (DF) protocol with relay node and antenna selection strategies. The simulation results indicate that the proposed schemes can bring about significant capacity gain by exploiting the nature of the relay link. Additionally, the proposed TPA scheme in the HDF system can achieve the same capacity as the equal TPA with fewer relay nodes used. Finally, the capacity gain with the proposed schemes increases when the distribution range of relay nodes expands.     

Transactions Papers - Device Placement for Heterogeneous Wireless Sensor Networks: Minimum Cost with Lifetime Constraints

Device placement is a fundamental factor in determining the coverage, connectivity, cost and lifetime of a wireless sensor network (WSN). In this paper, we explore the problem of relay node placement in heterogeneous WSN. We formulate a generalized node placement optimization problem aimed at minimizing the network cost with constraints on lifetime and connectivity. Depending on the constraints, two representative scenarios of this problem are described. We characterize the first problem, where relay nodes are not energy constrained, as a minimum set covering problem. We further consider a more challenging scenario, where all nodes are energy limited. As an optimal solution to this problem is difficult to obtain, a two-phase approach is proposed, in which locally optimal design decisions are taken. The placement of the first phase relay nodes (FPRN), which are directly connected to sensor nodes (SN), is modeled as a minimum set covering problem. To ensure the relaying of the traffic from the FPRN to the base station, three heuristic schemes are proposed to place the second phase relay nodes (SPRN). Furthermore, a lower bound on the minimum number of SPRN required for connectivity is provided. The efficiency of our proposals is investigated by numerical examples.     

A genetic algorithm based approach for energy efficient routing in two-tiered sensor networks

Higher power relay nodes can be used as cluster heads in two-tiered sensor networks to achieve improved network lifetime. The relay nodes may form a network among themselves to route data towards the base station. In this model, the lifetime of a network is determined mainly by the lifetimes of these relay nodes. An energy-aware communication strategy can greatly extend the lifetime of such networks. However, integer linear program (ILP) formulations for optimal, energy-aware routing quickly become computationally intractable and are not suitable for practical networks. In this paper, we have proposed an efficient solution, based on a genetic algorithm (GA), for scheduling the data gathering of relay nodes, which can significantly extend the lifetime of a relay node network. For smaller networks, where the global optimum can be determined, our GA based approach is always able to find the optimal solution. Furthermore, our algorithm can easily handle large networks, where it leads to significant improvements compared to traditional routing schemes.     

Optimal placement and routing strategies for resilient two‐tiered sensor networks

In hierarchical sensor networks using relay nodes, sensor nodes are arranged in clusters and higher powered relay nodes can be used as cluster heads. The lifetime of such a network is determined primarily by the lifetime of the relay nodes. In this paper, we propose two new integer linear programs (ILPs) formulations for optimal data gathering, which maximize the lifetime of the upper tier relay node network. Unlike most previous approaches considered in the literature, our formulations can generate optimal solutions under the non‐flow‐splitting model. Experimental results demonstrate that our approach can significantly extend network lifetime, compared to traditional routing schemes, for the non‐flow‐splitting model. The lifetime can be further enhanced by periodic updates of the routing strategy based on the residual energy at each relay node. The proposed rescheduling scheme can be used to handle single or multiple relay node failures. We have also presented a very simple and straightforward algorithm for the placement of relay nodes. The placement algorithm guarantees that all the sensor nodes can communicate with at least one relay node and that the relay node network is at least 2‐connected. This means that failure of a single relay node will not disconnect the network, and data may be routed around the failed node. The worst case performance of the placement algorithm is bounded by a constant with respect to any optimum placement algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

拥有多天线源节点的放大转发双向中继信道机会中继策略研究

We consider a two-way relay network where the Amplify-and-Forward (AF) protocol is adopted by all relays in this paper. The network consists of two multi-antenna source nodes and multiple distributed single-antenna relays. Two opportunistic relaying schemes are proposed to efficiently utilize the antennas of the source nodes and the relay nodes. In the first scheme, the best relay is selected out by a max-min-max criterion before transmitting. After that, at each source, only the antenna with the largest channel gain between itself and the best relay is activated to transmit and receive signals with full power. In the second scheme, assisted by the best relay which is selected by the typical max-min criterion, both source nodes use all their antennas to exchange data, and match filter beamforming techniques are employed at both source nodes. Further analyses show that all schemes can achieve the full diversity order, and the conclusions are not only mathematically demonstrated but numerically illustrated. System performance comparisons are carried out by numerical methods in terms of rate sum and outage probability, respectively. The beamforming assisted scheme can be found to be superior to the antenna selection scheme when accurate Channel State Information (CSI) is available at the transmitters. Otherwise, the latter is very suitable.     

Physical Layer Security for Wireless Powered Massive MIMO Decode and Forward Relay Systems with Hardware Impairments: Performance Analysis

In this paper, the issue of secrecy capacity of wireless powered massive MIMO dual hop relay system with a single antenna eavesdropper having non ideal hardware is addressed. The relay harvests energy in a proportionate manner and passes it to destination through beamforming with classical decode and forward relaying protocol. The relay has no channel state information (CSI) of passive eavesdropper but has CSI of the legitimate channel. The work presented in this paper focuses on the analysis of the difference in system performance with ideal and non ideal hardware, bounded by strict outage probability. The performance (in terms of secrecy outage capacity) is studied with hardware impairments (HWIs) defined for all network elements, i.e., source, relay, destination and passive eavesdropper. It is also observed that compared to ideal hardware, there is significant degradation in performance due to HWIs.

     

Exact analysis of the multihop multibranch hybrid AF/DF relaying networks

In this paper, the exact analysis of a multihop multibranch (MHMB) relaying network is investigated wherein each relay can operate in amplify‐and‐forward (AF) or decode‐and‐forward (DF) modes depending upon the decoding result of its received signal. If a relay decodes the received signal correctly, it works in DF mode; otherwise, the relay operates in AF mode. Therefore, we name such relaying network as hybrid amplify‐and‐forward and decode‐and‐forward (hybrid AF/DF) relaying network. We first investigate the signal transmission from source to destination node via n number of relays in a hybrid AF/DF MHMB mode. Then, we obtained the statistical features and analyze the end‐to‐end signal‐to‐noise ratio (SNR). Finally, a comprehensive performance analysis is conducted by using maximal ratio combining (MRC) scheme at the destination node. For comparison, we also obtained the results using selection combining (SC) scheme at the destination node. To the best of our knowledge, very few works in the literature have considered a general system model of MHMB relaying network wherein each relay can operate in AF or DF modes, that is, a hybrid AF/DF relaying network. Accordingly, the analysis of our system model is not only novel and exact, but also is comprehensive and can be employed in the future works.     

Resource allocations in relay‐assisted cellular networks

In a relay‐assisted cellular network, the transmission mode (either direct transmission or relaying) and the transmit power of the source and relay nodes affect not only transmission rates of individual links but also the rates of other links sharing the same channel. In this paper, we propose a cross‐layer design that jointly considers the transmission mode/relay node selection (MRS) with power allocation (PA) to optimize the system rate. We first formulate an optimization problem for a cellular system, where the same frequency channel can be reused in different cells. A low complexity heuristic MRS scheme is proposed on the basis of the link and interference conditions of the source and potential relay nodes. Given the transmission mode and relay node (if the relaying mode is chosen) of each link, the transmit power of the source and relay nodes can be solved by geometric programming. This method for MRS and PA can achieve a close‐to‐optimum performance, but implementing the PA requires heavy signalling exchanged among cells. To reduce the signalling overheads, we finally proposed a heuristic and distributed method for MRS and PA inspired by some asymptotic analysis. Numerical results are conducted to demonstrate the rate performance of the proposed methods.Copyright © 2013 John Wiley & Sons, Ltd.     

On cell range extension in LTE‐Advanced Type 1 inband relay networks

Relay node cell area is limited by low transmission power and limited antenna capabilities, which may not allow it to carry a significant share of the traffic load, thus reducing its efficiency. Cell range extension is thus expected to better balance the load in the network, hence, improving the performance of relay deployments. Herein, we investigate two relay cell range extension techniques, introducing a bias to cell selection and handover thresholds along with reduction in donor enhanced Node B transmission power. The study focuses on inband half‐duplex relaying where resource partitioning among the two relay hops is jointly considered with cell range extension. As opposed to picocell deployments, extending the relay cell range offloads only partially the macrocell as newly admitted users increase the resource demand of the relay on its wireless backhaul link from its donor enhanced Node B. Hence, joint optimization of the decisive parameters for different key performance metrics is performed. Comprehensive analysis was carried out for both the downlink and the uplink in urban and suburban scenarios within the LTE‐ Advanced framework. Results reveal that the investigated solution yields significant gains. Finally, we discuss on the realization of cell range extension as part of network planning and offline optimization.Copyright © 2013 John Wiley & Sons, Ltd.     

A Sink-Oriented Layered Clustering Protocol for Wireless Sensor Networks

Clustering is an effective technique to prolong network lifetime for energy-constrained wireless sensor networks. Due to the many-to-one traffic pattern in a multi-hop network, the nodes closer to the sink also help to relay data for those farther away from the sink, and hence they consume much more energy and tend to die faster. This paper proposes a sink-oriented layered clustering (SOLC) protocol to better balance energy consumption among nodes with different distances to the sink. In SOLC, the sensor field is divided into concentric rings, and the SOLC protocol consists of intra-ring clustering and inter-ring routing. We compute the optimal ring width and the numbers of cluster heads in different rings to balance energy consumption between intra-cluster data processing and inter-cluster data relaying. Cluster heads in a ring closer to the sink has smaller sizes than those in the rings farther away from the sink, and hence they can spend less energy for intra-cluster data processing and more energy for inter-cluster data relay. Simulation results show that the SOLC protocol can outperform several existing clustering protocols in terms of improved network lifetime.     

基于权值竞争的分簇与连通策略研究

针对无线传感器网络中节点失效导致网络断连的问题,提出一种基于分簇和路径规划的网络连通策略,适用于命令监控型监测。固定节点采用权值竞选机制选举出最佳数量的簇首,其余节点根据簇首信号强度成簇;移动节点连通各簇首与汇点（sink）,借鉴动态旅行商问题的数学模型,尽快遍历所有簇首。两者共同维护无线传感器网络全连通。仿真结果表明：分簇算法显著增加网络运行轮数,路径规划降低网络的数据丢失率。     

Multiple-Antenna Cooperative Wireless Systems: A Diversity–Multiplexing Tradeoff Perspective

We consider a general multiple-antenna network with multiple sources, multiple destinations, and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into account the processing capability of the relays (half-duplex or full-duplex), and the network geometry (clustered or nonclustered). We first study the multiple-antenna relay channel with a full-duplex relay to understand the effect of increased degrees of freedom in the direct link. We find DMT upper bounds and investigate the achievable performance of decode-and-forward (DF), and compress-and-forward (CF) protocols. Our results suggest that while DF is DMT optimal when all terminals have one antenna each, it may not maintain its good performance when the degrees of freedom in the direct link are increased, whereas CF continues to perform optimally. We also study the multiple-antenna relay channel with a half-duplex relay. We show that the half-duplex DMT behavior can significantly be different from the full-duplex case. We find that CF is DMT optimal for half-duplex relaying as well, and is the first protocol known to achieve the half-duplex relay DMT. We next study the multiple-access relay channel (MARC) DMT. Finally, we investigate a system with a single source-destination pair and multiple relays, each node with a single antenna, and show that even under the ideal assumption of full-duplex relays and a clustered network, this virtual multiple-input multiple-output (MIMO) system can never fully mimic a real MIMO DMT. For cooperative systems with multiple sources and multiple destinations the same limitation remains in effect.     

Distributed simultaneous wireless information and power transfer in multiuser amplify‐and‐forward ad hoc wireless networks

This paper studies the problem of stable node matching for distributed simultaneous wireless information and power transfer in multiuser amplify‐and‐forward ad hoc wireless networks. Particularly, each source node aims to be paired with another node that takes the role of an amplify‐and‐forward relay to forward its signal to the destination, such that the achievable rate is improved, in return of some payment made to the relaying node. Each relaying node splits its received signal from its respective source into two parts: one for information processing and the other for energy harvesting. In turn, a matching‐theoretic solution based on the one‐to‐one stable marriage matching game is studied, and a distributed polynomial‐time complexity algorithm is proposed to pair each source node with its best potential relaying node based on the power‐splitting ratios, such that their utilities or payments are maximized while achieving network stability. For comparison purposes, an algorithm to enumerate all possible stable matchings is also devised to study the impact of different matchings on the source and relay utilities. Simulation results are presented to validate the proposed matching algorithm and illustrate that it yields sum‐utility and sum‐payment that are closely comparable to those of centralized power allocation and node pairing, with the added merits of low complexity, truth telling, and network stability.     

Cooperative Communications in Future Home Networks

The basic idea behind cooperative communications is that mobile terminals collaborate to send data to each other. This effectively adds diversity in the system and improves the overall performance. In this paper, we investigate the potential gains of cooperative communication in future home networks. We derive analytical expressions for the error probability of binary phase shift keying (BPSK) signals over Nakagami-m fading channels in a multi relay communication network. Following to the analytical study, we analyze the contribution of cooperative relaying to the 60GHz network connectivity through simulations using a realistic indoor environment model. We compare the performance of different relay configurations under variable obstacle densities. We show that a typical 60GHz indoor network should employ either a multi-relay configuration or a single-relay configuration with a smart relay selection mechanism to achieve acceptable outage rates. In the use of multiple-relay configuration, both analytical and simulation studies indicate that increasing the number of cooperative relays does not improve the system performance significantly after a certain threshold.     

Angle random forwarding (AnRaF) for wireless sensor networks: performances and realization

A novel random forwarding protocol for distributed wireless sensor networks (WSN_s) is reported in this paper. The proposed protocol features the utilization of azimuth angle of the nodes involved and opportunistic selection of the relaying node via contention among neighbors. First, the protocol with precise angle information is discussed and its multi‐hop performance is evaluated by means of both simulation and analysis in terms of average number of hops to the sink node. Simulation results show that it performs well especially in network connectivity. As a complement, node mobility is also introduced to evaluate multi‐hop performance in real environments. Then, a simple MAC scheme to ensure that the node with the highest angular advantage will be selected as a relay is proposed, and subsequently energy and latency performances based on it are evaluated. It is shown that our protocol can effectively deliver data with half number of active neighbors required in geographical random forwarding (G_eR_aF). Finally, a practical method is presented to estimate azimuth angle, combined with which, our forwarding protocol is shown to achieve the performance very close to the case with precise angle information. Copyright © 2008 John Wiley & Sons, Ltd.