"Hierarchical routing in sensor networks using κ-dominating sets "

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Rieck, Michael Q.
dc.contributor.author Dhar, Subhankar
dc.date.accessioned 2006-09-06T19:09:51Z
dc.date.available 2006-09-06T19:09:51Z
dc.date.issued 2005
dc.identifier.citation Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ,Volume 3741 LNCS, 2005, Pages 306-317 en
dc.identifier.issn 0302-9743
dc.identifier.uri http://hdl.handle.net/2092/409
dc.description Michael Q. Rieck is Associate Professor of Computer Science in the Department of Math and Computer Science at Drake University. He can be contacted at michael.rieck@drake.edu en
dc.description.abstract For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, called k-SPR sets. Such a set can serve as a virtual backbone to facilitate shortest path routing, as introduced in [4] and [14]. When employed in a hierarchical fashion, together with a hybrid (partly proactive, partly reactive) strategy, the κ-SPR set methods become highly scalable, resulting in guaranteed minimal path routing, with comparatively little overhead. © Springer-Verlag Berlin Heidelberg 2005. en
dc.format.extent 164144 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.publisher Springer-Verlag en
dc.subject Ad hoc wireless networks. en
dc.subject Dominating set. en
dc.subject Routing algorithm. en
dc.subject Set covering problem. en
dc.subject Shortest path routing. en
dc.title "Hierarchical routing in sensor networks using κ-dominating sets " en
dc.type Article en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account