Date Added: Aug 2011
Two efficient broadcasting algorithms based on 1- hop neighbor information is implemented here, i.e. Sender-based broadcasting algorithm and receiver-based broadcasting algorithm. The sender-based broadcasting algorithm selects a subset of nodes to forward the message. An efficient sender-based broadcasting algorithm proposed here is based on 1-hop neighbor information where the number of forwarding nodes selected in the worst case is 11 which reduces the time complexity of computing forwarding nodes to O (n). An elementary and extremely competent receiver-based broadcasting algorithm is also implemented. When nodes are uniformly distributed, the chance of two neighbor nodes broadcasting the same message exponentially diminishes when the distance between them decreases or when the node density increases.