Search Sciweavers | Sciweavers

334 search results - page 7 / 67

» Analysis of Clustering and Routing Overhead for Clustered Mo...

click to vote

MOBIHOC
2002
ACM

214views Computer Networks» more MOBIHOC 2002»

Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks

14 years 7 months ago

Download www.cs.mun.ca

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

claim paper

Read More »

click to vote

CLUSTER
2002
IEEE

222views Distributed And Parallel Com...» more CLUSTER 2002»

WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

13 years 7 months ago

Download www.cs.ucf.edu

In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...

Mainak Chatterjee, Sajal K. Das, Damla Turgut

claim paper

Read More »

click to vote

INFOCOM
2007
IEEE

102views Communications» more INFOCOM 2007»

Capacity Deficit in Mobile Wireless Ad Hoc Networks Due to Geographic Routing Overheads

14 years 2 months ago

Download www.ecse.rpi.edu

Nabhendra Bisnik, Alhussein A. Abouzeid

claim paper

Read More »