Sciweavers

34 search results - page 5 / 7
» On Locality of Dominating Set in Ad Hoc Networks with Switch...
Sort
View
DC
2010
13 years 6 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
MOBIHOC
2005
ACM
14 years 6 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath
HIPC
2000
Springer
13 years 10 months ago
A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...
Mainak Chatterjee, Sajal K. Das, Damla Turgut
IPPS
2003
IEEE
13 years 12 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
ISCC
2005
IEEE
114views Communications» more  ISCC 2005»
14 years 5 days ago
Localized Broadcast Incremental Power Protocol for Wireless Ad Hoc Networks
— As broadcasting is widely used for miscellaneous maintenance operations in wireless ad hoc networks, where energy is a scarce resource, an efficient broadcasting protocol is o...
François Ingelrest, David Simplot-Ryl