Sciweavers

279 search results - page 46 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
TCOM
2008
120views more  TCOM 2008»
13 years 7 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief
SENSYS
2003
ACM
14 years 26 days ago
Anchor-free distributed localization in sensor networks
Many sensor network applications require that each node’s sensor stream be annotated with its physical location in some common coordinate system. Manual measurement and configu...
Nissanka B. Priyantha, Hari Balakrishnan, Erik D. ...
MOBIHOC
2008
ACM
14 years 7 months ago
Localized distance-sensitive service discovery in wireless sensor networks
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
Xu Li, Nicola Santoro, Ivan Stojmenovic
SP
2005
IEEE
156views Security Privacy» more  SP 2005»
14 years 1 months ago
Distributed Detection of Node Replication Attacks in Sensor Networks
The low-cost, off-the-shelf hardware components in unshielded sensor-network nodes leave them vulnerable to compromise. With little effort, an adversary may capture nodes, analyze...
Bryan Parno, Adrian Perrig, Virgil D. Gligor
SENSYS
2006
ACM
14 years 1 months ago
RBP: robust broadcast propagation in wireless networks
Varying interference levels make broadcasting an unreliable operation in low-power wireless networks. Many routing and resource discovery protocols depend on flooding (repeated pe...
Fred Stann, John S. Heidemann, Rajesh Shroff, Muha...