Abstract
Previous mutual exclusion (MUTEX for short) protocols for mobile ad hoc networks are based on the token circulation technique. They assume that the network is reliable to avoid starvation. Considering that the MUTEX issue is to share a communication channel, we have designed an average-case-analysis protocol for single-hop networks which is based on the fully distributed construction of a random binary tree. Contrarily to other papers, the stations are not identified and their number (n) is unknown. Assuming that time is slotted, our algorithm runs in approximately n/log 2 slots. The derived k-MUTEX protocol runs in n/log k slots.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Ad Hoc and Ubiquitous Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
