Probabilistic counter-Based route discovery for mobile Ad hoc networks

Aminu Mohammed*, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Colin Perkins, Jamal Deen Abdulai

*المؤلف المقابل لهذا العمل

نتاج البحث: Conference contribution

21 اقتباسات (Scopus)

ملخص

Conventional on-demand route discovery for ad hoc routing protocols extensively use simple flooding, which could potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. This phenomenon has been shown to greatly increase the network communication overhead and end to end delay. This paper proposes a new probabilistic counter-based method that can significantly reduce the number of RREQ packets transmitted during route discovery operation. Our simulation results reveal that equipping AODV routing protocol with the proposed probabilistic counter-based route discovery method can result in significant performance improvements in terms of routing overhead, MAC collisions and end-to-end delay while still achieving a good throughput.

اللغة الأصليةEnglish
عنوان منشور المضيفProceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
الصفحات1335-1339
عدد الصفحات5
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 2009
الحدث2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009 - Leipzig, Germany
المدة: يونيو ٢١ ٢٠٠٩يونيو ٢٤ ٢٠٠٩

سلسلة المنشورات

الاسمProceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009

Other

Other2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
الدولة/الإقليمGermany
المدينةLeipzig
المدة٦/٢١/٠٩٦/٢٤/٠٩

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1705???
  • ???subjectarea.asjc.1700.1706???
  • ???subjectarea.asjc.1700.1712???

بصمة

أدرس بدقة موضوعات البحث “Probabilistic counter-Based route discovery for mobile Ad hoc networks'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا