Relay Node Selection Research Articles

RBC-OLSR: Reputation-based clustering OLSR protocol for wireless ad hoc networks

We consider the problem of assuring the trustworthiness (i.e. reliability and robustness) and prolonging the lifetime of wireless ad hoc networks, using the OLSR routing protocol, in the presence of selfish nodes. Assuring the trustworthiness of these networks can be achieved by selecting the most trusted paths, while prolonging the lifetime can be achieved by (1) reducing the number of relay nodes (MPR) propagating the topology control (TC) messages and (2) considering the residual energy levels of these relay nodes in the selection process. In this paper, we propose a novel clustering algorithm and a relay node selection algorithm based on the residual energy level and connectivity index of the nodes. This hybrid model is referred to as H-OLSR. The OLSR messages are adapted to handle the cluster heads election and the MPR nodes selection algorithms. These algorithms are designed to cope with selfish nodes that are getting benefits from others without cooperating with them. Hence, we propose an incentive compatible mechanism that motivates nodes to behave truthfully during the selection and election processes. Incentive retributions increase the reputation of the nodes. Since network services are granted according to nodes’ accumulated reputation, the nodes should cooperate. Finally, based on nodes’ reputation, the most trusted forwarding paths are determined. This reputation-based hybrid model is referred to as RH-OLSR. Simulation results show that the novel H-OLSR model based on energy and connectivity can efficiently prolong the network lifetime, while the RH-OLSR model improves the trustworthiness of the network through the selection of the most trusted paths based on nodes’ reputations. These are the two different processes used to define the reputation-based clustering OLSR (RBC-OLSR) routing protocol.

A Secure Relay-Assisted Handover Protocol for Proxy Mobile IPv6 in 3GPP LTE Systems

The LTE (Long Term Evolution) technologies defined by 3GPP is the last step toward the 4th generation (4G) of radio technologies designed to increase the capacity and speed of mobile telephone networks. Mobility management for supporting seamless handover is the key issue for the next generation wireless communication networks. The evolved packet core (EPC) standard adopts the proxy mobile IPv6 protocol (PMIPv6) to provide the mobility mechanisms. However, the PMIPv6 still suffers the high handoff delay and the large packet lost. Our protocol provides a new secure handover protocol to reduce handoff delay and packet lost with the assistance of relay nodes over LTE networks. In this paper, we consider the security issue when selecting relay nodes during the handoff procedure. During the relay node discovery, we extend the access network discovery and selection function (ANDSF) in 3GPP specifications to help mobile station or UE to obtain the information of relay nodes. With the aid of the relay nodes, the mobile station or UE performs the pre-handover procedure, including the security operation and the proxy binding update to significantly reduce the handover latency and packet loss. The simulation results illustrate that our proposed protocol actually achieves the performance improvements in the handoff delay time and the packet loss rate.

Transmission Power Control and Routing Strategy Based on Differential Games in Deep Space Exploration

The spectrum resource is a kind of scarce resource in the deep space exploration, the total bandwidth need for deep space communication is related to the required data rates, the number of spacecrafts, and the extent of spectrum frequency sharing. Future requirements of deep space communication may need to accommodate more spacecrafts within a particular band allocation, so the spread spectrum and multiple access techniques are widely used in deep space communications. And for the purpose of save power and reduce mutual interference, transmission power control may be introduced in the communication process. In this paper, a noncooperative differential game is proposed, and a power control algorithm is get from the equilibrium of the game, the results show that the algorithm can effectively reduce mutual interference, and also provide a way of route setup through relay nodes selection.

QoS Provisioning Relay Selection in Random Relay Networks

In this paper, we propose an analytical framework for determining the outage probability of random and best relay selection schemes given a Poisson field of relay nodes and the presence of path loss and fading. For relay selection, relays geographically close to the source and destination are preferred to others. This selection guideline ensures a target quality of service (QoS) and reduces the signaling overhead and the relay selection delay. A spatial region called the QoS region is obtained for the random relay selection and is shown to shrink as the distance between the source and the destination increases and the interfering node density increases. When the QoS region for random relay selection is not large enough and cannot probabilistically ensure a reliable relay therein, the best relay selection is employed since the required relay node density and selection range for a desired QoS can be reduced for the best relay selection. The gain of the best relay selection with respect to the random relay selection is quantified in terms of relay node density reduction and coverage extension due to selection diversity.

Energy-efficient joint relay node selection and power allocation over multihop relaying cellular networks toward LTE-Advanced

