Skip to search formSkip to main contentSkip to account menu

Small-world routing

Known as: Small world routing 
In network theory, small-world routing refers to routing methods for small-world networks. Networks of this type are peculiar in that relatively… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Clustering coefficientFreenetFriend-to-friendGreedy algorithm

Broader (1)

Network theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A Small-World Routing Protocol and the Effect of Pass-Over for Wireless Sensor Networks
One of the fundamental issues of wireless sensor networks is that an event can be detected by some sensor nodes and delivered to… 
2010
2010
Small world routing algorithm of wireless sensor network
Concerning the small-world topology characteristics, Small World Routing Algorithm ( SWRA) of wireless sensor network was… 
2010
2010
Small world routing algorithm of wireless sensor network: Small world routing algorithm of wireless sensor network
2009
2009
Resolving PassOver Problem in Wireless Sensor Networks
-In this work, we address the pass-over issue in wireless sensor network routing. Pass-over occurs when a query agent passes over… 
2008
2008
A Small-World Routing Protocol for Wireless Sensor Networks
In this work, we propose a new routing protocol-the small-world routing protocol. With the idea originating from the small-world… 
2008
2008
A Small World Routing Model for Structured P2P Systems
Peer-to-Peer (P2P) technologies are considered as one of the fundamental technologies for the next generation Internet. P2P… 
2008
2008
A Small World Routing Protocol in Wireless Networks
The use of mobile nodes to improve network system performance has drawn considerable attention recently.These methods consider… 
2006
2006
Small world routing: a methodological framework for driving the emerging topology of energy-constrained multi-hop wireless networks
A small world topology may result in particularly appealing features for wireless ad-hoc and sensor networks, thanks to its… 
2006
2006
Small world routing: a methodological framework for driving the emerging topology of energy-constrained multi-hop wireless networks
A small world topology may result in particularly appealing features for wireless ad-hoc and sensor networks, thanks to its… 
2003
2003
The Power of Lookahead in Small-World Routing Networks: Greedy routing, aided by 1-Lookahead, has O(log n / log log n) latency for several randomized P2P routing networks.
We present tight bounds for GREEDY routing with/without 1-LOOKAHEAD in several randomized networks. The idea of 1-LOOKAHEAD is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)