Sciweavers

586 search results - page 4 / 118
» A Distributed Graph Algorithm for Geometric Routing in Ad Ho...
Sort
View
CORR
2010
Springer
183views Education» more  CORR 2010»
13 years 8 months ago
Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...
Alok Ojha, Hongmei Deng, Dharma P. Agrawal, Sugata...
ICPP
2000
IEEE
14 years 29 days ago
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
Jie Wu, Hailan Li
MOBIHOC
2002
ACM
14 years 8 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
BROADNETS
2004
IEEE
14 years 9 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...
OPODIS
2008
13 years 10 months ago
Fast Geometric Routing with Concurrent Face Traversal
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
Thomas Clouser, Mark Miyashita, Mikhail Nesterenko