Sciweavers

295 search results - page 21 / 59
» An approximation algorithm for the wireless gathering proble...
Sort
View
MOBIHOC
2002
ACM
15 years 9 months ago
Constructing minimum-energy broadcast trees in wireless ad hoc networks
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...
Weifa Liang
ICC
2008
IEEE
126views Communications» more  ICC 2008»
15 years 4 months ago
Joint Stream Control and Scheduling in Multihop Wireless Networks with MIMO Links
—MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes and suppressing wireless interference. In this pa...
Brendan Mumey, Jian Tang, Timothy Hahn
ESA
2003
Springer
98views Algorithms» more  ESA 2003»
15 years 2 months ago
Network Lifetime and Power Assignment in ad hoc Wireless Networks
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsk...
MST
2010
187views more  MST 2010»
14 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
73
Voted
MOBIHOC
2008
ACM
15 years 9 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao