Sciweavers

306 search results - page 48 / 62
» Routing Algorithms for Anycast Messages
Sort
View
ICDE
2011
IEEE
244views Database» more  ICDE 2011»
14 years 3 months ago
Algorithms for local sensor synchronization
— In a wireless sensor network (WSN), each sensor monitors environmental parameters, and reports its readings to a base station, possibly through other nodes. A sensor works in c...
Lixing Wang, Yin Yang, Xin Miao, Dimitris Papadias...
WPES
2006
ACM
15 years 5 months ago
Measuring relationship anonymity in mix networks
Many applications of mix networks such as anonymous Web browsing require relationship anonymity: it should be hard for the attacker to determine who is communicating with whom. Co...
Vitaly Shmatikov, Ming-Hsiu Wang
MOBIHOC
2002
ACM
15 years 11 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
SIGCOMM
2003
ACM
15 years 5 months ago
Towards an accurate AS-level traceroute tool
Traceroute is widely used to detect routing problems, characterize end-to-end paths, and discover the Internet topology. Providing an accurate list of the Autonomous Systems (ASes...
Zhuoqing Morley Mao, Jennifer Rexford, Jia Wang, R...
ADHOCNOW
2008
Springer
15 years 6 months ago
Request Satisfaction Problem in Synchronous Radio Networks
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
Benoît Darties, Sylvain Durand, Jér&o...