Sciweavers

2677 search results - page 384 / 536
» Locally Served Network Computers
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 12 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
LCN
2003
IEEE
15 years 11 months ago
ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks
Sensor networks are meant for sensing and disseminating information about the environment they sense. The criticality of a sensed phenomenon determines it’s importance to the en...
Budhaditya Deb, Sudeept Bhatnagar, Badri Nath
MOBIHOC
2003
ACM
16 years 6 months ago
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
Chao Gui, Prasant Mohapatra
SECON
2008
IEEE
16 years 26 days ago
On the Pitfalls of High-Throughput Multicast Metrics in Adversarial Wireless Mesh Networks
—Recent work in multicast routing for wireless mesh networks has focused on metrics that estimate link quality to maximize throughput. Nodes must collaborate in order to compute ...
Jing Dong, Reza Curtmola, Cristina Nita-Rotaru
BROADNETS
2007
IEEE
16 years 25 days ago
Joint monitoring and routing in wireless sensor networks using robust identifying codes
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their ons present challenges to fundamental network services such as routing. In t...
Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, ...