A Channel Access Scheme for Large Dense Packet Radio Networks

@inproceedings{citeulike:583855, abstract = {Prior work in the field of packet radio networks has often assumed a simple success-if-exclusive model of successful reception. This simple model is insufficient to model interference in large dense packet radio networks accurately. In this paper we present a model that more closely approximates communication theory and the underlying physics of radio communication. Using this model we present a decentralized channel access scheme for scalable packet radio networks that is free of packet loss...}, author = {Shepard, Timothy J. }, booktitle = {SIGCOMM}, citeulike-article-id = {583855}, keywords = {random, schedule}, pages = {219--230}, posted-at = {2006-04-12 14:42:34}, priority = {0}, title = {A Channel Access Scheme for Large Dense Packet Radio Networks}, url = {http://citeseer.ist.psu.edu/shepard98channel.html}, year = {1996} }

TY - CONF ID - citeulike:583855 L3 - citeulike-article-id:583855 TI - A Channel Access Scheme for Large Dense Packet Radio Networks T2 - SIGCOMM SP - 219 EP - 230 N2 - Prior work in the field of packet radio networks has often assumed a simple success-if-exclusive model of successful reception. This simple model is insufficient to model interference in large dense packet radio networks accurately. In this paper we present a model that more closely approximates communication theory and the underlying physics of radio communication. Using this model we present a decentralized channel access scheme for scalable packet radio networks that is free of packet loss... KW - random KW - schedule AU - Shepard, Timothy PY - 1996/// UR - http://citeseer.ist.psu.edu/shepard98channel.html ER -