Cooperative relaying is emerging as an effective technology to fulfill requirements on high data rate coverage in next-generation cellular networks, like long term evolution-advanced (LTE-Advanced). In this paper, we propose a distributed joint relay node (RN) selection and power allocation scheme over multihop relaying cellular networks toward LTE-Advanced, taking both the wireless channel state and RNs' residual energy into consideration. We formulate the multihop relaying cellular network as a restless bandit system. The first-order finite-state Markov chain is used to characterize the time-varying channel and residual energy state transitions. With this stochastic optimization formulation, the optimal policy has indexability property that dramatically reduces the computational complexity. Simulation results demonstrate that the proposed scheme can efficiently enhance the expected system reward, compared with other existing algorithms.

On the Performance of Cyclic Prefix-Based Single-Carrier Cooperative Diversity Systems with Best Relay Selection

In this paper, several important performance metrics for the cyclic prefix-based single-carrier (CP-SC) cooperative diversity systems with best relay node selection, are presented and quantitatively compared with Monte-Carlo simulations. The statistical evaluation of the upper bound of the average end-to-end signal-to-noise-ratio (SNR) of a two-hop amplify-and-forward (AF) relaying CP-SC transmission is presented. By using this upper bound, closed-form bounds for the maximum achievable average rate, the outage probability and the average symbol error rate (SER), are derived. Further, asymptotic analysis on the outage probability and the average SER reveal that the diversity gain is determined by both the number of relay nodes in the system and the number of channel taps being supported by the CP length. Simulation results verify the derived closed-form analytical expressions and also the diversity gains. Asymptotic performance is also verified in practically high SNR region via Monte Carlo simulations.

Multi-Relay Selection Design and Analysis for Multi-Stream Cooperative Communications

In this paper, we consider the problem of multi-relay selection for multi-stream cooperative MIMO systems with M relay nodes. Traditionally, relay selection approaches are primarily focused on selecting one relay node to improve the transmission reliability given a single-antenna destination node. As such, in the cooperative phase whereby both the source and the selected relay nodes transmit to the destination node, it is only feasible to exploit cooperative spatial diversity (for example by means of distributed space time coding). For wireless systems with a multi-antenna destination node, in the cooperative phase it is possible to opportunistically transmit multiple data streams to the destination node by utilizing multiple relay nodes. Therefore, we propose a low overhead multi-relay selection protocol to support multi-stream cooperative communications. In addition, we derive the asymptotic performance results at high SNR for the proposed scheme and discuss the diversity-multiplexing tradeoff as well as the throughput-reliability tradeoff. From these results, we show that the proposed multi-stream cooperative communication scheme achieves lower outage probability compared to existing baseline schemes.

Energy-Efficient Routing Protocol for Wireless Sensor Networks with Static Clustering and Dynamic Structure

Due to limited energy of sensor nodes in a wireless sensor network, an energy-efficient routing protocol with static clustering and dynamic structure (ERP-SCDS) is proposed in this paper. Utilizing virtual points in a corona-based wireless sensor network, static clusters with dynamic structures are formed in ERP-SCDS. Moreover, next-round cluster heads are selected in advance to avoid a deadlock when the old cluster heads die. Finally, a simple relay node selection mechanism instead of a complicated multi-hop route discovery algorithm is further designed for ERP-SCDS. Integrating these mechanisms enables ERP-SCDS to form balanced cluster sizes to prolong the network lifetime. Via simulations, we demonstrate that ERP-SCDS significantly outperforms LEACH, HEED, and Hausdorff previously proposed in the literature.

Spare node cooperative method for IEEE 802.11 networks

Most of the existing cooperation methods select relay node(s) mainly based on the channel state information, but do not consider whether the selected relay nodes work or not. If the selected relays are invalidated, the performance of cooperative communication will deteriorate. To resolve the above problem, this paper investigates cooperative communication in IEEE 802.11 networks, and proposes a novel Spare Cooperative Method (SCM). SCM chooses a spare cooperation node to enhance the reliability of communication, and uses an enhanced handshaking mechanism to coordinate the access of source nodes and cooperation nodes to the wireless channel. The performance of SCM is comprehensively analyzed in terms of outage probability and saturated throughput. The analysis shows that SCM improves the performance of IEEE 802.11.

Particle Swarm Optimization for Adaptive Resource Allocation in Communication Networks

A generalized model of particle swarm optimization (PSO) technique is proposed as a low complexity method for adaptive centralized and distributed resource allocation in communication networks. The proposed model is applied to adaptive multicarrier cooperative communications (MCCC) technique which utilizes the subcarriers in deep fade using a relay node in order to improve the bandwidth efficiency. Centralized PSO, based on virtual particles (VPs), is introduced for single layer and cross-layer subcarrier allocation to improve the bit error rate performance in multipath frequency selective fading channels. In the single layer strategy, the subcarriers are allocated based on the channel gains. In the cross-layer strategy, the subcarriers are allocated based on a joint measure of channel gains and distance provided by the physical layer and network layer to mitigate the effect of path loss. The concept of training particles in distributed PSO is proposed and then is applied for relay node selection. The computational complexity and traffic of the proposed techniques are investigated, and it is shown that using PSO for subcarrier allocation has a lower complexity than the techniques in the literature. Significant reduction in the traffic overhead of PSO is demonstrated when using trained particles in distributed optimizations.

