Sciweavers

914 search results - page 99 / 183
» Branch and Bound on the Network Model
Sort
View
INFOCOM
2007
IEEE
15 years 4 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad-hoc Networks
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
Atef Abdrabou, Weihua Zhuang
CP
2006
Springer
15 years 1 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter
ADHOC
2008
78views more  ADHOC 2008»
14 years 10 months ago
Asymptotic uniform data-rate guarantees in large wireless networks
In this paper, we study asymptotic uniform data-rate guarantees in large wireless networks from an information-theoretic viewpoint. We consider the following question: what is the...
Xin Liu, R. Srikant
INFOCOM
1997
IEEE
15 years 2 months ago
Time Scale Analysis of an ATM Queueing System with Long-Range Dependent Traffic
Several types of network trafic have been shown to exhibit long-range dependence (LRD). In this work, we show that the busy period of an ATM system driven by a long-range dependen...
Gilberto Mayor, John A. Silvester
GLOBECOM
2007
IEEE
15 years 4 months ago
A TDMA-based Scheduling and Routing Algorithm for Data-Centric Wireless Sensor Networks
—Recharging the batteries of a moribund sensor deployed as part of a wireless sensor network is often infeasible due to logistical considerations. With the purpose of prolonging ...
Yean-Fu Wen, Frank Yeong-Sung Lin, Hung-Shi Wang