The project proposes an efficient sender-based broadcasting algorithm based on 1-hop neighbor information that reduces the time complexity of computing forwarding nodes to O (n Log n). In Liu et al.’s algorithm, n nodes are selected to forward the message in the worst case, whereas in our proposed algorithm, the number of forwarding nodes in the worst case is 11. a simple and highly efficient receiver-based broadcasting algorithm is proposed. When nodes are uniformly distributed, it proves that the probability of two neighbor nodes broadcasting the same message exponentially decreases when the distance between them decreases or when the node density increases.