Sciweavers

1571 search results - page 157 / 315
» Improved Algorithms for Latency Minimization in Wireless Net...
Sort
View
JPDC
2006
134views more  JPDC 2006»
13 years 9 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
TC
2008
13 years 8 months ago
Traffic-Balanced Routing Algorithm for Irregular Mesh-Based On-Chip Networks
On-chip networks (OCNs) have been proposed to solve the increasing scale and complexity of the designs in nanoscale multicore VLSI designs. The concept of irregular meshes is an im...
Shu-Yen Lin, Chun-Hsiang Huang, Chih-Hao Chao, Ken...
IPSN
2005
Springer
14 years 2 months ago
Design of a wireless sensor network platform for detecting rare, random, and ephemeral events
— We present the design of the eXtreme Scale Mote, a new sensor network platform for reliably detecting and classifying, and quickly reporting, rare, random, and ephemeral events...
Prabal Dutta, Mike Grimmer, Anish Arora, Steven B....
ICC
2007
IEEE
166views Communications» more  ICC 2007»
14 years 3 months ago
Dynamic Optimization of Secure Mobile Sensor Networks: A Genetic Algorithm
— We propose a reduced-complexity genetic algorithm for secure and dynamic deployment of resource constrained multi-hop mobile sensor networks. Mobility and security are relative...
Rahul Khanna, Huaping Liu, Hsiao-Hwa Chen
CORR
2010
Springer
215views Education» more  CORR 2010»
13 years 7 months ago
Energy Efficient Clustering and Routing in Mobile Wireless Sensor Network
A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes’ mobility in M...
Getsy S. Sara, Kalaiarasi R, Neelavathy Pari S, Sr...