914 search results - page 145 / 183 » Branch and Bound on the Network Model |
150
click to vote
INFOCOM
2006
IEEE
16 years 9 days ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
183
click to vote
SIGMETRICS
2006
ACM
16 years 7 days ago
2006
ACM
Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide e...
166
click to vote
TON
2008
15 years 6 months ago
2008
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
226
click to vote
MOBIHOC
2005
ACM
16 years 5 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...
189
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...