Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- L. Tassiulas, A. Ephremides
- Computer ScienceIEEE Conference on Decision and Control
- 5 December 1990
The stability of a queuing network with interdependent servers is considered, and the problem of scheduling server activation under the constraints imposed by the dependency among them is studied.
On the construction of energy-efficient broadcast and multicast trees in wireless networks
- J. Wieselthier, G. Nguyen, A. Ephremides
- Computer Science, BusinessProceedings IEEE INFOCOM . Conference on Computer…
- 26 March 2000
This work develops the broadcast incremental power algorithm, and adapt it to multicast operation as well, and demonstrates that this algorithm provides better performance than algorithms that have been developed for the link-based, wired environment.
The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm
- D. Baker, A. Ephremides
- Computer ScienceIEEE Transactions on Communications
- 1 November 1981
A self-starting, distributed algorithm is proposed and developed that establishes and maintains a reliable structure that is especially suited to the needs of the HF Intra-Task Force (ITF) communication network, which is discussed in the paper.
Dynamic server allocation to parallel queues with randomly varying connectivity
- L. Tassiulas, A. Ephremides
- MathematicsIEEE Transactions on Information Theory
- 1 March 1993
In a system with a single buffer per queue, an allocation policy is obtained that maximizes the throughput and minimizes the delay when the arrival and service statistics of different queues are identical.
Joint scheduling and power control for wireless ad hoc networks
- T. Elbatt, A. Ephremides
- Computer Science, BusinessIEEE Transactions on Wireless Communications
- 7 November 2002
A cross-layer design framework to the multiple access problem in contention-based wireless ad hoc networks is introduced, limiting multiuser interference to increase single-hop throughput and reducing power consumption to prolong battery life.
Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
- J. Wieselthier, G. Nguyen, A. Ephremides
- Computer Science, BusinessMob. Networks Appl.
- 1 December 2002
This paper introduces and evaluates algorithms for tree construction in infrastructureless, all-wireless applications, and develops the Broadcast Incremental Power algorithm, and adapts it to multicast operation by introducing the MIP algorithm.
On the stability of interacting queues in a multiple-access system
- R. Rao, A. Ephremides
- MathematicsIEEE Transactions on Information Theory
- 1 September 1988
It is shown that the stability region for the case of two terminals can be obtained in a simple way and lower (inner) bounds are obtained for the Stability region of the system with an arbitrary finite number of terminals that are tighter than the ones already known.
A design concept for reliable mobile radio networks with frequency hopping signaling
- A. Ephremides, J. Wieselthier, D. Baker
- Computer ScienceProceedings of the IEEE
- 1987
This paper outlines those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and presents a design concept for this network that encompasses organizational structure, waveform design, and channel access.
Cognitive multiple access via cooperation: Protocol design and performance analysis
- A. Sadek, K. J. Liu, A. Ephremides
- BusinessIEEE Transactions on Information Theory
- 1 October 2007
The analysis reveals that the throughput region of the proposed cognitive multiple-access strategy is a subset of its maximum stable throughput region, which is different from random access, where both regions are conjectured to be identical.
Scheduling broadcasts in multihop radio networks
- A. Ephremides, T. Truong
- Business, Computer ScienceIEEE Transactions on Communications
- 1 April 1990
It is shown that the problem of scheduling broadcast transmissions in a multihop, mobile packet radio network is NP complete and a centralized algorithm that runs in polynomial time and results in efficient (maximal) schedules is proposed.
...
...