Backpressure Delay Enhancement for Encounter-Based Mobile Networks While Sustaining Throughput Optimality

被引:20
作者
Alresaini, Majed [1 ]
Wright, Kwame-Lante [2 ]
Krishnamachari, Bhaskar [2 ]
Neely, Michael J. [3 ]
机构
[1] King Saud Univ, Dept Comp Engn, Riyadh 51178, Saudi Arabia
[2] Univ So Calif, Dept Elect Engn, Los Angeles, CA 90089 USA
[3] Univ So Calif, Dept Elect Engn Syst, Los Angeles, CA 90089 USA
基金
美国国家科学基金会;
关键词
Backpressure; DTN; ICMN; redundancy; duplicates; BWAR; POWER ALLOCATION; WIRELESS; TRADEOFFS; OPTIMIZATION; REDUCTION; STABILITY;
D O I
10.1109/TNET.2015.2404331
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Backpressure routing, in which packets are preferentially transmitted over links with high queue differentials, offers the promise of throughput-optimal operation for a wide range of communication networks. However, when traffic load is low, back-pressure methods suffer from long delays. This is of particular concern in intermittent encounter-based mobile networks which are already delay-limited due to the sparse and highly dynamic network connectivity. While state of the art mechanisms for such networks have proposed the use of redundant transmissions to improve delay, they do not work well when traffic load is high. In this paper we propose backpressure with adaptive redundancy (BWAR), a novel hybrid approach that provides the best of both worlds. This approach is robust, distributed, and does not require any prior knowledge of network load conditions. We also present variants of BWAR that remove redundant packets via a timeout mechanism, and that improve energy use. These algorithms are evaluated by mathematical analysis and by simulations of real traces of taxis in Beijing, China. The simulations confirm that BWAR outperforms traditional backpressure at low load, while outperforming encounter-routing schemes (Spray and Wait and Spray and Focus) at high load.
引用
收藏
页码:1196 / 1208
页数:13
相关论文
共 62 条
  • [1] Alresaini M, 2012, IEEE INFOCOM SER, P2300, DOI 10.1109/INFCOM.2012.6195617
  • [2] [Anonymous], P MOBIHOC
  • [3] [Anonymous], 2010, SYNTHESIS LECT COMMU
  • [4] [Anonymous], 2000, EPIDEMIC ROUTING PAR
  • [5] [Anonymous], GLOBECOM 2009 GLOB T
  • [6] Novel Architectures and Algorithms for Delay Reduction in Back-pressure Scheduling and Routing
    Bui, Loc
    Srikant, R.
    Stolyar, Alexander
    [J]. IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 2936 - +
  • [7] Ding Y., 2011, C SMART GRIDS GREEN
  • [8] Backpressure-based Routing Protocol for DTNs
    Dvir, Amit
    Vasilakos, Athanasios V.
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2010, 40 (04) : 405 - 406
  • [9] Georgiadis Leonidas, 2006, Foundations and Trends in Networking, V1, P1, DOI 10.1561/1300000001
  • [10] Locating mobile nodes with EASE: Learning efficient routes from encounter histories alone
    Grossglauser, Matthias
    Vetterli, Martin
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2006, 14 (03) : 457 - 469