skip to main content
10.1145/1287853.1287888acmconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
Article

Weak state routing for large scale dynamic networks

Published: 09 September 2007 Publication History

Abstract

Routing in communication networks involves the indirection from a persistent name (or ID) to a locator and delivering packets based upon the locator. In a large-scale, highly dynamic network, the ID-to-locator mappings are both large in number, and change often. Traditional routing protocols require high overhead to keep these in directions up-to-date. In this paper, we propose Weak State Routing (WSR), a routing mechanism for large-scale highly dynamic networks. WSR's novelty is that it uses random directional walks biased occasionally by weak indirection state information in intermediate nodes. The indirection state information is weak, i.e. interpreted not as absolute truth, but as probabilistic hints. Nodes only have partial information about the region a destination node is likely to be. This method allows us to aggregate information about a number of remote locations in a geographic region. In other words, the state information maps a set-of-IDs to a it geographical region. The intermediate nodes receiving the random walk use a method similar to longest-prefix-match in order to prioritize their mappings to decide how to bias and forward the random walk. WSR can also be viewed as an unstructured distributed hashing technique. WSR displays good rare-object recall with scalability properties similar to structured DHTs, albeit with more tolerance to dynamism and without constraining the degree distribution of the underlying network.
Through simulations, we show that WSR offers a high packet delivery ratio, more than 98%. The control packet overhead incurred in the network scales as O(N) for N-node networks. The number of mappings stored in the network appears to scale as Θ(N(3/2)). We compare WSR with Dynamic Source Routing (DSR) and geographic forwarding (GPSR) combined with Grid Location Service (GLS). Our results indicate that WSR delivers more packets with less overhead at the cost of increased path length.

References

[1]
Hls patch for ns-2.29. http://www.cn.uni-duesseldorf.de/staff/kiess/software/hls-ns2-patch.
[2]
Network simulator. ns-2. http://www.isi.edu/nsnam/ns.
[3]
BISNIK, N., AND ABOUZEID, A. A. Capacity deficit in mobile wireless ad hoc networks due to geographic routing overheads. In 26th IEEE International Conference on Computer Communications (INFOCOM'07). (2007), pp. 517--525.
[4]
BLOOM, B. H. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13, 7 (1970), 422--426.
[5]
CAESAR, M., CASTRO, M., NIGHTINGALE, E. B., O'SHEA, G., AND ROWSTRON, A. Virtual ring routing: Network routing inspired by dhts. Computer Communication Review 36, 4 (2006), 351--362.
[6]
CHAWATHE, Y., RATNASAMY, S., BRESLAU, L., LANHAM, N., AND SHENKER, S. Making gnutella-like p2p systems scalable. Computer Communication Review 33, 4 (2003), 407--418.
[7]
CHENG, B.-N., YUKSEL, M., AND KALYANARAMAN, S. Orthogonal rendezvous routing protocol for wireless mesh networks. IEEE International Conference on Network Protocols (ICNP) (2006).
[8]
DUBOIS-FERRIERE, H., GROSSGLAUSER, M., AND VETTERLI, M. Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages. Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (2003), 257--266.
[9]
GKANTSIDIS, C., MIHAIL, M., AND SABERI, A. Random walks in peer-to-peer networks. Proceedings - IEEE INFOCOM 1 (2004), 120--130.
[10]
GROSSGLAUSER, M., AND TSE, D. N. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking 10, 4 (2002), 477--486.
[11]
GROSSGLAUSER, M., AND VETTERLI, M. Locating mobile nodes with ease: Learning efficient routes from encounter histories alone. IEEE/ACM Transactions on Networking 14, 3 (2006), 457--469.
[12]
JAIN, S., FALL, K., AND PATRA, R. Routing in a delay tolerant network. vol. 34, pp. 145--157.
[13]
JOHNSON, D. B., AND MALTZ, D. A. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, T. Imielinski and H. Korth, Eds., vol. 353. Kluwer Academic Publishers, 1996.
[14]
KARGER, D., LEHMAN, E., LEIGHTON, T., LEVINE, M., EWIN, D., AND PANIGRAHY, R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. Conference Proceedings of the Annual ACM Symposium on Theory of Computing (1997), 654--663.
[15]
KARP, B., AND KUNG, H. Gpsr: Greedy perimeter stateless routing for wireless networks. Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM (2000), 243--254.
[16]
KIESS, W., FÜSSLER, H., WIDMER, J., AND MAUVE, M. Hierarchical location service for mobile ad-hoc networks. ACM SIGMOBILE Mobile Computing and Communications Review (MC2R) 8, 4 (2004), 47--58.
[17]
KUMAR, A., XU, J., AND ZEGURA, E. W. Efficient and scalable query routing for unstructured peer-to-peer networks. Proceedings of IEEE INFOCOM 2 (2005), 1162--1173.
[18]
LI, J., JANNOTTI, J., DE COUTO, D., KARGER, D., AND MORRIS, R. A scalable location service for geographic ad hoc routing. Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking(Mobicom) (2000), 120--30.
[19]
LV, Q., CAO, P., COHEN, E., LI, K., AND SHENKER, S. Search and replication in unstructured peer-to-peer networks. Proceedings of the International Conference on Supercomputing, (2002), 84--95
[20]
PERKINS, C. E., AND BHAGWAT, P. Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers. Computer Communications Review 24, 4 (1994), 234--.
[21]
RATNASAMY, S., FRANCIS, P., HANDLEY, M., KARP, R., AND SHENKER, S. A scalable content-addressable network. Computer Communication Review 31,4 (2001), 161--172.
[22]
RHEA, S. C., AND KUBIATOWICZ, J. Probabilistic location and routing. Proceedings - IEEE INFOCOM 3 (2002), 1248--1257.
[23]
SANTIVANEZ, C., AND RAMANATHAN, R. Hazy sighted link state (hsls) routing: A scalable link state algorithm. Tech. Rep. BBN-TM-1301, BBN Technologies, Cambridge, MA, 2001.
[24]
SPYROPOULOS, T., PSOUNIS, K., AND RAGHAVENDRA, C. S. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. pp. 252--259.
[25]
STOICA, I., MORRIS, R., KARGER, D., KAASHOEK, M., AND BALAKRISHNAN, H. Chord: A scalable peer-to-peer lookup service for internet applications. Computer Communication Review 31, 4 (2001), 149--160.
[26]
WANG, Y., JAIN, S., MARTONOSI, M., AND FALL, K. Erasure-coding based routing for opportunistic networks. pp. 229--236.
[27]
YOON, J., LIU, M., AND NOBLE, B. Random waypoint considered harmful. Proceedings - IEEE INFOCOM 2 (2003), 1312--1321.

Cited By

View all
  • (2019)Time-aware Probabilistic Epidemic Forwarding Method in Heterogeneous DTNs2019 27th Iranian Conference on Electrical Engineering (ICEE)10.1109/IranianCEE.2019.8786535(1239-1244)Online publication date: Apr-2019
  • (2019)p-Epidemic forwarding method for heterogeneous delay-tolerant networksThe Journal of Supercomputing10.1007/s11227-019-02886-775:11(7244-7264)Online publication date: 19-Jun-2019
  • (2018)Scalable and Privacy Preserving Routing in Mobile Social Networks2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)10.1109/MASS.2018.00087(559-564)Online publication date: Oct-2018
  • Show More Cited By

