E-SP: An Enhanced Self-Pruning Broadcast Protocol for Wireless Ad-hoc Networks using One-hop Neighbor Information

Broadcast protocol is an essential part of wireless ad-hoc networks for fundamental network operations, route discovery, service discovery and even actual data transmission. Reducing number of forwarding stations and network overhead are the main goals of a scalable broadcast protocol. To fulfil the goals, we are motivated by the use of one-hop neighbor information in self-pruning and timer mechanism of scalable broadcast algorithm (SBA). The use of two-hop information and random selection process to assign priority among the stations are the major deficiencies of the probabilistic timer mechanism of SBA. To address these issues, we develop a broadcast protocol named enhanced self-pruning (E-SP) that uses deterministic timer mechanism and one-hop neighbor information which ensure network scalability in expense of broadcast delay. The simulation results show that the proposed E-SP broadcast protocol outperforms other existing broadcast protocols in terms of number of forwarding stations, saved rebroadcast, redundancy, and energy consumption.