TY - GEN
T1 - RBP
T2 - 24th IEEE International Conference on Advanced Information Networking and Applications, AINA2010
AU - Saha, Subrata
AU - Hussain, Syed Rafiul
AU - Rahman, A. K.M.Ashikur
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2010
Y1 - 2010
N2 - Conventional broadcasting protocols suffer from network congestion, frequent message losses and corruption of broadcast messages due to a vast number of duplicate packets transmitting in the network. In this paper, we propose an efficient, scalable and reliable broadcast protocol to send a message in the entire network where every node is guaranteed to receive the message with low overhead and minimal cost. The scalability and reliability of broadcast transmission is ensured by composing the entire network in a hierarchy of grids/squares. A higher order square is made up of four lower order squares forming a quad tree architecture. With this grid architecture a node does not need to flood the broadcast packet to the entire network. Rather a node exploits the Geographic Forwarding mechanism to send the packet to a particular square. The rest of the work is done by the very first node receiving the packet destined for that particular grid. This node has now the responsibility to update its own grid with the broadcast packet. The whole procedure is repeated iteratively in every grid. Simulation results show that our proposed algorithm is reliable, scalable, robust and also outperforms some other promising broadcasting protocols that exist in the current literature.
AB - Conventional broadcasting protocols suffer from network congestion, frequent message losses and corruption of broadcast messages due to a vast number of duplicate packets transmitting in the network. In this paper, we propose an efficient, scalable and reliable broadcast protocol to send a message in the entire network where every node is guaranteed to receive the message with low overhead and minimal cost. The scalability and reliability of broadcast transmission is ensured by composing the entire network in a hierarchy of grids/squares. A higher order square is made up of four lower order squares forming a quad tree architecture. With this grid architecture a node does not need to flood the broadcast packet to the entire network. Rather a node exploits the Geographic Forwarding mechanism to send the packet to a particular square. The rest of the work is done by the very first node receiving the packet destined for that particular grid. This node has now the responsibility to update its own grid with the broadcast packet. The whole procedure is repeated iteratively in every grid. Simulation results show that our proposed algorithm is reliable, scalable, robust and also outperforms some other promising broadcasting protocols that exist in the current literature.
UR - http://www.scopus.com/inward/record.url?scp=77954329167&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77954329167&partnerID=8YFLogxK
U2 - 10.1109/AINA.2010.91
DO - 10.1109/AINA.2010.91
M3 - Conference contribution
AN - SCOPUS:77954329167
SN - 9780769540184
T3 - Proceedings - International Conference on Advanced Information Networking and Applications, AINA
SP - 526
EP - 532
BT - 24th IEEE International Conference on Advanced Information Networking and Applications, AINA 2010
Y2 - 20 April 2010 through 23 April 2010
ER -