TY - GEN
T1 - A limited flooding scheme for mobile ad hoc networks
AU - Chiang, Tzu Chiang
AU - Wu, Po Yi
AU - Huang, Yueh Min
PY - 2005/12/1
Y1 - 2005/12/1
N2 - Broadcasting is an elementary operation to support many applications in a mobile ad hoc network. However, naively broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which we refer to as the broadcast storm problem. In this paper we propose a limited flooding scheme which takes the advantage of the cluster structure and which only requires clusterheads, initial nodes and selected gateways to forward the broadcast packets. Our approach reduces control overhead of ad hoc routing protocols significantly and introduces many benefits, including efficient flooding, density adaptation and mobility adaptation. As a result, our approach enables routing scheme in a dense and high mobility mobile ad hoc networks. Simulation shows that our approach outperforms conventional AODV in the dense network, and overmatches some existing cluster schemes such as Lowest-ID or Highest-Connectivity Cluster Algorithm in the aspect of mobility adaptability.
AB - Broadcasting is an elementary operation to support many applications in a mobile ad hoc network. However, naively broadcasting by flooding may cause serious redundancy, contention, and collision in the network, which we refer to as the broadcast storm problem. In this paper we propose a limited flooding scheme which takes the advantage of the cluster structure and which only requires clusterheads, initial nodes and selected gateways to forward the broadcast packets. Our approach reduces control overhead of ad hoc routing protocols significantly and introduces many benefits, including efficient flooding, density adaptation and mobility adaptation. As a result, our approach enables routing scheme in a dense and high mobility mobile ad hoc networks. Simulation shows that our approach outperforms conventional AODV in the dense network, and overmatches some existing cluster schemes such as Lowest-ID or Highest-Connectivity Cluster Algorithm in the aspect of mobility adaptability.
UR - http://www.scopus.com/inward/record.url?scp=33747288143&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33747288143&partnerID=8YFLogxK
U2 - 10.1109/WIMOB.2005.1512940
DO - 10.1109/WIMOB.2005.1512940
M3 - Conference contribution
AN - SCOPUS:33747288143
SN - 0780391829
SN - 9780780391826
T3 - 2005 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob'2005
SP - 473
EP - 478
BT - 2005 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob'2005
T2 - 2005 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob'2005
Y2 - 22 August 2005 through 24 August 2005
ER -