کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10338031 | 693295 | 2013 | 18 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
BPC - A binary priority countdown protocol
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: BPC - A binary priority countdown protocol BPC - A binary priority countdown protocol](/preview/png/10338031.png)
چکیده انگلیسی
In modern wireless ad hoc networks, with a high speed PHY, every collision means a significant loss of useful bandwidth. In the last few years different binary contention protocols have been introduced to address this problem. In this work we propose a novel binary contention protocol called binary priority countdown (BPC) protocol, whose goal is to reduce collisions as well as contention time. BPC uses a new priority countdown mechanism which exploits the efficiency of binary countdown, but the priority countdown process is not constrained to a single binary countdown round. This way, the priority space is not defined by the length of binary countdown round, like in other binary countdown protocols proposed in the literature, and arbitrary medium access priorities can be decremented through multiple binary countdown rounds if necessary. The ability of a new priority countdown mechanism to count down any priority number without changing the length of a binary countdown round, allows independent management of priority space. This “independence” of priority space introduces new optimization and adaptation possibilities. Collision memory effect is recognized and described. BPC protocol reveals connection between unary, binary and digit contention protocols. All three groups of protocols can now be seen as members of the same class of contention algorithms. Preliminary simulation results are shown.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Ad Hoc Networks - Volume 11, Issue 3, May 2013, Pages 747-764
Journal: Ad Hoc Networks - Volume 11, Issue 3, May 2013, Pages 747-764
نویسندگان
Ivan Kedžo, Julije OžegoviÄ, Ante KristiÄ,