Sciweavers

1070 search results - page 113 / 214
» On maximum lifetime routing in Wireless Sensor Networks
Sort
View
IPCCC
2007
IEEE
16 years 21 days ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
ADHOC
2008
111views more  ADHOC 2008»
15 years 6 months ago
MERLIN: Cross-layer integration of MAC and routing for low duty-cycle sensor networks
Sensor network MAC protocols typically sacrifice packet latency to achieve energy efficiency. Such delays may well increase due to routing protocol operation. For this reason it i...
Antonio G. Ruzzelli, Gregory M. P. O'Hare, Raja Ju...
ENTCS
2007
95views more  ENTCS 2007»
15 years 6 months ago
Rijndael for Sensor Networks: Is Speed the Main Issue?
We present an implementation of Rijndael for wireless sensor networks running on Eyes sensor nodes. In previous works, Rijndael has not been considered a suitable encryption algor...
Andrea Vitaletti, Gianni Palombizio
ADHOC
2005
100views more  ADHOC 2005»
15 years 6 months ago
Robust position-based routing for wireless ad hoc networks
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile ho...
Kousha Moaveninejad, Wen-Zhan Song, Xiang-Yang Li
HICSS
2003
IEEE
103views Biometrics» more  HICSS 2003»
15 years 11 months ago
Wireless Sensor Placement For Reliable and Efficient Data Collection
Sensors can be paired with radio units and deployed to form a wireless ad-hoc sensor network. Actual deployments must consider the coverage that can be achieved with a given numbe...
Edoardo S. Biagioni, Galen H. Sasaki