Sciweavers

9 search results - page 1 / 2
» Lightweight Coloring and Desynchronization for Networks
Sort
View
INFOCOM
2009
IEEE
13 years 11 months ago
Lightweight Coloring and Desynchronization for Networks
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leon...
SASO
2008
IEEE
13 years 11 months ago
Towards Desynchronization of Multi-hop Topologies
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
Julius Degesys, Radhika Nagpal
ICIP
2008
IEEE
14 years 6 months ago
A lightweight multiview tracked person descriptor for camera sensor networks
We present a simple multiple view 3D model for object tracking and identification in camera networks. Our model is composed of 8 distinct views in the interval 0, 7 4 . Each of th...
Michael J. Quinn, Thomas Kuo, B. S. Manjunath
PERCOM
2009
ACM
13 years 11 months ago
Randomizing RFID Private Authentication
—Privacy protection is increasingly important during authentications in Radio Frequency Identification (RFID) systems. In order to achieve high-speed authentication in largescale...
Qingsong Yao, Yong Qi, Jinsong Han, Jizhong Zhao, ...
RTAS
2011
IEEE
12 years 8 months ago
ARCH: Practical Channel Hopping for Reliable Home-Area Sensor Networks
Abstract—Home area networks (HANs) promise to enable sophisticated home automation applications such as smart energy usage and assisted living. However, recent empirical study of...
Mo Sha, Gregory Hackmann, Chenyang Lu