A Novel Multi-hop Broadcast Protocol for Vehicular Safety Applications

Many safety applications in Vehicular Ad hoc Networks (VANETs) are based on broadcast. Designing a broadcast protocol that satisfies VANET applications' requirements is very crucial. In this paper, we propose a reliable and efficient multi-hop broadcast routing protocol for VANETs. The proposed protocol provides the strict reliability in various traffic conditions. This protocol also performs low overhead by means of reducing rebroadcast redundancy in a high-density network environment. We also propose an enhanced multipoint relay (MPR) selection algorithm that considers vehicles' mobility and then use it for relay node selection. We show the performance analysis of the proposed protocol by simulation with ns-2 in different conditions, and give the simulation results demonstrating effectiveness of the proposed protocol compared with other VANET broadcast schemes.

A Cross Layer Routing Protocol for Multihop Cellular Networks

We propose a cross-layer routing protocol for a Code Division Multiple Access (CDMA) Multihop Cellular Network (MCN). In designing the routing protocol for MCN, multiple constraints are imposed on intermediate relay node selection and end-to-end path selection. The constraints on relay nodes include willingness for cooperation, sufficient neighbourhood connectivity and the level of interference offered on the path. Path constraints include end-to-end throughput and end-to-end delay. A facile incentive mechanism is presented to motivate the cooperation between nodes in call forwarding. In addition, we present a route resilience scheme in the event of dynamic call dropping. In particular, a fast neighbour detection scheme for route resilience is proposed. Instead of using periodic HELLO messages as in traditional ad-hoc routing, the proposed neighbour detection scheme adopts an explicit handshake mechanism to reduce neighbour detection latency. We conclude the paper by demonstrating the superior performance of the proposed routing protocol compared with the other well known routing algorithms.

Opportunistic collaborative beamforming with one-bit feedback

An energy-efficient opportunistic collaborative beamformer with one-bit feedback is proposed for ad hoc sensor networks transmitting a common message over independent Rayleigh fading channels to a relatively distant destination node. In contrast to conventional collaborative beamforming schemes in which each relay node uses channel state information (CSI) to pre-compensate for its channel phase and local carrier offset, the relay nodes in the proposed beamforming scheme do not perform any phase precompensation. Instead, the destination node broadcasts a relay node selection vector to the pool of available relay nodes to opportunistically select a subset of relay nodes whose transmitted signals combine in a quasicoherent manner at the destination. Since the selection vector only indicates which relay nodes are to participate in the collaborative beamformer and does not convey any CSI, only one bit of feedback is required per relay node. Theoretical analysis shows that the received signal power obtained with the proposed opportunistic collaborative beamforming scheme scales linearly with the number of available relay nodes under a fixed total power constraint. Since computation of the optimal selection vector is exponentially complex in the number of available relays, three low-complexity sub-optimal relay node selection rules are also proposed. Simulation results confirm the effectiveness of opportunistic collaborative beamforming with the low-complexity relay node selection rules.

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.

Packet level performance analysis in wireless user-relaying networks

In this paper, the impact of user relaying on the behavior of a relay node, which acts as the source node at the same time, is analyzed in a wireless relay network at the packet level. The analysis process models the behavior of the relay node as a queueing system and represents the service for its own packet transmission as an M/G/1-type Markov chain. By considering the fact that the maximum number of packet arrivals is ordinarily limited in a practical system, the M/G/1-type Markov chain is further reformatted into a quasi-birth-death (QBD) process through re-blocking so as to simplify the analysis and obtain the associated performance, such as average packet transmission delay. As an application of the results arising from the analysis, a new relay node selection scheme, based on a utility function approach that jointly considers the channel and the queue conditions at the relay node, is proposed. Numerical results show that the proposed analysis model is quite accurate and the proposed relay node selection scheme is effective in balancing cooperative diversity gain and packet transmission delay.

Semi-Distributed User Relaying Algorithm for Amplify-and-Forward Wireless Relay Networks

