T-SP: A Timer-based Self-Pruning Broadcast Protocol using One-hop Neighbor Information

The broadcast protocol plays a crucial role in wire- less ad-hoc networks for fundamental network operations, route discovery, service discovery and even actual data transmission. The primary objectives of a scalable broadcast protocol involve minimizing the number of forwarding stations and reducing network overhead. To achieve these objectives, we are motivated by the use of one-hop neighbor information in self-pruning and timer mechanism of 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 solve these issues, we develop a broadcast protocol called timer-based self-pruning (T-SP) that uses deterministic timer mechanism and one-hop neighbor information. The simulation results show that the proposed T-SP ensures network scalability, reduces number of forwarding stations, network overhead and energy consumption in expense of broadcast delay.