Conference Paper

Enforce truth-telling in wireless relay networks for secure communication

Sch. of Electron. Eng. & Comput. Sci., Peking Univ., Beijing, China
DOI: 10.1109/INFCOMW.2011.5928786 Conference: Computer Communications Workshops (INFOCOM WKSHPS), 2011 IEEE Conference on
Source: IEEE Xplore

ABSTRACT To ensure security in data transmission is one of the most important issues for wireless relay networks. In this paper, we consider a cooperative network, consisting of one source node, one destination node, one eavesdropper node, and a number of relay nodes. Specifically, the source selects several relay nodes which can help forward the signal to the corresponding destination to achieve the best security performance. However, the relay nodes may have the incentive not to report their true private channel information in order to get more chance to be selected and gain more payoff from the source. We employ a self-enforcing truth-telling mechanism into the network to solve this cheating problem. By adding a transfer payoff to the total payoff of each selected relay node, we prove that each relay node would get its maximum expected payoff only when it tells the truth to the source. And then, an optimal secrecy capacity of the network can be achieved. Simulation results verify the efficiency of the proposed mechanism.

0 Bookmarks
 · 
57 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Multicasting is emerging as an enabling technology for multimedia transmissions over wireless networks to support several groups of users with flexible quality of service (QoS) requirements. Although multicast has huge potential to push the limits of next generation communication systems; it is however one of the most challenging issues currently being addressed. In this survey, we explain multicast group formation and various forms of group rate determination approaches. We also provide a systematic review of recent channel-aware multicast scheduling and resource allocation (MSRA) techniques proposed for downlink multicast services in OFDMA based systems. We study these enabling algorithms, evaluate their core characteristics, limitations and classify them using multidimensional matrix. We cohesively review the algorithms in terms of their throughput maximization, fairness considerations, performance complexities, multi-antenna support, optimality and simplifying assumptions. We discuss existing standards employing multicasting and further highlight some potential research opportunities in multicast systems.
    IEEE Communications Surveys &amp Tutorials 02/2013; 15(1):240-254. · 4.82 Impact Factor

Full-text

View
2 Downloads
Available from