2362 search results - page 188 / 473 » The wireless network jamming problem |
182
click to vote
WINET
2010
15 years 4 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
161
click to vote
DSN
2008
IEEE
16 years 25 days ago
2008
IEEE
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
189
click to vote
SENSYS
2003
ACM
15 years 11 months ago
2003
ACM
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...
214
click to vote
IJSNET
2007
15 years 6 months ago
2007
: Many applications developed for wireless sensor networks (WSNs) demand for Reliable communication service, since majority of these applications are event-critical applications. T...
138
click to vote
INFOCOM
2007
IEEE
16 years 20 days ago
2007
IEEE
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...