Sciweavers

3793 search results - page 177 / 759
» The wireless synchronization problem
Sort
View
MEMOCODE
2006
IEEE
15 years 10 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
SPAA
2012
ACM
13 years 6 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
INFOCOM
2005
IEEE
15 years 9 months ago
Power assignment for k-connectivity in wireless ad hoc networks
— The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the tot...
Xiaohua Jia, Dongsoo Kim, Sam Makki, Peng-Jun Wan,...
TWC
2008
105views more  TWC 2008»
15 years 3 months ago
Joint medium access control, routing and energy distribution in multi-hop wireless networks
It is a challenging task for multi-hop wireless networks to support multimedia applications with quality-ofservice (QoS) requirements. This letter presents a joint crosslayer optim...
Khoa T. Phan, Hai Jiang, Chintha Tellambura, Sergi...
INFOCOM
2012
IEEE
13 years 6 months ago
Dynamic index coding for wireless broadcast networks
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
Michael J. Neely, Arash Saber Tehrani, Zhen Zhang