Scalable routing for networked sensors and actuators. Fuhrmann, T. 2005. ![Scalable routing for networked sensors and actuators [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex The design of efficient routing protocols for ad hoc and sensor networks is challenging for several reasons: Physical network topology is random. Nodes have limited computation and memory capabilities. Energy and bisection bandwidth are scarce. Furthermore, in most settings, the lack of centralized components leaves all network control tasks to the nodes acting as decentralized peers. In this paper, we present a novel routing algorithm, scalable source routing (SSR), which is capable of memory and message efficient routing in large random networks. A guiding example is a community of \textquoterightdigital homes \textquoteright where smart sensors and actuators are installed by laypersons. Such networks combine wireless ad-hoc and infrastructure networks, and lack a well-crafted network topology. Typically, the nodes do not have sufficient processing and memory resources to perform sophisticated routing algorithms. Flooding on the other hand is too bandwidthconsuming in the envisaged large-scale networks. SSR is a fully self-organizing routing protocol for such scenarios. It creates a virtual ring that links all nodes via predecessor/successor source routes. Additionally, each node possesses O(log N) short-cut source routes to nodes in exponentially increasing virtual ring distance. Like with the Chord overlay network, this ensures full connectivity within the network. Moreover, it provides a routing semantic which can efficiently support indirection schemes like i3. Memory and message efficiency are achieved by the introduction of a route cache together with a set of path manipulation rules that allow to produce near-to-optimal paths.
@conference {Fuhrmann05scalablerouting,
title = {Scalable routing for networked sensors and actuators},
booktitle = {In Proceedings of the Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks},
year = {2005},
abstract = {The design of efficient routing protocols for ad hoc and sensor networks is challenging for several reasons: Physical network topology is random. Nodes have limited computation and memory capabilities. Energy and bisection bandwidth are scarce. Furthermore, in most settings, the lack of centralized components leaves all network control tasks to the nodes acting as decentralized peers. In this paper, we present a novel routing algorithm, scalable source routing (SSR), which is capable of memory and message efficient routing in large random networks. A guiding example is a community of {\textquoteright}digital homes {\textquoteright} where smart sensors and actuators are installed by laypersons. Such networks combine wireless ad-hoc and infrastructure networks, and lack a well-crafted network topology. Typically, the nodes do not have sufficient processing and memory resources to perform sophisticated routing algorithms. Flooding on the other hand is too bandwidthconsuming in the envisaged large-scale networks. SSR is a fully self-organizing routing protocol for such scenarios. It creates a virtual ring that links all nodes via predecessor/successor source routes. Additionally, each node possesses O(log N) short-cut source routes to nodes in exponentially increasing virtual ring distance. Like with the Chord overlay network, this ensures full connectivity within the network. Moreover, it provides a routing semantic which can efficiently support indirection schemes like i3. Memory and message efficiency are achieved by the introduction of a route cache together with a set of path manipulation rules that allow to produce near-to-optimal paths.},
keywords = {scalable source routing, sensor networks, wireless sensor network},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6509},
author = {Thomas Fuhrmann}
}
Downloads: 0
{"_id":"vBNtWyzK5kXxu5YBF","bibbaseid":"fuhrmann-scalableroutingfornetworkedsensorsandactuators-2005","downloads":0,"creationDate":"2018-07-03T04:50:28.789Z","title":"Scalable routing for networked sensors and actuators","author_short":["Fuhrmann, T."],"year":2005,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"Scalable routing for networked sensors and actuators","booktitle":"In Proceedings of the Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks","year":"2005","abstract":"The design of efficient routing protocols for ad hoc and sensor networks is challenging for several reasons: Physical network topology is random. Nodes have limited computation and memory capabilities. Energy and bisection bandwidth are scarce. Furthermore, in most settings, the lack of centralized components leaves all network control tasks to the nodes acting as decentralized peers. In this paper, we present a novel routing algorithm, scalable source routing (SSR), which is capable of memory and message efficient routing in large random networks. A guiding example is a community of \\textquoterightdigital homes \\textquoteright where smart sensors and actuators are installed by laypersons. Such networks combine wireless ad-hoc and infrastructure networks, and lack a well-crafted network topology. Typically, the nodes do not have sufficient processing and memory resources to perform sophisticated routing algorithms. Flooding on the other hand is too bandwidthconsuming in the envisaged large-scale networks. SSR is a fully self-organizing routing protocol for such scenarios. It creates a virtual ring that links all nodes via predecessor/successor source routes. Additionally, each node possesses O(log N) short-cut source routes to nodes in exponentially increasing virtual ring distance. Like with the Chord overlay network, this ensures full connectivity within the network. Moreover, it provides a routing semantic which can efficiently support indirection schemes like i3. Memory and message efficiency are achieved by the introduction of a route cache together with a set of path manipulation rules that allow to produce near-to-optimal paths.","keywords":"scalable source routing, sensor networks, wireless sensor network","url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6509","author":[{"firstnames":["Thomas"],"propositions":[],"lastnames":["Fuhrmann"],"suffixes":[]}],"bibtex":"@conference {Fuhrmann05scalablerouting,\n\ttitle = {Scalable routing for networked sensors and actuators},\n\tbooktitle = {In Proceedings of the Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks},\n\tyear = {2005},\n\tabstract = {The design of efficient routing protocols for ad hoc and sensor networks is challenging for several reasons: Physical network topology is random. Nodes have limited computation and memory capabilities. Energy and bisection bandwidth are scarce. Furthermore, in most settings, the lack of centralized components leaves all network control tasks to the nodes acting as decentralized peers. In this paper, we present a novel routing algorithm, scalable source routing (SSR), which is capable of memory and message efficient routing in large random networks. A guiding example is a community of {\\textquoteright}digital homes {\\textquoteright} where smart sensors and actuators are installed by laypersons. Such networks combine wireless ad-hoc and infrastructure networks, and lack a well-crafted network topology. Typically, the nodes do not have sufficient processing and memory resources to perform sophisticated routing algorithms. Flooding on the other hand is too bandwidthconsuming in the envisaged large-scale networks. SSR is a fully self-organizing routing protocol for such scenarios. It creates a virtual ring that links all nodes via predecessor/successor source routes. Additionally, each node possesses O(log N) short-cut source routes to nodes in exponentially increasing virtual ring distance. Like with the Chord overlay network, this ensures full connectivity within the network. Moreover, it provides a routing semantic which can efficiently support indirection schemes like i3. Memory and message efficiency are achieved by the introduction of a route cache together with a set of path manipulation rules that allow to produce near-to-optimal paths.},\n\tkeywords = {scalable source routing, sensor networks, wireless sensor network},\n\turl = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6509},\n\tauthor = {Thomas Fuhrmann}\n}\n","author_short":["Fuhrmann, T."],"key":"Fuhrmann05scalablerouting","id":"Fuhrmann05scalablerouting","bibbaseid":"fuhrmann-scalableroutingfornetworkedsensorsandactuators-2005","role":"author","urls":{"Paper":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6509"},"keyword":["scalable source routing","sensor networks","wireless sensor network"],"downloads":0},"search_terms":["scalable","routing","networked","sensors","actuators","fuhrmann"],"keywords":["scalable source routing","sensor networks","wireless sensor network"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}