Sciweavers

295 search results - page 7 / 59
» A New Node Centroid Algorithm for Bandwidth Minimization
Sort
View
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
15 years 3 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
ICCAD
2004
IEEE
111views Hardware» more  ICCAD 2004»
15 years 7 months ago
A new incremental placement algorithm and its application to congestion-aware divisor extraction
— This paper presents two contributions. The first is an incremental placement algorithm for placement-aware logic synthesis along with a proof of optimality. The algorithm can ...
Satrajit Chatterjee, Robert K. Brayton
WSNA
2003
ACM
15 years 3 months ago
Analyzing and modeling encryption overhead for sensor network nodes
Recent research in sensor networks has raised security issues for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices in...
Prasanth Ganesan, Ramnath Venugopalan, Pushkin Ped...
RTSS
2007
IEEE
15 years 4 months ago
Distributed Minimal Time Convergecast Scheduling for Small or Sparse Data Sources
— Many applications of sensor networks require the base station to collect all the data generated by sensor nodes. As a consequence many-to-one communication pattern, referred to...
Ying Zhang, Shashidhar Gandham, Qingfeng Huang
CORR
2010
Springer
437views Education» more  CORR 2010»
14 years 7 months ago
A Distributed Cluster Scheme For Bandwidth Management In Multi-hop MANETs
Electronic collaboration among devices in a geographically localized environment is made possible with the implementation of IEEE 802.11 based wireless ad hoc networks. Dynamic na...
Binod Kumar Pattanayak, Alok Kumar Jagadev, Manoj ...