Sciweavers

478 search results - page 93 / 96
» Establishing pairwise keys in distributed sensor networks
Sort
View
JSAC
2008
140views more  JSAC 2008»
13 years 6 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
FOCS
2008
IEEE
14 years 24 days ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly
CCS
2008
ACM
13 years 8 months ago
Location privacy of distance bounding protocols
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
Kasper Bonne Rasmussen, Srdjan Capkun
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 6 months ago
Understanding the Characteristics of Internet Short Video Sharing: YouTube as a Case Study
—Established in 2005, YouTube has become the most successful Internet site providing a new generation of short video sharing service. Today, YouTube alone comprises approximately...
Xu Cheng, Cameron Dale, Jiangchuan Liu
CLADE
2003
IEEE
13 years 11 months ago
vGrid: A Framework For Building Autonomic Applications
With rapid technological advances in network infrastructure, programming languages, compatible component interfaces and so many more areas, today the computational Grid has evolve...
Bithika Khargharia, Salim Hariri, Manish Parashar,...