Sciweavers

WASA
2009
Springer
231views Algorithms» more  WASA 2009»
14 years 5 months ago
A Consistency-Based Secure Localization Scheme against Wormhole Attacks in WSNs
Wormhole attacks can negatively affect the localization in wireless sensor networks. A typical wormhole attack can be launched by two colluding external attackers, one of which sni...
Honglong Chen, Wei Lou, Zhi Wang
WASA
2009
Springer
92views Algorithms» more  WASA 2009»
14 years 5 months ago
Location Discovery in SpeckNets Using Relative Direction Information
A   speck   is   intended   to   be   a   miniature   (5X5X5mm)   semiconductor   device   that  combines sensing, processing, wireless communication and energyÂ...
Ryan McNally, Damal Kandadai Arvind
WASA
2009
Springer
80views Algorithms» more  WASA 2009»
14 years 5 months ago
Dynamic Scheduling of Pigeons for Delay Constrained Applications
Information collection in the disaster area is an important application of pigeon networks - a special type of delay tolerant networks (DTN). The aim of this paper is to explore hi...
Jiazhen Zhou, Jiang Li, Legand L. Burge III
WASA
2009
Springer
126views Algorithms» more  WASA 2009»
14 years 5 months ago
Data Collection with Multiple Sinks in Wireless Sensor Networks
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Ki...
WASA
2009
Springer
93views Algorithms» more  WASA 2009»
14 years 5 months ago
Experimental Study on Mobile RFID Performance
Abstract. An increasing number of applications use RFID in their design, but there is a lack of understanding of how mobility affects RFID performance in these applications. Unlik...
Zhong Ren, Chiu Chiang Tan, Dong Wang, Qun Li
WADS
2009
Springer
237views Algorithms» more  WADS 2009»
14 years 5 months ago
A Pseudopolynomial Algorithm for Alexandrov's Theorem
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedro...
Daniel M. Kane, Gregory N. Price, Erik D. Demaine
WADS
2009
Springer
255views Algorithms» more  WADS 2009»
14 years 5 months ago
Plane Graphs with Parity Constraints
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
WADS
2009
Springer
265views Algorithms» more  WADS 2009»
14 years 5 months ago
A Distribution-Sensitive Dictionary with Low Space Overhead
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
Prosenjit Bose, John Howat, Pat Morin
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
14 years 5 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...