Sciweavers

484 search results - page 84 / 97
» Anchor-free distributed localization in sensor networks
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Protecting Receiver-Location Privacy in Wireless Sensor Networks
—Due to the open nature of a sensor network, it is relatively easy for an adversary to eavesdrop and trace packet movement in the network in order to capture the receiver physica...
Ying Jian, Shigang Chen, Zhan Zhang, Liang Zhang
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
ICDCS
2006
IEEE
14 years 1 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
INFOCOM
2007
IEEE
14 years 2 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
GLOBECOM
2009
IEEE
13 years 5 months ago
Energy-Efficient Space-Time Coded Cooperative Routing in Multihop Wireless Networks
Due to the limited energy supplies of nodes in many applications like wireless sensor networks, energy efficiency is crucial for extending the lifetime of these networks. This pape...
Behrouz Maham, Ravi Narasimhan, Are Hjørung...