Sciweavers

5911 search results - page 1124 / 1183
» Annealing Sensor Networks
Sort
View
JSAC
2008
140views more  JSAC 2008»
14 years 9 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
JPDC
2007
112views more  JPDC 2007»
14 years 9 months ago
CHEMAS: Identify suspect nodes in selective forwarding attacks
Selective forwarding attacks may corrupt some mission-critical applications such as military surveillance and forest fire monitoring in wireless sensor networks. In such attacks,...
Bin Xiao, Bo Yu, Chuanshan Gao
VLDB
2002
ACM
137views Database» more  VLDB 2002»
14 years 9 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
CASCON
2010
174views Education» more  CASCON 2010»
14 years 7 months ago
Smart Services Across the Real and Virtual Worlds
Today, we are witnessing a new level of scale, complexity, and pervasiveness of software systems that are designed to support much more holistically complex processes. Much richer...
Eleni Stroulia
EMSOFT
2010
Springer
14 years 7 months ago
TeleScribe: a scalable, resumable wireless reprogramming approach
TeleScribe is a software mechanism for efficiently reprogramming embedded systems such as wireless sensor nodes over a shared communication link. One distinguishing feature is its...
Min-Hua Chen, Pai H. Chou
« Prev « First page 1124 / 1183 Last » Next »