skip to main content
review-article

FansyRoute: adaptive fan-out for variably intermittent challenged networks

Published: 12 February 2014 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-andforward (DTN) techniques are not an option due to the need for ndelay 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. Fansy- Route 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]
S. Biswas and R. Morris. ExOR: Opportunistic multi-hop routing for wireless networks. Proc. of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2005.
[2]
J. W. Byers, M. Luby, and M. Mitzenmacher. A digital fountain approach to asynchronous reliable multicast. IEEE JSAC, Special Issure for network support in Multicast Communications, 20(8), 2002.
[3]
T. Clausen and P. Jacquet. Optimized Link State Routing Protocol(OLSR). RFC 3626, October 2003.
[4]
D. D. Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. Proc. MOBICOM, 2003.
[5]
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.
[6]
A. L. A. Doria and O. Schelén. Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 2003.
[7]
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.
[8]
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.
[9]
C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. n Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking (MOBICOM), 2000.
[10]
S. Jain, M. Demmer, R. Patra, and K. Fall. Using redundancy to cope with failures in a delay tolerant network. ACM SIGCOMM, 2005.
[11]
R. Jurdak, P. Baldi, and C. Lopes. Energy-aware adaptive low power listening for sensor networks. International Workshop on Networked Sensing Systems, 2005.
[12]
D. Kim and M. Liu. Optimal stochastic routing in low duty-cycled wireless sensor networks. International Conference on Wireless Internet (WICON), 2008.
[13]
O. Landsiedel, E. Ghadimi, S. Duquennoy, and M. Johansson. Low power, low delay: Opportunistic routing meets duty cycling. O. Landsiedel, E. Ghadimi, S. Duquennoy, and M. Johansson., 2012.
[14]
S.-J. Lee and M. Gerla. AODV-BR: Backup routing in ad hoc networks. IEEE Wireless Communications and Networking Conference, 2000.
[15]
C. E. Leiserson, R. L. Rivest, C. Stein, and T. H. Cormen. Introduction to algorithms. The MIT press, 2001.
[16]
X. Li and L. Cuthber. On-demand node-disjoint multipath routing in wireless ad hoc networks. IEEE International Conference on Local Computer Networks, 2004.
[17]
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.
[18]
V. Manfredi, R. Hancock, and J. Kurose. Robust routing in dynamic MANETs. Annual Conference of the International Technology Alliance, 2008.
[19]
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.
[20]
M. Mosko and J. Garcia-Luna-Aceves. Multupath routing in wireless mesh networks. IEEE Workshop in Wireless Mesh Networks, 2005.
[21]
N. Nguyen, A. Wang, P. Reiher, and G. Kuenning. Magnetic field routing for ad-hoc networks. First Workshop on Hot Topics in Networks, 2002.
[22]
V. Paruchuri, S. Basavaraju, A. Durresi, and R. Kannan. Random asynchronous wakeup protocol for sensor networks. Proc. IEEE BroadNets, 2004.
[23]
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.
[24]
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.
[25]
L. Shu. Impacts of duty-cycle on TPGF geographical multipath routing in wireless sensor networks. International Workshop on Quality of Service, 2010.
[26]
L. Shu, M. Hauswirth, D. Phuoc, P. Yu, and L. Zhang. Transmitting streaming data in wireless multimedia sensor networks with holes. International Conference on Mobile Ubiquitous Multimedia, 2007.
[27]
J. A. Silvester and L. Kleinrock. On the capacity of multihop slotted ALOHA networks with regular structure. IEEE Transactions on Communications, 31(8), 1983.
[28]
T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. Proc. ACM SIGCOMM workshop on Delay-tolerant networking, 2005.
[29]
D. Tian and N. D. Georganas. a node scheduling scheme for energy conservation in large wireless sensor networks. Wireless Communication Mobile Computing, 3, 2003.
[30]
A. Vahdat and D. Becker. Epidemic routing for partially-connected ad hoc networks. Technical report, Duke University, 2000.
[31]
K. Zeng, K. Ren, and W. Lou. Geographic on-demand disjoint multipath routing in wireless ad hoc networks. Military Communications Conference, 2005.

Cited By

View all
  • (2021)Intent-Based Routing in Delay- and Disruption-Tolerant NetworksFuture Intent-Based Networking10.1007/978-3-030-92435-5_6(101-127)Online publication date: 10-Dec-2021

Index Terms

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

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM SIGMOBILE Mobile Computing and Communications Review
    ACM SIGMOBILE Mobile Computing and Communications Review  Volume 18, Issue 1
    January 2014
    94 pages
    ISSN:1559-1662
    EISSN:1931-1222
    DOI:10.1145/2581555
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 February 2014
    Published in SIGMOBILE Volume 18, Issue 1

    Check for updates

    Author Tags

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

    Qualifiers

    • Review-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 24 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Intent-Based Routing in Delay- and Disruption-Tolerant NetworksFuture Intent-Based Networking10.1007/978-3-030-92435-5_6(101-127)Online publication date: 10-Dec-2021

    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