Sciweavers

460 search results - page 42 / 92
» Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
Sort
View
ESAS
2005
Springer
14 years 1 months ago
Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks
Abstract. In this paper, we propose a framework for the security analysis of on-demand, distance vector routing protocols for ad hoc networks, such as AODV, SAODV, and ARAN. The pr...
Gergely Ács, Levente Buttyán, Istv&a...
IPPS
2006
IEEE
14 years 1 months ago
Similarity-aware query processing in sensor networks
We assume a sensor network with data-centric storage, where sensor data is stored within the sensor network and ad hoc queries are disseminated and processed inside the network. I...
Ping Xia, Panos K. Chrysanthis, Alexandros Labrini...
PERVASIVE
2004
Springer
14 years 1 months ago
A Distributed Precision Based Localization Algorithm for Ad-Hoc Networks
In this paper we introduce a new distributed algorithm for location discovery. It can be used in wireless ad-hoc sensor networks that are equipped with means of measuring the dista...
Leon Evers, Stefan Dulman, Paul J. M. Havinga
MOBICOM
2009
ACM
14 years 2 months ago
Mobility increases the connectivity of K-hop clustered wireless networks
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
Qingsi Wang, Xinbing Wang, Xiaojun Lin
INFOCOM
2000
IEEE
14 years 7 days ago
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
— 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...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong