Sciweavers

542 search results - page 57 / 109
» Optimal delay scheduling in networks with arbitrary constrai...
Sort
View
DEBU
1998
115views more  DEBU 1998»
14 years 9 months ago
The Case for Non-transparent Replication: Examples from Bayou
Applications that rely on replicated data have different requirements for how their data is managed. For example, some applications may require that updates propagate amongst repl...
Douglas B. Terry, Karin Petersen, Mike Spreitzer, ...
JSAC
2007
125views more  JSAC 2007»
14 years 9 months ago
Network Dimensioning under Scheduled and Random Lightpath Demands in All-Optical WDM Networks
— In WDM optical networks connection requests can be classified into three different types: Permanent Lightpath Demands (PLDs), Scheduled Lightpath Demands (SLDs), and Random Li...
Maurice Gagnaire, Mohamed Koubàa, Nicolas P...
DCOSS
2007
Springer
15 years 3 months ago
A Connectivity Based Partition Approach for Node Scheduling in Sensor Networks
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
Yong Ding, Chen Wang, Li Xiao
COMCOM
2006
147views more  COMCOM 2006»
14 years 9 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
WIOPT
2010
IEEE
14 years 8 months ago
Throughput-delay-reliability tradeoff in ad hoc networks
Abstract—Delay-reliability (D-R), and throughput-delayreliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repe...
Rahul Vaze