0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R1,000 - R2,500 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Stable Throughput Regions in Wireless Networks (Paperback): Sastry Kompella, Anthony Ephremides Stable Throughput Regions in Wireless Networks (Paperback)
Sastry Kompella, Anthony Ephremides
R1,863 Discovery Miles 18 630 Ships in 10 - 15 working days

Stable Throughput Regions in Wireless Networks examines the fundamentals of stable throughput in wireless networks. It reviews the notion of stability and of stable throughput regions in wireless networks, with emphasis on network layer cooperation between interacting users. After a brief introduction, it examines in detail specific instances of the stability issue. These instances differ from each other in terms of the network, channel and traffic models they use. What they share is the notion of how stability is affected by node cooperation, as well as the notion of ""interacting queues"" that makes the stable throughput analysis difficult and often intractable. This review is intended to provide a reference point for the rich set of network control problems that arise in the context of queue stability in modern and future networks.

Weighted Sum-Rate Maximization in Wireless Networks - A Review (Paperback): Pradeep Chathuranga Weeraddana, Marian Codreanu,... Weighted Sum-Rate Maximization in Wireless Networks - A Review (Paperback)
Pradeep Chathuranga Weeraddana, Marian Codreanu, Matti Latva-Aho, Anthony Ephremides, Carlo Fischione
R2,293 Discovery Miles 22 930 Ships in 10 - 15 working days

The weighted sum-rate maximization (WSRMax) problem plays a central role in many network control and optimization methods, such as power control, link scheduling, cross-layer control, network utility maximization. The problem is NP-hard in general. In Weighted Sum-Rate Maximization in Wireless Networks: A Review, a cohesive discussion of the existing solution methods associated with the WSRMax problem, including global, fast local, as well as decentralized methods is presented. In addition, general optimization approaches, such as branch and bound methods, complementary geometric programming, and decomposition methods, are discussed in depth to address the problem. Through a number of numerical examples, the applicability of the resulting algorithms in various application domains is demonstrated. The presented algorithms and the associated numerical results can be very useful for network engineers or researchers with an interest in network design.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
In Silence My Heart Speaks
Thobeka Yose Paperback R302 Discovery Miles 3 020
Surface Modification and…
Rajan Jose, Fabian Ezema Paperback R5,497 Discovery Miles 54 970
Physics of Semiconductor Devices
J.-p. Colinge, C. A Colinge Hardcover R6,578 Discovery Miles 65 780
The House In The Pines
Ana Reyes Paperback R467 R426 Discovery Miles 4 260
Meditations
Marcus Aurelius Paperback R168 R131 Discovery Miles 1 310
The Match
Harlan Coben Paperback R411 Discovery Miles 4 110
The Analogy of Religion, Natural and…
Joseph Butler Paperback R676 Discovery Miles 6 760
Math Fact Fluency - 60+ Games and…
Jennifer Bay Williams, Gina Kling Paperback R875 R759 Discovery Miles 7 590
Embryonic Stem Cell Immunobiology…
Nicholas Zavazava Hardcover R3,888 R3,606 Discovery Miles 36 060
Classroom Gems: Games, Ideas and…
Donna Minto Paperback R455 Discovery Miles 4 550

 

Partners