@techreport{TD:100941,
	att_abstract={{In most wireless networks, nodes have only limited
local information about the network state, 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 paper, 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 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 a distributed algorithm which achieves rates higher than
interference-avoidance based link scheduling, especially if each
node knows more than one hop of network state information.}},
	att_authors={va037f},
	att_categories={C_CCF.3},
	att_copyright={{IEEE}},
	att_copyright_notice={{This version of the work is reprinted here with permission of IEEE for your personal use. Not for redistribution. The definitive version was published in 2012 {{, 2013-04-14}}
}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={},
	att_techdoc={true},
	att_techdoc_key={TD:100941},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:100941_DS1_2013-01-22T20:36:25.545Z.pdf},
	author={Vaneet Aggarwal and Pedro Santacruz and Ashutosh Sabharwal},
	institution={{IEEE Infocomm 2013}},
	month={April},
	title={{Beyond Interference Avoidance: Distributed Sub-network Scheduling in Wireless Networks with Local Views}},
	year=2013,
}