250 search results - page 9 / 50 » Distributed Algorithms for Coloring and Domination in Wirele... |
MOBIHOC
2005
ACM
14 years 8 months ago
2005
ACM
: 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 ...
HIPC
2000
Springer
14 years 5 days ago
2000
Springer
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...
CISS
2008
IEEE
14 years 3 months ago
2008
IEEE
— This paper presents an algorithm for distributed power control and scheduling over wireless ad hoc-networks, where the data rate on each link depends on the transmission power ...
CSE
2008
IEEE
13 years 10 months ago
2008
IEEE
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
INFOCOM
2000
IEEE
14 years 29 days ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...