TY - GEN
T1 - New adaptive counter based broadcast using neighborhood information in MANETS
AU - Yassein, M. Bani
AU - Al-Dubai, A.
AU - Khaoua, M. Ould
AU - Al-jarrah, Omar M.
PY - 2009
Y1 - 2009
N2 - Broadcasting in MANETs is a fundamental data dissemination mechanism, with important applications, e.g., route query process in many routing protocols, address resolution and diffusing information to the whole network. Broadcasting in MANETs has traditionally been based on flooding, which overwhelm the network with large number of rebroadcast packets. Fixed counter-based flooding has been one of the earliest suggested approaches to overcome blindflooding or the "broadcast storm problem". As the topological characteristics of mobile networks varies instantly, the need of an adapted counter-based broadcast emerge. This research argues that neighbouring information could be used to better estimate the counter-based threshold value at a given node. Additionally results of extensive simulation experiments performed in order to determine the minimum and maximum number of neighbours for a given node is shown. This is done based on locally available information and without requiring any assistance of distance measurements or exact location determination devices.
AB - Broadcasting in MANETs is a fundamental data dissemination mechanism, with important applications, e.g., route query process in many routing protocols, address resolution and diffusing information to the whole network. Broadcasting in MANETs has traditionally been based on flooding, which overwhelm the network with large number of rebroadcast packets. Fixed counter-based flooding has been one of the earliest suggested approaches to overcome blindflooding or the "broadcast storm problem". As the topological characteristics of mobile networks varies instantly, the need of an adapted counter-based broadcast emerge. This research argues that neighbouring information could be used to better estimate the counter-based threshold value at a given node. Additionally results of extensive simulation experiments performed in order to determine the minimum and maximum number of neighbours for a given node is shown. This is done based on locally available information and without requiring any assistance of distance measurements or exact location determination devices.
KW - Broadcast storm problem
KW - Counter-based
KW - Flooding
KW - MANET
KW - Neighbourhood information
UR - http://www.scopus.com/inward/record.url?scp=70449868862&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449868862&partnerID=8YFLogxK
U2 - 10.1109/IPDPS.2009.5161179
DO - 10.1109/IPDPS.2009.5161179
M3 - Conference contribution
AN - SCOPUS:70449868862
SN - 9781424437504
T3 - IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium
BT - IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium
T2 - 23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009
Y2 - 23 May 2009 through 29 May 2009
ER -