2691 search results - page 240 / 539 » Securing Ad Hoc Networks |
196
click to vote
CLUSTER
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
227
click to vote
DIALM
2003
ACM
15 years 12 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
186
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— In this paper we use an information-theoretic formulation for characterizing the minimum routing overhead of link state routing in a mobile ad hoc network. We formulate...
214
click to vote
GLOBECOM
2007
IEEE
16 years 29 days ago
2007
IEEE
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...
188
click to vote
VALUETOOLS
2006
ACM
16 years 17 days ago
2006
ACM
— Considered is a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing protocol. Packets at relay no...