Sciweavers

623 search results - page 64 / 125
» Packet Routing in Dynamically Changing Networks on Chip
Sort
View
TON
2002
102views more  TON 2002»
13 years 7 months ago
A min, + system theory for constrained traffic regulation and dynamic service guarantees
By extending the system theory under the (min, +) algebra to the time-varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic ser...
Cheng-Shang Chang, Rene L. Cruz, Jean-Yves Le Boud...
SENSYS
2006
ACM
14 years 1 months ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha
IPPS
2006
IEEE
14 years 1 months ago
k-anycast routing schemes for mobile ad hoc networks
— Anycast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the...
Bing Wu, Jie Wu
EWSN
2004
Springer
14 years 7 months ago
Structured Communication in Single Hop Sensor Networks
Abstract. We propose a model for communication in single-hop wireless sensor networks and define and evaluate the performance of a robust, energy balanced protocol for a powerful a...
Amol Bakshi, Viktor K. Prasanna
SECON
2010
IEEE
13 years 5 months ago
Distributed Routing, Relay Selection, and Spectrum Allocation in Cognitive and Cooperative Ad Hoc Networks
Throughput maximization is a key challenge in cognitive radio ad hoc networks, where the availability of local spectrum resources may change from time to time and hopby-hop. To ach...
Lei Ding, Tommaso Melodia, Stella N. Batalama, Joh...