Robustness and Optimality in CSMA Wireless Networks
| dc.contributor.advisor | Knightly, Edward W. | |
| dc.contributor.committeeMember | Sabharwal, Ashutosh | |
| dc.contributor.committeeMember | Johnson, David B. | |
| dc.creator | Nardelli, Bruno | |
| dc.date.accessioned | 2014-10-03T15:22:44Z | |
| dc.date.available | 2014-10-03T15:22:44Z | |
| dc.date.created | 2013-12 | |
| dc.date.issued | 2013-06-04 | |
| dc.date.submitted | December 2013 | |
| dc.date.updated | 2014-10-03T15:22:44Z | |
| dc.description.abstract | In today's widely diffused CSMA wireless networks, problems of coordination in the access to the channel by multiple transmitters can lead to unfair situations where some of the flows receive much of the network throughput while others suffer from poor performance. As a solution to this problem, recent theoretical studies have proposed distributed CSMA adaptation protocols that, under certain assumptions, maximize a network utility function, yielding high throughput fairly distributed among flows. The main idea in the operation of such protocols, referred to as Optimal CSMA, is to adapt the contention aggressiveness of a flow as a function of its queue length, without the need of any information exchange among nodes. Thus, their operation is distributed, and does not introduce additional control overhead to CSMA operation. However, we show that such an approach is fragile, and can suffer high performance degradation under conditions of frequent occurrence, namely; asymmetric channels, heterogeneous traffic, and packet collisions. In this work, we address the main sources of performance degradation in Optimal CSMA to design a distributed protocol for proportional-fair throughput maximization robust to such conditions. First, we generalize Optimal CSMA models to incorporate individual per-link modulation and coding rates. With our generalized network optimization model, we derive distributed algorithms that maximize utility under arbitrary channel capacities. Second, we propose a novel structure that can be used in the place of queues to provide optimal CSMA adaptation. As such a structure does not use traffic backlog to operate, the resulting adaptation is optimal for the set of active flows under general traffic arrival patterns. Third, we propose a robustness function compatible with the optimization approach, which maintains high medium access rates to maximize performance in low contention scenarios, yet reduces medium access to avoid collisions as the network contention increases. Finally, we validate our design by evaluating its performance against state-of-the-art protocols for distributed CSMA optimization under critical scenarios combining the three aforementioned sources of performance degradation, observing vast gains in network logarithmic utility across a wide-range of network operating conditions. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | Nardelli, Bruno. "Robustness and Optimality in CSMA Wireless Networks." (2013) Diss., Rice University. <a href="https://hdl.handle.net/1911/77389">https://hdl.handle.net/1911/77389</a>. | |
| dc.identifier.uri | https://hdl.handle.net/1911/77389 | |
| dc.language.iso | eng | |
| dc.rights | Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. | |
| dc.subject | Network utility maximization | |
| dc.subject | Distributed network optimization | |
| dc.subject | CSMA wireless protocols | |
| dc.subject | Cross-layer network optimization | |
| dc.subject | Robust network operation | |
| dc.title | Robustness and Optimality in CSMA Wireless Networks | |
| dc.type | Thesis | |
| dc.type.material | Text | |
| thesis.degree.department | Electrical and Computer Engineering | |
| thesis.degree.discipline | Engineering | |
| thesis.degree.grantor | Rice University | |
| thesis.degree.level | Doctoral | |
| thesis.degree.name | Doctor of Philosophy |