Sciweavers

5068 search results - page 188 / 1014
» Basic Computations in Wireless Networks
Sort
View
ISCC
2005
IEEE
143views Communications» more  ISCC 2005»
16 years 2 days ago
Approximating Optimal Multicast Trees in Wireless Multihop Networks
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
AINA
2005
IEEE
16 years 3 days ago
Optimal Energy-Efficient Routing for Wireless Sensor Networks
The network lifetime for wireless sensor network plays an important role to survivability. Thus, we indicate the importance of routing protocol to network lifetime, and model the ...
Chih-Wei Shiou, Frank Yeong-Sung Lin, Hsu-Chen Che...
WSNA
2003
ACM
15 years 11 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
INFOCOM
2005
IEEE
16 years 2 days ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...
TC
2011
15 years 1 months ago
Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
Xiang-Yang Li, Yajun Wang, Yu Wang