Index Terms

  1. Weak state routing for large scale dynamic networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking
    September 2007
    370 pages
    ISBN:9781595936813
    DOI:10.1145/1287853
    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 ACM 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: 09 September 2007

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. dynamic networks
    2. routing algorithms
    3. unstructured distributed hashing
    4. weak states

    Qualifiers

    • Article

    Conference

    MobiCom/MobiHoc '07
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 440 of 2,972 submissions, 15%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)13
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 17 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Time-aware Probabilistic Epidemic Forwarding Method in Heterogeneous DTNs2019 27th Iranian Conference on Electrical Engineering (ICEE)10.1109/IranianCEE.2019.8786535(1239-1244)Online publication date: Apr-2019
    • (2019)p-Epidemic forwarding method for heterogeneous delay-tolerant networksThe Journal of Supercomputing10.1007/s11227-019-02886-775:11(7244-7264)Online publication date: 19-Jun-2019
    • (2018)Scalable and Privacy Preserving Routing in Mobile Social Networks2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)10.1109/MASS.2018.00087(559-564)Online publication date: Oct-2018
    • (2016)Distance-Based Energy-Efficient Opportunistic Broadcast Forwarding in Mobile Delay-Tolerant NetworksIEEE Transactions on Vehicular Technology10.1109/TVT.2015.245115565:7(5512-5524)Online publication date: Jul-2016
    • (2014)Scalable opportunistic forwarding algorithms in delay tolerant networks using similarity hashing2014 Eleventh Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)10.1109/SAHCN.2014.6990326(46-54)Online publication date: Jun-2014
    • (2014)A Localized Efficient Forwarding Algorithm in Large-Scale Delay Tolerant NetworksProceedings of the 2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems10.1109/MASS.2014.132(594-599)Online publication date: 28-Oct-2014
    • (2014)Performance modeling of DTN routing with heterogeneous and selfish nodesWireless Networks10.1007/s11276-013-0583-z20:1(25-40)Online publication date: 1-Jan-2014
    • (2013)A Risk Taking Routing Algorithm for Delay Tolerant NetworksProceedings of the 2013 IEEE 27th International Conference on Advanced Information Networking and Applications10.1109/AINA.2013.128(284-289)Online publication date: 25-Mar-2013
    • (2012)Message-driven based energy-efficient routing in heterogeneous delay-tolerant networksProceedings of the 1st ACM workshop on High performance mobile opportunistic systems10.1145/2386980.2386989(39-46)Online publication date: 25-Oct-2012
    • (2012)DART: A Directional Antenna Based RouTing Protocol for Ad-Hoc Networks with High Mobility2012 8th International Conference on Wireless Communications, Networking and Mobile Computing10.1109/WiCOM.2012.6478474(1-4)Online publication date: Sep-2012
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media