Full metadata record
DC FieldValueLanguage
dc.contributor.authorSun, MTen_US
dc.contributor.authorMa, XLen_US
dc.contributor.authorYi, CWen_US
dc.contributor.authorYang, CKen_US
dc.contributor.authorLai, THen_US
dc.date.accessioned2014-12-08T15:37:08Z-
dc.date.available2014-12-08T15:37:08Z-
dc.date.issued2005en_US
dc.identifier.isbn3-540-28102-9en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/11536/25512-
dc.description.abstractThe minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute the minimum disc cover set proposed in previous study has been considered too expensive. In this paper, we show that the disc cover set problem is in fact a special case of the general a-hull problem. In addition, we prove that the disc cover set problem is not any easier than the a-hull problem by linearly reducing the element uniqueness problem to the disc cover set problem. In addition to the known a-hull approach, we provide an optimal divide-and-conquer algorithm that constructs the minimum disc cover set for arbitrary cases, including the degenerate ones where the traditional alpha-hull algorithm incapable of handling.en_US
dc.language.isoen_USen_US
dc.titleMinimum disc cover set construction in mobile ad hoc networksen_US
dc.typeArticle; Proceedings Paperen_US
dc.identifier.journalNETWORKING AND MOBILE COMPUTING, PROCEEDINGSen_US
dc.citation.volume3619en_US
dc.citation.spage712en_US
dc.citation.epage721en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000231116600073-
Appears in Collections:Conferences Paper