The paper by I. Stojmenovic et al. (2002) generated a lot of interest among researchers in ad hoc networks. A number of researchers questioned, through their articles, or directly to the first author, the correctness of the described procedure, and the correctness of the claim that the procedure does not need any communication exchange between nodes, in addition to "hello" messages needed to learn information about neighboring nodes. This correspondence completes the article by providing the actual dominating set definitions used in the procedure (from which zero communication overhead follows easily), the correct procedure (the published one has few misprints at key places), and the proof that the new definitions and procedure indeed define connected dominating sets.
Published in:
Parallel and Distributed Systems, IEEE Transactions on
(Volume:15
,
Issue:
11
)
Date of Publication: Nov. 2004