Show simple item record

dc.contributor.authorRieck, Michael Q.
dc.contributor.authorPai, Sukesh
dc.contributor.authorDhar, Subhankar
dc.date.accessioned2005-05-23T19:29:27Z
dc.date.available2005-05-23T19:29:27Z
dc.date.issued2005-04-22
dc.identifier.citationCOMPUTER NETWORKS, 2005. 47 (6): 785-799en
dc.identifier.issn1389-1289
dc.identifier.urihttp://hdl.handle.net/2092/261
dc.descriptionMichael Q. Rieck is Assistant Professor of Computer Science in the Department of Math and Computer Science at Drake University.en
dc.description.abstractThis paper describes a distributed algorithm (generalized d-CDS) for producing a variety of d-dominating sets of nodes that can be used to form the backbone of an ad hoc wireless network. In special cases (ordinary d-CDS), these sets are also d-hop connected and has a desirable “shortest path property”. Routing via the backbone created is also discussed. The algorithm has a “constant time” complexity in the limited sense that it is unaffected by expanding the size of the network as long as the maximal node degree is not allowed to increase too. The performances of this algorithm for various parameters are compared, and also compared with other algorithms.en
dc.format.extent213941 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherElsevier Science, Inc.en
dc.subjectAd hoc wireless networksen
dc.subjectD-dominating seten
dc.subjectD-closureen
dc.subjectRouting algorithmen
dc.title"Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets"en
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record