Sciweavers

213 search results - page 17 / 43
» Bounding the Information Collection Performance of Wireless ...
Sort
View
SPAA
2003
ACM
14 years 2 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
DSN
2004
IEEE
14 years 16 days ago
Intrusion Tolerance and Anti-Traffic Analysis Strategies For Wireless Sensor Networks
Wireless sensor networks face acute security concerns in applications such as battlefield monitoring. A central point of failure in a sensor network is the base station, which act...
Jing Deng, Richard Han, Shivakant Mishra
SECON
2007
IEEE
14 years 3 months ago
Approximation Algorithm for Base Station Placement in Wireless Sensor Networks
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
Yi Shi, Yiwei Thomas Hou
SENSYS
2003
ACM
14 years 2 months ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
GLOBECOM
2008
IEEE
14 years 3 months ago
Routing with Probabilistic Delay Guarantees in Wireless Ad-Hoc Networks
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
Matthew Brand, Petar Maymounkov, Andreas F. Molisc...