An Optimal Algorithm for Relay Node Assignment in Cooperative Ad Hoc Networks

Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA
IEEE/ACM Transactions on Networking (Impact Factor: 1.81). 07/2011; 19(3):879 - 892. DOI: 10.1109/TNET.2010.2091148
Source: IEEE Xplore


Recently, cooperative communications, in the form of having each node equipped with a single antenna and exploit spatial diversity via some relay node's antenna, is shown to be a promising approach to increase data rates in wireless networks. Under this communication paradigm, the choice of a relay node (among a set of available relay nodes) is critical in the overall network performance. In this paper, we study the relay node assignment problem in a cooperative ad hoc network environment, where multiple source-destination pairs compete for the same pool of relay nodes in the network. Our objective is to assign the available relay nodes to different source-destination pairs so as to maximize the minimum data rate among all pairs. The main contribution of this paper is the development of an optimal polynomial time algorithm, called ORA, that achieves this objective. A novel idea in this algorithm is a “linear marking” mechanism, which maintains linear complexity of each iteration. We give a formal proof of optimality for ORA and use numerical results to demonstrate its capability.

Download full-text


Available from: Yi Shi,
  • Source
    • "Following our network model and the discussions in [20] and [32], each source-destination pair can use either direct transmission or cooperative communication with the help of the best relay to achieve full diversity. We define the channel between s i and d i (with or without cooperative relay) as primary channel, and the channel between s i and e u (with or without cooperative relay) as eavesdropping channel. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Cooperative wireless networking, which is promising in improving the system operation efficiency and reliability by acquiring more accurate and timely information, has attracted considerable attentions to support many services in practice. However, the problem of secure cooperative communication has not been well investigated yet. In this paper, we exploit physical layer security to provide secure cooperative communication for wireless ad hoc networks (WANETs) where involve multiple source-destination pairs and malicious eavesdroppers. By characterizing the security performance of the system by secrecy capacity, we study the secrecy capacity optimization problem in which security enhancement is achieved via cooperative relaying and cooperative jamming. Specifically, we propose a system model where a set of relay nodes can be exploited by multiple source-destination pairs to achieve physical layer security. We theoretically present a corresponding formulation for the relay assignment problem and develop an optimal algorithm to solve it in polynomial time. To further increase the system secrecy capacity, we exploit the cooperative jamming technique and propose a smart jamming algorithm to interfere the eavesdropping channels. Through extensive experiments, we validate that our proposed algorithms significantly increase the system secrecy capacity under various network settings.
    IEEE Transactions on Parallel and Distributed Systems 01/2014; 26(4):1-1. DOI:10.1109/TPDS.2014.2316155 · 2.17 Impact Factor
  • Source
    • "Let the erroneous packets received at R 1 , R 2 , R 3 and D in the BC phase be {s[3], s[5]}, {s[2] "
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates retransmission (RT) mechanisms in wireless regenerative multirelay networks. Conventionally, the RT can be realized in a cooperative manner with the assistance of all available relays. However, this may result in high overall power consumption due to the RT of the same packets across the nodes, particularly when the number of relays is large. We propose a cooperative RT (CR) scheme based on relay cooperation (RC) and binary xor operations to significantly reduce the number of packets retransmitted to produce a more power-efficient system with nonoverlapped RTs. Significantly, we also derive the error probability of RT decisions at the source and relays and show that the proposed CR scheme improves the reliability of the RTs. Furthermore, by deriving the average number of packets to be retransmitted at the source and relays, we not only show that the proposed CR scheme reduces the number of RTs and removes overlapped retransmitted packets but determine the optimized number of relays used for the RT phase as well. Finally, simulation results are presented to demonstrate the validity of the analytical expressions.
    IEEE Transactions on Vehicular Technology 02/2013; 62(2):735-747. DOI:10.1109/TVT.2012.2224393 · 1.98 Impact Factor
  • Source
    • "Recently, many research results on wireless cooperative communication system have been reported. In [1] [2], signal copies at relay nodes are transmitted to destination in TDM (Time-division multiplexing) mode or FDM (Frequencydivision multiplexing) mode. As it needs multiple orthogonal channels to help the communication between source and destination, it leads to a long delay for TDM mode and high frequency consumption for FDM mode. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In multi-relay shared-bandwidth (MRSB) wireless cooperative communication systems, it generally needs destination node to determine the optimal relay subset and broadcast the information to the candidate relays. One drawback to this central scheme is its high complexity and time consumption. In this letter, we propose a distributed power allocation strategy that makes the system's Signal-Noise-Ratio (SNR) performance improve monotonically in the number of the relays. Each terminal can relay its overheard information with specified transmission power according to its own channel information separately. Consequently, the NP problem of solving the optimal relay subset in previous central mode is transformed into the problem of power allocation and distributed relay scheduling is realized in a simple way. Through Monte Carlo simulations being carried out under Rayleigh fading channel condition, the performance of the proposed scheme is highlighted by comparing with previous central mode schemes.
    IEEE Communications Letters 08/2012; 16(8):1263-1265. DOI:10.1109/LCOMM.2012.060812.121088 · 1.27 Impact Factor
Show more