Sciweavers

4781 search results - page 613 / 957
» Online algorithms for network design
Sort
View
ICC
2008
IEEE
175views Communications» more  ICC 2008»
16 years 1 months ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...
INFOCOM
2008
IEEE
16 years 1 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
PIMRC
2008
IEEE
16 years 1 months ago
Distributed scheduling with end-to-end compensation in multihop ad hoc networks
Abstract-In this paper, we investigate the problem of providing QoS to end-to-end flows in multihop ad hoc networks with channel errors through packet scheduling. Each flow is asso...
Yijiang Sun, Victor O. K. Li, Ka-Cheong Leung
ISPASS
2006
IEEE
16 years 22 days ago
Modeling TCAM power for next generation network devices
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...
Banit Agrawal, Timothy Sherwood
INFOCOM
2000
IEEE
15 years 11 months ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
Jae-Hwan Chang, Leandros Tassiulas