Sciweavers

625 search results - page 34 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
IJON
2006
67views more  IJON 2006»
14 years 11 months ago
Robust persistent activity in neural fields with asymmetric connectivity
Modeling studies have shown that recurrent interactions within neural networks are capable of self-sustaining non-uniform activity profiles. These patterns are thought to be the n...
Cláudia Horta, Wolfram Erlhagen
MOBIHOC
2008
ACM
15 years 11 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
LCN
2005
IEEE
15 years 5 months ago
Approximate Coverage in Wireless Sensor Networks
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
Yuzhen Liu, Weifa Liang
INFOCOM
2008
IEEE
15 years 6 months ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff
IPSN
2009
Springer
15 years 6 months ago
Recovering temporal integrity with Data Driven Time Synchronization
Data Driven Time Synchronization (DDTS) provides synchronization across sensors by using underlying characteristics of data collected by an embedded sensing system. We apply the c...
Martin Lukac, Paul Davis, Robert Clayton, Deborah ...