K
Khaled M. Alzoubi
Researcher at Saint Xavier University
Publications - 19
Citations - 2944
Khaled M. Alzoubi is an academic researcher from Saint Xavier University. The author has contributed to research in topics: Wireless ad hoc network & Connected dominating set. The author has an hindex of 11, co-authored 19 publications receiving 2909 citations. Previous affiliations of Khaled M. Alzoubi include Illinois Institute of Technology.
Papers
More filters
Proceedings ArticleDOI
Distributed construction of connected dominating set in wireless ad hoc networks
TL;DR: This work presents their own distributed algorithm that outperforms the existing algorithms for minimum CDS and establishes the /spl Omega/(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, which is thus message-optimal.
Journal ArticleDOI
Distributed construction of connected dominating set in wireless ad hoc networks
TL;DR: This paper presents their own distributed algorithm that outperforms the existing algorithms for minimum CDS and establishes the Ω(nlog n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, thus message-optimal.
Proceedings ArticleDOI
Message-optimal connected dominating sets in mobile ad hoc networks
TL;DR: This paper proposes the first distributed approximation algorithm to construct a MCDS for the unit-disk-graph with a emph constant approximation ratio, and emph linear time and emphlinear message complexity.
Proceedings ArticleDOI
New distributed algorithm for connected dominating set in wireless ad hoc networks
TL;DR: This work presents their own distributed algorithm that outperforms the existing algorithms for minimum CDS and establishes the /spl Omega/(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDs, which is thus message-optimal.
Journal ArticleDOI
Distributed heuristics for connected dominating sets in wireless ad hoc networks
TL;DR: Two destributed heuristics with constant performance ratios are proposed, which require only single-hop neighborhood knowledge, and a message length of O (1) and O(n log n), respectively.