Sciweavers

250 search results - page 8 / 50
» Distributed Algorithms for Coloring and Domination in Wirele...
Sort
View
BROADNETS
2004
IEEE
14 years 10 days ago
A Distributed Mobile Backbone Formation Algorithm for Wireless Ad Hoc Networks
In this paper, we present a novel fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backbone...
Laura Huei-jiun Ju, Izhak Rubin, Kevin Ni, Christo...
IPPS
2003
IEEE
14 years 1 months ago
A Generic Broadcast Protocol in Ad Hoc Networks Based on Self-Pruning
In ad hoc wireless networks, a successful broadcasting requires that the nodes forwarding the broadcast packet form a connected dominating set to ensure the coverage. An efficien...
Jie Wu, Fei Dai
COLOGNETWENTE
2007
13 years 10 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg
IPPS
2005
IEEE
14 years 2 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
JNW
2007
104views more  JNW 2007»
13 years 8 months ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
Rashid Bin Muhammad