IDEAS home Printed from https://ideas.repec.org/a/gvu/tcsst0/v3y2021i3id1989.html

Efficient Routing Algorithm using MLP and RBX in a Four Model Neural Networks

Author

Listed:
  • C Anand

Abstract

Two important paradigms which are contradicting by nature namely: the efficient routing information diffusion and adaptability to dynamic network conditions using wireless routing protocols have been researched in recent years. One way of solving this issue is by using the past experiences of a node in network traffic condition through intelligent algorithm to predict the network traffic condition in the future. In this methodology we propose an algorithm which is used to to predict one hop delay per packet during routing process using neural networking. The one hop delay that is predicted is then further used by the participating nodes for information diffusion during routing. Experimental analysis indicate that using tapped delay line radial basis function and tapped delay line multilayer perceptron, it is possible to predict mean delays as a time series. The inputs used for prediction are mean delay time series with traffic loads and mean delay time series itself. The pros and cons of the proposed work are also present in this paper.

Suggested Citation

Handle: RePEc:gvu:tcsst0:v:3:y:2021:i:3:id:1989
DOI: 10.36548/jtcsst.2021.3.006
as

Download full text from publisher

File URL: https://irojournals.com/tcsst/article/view/1989
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/tcsst/article/download/1989/1810
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jtcsst.2021.3.006?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gvu:tcsst0:v:3:y:2021:i:3:id:1989. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Manager (email available below). General contact details of provider: https://irojournals.com/tcsst .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.