Show simple item record

dc.contributor.authorDhar, Subhankar
dc.contributor.authorRieck, Michael Q.
dc.contributor.authorPai, Sukesh
dc.contributor.authorKim, Eun Jik
dc.date.accessioned2005-05-11T13:48:42Z
dc.date.available2005-05-11T13:48:42Z
dc.date.issued2004-10
dc.identifier.citationMICROPROCESSORS AND MICROSYSTEMS, 2004. 28 (8): 427-437.en
dc.identifier.issn0141-9331
dc.identifier.urihttp://hdl.handle.net/2092/239
dc.descriptionMichael Q. Rieck is Assistant Professor of Computer Science in the Department of Math and Computer Science at Drake University.en
dc.description.abstractIn this paper, we propose several new distributed algorithms for producing sets of nodes that can be used to form backbones of an ad hoc wireless network. Our focus is on producing small sets that are d-hop connected and d-dominating and have a desirable ‘d-shortest path property’ which we call d-SPR sets. These algorithms produce sets that are considerably smaller than those produced by an algorithm previously introduced by the authors. Our proposed algorithms, except the greedy ones, have constant time complexity in the restricted sense that the time required is unaffected by the size of the network, assuming however that the node degrees are bounded by a constant. The performance of the new algorithms are compared, and also compared with the authors' earlier algorithm, and with an adaptation of an algorithm of Wu and Li.en
dc.format.extent209470 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherElsevier Scienceen
dc.subjectAd hoc wireless networksen
dc.subjectDominating seten
dc.subjectRouting algorithmen
dc.subjectSet covering problemen
dc.subjectShortest path routingen
dc.title"Distributed routing schemes for ad hoc networks using d-SPR sets"en
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record