skip to main content
research-article

FansyRoute: adaptive fan-out for variably intermittent challenged networks

Published: 30 September 2013 Publication History

Abstract

We consider the problem of routing in a highly and variably intermittent wireless network to support delay-intolerant as well as delay tolerant applications. Specifically, the links in such a network are too volatile to maintain a consistent topology, rendering most MANET protocols ineffective. At the same time, store-and-forward (DTN) techniques are not an option due to the need for delay intolerance, and may be unnecessary due to the likely availability of contemporaneous, albeit rapidly changing, paths. We present a novel routing mechanism called FansyRoute, aimed at this challenged region between MANETs and DTNs. FansyRoute adaptively adjusts the number of replications (fan-out) on a per-node basis, taking into account the level of intermittency along the path to the destination and a user-specified tradeoff between delivery expectation and the cost of replication. We study the performance of two FansyRoute schemes on a prime example of such variably intermittently connected networks, namely asynchronously duty-cycled sensor networks. Using ns-3, we compare FansyRoute to OLSR, AODV and Flooding. The results show that in an intermittent network, FansyRoute can deliver 50% more packets than the single path protocols, with less than 5% of the replication incurred by flooding. FansyRoute replicates only when needed and the replication is restricted to the challenged regions of the network.

References

[1]
M. Alresaini, M. Sathiamoorthy, B. Krishnamachari, and M. J. Neely. Backpressure with adaptive redundancy. IEEE Infocom, 2012.
[2]
T. Clausen and P. Jacquet. Optimized Link State Routing Protocol(OLSR). RFC 3626, October 2003.
[3]
B. Deb, S. Bhatnagar, and B. Nath. A topology discovery algorithm for sensor networks with applications to network management. Technical Report DCS-TR-441, Rutgers University, 2001.
[4]
A. L. A. Doria and O. Schelén. Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 2003.
[5]
D. Ganesan, R. Govindan, S. Shenker, and D. Estrin. Highly-resilient, energy-efficient multipath routing in wireless sensor networks. ACM Sigmobile, 5(4):11--25, 2001.
[6]
J. Greunen, D. Petrovic, A. Bonivento, J. Rabaey, K. Ramchandran, and A. Sangiovanni-Vincentelli. Adaptive sleep discipline for energy conservation and robustness in dense sensor networks. IEEE International Conference on Communications, 2004.
[7]
R. Jurdak, P. Baldi, and C. Lopes. Energy-aware adaptive low power listening for sensor networks. International Workshop on Networked Sensing Systems, 2005.
[8]
S.-J. Lee and M. Gerla. Aodv-br: Backup routing in ad hoc networks. IEEE Wireless Communications and Networking Conference, 2000.
[9]
X. Li and L. Cuthber. On-demand node-disjoint multipath routing in wireless ad hoc networks. IEEE International Conference on Local Computer Networks, 2004.
[10]
H. Liu, B. Zhang, H. Mouftah, and X. Shen. Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions. IEEE Communications Magazine, 47(12), 2009.
[11]
V. Manfredi, R. Hancock, and J. Kurose. Robust routing in dynamic manets. Annual Conference of the International Technology Alliance, 2008.
[12]
M. K. Marina and S. R. Das. On-demand multi path distance vector routing in ad hoc networks. Proceedings of the Ninth International Conference on Network Protocols, 2001.
[13]
M. Mosko and J. Garcia-Luna-Aceves. Multupath routing in wireless mesh networks. IEEE Workshop in Wireless Mesh Networks, 2005.
[14]
N. Nguyen, A. Wang, P. Reiher, and G. Kuenning. Magnetic field routing for ad-hoc networks. First Workshop on Hot Topics in Networks, 2002.
[15]
C. E. Perkins and E. Royer. Ad hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pages 90--100, February 1999.
[16]
N. Shacham, E. Craighill, and A. Poggio. Speech transport in packet-radio networks with mobile nodes. IEEE Journal on Selected Areas in Communications, 1(6), 1983.
[17]
J. A. Silvester and L. Kleinrock. On the capacity of multihop slotted aloha networks with regular structure. IEEE Transactions on Communications, 31(8), 1983.
[18]
D. Tian and N. D. Georganas. a node scheduling scheme for energy conservation in large wireless sensor networks. Wireless Communication Mobile Computing, 3, 2003.
[19]
K. Zeng, K. Ren, and W. Lou. Geographic on-demand disjoint multipath routing in wireless ad hoc networks. Military Communications Conference, 2005.

Index Terms

  1. FansyRoute: adaptive fan-out for variably intermittent challenged networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CHANTS '13: Proceedings of the 8th ACM MobiCom workshop on Challenged networks
    September 2013
    76 pages
    ISBN:9781450323635
    DOI:10.1145/2505494
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 30 September 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. adaptive
    2. challenged networks
    3. delay intolerant
    4. fan-out
    5. multipath
    6. routing

    Qualifiers

    • Research-article

    Conference

    MobiCom'13
    Sponsor:

    Acceptance Rates

    CHANTS '13 Paper Acceptance Rate 10 of 25 submissions, 40%;
    Overall Acceptance Rate 61 of 159 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 149
      Total Downloads
    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 24 Oct 2024

    Other Metrics

    Citations

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media