4131 search results - page 773 / 827 » Compactness in Topology and Computation |
172
click to vote
MOBIHOC
2005
ACM
16 years 1 months ago
2005
ACM
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
127
click to vote
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
149
click to vote
MOBIHOC
2003
ACM
16 years 1 months ago
2003
ACM
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
151
click to vote
MOBIHOC
2003
ACM
16 years 1 months ago
2003
ACM
A central challenge in ad hoc networks is the design of routing protocols that can adapt their behavior to frequent and rapid changes in the network. The performance of proactive ...
100
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...