Show simple item record

dc.contributor.authorRieck, Michael Q.
dc.contributor.authorDhar, Subhankar
dc.date.accessioned2006-09-06T19:09:51Z
dc.date.available2006-09-06T19:09:51Z
dc.date.issued2005
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ,Volume 3741 LNCS, 2005, Pages 306-317en
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/2092/409
dc.descriptionMichael 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.eduen
dc.description.abstractFor 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.extent164144 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherSpringer-Verlagen
dc.subjectAd hoc wireless networks.en
dc.subjectDominating set.en
dc.subjectRouting algorithm.en
dc.subjectSet covering problem.en
dc.subjectShortest path routing.en
dc.title"Hierarchical routing in sensor networks using κ-dominating sets "en
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record