Research Article Open Access

Efficient Data Broadcast Using One-To-All and All-To-All Broadcast Algorithm In Wireless Networks

Abstract

Broadcast communication is a key requirement for WSNs since many tasks in the network depend on broadcasting. Broadcasting has been one of the most significant and widely used communication techniques for information transformation. Broadcast communication, which forms the basis of all communication in wireless networks. In multihop wireless networks, however, interference at a node due to simultaneous transmissions from its neighbors makes it important to design a minimum-latency broadcast algorithm, which is known to be NP-complete. A simple 12-approximation algorithm for the one-to-all broadcast problem that improves latency Problem in the one-to-all broadcast algorithm. This leads to better performance with a collision free broadcasting. The all-to-all broadcast crisis where each node sends its own message to all other nodes. For all-to-all broadcasting the performance is improved by using Collect and Distribute, Interleaved Collect and Distribute algorithm. The message transmission in the wireless network using one-to-all and all-toall broadcast algorithm best result. But it is not enough for very large multihop networks, so in future it can be implemented for very large multihop networks in efficient manner to reduce latency and collision-free and to find the latency time in wireless networks. We can increase the performance in multihop networks over the existing system.

S.BrittoRaj, A.Sivanesh Kumar