133 search results - page 17 / 27 » Fault-Tolerant Power Assignment and Backbone in Wireless Net... |
TMC
2010
13 years 5 months ago
2010
—We consider a point-to-multipoint cognitive radio network that shares a set of channels with a primary network. Within the cognitive radio network, a base station controls and s...
TMC
2012
11 years 9 months ago
2012
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
FSTTCS
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
INFOCOM
2006
IEEE
14 years 1 months 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...