The Use of Scalable Source Routing for Networked Sensors. Fuhrmann, T. 2005.
The Use of Scalable Source Routing for Networked Sensors [link]Paper  abstract   bibtex   
In this paper, we briefly present a novel routing algorithm, scalable source routing (SSR), which is capable of memory and message efficient routing in networks with \textquoterightrandom topology\textquoteright. This algorithm enables sensor networks to use recent peer to-peer mechanisms from the field of overlay networks, like e.g. distributed hash tables and indirection infrastructures. Unlike other proposals along that direction, SSR integrates all necessary routing tasks into one simple, highly efficient routing protocol. Simulations demonstrate that in a small-world network with more than 100 000 nodes, SSR requires each node to only store routing data for 255 other nodes to establish routes between arbitrary pairs of nodes. These routes are on average only about 20-30% longer than the globally optimal path between these nodes.
@conference {fuhrmann05emnets,
	title = {The Use of Scalable Source Routing for Networked Sensors},
	booktitle = {Proceedings of the 2nd IEEE Workshop on Embedded Networked Sensors},
	year = {2005},
	pages = {163{\textendash}165},
	publisher = {IEEE Computer Society  Washington, DC, USA},
	organization = {IEEE Computer Society  Washington, DC, USA},
	type = {publication},
	address = {Sydney, Australia},
	abstract = {In this paper, we briefly present a novel routing algorithm, scalable source routing (SSR), which is capable of memory and message efficient routing in networks with {\textquoteright}random topology{\textquoteright}. This algorithm enables sensor networks to use recent peer to-peer mechanisms from the field of overlay networks, like e.g. distributed hash tables and indirection infrastructures. Unlike other proposals along that direction, SSR integrates all necessary routing tasks into one simple, highly efficient routing protocol. Simulations demonstrate that in a small-world network with more than 100 000 nodes, SSR requires each node to only store routing data for 255 other nodes to establish routes between arbitrary pairs of nodes. These routes are on average only about 20-30\% longer than the globally optimal path between these nodes.
},
	keywords = {scalable source routing, topology matching},
	isbn = {0-7803-9246-9},
	url = {http://i30www.ira.uka.de/research/publications/p2p/},
	author = {Thomas Fuhrmann}
}

Downloads: 0