Sciweavers

1095 search results - page 133 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
MASS
2010
173views Communications» more  MASS 2010»
14 years 7 months ago
Efficient routing in delay tolerant networks with correlated node mobility
Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path ...
Eyuphan Bulut, Sahin Cem Geyik, Boleslaw K. Szyman...
ICNP
2000
IEEE
15 years 2 months ago
Characterization and Performance Evaluation for Proportional Delay Differentiated Services
In this paper, we consider a proportional delay model for Internet differentiated services. Under this model, an ISP can control the “spacing” of waiting times between differe...
Matthew K. H. Leung, John C. S. Lui, David K. Y. Y...
INFOCOM
2007
IEEE
15 years 4 months ago
Optimal Pricing in a Free Market Wireless Network
We consider an ad-hoc wireless network operating within a free market economic model. Users send data over a choice of paths, and scheduling and routing decisions are updated dyna...
Michael J. Neely
SRDS
2010
IEEE
14 years 7 months ago
Crash-Tolerant Collision-Free Data Aggregation Scheduling for Wireless Sensor Networks
Data aggregation scheduling, or convergecast, is a fundamental pattern of communication in wireless sensor networks (WSNs), where sensor nodes aggregate and relay data to a sink no...
Arshad Jhumka
ETS
2009
IEEE
128views Hardware» more  ETS 2009»
14 years 7 months ago
Algorithms for ADC Multi-site Test with Digital Input Stimulus
This paper reports two novel algorithms based on time-modulo reconstruction method intended for detection of the parametric faults in analogue-to-digital converters (ADC). In both ...
Xiaoqin Sheng, Hans G. Kerkhoff, Amir Zjajo, Guido...