Sciweavers

658 search results - page 64 / 132
» Lower bounds for sorting networks
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Maximizing Restorable Throughput in MPLS Networks
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
Reuven Cohen, Gabi Nakibly
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 7 months ago
On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model
Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under sm...
K. Prasad, B. Sundar Rajan
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 7 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 5 months ago
Two-Way Transmission Capacity of Wireless Ad-hoc Networks
The transmission capacity of an ad-hoc network is the maximum density of active transmitters in an unit area, given an outage constraint at each receiver for a fixed rate of transm...
Rahul Vaze, Kien T. Truong, Steven Weber, Robert W...
INFOCOM
2011
IEEE
12 years 11 months ago
Delay-bounded MAC with minimal idle listening for sensor networks
—This paper presents a new receiver-initiated sensor network MAC protocol, called CyMAC, which has the following unique features. It reduces the idle listening time of sensor nod...
Yang Peng, Zi Li, Daji Qiao, Wensheng Zhang