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...
Stimulating Emerging Story Writing…
Simon Brownhill Hardcover R4,467 Discovery Miles 44 670
Life and Adventures of Robinson Crusoe…
Daniel Defoe Paperback R751 Discovery Miles 7 510
Rollin' with Rico - Meeting My Fur-Ever…
Allen Hardcover R584 Discovery Miles 5 840
Strengths Finder 2.0 - A New and…
Gallup Hardcover R620 R541 Discovery Miles 5 410
My First Kurdish Kurmanji Alphabets…
Seyda S Hardcover R510 Discovery Miles 5 100
Critical Issues in preparing Effective…
Festus E. Obiakor, Alicja Rieger, … Hardcover R2,772 Discovery Miles 27 720
My First Armenian Alphabets Picture Book…
Sara S. Hardcover R511 Discovery Miles 5 110
Air Transport and Regional Development…
Anne Graham, Nicole Adler, … Hardcover R4,493 Discovery Miles 44 930
Airbus Industrie - Conflict and…
S. McGuire Hardcover R2,873 Discovery Miles 28 730
Engaging the Next Generation of Aviation…
Suzanne K. Kearns, Timothy J. Mavin, … Paperback R1,148 Discovery Miles 11 480

 

Partners