Show simple item record

dc.contributor.advisor Sabharwal, Ashutosh
dc.creatorSantacruz, Pedro
dc.date.accessioned 2013-09-16T16:37:46Z
dc.date.accessioned 2013-09-16T16:37:48Z
dc.date.available 2013-09-16T16:37:46Z
dc.date.available 2013-09-16T16:37:48Z
dc.date.created 2013-05
dc.date.issued 2013-09-16
dc.date.submitted May 2013
dc.identifier.urihttps://hdl.handle.net/1911/72036
dc.description.abstract In most wireless networks, nodes have only limited local information about the state of the network, which includes connectivity and channel state information. With limited local information about the network, each node’s knowledge is mismatched; therefore, they must make distributed decisions. In this thesis, we pose the following question - if every node has network state information only about a small neighborhood, how and when should nodes choose to transmit? While link scheduling answers the above question for point-to-point physical layers which are designed for an interference-avoidance paradigm, we look for answers in cases when interference can be embraced by advanced code design, as suggested by results in network information theory. To make progress on this challenging problem, we propose two constructive distributed algorithms, one conservative and one aggressive, which achieve rates higher than link scheduling based on interference avoidance, especially if each node knows more than one hop of network state information. Both algorithms schedule sub-networks such that each sub-network can employ advanced interference-embracing coding schemes to achieve higher rates. Our innovation is in the identification, selection and scheduling of sub-networks, especially when sub-networks are larger than a single link. Using normalized sum-rate as the metric of network performance, we prove that the proposed conservative sub-network scheduling algorithm is guaranteed to have performance greater than or equal to pure coloring-based link scheduling. In addition, the proposed aggressive sub-network scheduling algorithm is shown, through simulations, to achieve better normalized sum-rate than the conservative algorithm for several network classes. Our results highlight the advantages of extending the design space of possible scheduling strategies to include those that leverage local network information.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.subjectWireless communication
Wireless networks
Distributed scheduling
Local views
dc.title Beyond Interference Avoidance: Distributed Sun-network Scheduling in Wireless Networks with Local Views
dc.contributor.committeeMember Aazhang, Behnaam
dc.contributor.committeeMember Knightly, Edward W.
dc.contributor.committeeMember Hicks, Illya V.
dc.date.updated 2013-09-16T16:37:48Z
dc.identifier.slug 123456789/ETD-2013-05-477
dc.type.genre 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
dc.identifier.citation Santacruz, Pedro. "Beyond Interference Avoidance: Distributed Sun-network Scheduling in Wireless Networks with Local Views." (2013) Diss., Rice University. https://hdl.handle.net/1911/72036.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record