Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Digital Communications and Networking

Modification

Articles 1 - 2 of 2

Full-Text Articles in Computer Engineering

Efficiency Of Calculating Gcd Through Computer With Help Of Modified Euclidean Algorithm, Emin Emini, Azir Jusufi, Ruhada Emini Oct 2018

Efficiency Of Calculating Gcd Through Computer With Help Of Modified Euclidean Algorithm, Emin Emini, Azir Jusufi, Ruhada Emini

UBT International Conference

Euclid’s algorithm remains to be the most efficient method for finding greatest common divisor of two full numbers. By using the meaning of congruences this research paper will make a modification in the note of the Euclid’s algorithm. Here are discussed both classic and modified methods, by putting appropriate codes and observe the duration of the calculation through the computer.


A Cross-Layer Modification To The Dsr Routing Protocol In Wireless Mesh Networks, Mustafa Ramadhan Sep 2010

A Cross-Layer Modification To The Dsr Routing Protocol In Wireless Mesh Networks, Mustafa Ramadhan

Doctoral

A cross-layer modification to the DSR routing protocol that finds high throughput paths in WMNs has been introduced in this work. The Access Efficiency Factor (AEF) has been introduced in this modification as a local congestion avoidance metric for the DSR routing mechanism as an alternative to the hop count (Hc) metric. In this modification, the selected path is identified by finding a path with the highest minimum AEF (max_min_AEF) value. The basis of this study is to compare the performance of the Hc and max_min_AEF as routing metrics for the DSR protocol in WMNs using the OPNET modeler. Performance …