Abstract. This paper analyzes the communication between two points in wireless ad hoc networks operating at the IEEE 802.11 standard mode. The path from the source to the destination consists of a chain of nodes. We aim at deriving an analytical expression for the maximum throughput. We show

. We study the problem of scheduling the server activation under the constraints imposed by the dependency among them. The performance criterion of a scheduling policy m is its throughput that is characterized by its stability region C,, that is, the set of vectors of arrival rates for which the system

This paper presents UNRET (unrolling and retiming), a resource-constrained software pipelining approach aimed at finding a loop schedule with maximum throughput and minimum register requirements. UNRET works in two phases. First, a pipelined loop schedule with maximum throughput is found for a

Abstract — The maximum throughput of relaying information flows while concealing their presence is studied. The concealment is achieved by embedding transmissions of information flows into truly independent transmission schedules that resemble the normal transmission behaviors without any flow

This paper presents and solves the maximum throughput dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which the flow on each arc not only has an associated upper and lower bound but also

constraint at the relay nodes in terms of limited buffer size. The proposed method is proved to achieve the maximum throughput, which is characterized analytically for transmission schedules following alternating renewal processes with a closed-form solution for Poisson processes. The analytical results

UNRET (unrolling and retiming) is an approach for resource-constrained loop pipelining that aims at finding a loop schedule with maximum throughput and minimum register pressure. This paper proposes an algorithm in two phases. In the first phase, a schedule with maximum throughput is found for a

This paper presents UNRET (unrolling and retiming), a new approach for resourceconstrained loop pipelining. UNRET aims at finding a loop schedule with maximum throughput and minimum register pressure. UNRET is composed of two main phases. In the first phase, a schedule with maximum throughput

coding cannot support maximum throughput in wireless fading channels. However, the network coded broadcast poses new constraints for the receivers to manage stable queues while the fading channel characteristics suggest the broadcast to operate at multi-rate to achieve higher throughput. In this research

system based on 802.11 technology (whether in ad-hoc or infrastructure mode). We will discuss the practical importance of theoretical maximum throughput and present several applications.