1029 search results - page 138 / 206 » Neural Networks and Complexity Theory |
153
click to vote
PEWASUN
2004
ACM
15 years 9 months ago
2004
ACM
An M/MMGI/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, ...
167
click to vote
JSAC
2011
14 years 7 months ago
2011
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
139
click to vote
PODC
2009
ACM
15 years 9 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
163
click to vote
WD
2010
15 years 2 months ago
2010
The use of topological features, more specifically, the importance of an element related to its structural position is a subject widely studied. For instance, complex networks theo...
128
click to vote
DIALM
2004
ACM
15 years 9 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...