Sciweavers

545 search results - page 51 / 109
» Minimum energy accumulative routing in wireless networks
Sort
View
ISCAS
2003
IEEE
112views Hardware» more  ISCAS 2003»
14 years 2 months ago
Energy-balancing strategies for wireless sensor networks
The lifetime of wireless sensor network is crucial, since autonomous operation must be guaranteed over an extended period. As all the sensor data has to be forwarded to an observe...
Martin Haenggi
MOBIQUITOUS
2007
IEEE
14 years 3 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
MOBIHOC
2002
ACM
14 years 8 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
NCA
2007
IEEE
14 years 3 months ago
On the Evaluation of Shortest Journeys in Dynamic Networks
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...
Afonso Ferreira, Alfredo Goldman, Julian Monteiro
TMC
2008
114views more  TMC 2008»
13 years 8 months ago
Toward Reliable and Efficient Reporting in Wireless Sensor Networks
Energy efficiency is one of the major concerns in wireless sensor networks, since it impacts the network lifetime. In this paper, we investigate the relationship between sensor net...
Fatma Bouabdallah, Nizar Bouabdallah, Raouf Boutab...