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
Journal ArticleDOI
Geometric spanners for wireless ad hoc networks
TL;DR: A new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner and whose backbone is a planar graph and the node degree is bounded from above by a positive constant.
Journal ArticleDOI
Maximal independent set, weakly-connected dominating set, and induced spanners in wireless ad hoc networks
TL;DR: This paper presents two distributed algorithms for constructing a WCDS for wireless ad hoc networks in linear time, one of which is fully localized, and does not depend on the spanning tree, which makes the maintenance of the WCDS simpler, and guarantees thetenance of the same approximation ratio.
Proceedings ArticleDOI
Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks
TL;DR: This paper presents two distributed algorithms for finding a WCDS of G, a weakly-connected dominating set of G if S is dominating and G' is connected, and the graph G' generated by the second algorithm forms a sparse spanner with a topological dilation of 3, and a geometricdilation of 6.
Patent
Technique for establishing a virtual backbone in an ad hoc wireless network
TL;DR: In this article, a leader election and tree construction phase constructs a tree of neighboring transceivers with one transceiver being designated the root and with each transceiver establishing and recording its location in the tree structure and the identifiers of its neighbors; and reporting when the tree is established.
Journal ArticleDOI
A simple heuristic for minimum connected dominating set in graphs
TL;DR: A simple heuristic for Minimum Connected Dominating Set in graphs, where α2, γ and γc are the 2-independence number, the domination number, and the connected domination number of a graph G respectively.