Sciweavers

1687 search results - page 164 / 338
» On the complexity of scheduling in wireless networks
Sort
View
CODES
2003
IEEE
15 years 11 months ago
Synthesis of real-time embedded software with local and global deadlines
Current methods cannot synthesize real-time embedded software applications when the global deadline of a task is shorter than the total of all local deadlines along a critical pat...
Pao-Ann Hsiung, Cheng-Yi Lin
GLOBECOM
2007
IEEE
16 years 23 days ago
Relay Selection for Low-Complexity Coded Cooperation
— This paper explores relay selection and selection diversity for coded cooperation in wireless sensor networks, with complexity constraints for the sensor nodes. In previous wor...
Josephine P. K. Chu, Raviraj S. Adve, Andrew W. Ec...
WIOPT
2010
IEEE
15 years 4 months ago
A multiobjective performance evaluation framework for routing in wireless ad hoc networks
—Wireless ad hoc networks are seldom characterized by one single performance metric, yet the current literature lacks a flexible framework to assist in characterizing the design...
Katia Jaffrès-Runser, Mary R. Schurgot, Cri...
WCNC
2008
IEEE
16 years 24 days ago
Novel Ultra Wideband Low Complexity Ranging Using Different Channel Statistics
—UWB technology can reach centimetre level ranging and positioning accuracy in LOS propagation when time of arrival techniques are used. However, in a real positioning system, th...
Giovanni Bellusci, Gerard J. M. Janssen, Junlin Ya...
IPSN
2005
Springer
15 years 12 months ago
Maximizing system lifetime in wireless sensor networks
Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the pa...
Qunfeng Dong