MOBIHOC
2001
ACM
15 years 13 days ago
2001
ACM
So far, research on mobile ad hoc networks has been focused primarily on routing issues. Security, on the other hand, has been given a lower priority. This paper provides an overv...
MOBIHOC
2001
ACM
15 years 13 days ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
MOBIHOC
2001
ACM
15 years 13 days ago
2001
ACM
Previously proposed sensor network data dissemination schemes require periodic low-rate flooding of data in order to allow recovery from failure. We consider constructing two kind...
MOBIHOC
2001
ACM
15 years 13 days ago
2001
ACM
Spatial reuse TDMA is a fixed assignment access scheme for multi-hop radio networks. The idea is to increase network capacity by letting several radio terminals use the same time ...
MOBIHOC
2001
ACM
15 years 13 days ago
2001
ACM
We examine the performance of the TCP protocol for bulkdata transfers in mobile ad hoc networks (MANETs). We vary the number of TCP connections and compare the performances of thr...
MOBIHOC
2001
ACM
15 years 13 days ago
2001
ACM
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
MOBIHOC
2001
ACM
15 years 13 days ago
2001
ACM
MOBIHOC
2001
ACM
15 years 13 days ago
2001
ACM
MOBIHOC
2001
ACM
15 years 13 days ago
2001
ACM
MOBIHOC
2001
ACM
15 years 13 days ago
2001
ACM
A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. The constraints and properties of Bluetooth scatternets present special challenges in formin...