NDLI: Weak state routing for large scale dynamic networks

Please wait, while we are loading the content...

Scheduling algorithms for multi-carrier wireless data systems

Trade-offs between mobility and density for coverage in wireless sensor networks

DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks

Adaptive network coding and scheduling for maximizing throughput in wireless networks

Crossing over the bounded domain: from exponential to power-law inter-meeting time in MANET

Challenges: towards truly scalable ad hoc networks

Adaptive contact probing mechanisms for delay tolerant applications

Multicast capacity for large scale wireless ad hoc networks

Revisiting minimum cost reliable routing in wireless mesh networks

The geometry of mobility

Superimposed code based channel assignment in multi-radio multi-channel wireless mesh networks

Rendered path: range-free localization in anisotropic sensor networks with holes

802.11 user fingerprinting

Beyond the bits: cooperative packet recovery using physical layer information

A general model of wireless interference

Challenge: peers on wheels - a road to new traffic information systems

A measurement-based approach to modeling link capacity in 802.11-based wireless networks

On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks

Practical network coding in wireless networks

Optimal channel probing and transmission scheduling for opportunistic spectrum access

Designing localized algorithms for barrier coverage

Robust location distinction using temporal link signatures

Power law and exponential decay of inter contact times between mobile devices

Challenges: device-free passive localization for wireless environments

MDG: measurement-driven guidelines for 802.11 WLAN design

Weak state routing for large scale dynamic networks

SecNav: secure broadcast localization and time synchronization in wireless networks

Reliable density estimates for coverage and connectivity in thin strips of finite length

Mining call and mobility data to improve paging efficiency in cellular networks

Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing

Real-time implications of multiple transmission rates in wireless networks

Towards context-aware wireless spectrum agility

Altruistic cooperation for energy-efficient multi-channel MAC protocols

Self-healing multi-radio wireless mesh networks

Superposition coding for wireless mesh networks

Authentication on the edge: distributed authentication for a global open wi-fi network

Mining behavioral groups in large wireless LANs

Interference mitigation in enterprise WLANs through speculative scheduling

Cross-layer jamming detection and mitigation in wireless broadcast networks

Understanding the effect of access point density on wireless LAN performance

Low-overhead channel-aware rate adaptation

Weak state routing for large scale dynamic networks

Content Provider	ACM Digital Library
Author	Kalyanaraman, Shivkumar Abouzeid, Alhussein A. Acer, Utku Günay
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.
Starting Page	290
Ending Page	301
Page Count	12
File Format	PDF
ISBN	9781595936813
DOI	10.1145/1287853.1287888
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-09-09
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Dynamic networks Weak states Unstructured distributed hashing Routing algorithms
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in