Abstract
Network-wide broadcasting is very necessary in wireless networks. A large number of broadcast protocols are developed for wireless networks. However, most of these broadcast protocols focus on Single-Channel Single-Radio (SC-SR) networks. The broadcast protocols in SC-SR networks are often node-centric. It is not suitable for Multi-Channel Multi-Radio (MC-MR) networks, as SC-SR broadcast protocols cannot effectively distinguish the performance differences between the multiple channels equipped by the nodes. We proposed the MOCAB algorithm, a distributed algorithm, which can effectively compute a broadcast tree in MC-MR networks. Our approach is to represent a MC-MR network with a simplicial complex rather than a graph. The simplicial complex can effectively grasp the concept of group in the network. By using a special complex called minimum overlapping neighborhood subcomplex, we can achieve minimum redundancy broadcast. We compare the performance of our algorithm with CAB algorithm. Results show that our algorithm uses 10.9% less receptions.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
