Sciweavers

13214 search results - page 287 / 2643
» Pseudorandomness for network algorithms
Sort
View
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
16 years 20 days ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
SENSYS
2003
ACM
15 years 12 months ago
Matching data dissemination algorithms to application requirements
A distinguishing characteristic of wireless sensor networks is the opportunity to exploit characteristics of the application at lower layers. This approach is encouraged by device...
John S. Heidemann, Fabio Silva, Deborah Estrin
ICASSP
2010
IEEE
15 years 5 months ago
A symmetric adaptive algorithm for speeding-up consensus
Performing distributed consensus in a network has been an important research problem for several years, and is directly applicable to sensor networks, autonomous vehicle formation...
Daniel Thai, Elizabeth Bodine-Baron, Babak Hassibi
PIMRC
2008
IEEE
16 years 1 months ago
An adaptive holdoff algorithm based on node state for IEEE 802.16 mesh mode with coordinated distributed scheduling
Wireless mesh networks (WMNs) are one of the key features of beyond 3G system because of their flexible and lowcost deployment. IEEE 802.16 mesh mode has recently emerged as an alt...
Bong Chan Kim, Dong Gu Kwak, Heecheol Song, Hwang ...
168
Voted
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
16 years 3 months ago
Algorithms for simultaneous consideration of multiple physical synthesis transforms for timing closure
We propose a post-placement physical synthesis algorithm that can apply multiple circuit synthesis and placement transforms on a placed circuit to improve the critical path delay ...
Huan Ren, Shantanu Dutt