Abstract
Reducing number of forwarding nodes is the main focus of any broadcasting algorithm designed for ad-hoc wireless networks. All reliable broadcasting techniques can be broadly classified under proactive and reactive approaches. In proactive approach, a node selects a subset of its neighbors as forwarding node and announces the forwarding node list in the packet header during broadcast. On the other hand, no such forwarding list is generated in reactive approach. Rather, a node (cognitively) determines by itself whether to forward the packet or not based on neighbor information. Dominant pruning and Self-pruning are two example techniques that fall under proactive and reactive approach respectively. Between the two methods, dominant pruning shows better performance than self-pruning in reducing number of forwarding nodes as they work with extended neighbor knowledge. However, appended forwarding node list increases message overhead and consumes more bandwidth. As a result, the approach becomes non-scalable in large networks. In this paper, we propose a reactive broadcasting technique based on self-pruning. The proposed approach dubbed as “Improved Self-pruning based Broadcasting (ISB)” algorithm completes the broadcast with smaller packet header (i.e., with no overhead) but uses extended neighbor knowledge. Simulation results show that ISB outperforms dominant pruning and self-pruning. Furthermore, as the network gets more spread and denser, ISB works remarkably well.
Highlights
Reducing number of forwarding nodes is the main focus of any broadcasting algorithm designed for ad-hoc wireless networks
The proposed approach dubbed as “Improved Self-pruning based Broadcasting (ISB)” algorithm completes the broadcast with smaller packet header but uses extended neighbor knowledge
We proposed a new broadcasting technique dubbed as “improved selfpruning” that incurs minimal redundancy by reducing the number of forwarding nodes significantly
Summary
With a proactive solution, the transmitting node indicates (by providing a forwarding list in the header) which of its neighbors are supposed to re-broadcast the packet. Having received such a packet, a node essentially knows its role. Putting forwarding-list in the header is always a non-scalable solution as it grows with the network size Another problem with the proactive approaches is they are poor in handling dynamic topology. With the extended neighbor information improved self-pruning performs exceedingly better than traditional self-pruning and dominant pruning and generates lower number of forwarding nodes As it is an improved version of the self-pruning, it inherits all benefits of the reactive broadcast protocols.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.