• Publications
  • Influence
Distributed construction of connected dominating set in wireless ad hoc networks
TLDR
We present our own distributed algorithm that always outputs a nontrivial CDS. Expand
  • 881
  • 83
  • PDF
New distributed algorithm for connected dominating set in wireless ad hoc networks
TLDR
We establish a (n logn) lower bound on message complexity of any distributed algorithm for nontrivial CDS and present an algorithm that outperforms the existing algorithms. Expand
  • 338
  • 41
  • PDF
Message-optimal connected dominating sets in mobile ad hoc networks
TLDR
A connected dominating set (CDS) for a graph G(V,E) is a subset V1 of V, such that each node in V--V1 is adjacent to some nodes in V1, and V1 induces a connected subgraph. Expand
  • 415
  • 32
  • PDF
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
TLDR
Data aggregation is a fundamental yet time-consuming task in wireless sensor networks. Expand
  • 212
  • 29
  • PDF
Minimum-latency aggregation scheduling in multihop wireless networks
TLDR
Minimum-latency aggregation schedule (MLAS) in synchronous multihop wireless networks seeks a shortest schedule for data aggregation subject to the interference constraint. Expand
  • 249
  • 28
  • PDF
Minimum-energy broadcast routing in static ad hoc wireless networks
TLDR
We prove that minimum-energy broadcast routing can be solved in polynomial time, despite the NP-hardness of its general graph version. Expand
  • 441
  • 23
  • PDF
Distributed construction of a planar spanner and routing for ad hoc wireless networks
TLDR
We present a novel localized networking protocol that constructs a planar 2.5-spanner of UDG, called the localized Delaunay triangulation, as network topology. Expand
  • 308
  • 23
  • PDF
Distributed heuristics for connected dominating sets in wireless ad hoc networks
TLDR
A connected dominating set (CDS) for a graph G(V, E) is a subset V' of V, such that each node in V is adjacent to some node in E, and V' induces a connected subgraph. Expand
  • 258
  • 22
  • PDF
Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks
TLDR
We present a novel localized networking protocol that constructs a planar 2 5-spanner of UDG, called the localized Delaunay triangulation (LDEL), as network topology. Expand
  • 236
  • 18
  • PDF
Power efficient and sparse spanner for wireless ad hoc networks
  • X. Li, P. Wan, Yu Wang
  • Computer Science
  • Proceedings Tenth International Conference on…
  • 15 October 2001
TLDR
We first consider several well-known proximity graphs including the relative neighborhood graph, Gabriel graph, Yao graph and Yao graph. Expand
  • 190
  • 18
  • PDF