Sciweavers

460 search results - page 80 / 92
» Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
Sort
View
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 1 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
SASN
2003
ACM
14 years 1 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...
AISADM
2005
Springer
14 years 1 months ago
Multi-agent Approach for Community Clustering Based on Individual Ontology Annotations
The paper presents peer-to-peer multi-agent framework for community clustering based on contact propagation in the global network of contacts with individual ontology-based descrip...
Dmitri Soshnikov
ALGOSENSORS
2009
Springer
14 years 2 months ago
Link Reversal: How to Play Better to Work Less
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
Bernadette Charron-Bost, Jennifer L. Welch, Josef ...
TSMC
2010
13 years 2 months ago
Bio-inspired Algorithms for Autonomous Deployment and Localization of Sensor Nodes
Abstract--Optimal deployment and accurate localization of sensor nodes have a strong influence on the performance of a wireless sensor network (WSN). This paper considers real-time...
Raghavendra V. Kulkarni, Ganesh K. Venayagamoorthy