Sciweavers

461 search results - page 84 / 93
» p-Percent Coverage Schedule in Wireless Sensor Networks
Sort
View
PERCOM
2007
ACM
15 years 9 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
RTSS
2008
IEEE
15 years 3 months ago
Rate-Harmonized Scheduling for Saving Energy
—Energy consumption continues to be a major concern in multiple application domains including powerhungry data centers, portable and wearable devices, mobile communication device...
Anthony Rowe, Karthik Lakshmanan, Haifeng Zhu, Rag...
AINA
2007
IEEE
15 years 3 months ago
Efficient Hybrid Channel Access for Data Intensive Sensor Networks
In this paper, we introduce novel probabilistic transmission protocols for data intensive wireless sensor networks. The protocols combine a randomized transmission scheme with sch...
Chih-Kuang Lin, Vladimir Zadorozhny, Prashant Kris...
ICDCS
2008
IEEE
15 years 3 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
CEC
2010
IEEE
14 years 7 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...