Sciweavers

1036 search results - page 204 / 208
» The Distributed Wireless Gathering Problem
Sort
View
97
Voted
CCS
2007
ACM
15 years 3 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
MOBIDE
1999
ACM
15 years 1 months ago
Pervasive Computing: What is it Good for?
The first mass-produced pervasive computing devices are starting to appear—the AutoPC, the Internet-connected ScreenFridge, and the combination Microwave Oven/Home Banking term...
Andrew C. Huang, Benjamin C. Ling, Shankar Ponneka...
INFOCOM
2010
IEEE
14 years 8 months ago
Distance Estimation by Constructing The Virtual Ruler in Anisotropic Sensor Networks
Abstract—Distance estimation is fundamental for many functionalities of wireless sensor networks and has been studied intensively in recent years. A critical challenge in distanc...
Yun Wang, Kai Li, Jie Wu
MOBISYS
2008
ACM
15 years 9 months ago
Detecting energy-greedy anomalies and mobile malware variants
Mobile users of computation and communication services have been rapidly adopting battery-powered mobile handhelds, such as PocketPCs and SmartPhones, for their work. However, the...
Hahnsang Kim, Joshua Smith, Kang G. Shin
INFOCOM
2007
IEEE
15 years 3 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...