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...
Is Your Thinking Keeping You Poor? - 50…
Douglas Kruger Paperback  (4)
R270 R249 Discovery Miles 2 490
The Book Every Leader Needs To Read…
Abed Tau, Adriaan Groenewald, … Paperback R310 R277 Discovery Miles 2 770
Preschool and Early Childhood Treatment…
Maribeth Gettinger, Stephen N. Elliott, … Hardcover R4,486 Discovery Miles 44 860
15 Invaluable Laws Of Growth - Live Them…
John C. Maxwell Paperback R430 R384 Discovery Miles 3 840
Mind Power - #IPrayINeverDieBroke
Nkosi James Moremoholo Paperback  (3)
R341 Discovery Miles 3 410
FOREsight - Awaken Curiosity. Cultivate…
John Sanei Paperback R345 R318 Discovery Miles 3 180
The Courage To Be Disliked - How to free…
Ichiro Kishimi, Fumitake Koga Paperback  (2)
R315 R281 Discovery Miles 2 810
Teaching Music to Students with Special…
Alice Hammel, Ryan Hourigan Hardcover R3,484 Discovery Miles 34 840
Professional Development and Quality in…
Athanasios Gregoriadis, Vasilis Grammatikopoulos, … Hardcover R2,043 Discovery Miles 20 430
Empathy, Emotion and Education
Helen Demetriou Hardcover R3,897 Discovery Miles 38 970

 

Partners