Sciweavers

1729 search results - page 335 / 346
» Bound Graph Polysemy
Sort
View
ICCCN
2008
IEEE
14 years 1 months ago
TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs
—The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK — a no...
Avinash Srinivasan, Jie Wu
INFOCOM
2008
IEEE
14 years 1 months ago
Minimum Cost Topology Construction for Rural Wireless Mesh Networks
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
Debmalya Panigrahi, Partha Dutta, Sharad Jaiswal, ...
INFOCOM
2008
IEEE
14 years 1 months ago
Randomized 3D Geographic Routing
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
Roland Flury, Roger Wattenhofer
INFOCOM
2007
IEEE
14 years 1 months ago
Lava: A Reality Check of Network Coding in Peer-to-Peer Live Streaming
—In recent literature, network coding has emerged as a promising information theoretic approach to improve the performance of both peer-to-peer and wireless networks. It has been...
Mea Wang, Baochun Li
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro