Noureddine, Hadi and Ni, Qiang and Al-Raweshidy, Hamed (2010) SS-CBF: Sender-based Suppression algorithm for contention-based forwarding in Mobile ad-hoc Networks. In: Personal Indoor and Mobile Radio Communications (PIMRC), 2010 IEEE 21st International Symposium on. IEEE, New York, pp. 1810-1813. ISBN 978-1-4244-8016-6Full text not available from this repository.
Contention-based forwarding (CBF) has proven to achieve a good performance in routing in mobile and vehicular ad hoc networks. CBF's main advantage is that it does not require the knowledge about the local neighborhood, eliminating, therefore, the periodic beacon exchange that causes degradation in the network performance, especially when the density of the neighborhood is high. On the other hand, the main issue that the contention-based forwarding faces is packet duplications, which mainly occurs due to the hidden node problem. This paper introduces a suppression algorithm for contention-based forwarding to eliminate packet duplications, called Sender-based Suppression and referred to as SS-CBF. In addition to the idea of dividing the radio range of the sending node into Reuleaux triangle zones, SS-CBF assigns a time delay to every zone, which aggregates to the timer value, set by the nodes, to form the time required for deferring. Moreover, the Sending node is involved in the suppression process in order to prevent unwanted nodes from transmission. SS-CBF is simulated using OPNET 14.5 modeler and evaluated against area-based suppression scheme in terms of network overhead and effective throughput.
|Item Type:||Contribution in Book/Report/Proceedings|
|Uncontrolled Keywords:||Contention-based routing ; Reuleaux triangle ; suppression algorithm|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Departments:||Faculty of Science and Technology > School of Computing & Communications|
|Deposited On:||10 Oct 2012 16:34|
|Last Modified:||21 Jan 2017 02:39|
Actions (login required)