Sciweavers

75 search results - page 15 / 15
» Stable routing under the Spanning Tree Protocol
Sort
View
TMC
2008
125views more  TMC 2008»
13 years 5 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai
SASN
2003
ACM
13 years 10 months ago
SECTOR: secure tracking of node encounters in multi-hop wireless networks
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
Srdjan Capkun, Levente Buttyán, Jean-Pierre...
MIDDLEWARE
2007
Springer
13 years 11 months ago
AVMEM - Availability-Aware Overlays for Management Operations in Non-cooperative Distributed Systems
Monitoring and management operations that query nodes based on their availability can be extremely useful in a variety of largescale distributed systems containing hundreds to thou...
Ramsés Morales, Brian Cho, Indranil Gupta
CLUSTER
2002
IEEE
13 years 5 months ago
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
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
SENSYS
2009
ACM
14 years 22 hour ago
Darjeeling, a feature-rich VM for the resource poor
The programming and retasking of sensor nodes could benefit greatly from the use of a virtual machine (VM) since byte code is compact, can be loaded on demand, and interpreted on...
Niels Brouwers, Koen Langendoen, Peter Corke