Sciweavers

1118 search results - page 132 / 224
» The coverage problem in a wireless sensor network
Sort
View
SAINT
2008
IEEE
15 years 10 months ago
Dynamic Relay Node Placement in Wireless Sensor Networks
In this paper we present an online algorithm that attacks the problem of placing relay nodes in regions where high localized congestion is detected. Congestion refers to the netwo...
Jorge Mena, Vana Kalogeraki
141
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
Rendezvous design algorithms for wireless sensor networks with a mobile base station
Recent research shows that significant energy saving can be achieved in wireless sensor networks with a mobile base station that collects data from sensor nodes via short-range co...
Guoliang Xing, Tian Wang, Weijia Jia, Minming Li
IJSNET
2007
169views more  IJSNET 2007»
15 years 4 months ago
ART: an asymmetric and reliable transport mechanism for wireless sensor networks
: Many applications developed for wireless sensor networks (WSNs) demand for Reliable communication service, since majority of these applications are event-critical applications. T...
Nurcan Tezcan, Wenye Wang
147
Voted
WINET
2010
185views more  WINET 2010»
15 years 2 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya
GLOBECOM
2010
IEEE
15 years 2 months ago
Compact Wakeup Scheduling in Wireless Sensor Networks
In a traditional wakeup scheduling, sensor nodes start up numerous times to communicate in a period, thus consuming extra energy due to state transitions (e.g. from the sleep state...
Junchao Ma, Wei Lou