Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
One of the fundamental issues of wireless sensor networks is that an event can be detected by some sensor nodes and delivered to… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Concerning the small-world topology characteristics, Small World Routing Algorithm ( SWRA) of wireless sensor network was… Expand
Is this relevant?
2008
2008
In this work, we propose a new routing protocol-the small-world routing protocol. With the idea originating from the small-world… Expand
  • figure 1
  • figure 2
Is this relevant?
2008
2008
This paper presents a general virtual ring method to design and analyze small-world structured P2P networks on the base… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Peer-to-Peer (P2P) technologies are considered as one of the fundamental technologies for the next generation Internet. P2P… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2008
2008
The use of mobile nodes to improve network system performance has drawn considerable attention recently.These methods consider… Expand
Is this relevant?
2006
2006
A small world topology may result in particularly appealing features for wireless ad-hoc and sensor networks, thanks to its… Expand
Is this relevant?
2006
2006
A small world topology may result in particularly appealing features for wireless ad-hoc and sensor networks, thanks to its… Expand
Is this relevant?
2004
2004
We show in this paper that de Bruijn networks, despite providing efficient search while using constant routing table size, as… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
2003
2003
We present tight bounds for GREEDY routing with/without 1-LOOKAHEAD in several randomized networks. The idea of 1-LOOKAHEAD is… Expand
  • table 1
Is this relevant?