dynamically according to variations of the wireless channel quality. Simulation results show that the proposed algorithms can greatly improve the throughput performance of the IEEE 802.11 wireless LAN.

Copyright © 2007 by Morgan & Claypool All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means—electronic, mechanical, photocopy, recording, or any other except for brief quotations in printed reviews, without the prior permission of the publisher.

—including one-to-k unicast and multicast data dissemination as well as k-to-one data aggregation—the maximum achievable end-to-end data throughput (measured on the sources) heavily depends on the strategy of arranging the topology of transmission between sources and destinations, as well as possible per

This paper describes two techniques that improve through-put in an ad hoc network in the presence of nodes that agree to forward packets but fail to do so. To mitigate this prob-lem, we propose categorizing nodes based upon their dynam-ically measured behavior. We use a watchdog that identifies

from the original sender, end-to-end latency is significantly reduced, and the overall throughput is improved as well. Also, since only the DRs send their acknowledgments to the sender, instead of all receivers sending their acknowledgments to the sender, a single acknowledgement is generated per local

by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance in wireless and lossy systems. In this paper, we compare several schemes designed to improve the performance of TCP in such networks. We classify these schemes into three broad categories: end

A resource scheduling scheme is presented to improve throughput and fairness for NRT packet data traffic on the downlink shared channel of a UMTS WCDMA network supporting multiple services. The proposed Fair Resource Scheduling (FRS) scheme takes into account link conditions to enhance throughput

Applications that require good network performance often use parallel TCP streams and TCP modifications to improve the effectiveness of TCP. If the network bottleneck is fully utilized, this approach boosts throughput by unfairly stealing bandwidth from competing TCP streams. Improving

Abstract––Digit-serial/parallel multipliers with improved throughput and latency are presented. The multipliers are based on unfolded bit-serial/parallel multipliers. The unfolding yields long critical paths that are reduced by splitting the multiplication as a sum of partial multiplications. Using

-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery. Under this assumption, the per-user throughput can increase dramatically when nodes are mobile rather than fixed. This improvement can be achieved by exploiting node mobility as a