Sciweavers

497 search results - page 52 / 100
» Curve-Based Greedy Routing Algorithm for Sensor Networks
Sort
View
GLOBECOM
2007
IEEE
15 years 8 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong
137
Voted
MOBIHOC
2008
ACM
16 years 1 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
118
Voted
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
16 years 2 months ago
A secure hierarchical model for sensor network
In a distributed sensor network, large number of sensors deployed which communicate among themselves to selforganize a wireless ad hoc network. We propose an energyefficient level...
Malik Ayed Tubaishat, Jian Yin, Biswajit Panja, Sa...
141
Voted
EWSN
2006
Springer
16 years 1 months ago
Generic Routing Metric and Policies for WSNs
Energy-aware algorithms have proven to be a crucial part of sensor network applications, especially if they are required to operate for extended periods of time. Among these, effic...
Olga Saukh, Pedro José Marrón, Andre...
SAC
2005
ACM
15 years 7 months ago
Efficient placement and routing in grid-based networks
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
Roozbeh Jafari, Foad Dabiri, Bo-Kyung Choi, Majid ...