Sciweavers

73 search results - page 12 / 15
» Coverage Efficient Clustering Method Based on Time Delay for...
Sort
View
PIMRC
2010
IEEE
13 years 3 months ago
On the feasibility of receive collaboration in wireless sensor networks
In this paper, a new type of collaboration in wireless sensor networks (WSN) is suggested that exploits array processing algorithms for better reception of a signal. For receive co...
Behnam Banitalebi, S. Sigg, M. Beigl
VTC
2006
IEEE
13 years 11 months ago
Proposition of a full deterministic medium access method for wireless network in a robotic application
—Today, many network applications require shorter react time. Robotic field is an excellent example of these needs: robot react time has a direct effect on its task’s complexit...
Adrien van den Bossche, Thierry Val, Eric Campo
JSAC
2008
140views more  JSAC 2008»
13 years 5 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
JCP
2008
142views more  JCP 2008»
13 years 5 months ago
QoS Aware Query Processing Algorithm for Wireless Sensor Networks
In sensor networks, continuous query is commonly used for collecting periodical data from the objects under monitoring. This sort of queries needs to be carefully designed, in orde...
Jun-Zhao Sun
TMC
2012
11 years 8 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...