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: 2.01). 07/2011; DOI: 10.1109/TNET.2010.2091148
Source: IEEE Xplore

ABSTRACT 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.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, the analytical expressions for the outage probability of different decode-and-forward (DF) relaying strategies for two-source two-destination networks are evaluated allowing an investigation of their effectiveness in energy saving to be determined. Each source node transmits data to an interested destination node with the help of the remaining source node in a cooperative DF manner. Specifically, we consider four DF protocols, including repetition DF (RDF), parallel DF (PDF), network coding-based RDF (NC-RDF), and dirty paper coding-like network coding-based PDF (DPC-NC-PDF). The closed-form expression of the outage probability for each protocol is derived at high signal-to-noise ratio. The results show that the DPC-NC-PDF protocol achieves the best performance while the NC-RDF protocol is better than both the RDF and PDF protocols with proper linear NC coefficients. All the DF protocols are shown to achieve diversity order one and the highest multiplexing gain is achieved with the NC-RDF and DPC-NC-PDF protocols. Finally, simulation results are presented to verify the analytical findings and show the system throughput comparison of various DF protocols.
    Wireless Personal Communications 04/2013; 69(4):1969-1981. · 0.43 Impact Factor
  • Source
    [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 01/2013; 62(2):735-747. · 2.06 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Cooperative communication (CC) has been proposed to achieve spatial diversity without requiring multiple antennas on a single device. Many efforts in exploiting the benefits of CC focus on improving the performance in terms of outage probability and channel capacity. However, the energy efficiency of CC, which is critical for the applications with energy constraints, has been little studied. In this paper, we study the problem of energy-efficient CC in cognitive radio networks by taking power control, relay assignment and channel allocation into consideration. We obtain the optimal power control for a single source-destination pair. After that, a heuristic algorithm is proposed to solve the the relay assignment and channel allocation problem for multiple source-destination pairs. Extensive simulations are conducted to show that the proposed algorithm can significantly improve the performance of energy efficiency over the direct transmission approach.
    Wireless Communications and Networking Conference (WCNC), 2013 IEEE; 01/2013

Full-text (3 Sources)

Available from
May 23, 2014