In this paper, designing an effective user relaying algorithm, in terms of relay node selection and power allocation, is discussed for amplify-and-forward wireless relay networks. The objective is to simplify the application of user relaying in practical wireless communication networks so that the system capacity can be improved with low computational complexity and system overhead. Beginning with the derivation of a tight threshold-based sufficient condition on the feasibility of a relay node, i.e., ensuring that user relaying via the node can achieve a larger channel capacity than direct transmission, a semi-distributed user relaying algorithm is proposed. In the proposed algorithm, each relay node can make decision on its feasibility individually, and the ultimate decision on the relay node selection among multiple feasible ones is made in a centralized manner. Since there is no need on exchanging channel state information among different network nodes, the proposed algorithm is simple for implementation and suitable for practical applications, which have stringent constraints on system overhead. By comparing with the centralized user relaying algorithm, which requires global channel state information of the whole network, the proposed semi-distributed algorithm can provide comparable system capacity, but has significantly reduced computational complexity.

차량간 통신에서 긴급 메시지 전파를 위한 적응적 릴레이 노드 선정기법

차량 애드혹 네트워크는 기반 시설의 도움 없이 차량간 무선통신을 통해 구성되는 임시 네트워크이다. 특히, 운전자의 안전과 관련된 교통 정보가 다루어지기 때문에 신속한 메시지 전파가 요구된다. 이를 위한 대표적인 메시지 전파 기법으로 거리 기반 브로트캐스트 기법이 있다. 이 기법은 소스노드로 부터의 거리를 기반으로 메시지 전파 노드를 선택한다. 그러나 각 메시지 전파 노드가 소스노드의 통신범위 가장자리에 위치하지 않을 경우 메시지 전파 지연시간이 증가하는 문제점을 가지고 있다. 특히, 노드의 밀도가 낮을 경우 메시지 전파 지연시간은 더욱 증가한다. 본 논문에서는 이러한 문제점을 개선하기 위해 시간창 예약 기반 릴레이 노드 선택기법을 사용한 브로드캐스트 프로토콜을 제안하였다. 제안한 기법은 각 노드가 주어진 시간창 내에서 임의의 메시지 전송 대기시간을 선택한다. 각 노드의 시간창은 릴레이 노드로부터의 거리에 따라 각기 다른 시간범위를 갖게 되며, 소스노드의 통신영역의 가장자리에 좀 더 가까이 위치한 노드가 다음 릴레이 노드로 선택될 수 있도록 주어진 시간창의 일부를 예약한다. 실험결과, 시간창 예약 기반 릴레이 노드 선정기법을 사용한 브로드캐스트 프로토콜이 거리 기반 브로드 캐스트보다 노드밀도의 변화에 상관없이 더 짧은 종단간 메시지 전파 지연시간을 보였다. 특히, 노드밀도가 낮을 경우 25.7% 짧은 종단간 메시지 전파 지연시간을 보였으며, 지연시간과 네트워크 부하의 합성성능은 제안한 기법이 46% 우수한 성능을 보였다. Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.

An Integrated Sleep-Scheduling and Routing Algorithm in Ubiquitous Sensor Networks Based on AHP

Ubiquitous sensor networks (USNs) are comprised of energy constrained nodes. This limitation has led to the crucial need for energy-aware protocols to produce an efficient network. We propose a sleep scheduling scheme for balancing energy consumption rates in a single hop cluster based network using Analytical Hierarchy Process (AHP). We consider three factors contributing to the optimal nodes scheduling decision and they are the distance to cluster head (CH), residual energy, and sensing coverage overlapping, respectively. We also propose an integrated sleep scheduling and geographical multi-path routing scheme for USNs by AHP. The sleep scheduling is redesigned to adapt the multi-hop case. For the proposed routing protocol, the distance to the destination location, remaining battery capacity, and queue size of candidate sensor nodes in the local communication range are taken into consideration for next hop relay node selection. The proposed schemes are observed to improve network lifetime and conserve energy without compromising desired coverage. In the multi-hop case, it can further reduce the packet loss rate and link failure rate since the buffer capacity is considered.

Co-designed anchor-free localization and location-based routing algorithm for rapidly-deployed wireless sensor networks

We consider a wireless sensor network consisting of a single sink node at the center of a field of randomly distributed sensors. A simple anchor-free localization algorithm is proposed, in which the sink node imparts radial location information through the phased-array transmission of a series of beacons. Each individual sensor uses the knowledge of received beacons as well as information from neighbors to continue partitioning current sectors and identifying sub-sectors in which it resides until an accuracy requirement is satisfied. An energy-preserving routing algorithm is then proposed which uses the localization results as the basis for selecting relay nodes. We present the localization algorithm, analyze its partition errors as well as its impact on communication energy consumption, and then present the location-based routing algorithm. Simulation results indicate that the performance of our co-designed localization and routing algorithm in the presence of severe noise is as good as that provided by a shortest-path routing algorithm under ideal assumptions; therefore, our co-designing approach can achieve high performance with lightweight algorithms.