On Cooperative Communication in Ad-Hoc Networks: The Case for Uncoordinated Location-Aware Retransmission Strategies

被引:5
|
作者
Xiong, Lixiang [1 ]
Libman, Lavy [2 ,3 ]
Mao, Guoqiang [1 ,3 ]
机构
[1] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW 2006, Australia
[2] Univ Sydney, Sch Informat Technol, Sydney, NSW 2006, Australia
[3] NICTA, Networked Syst Res Grp, Eveleigh, NSW 1430, Australia
基金
澳大利亚研究理事会;
关键词
WIRELESS NETWORKS; CODED COOPERATION; DIVERSITY; PROTOCOLS;
D O I
10.1109/LCN.2009.5355188
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cooperative communication methods in wireless networks, ranging from relaying by a common neighbor over a single wireless hop to opportunistic routing at the network layer, have been shown in recent years to offer significant performance gains over traditional approaches that ignore the broadcast nature of the wireless medium, and are particularly valuable in environments prone to channel shadowing and fading, such as mobile ad-hoc networks. A common feature of various cooperative methods proposed in the literature is the coordination required to discover the available neighbors and determine the optimal one(s) to be involved in the cooperation. However, the overhead cost of such coordination may be prohibitive in networks with highly dynamic topology (e.g. due to high mobility), as the discovery and negotiation overheads may negate much of the cooperation gains. Accordingly, we present the case for uncoordinated cooperative retransmission, where a node overhearing a frame may retransmit it "blindly" without any prior coordination with the transmitter, intended receiver, or any other neighbors in the vicinity. We pose and solve the problem of finding the optimal retransmission probability as a function of location, and characterize the optimal uncoordinated cooperation region through the solution of an integral equation that depends only on the a priori node density and wireless propagation model. Through numerical evaluation, we demonstrate that uncoordinated cooperation provides a low-overhead viable alternative, with a frame delivery probability that can even exceed that of coordinated cooperation methods in situations with high noise (or low transmission power) and high node density.
引用
收藏
页码:554 / +
页数:2
相关论文
共 50 条
  • [41] QoS-Aware Cooperative Medium Access Control for MIMO Ad-Hoc Networks
    Zheng, Jialing
    Ma, Maode
    IEEE COMMUNICATIONS LETTERS, 2010, 14 (01) : 48 - 50
  • [42] An efficient encoding tree for location-aware multicast routing protocol in wireless ad hoc networks
    Huang, Yueh-Min
    Chiang, Tzu-Chiang
    Hou, Ting-Wei
    Journal of Internet Technology, 2005, 6 (01): : 73 - 80
  • [43] An efficient peer-to-peer lookup protocol for location-aware mobile ad hoc networks
    Kim, DW
    Park, CI
    PROCEEDINGS OF MOBIQUITOUS 2005, 2005, : 510 - 512
  • [44] Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks
    Shih, Tzay-Farn
    Yen, Hsu-Chun
    WIRELESS NETWORKS, 2008, 14 (03) : 321 - 333
  • [45] Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks
    Tzay-Farn Shih
    Hsu-Chun Yen
    Wireless Networks, 2008, 14 : 321 - 333
  • [46] Location-Aware Caching for Semantic-Based Image Queries in Mobile AD HOC Networks
    Yang, Bo
    Mareboyana, Manohar
    INTERNATIONAL JOURNAL OF MULTIMEDIA DATA ENGINEERING & MANAGEMENT, 2012, 3 (01): : 17 - 35
  • [47] Access control method with variable retransmission probability in ad-hoc networks
    Nakamura, Y
    Tian, X
    Ideguchi, T
    Okuda, T
    2004 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXP (ICME), VOLS 1-3, 2004, : 2095 - 2098
  • [48] Fully power-aware and location-aware protocols for wireless multi-hop ad hoc networks
    Tseng, YC
    Hsieh, TY
    ELEVENTH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2002, : 608 - 613
  • [49] New strategies for revocation in ad-hoc networks
    Moore, Tyler
    Clulow, Jolyon
    Nagaraja, Shishir
    Anderson, Ross
    SECURITY AND PRIVACY IN AD-HOC AND SENSOR NETWORKS, 2007, 4572 : 232 - +
  • [50] Capabilities aware routing for dynamic ad-hoc networks
    Gemelli, N
    LaMonica, P
    Petzke, P
    Spina, J
    INTERNATIONAL CONFERENCE ON INTEGRATION OF KNOWLEDGE INTENSIVE MULTI-AGENT SYSTEMS: KIMAS'03: MODELING, EXPLORATION, AND ENGINEERING, 2003, : 585 - 590