Skip to Main Content
 

Global Search Box

 
 
 

ETD Abstract Container

Abstract Header

A Decentralized Application of Dynamic Programming to Communication Network Reconfiguration

Batey, Anthony R
http://rave.ohiolink.edu/etdc/view?acc_num=akron1661421052825849

Abstract Details

2022, Master of Science in Engineering, University of Akron, Electrical Engineering.
A decentralized framework for network optimization is presented for wireless sensing nodes. The wireless sensing nodes use a dynamic programming algorithm to choose optimal routes for data transmission from any network node to a specialized ‘gateway’ node that provides access to the wider internet. The dynamic programming algorithm is a variation of the Bellman-Ford algorithm and allows for the wireless sensing nodes to make decisions based on locally available network information, resulting in a decentralized routing algorithm. Routing decisions depend on the cost it takes to communicate from a node to a gateway, either directly or indirectly, using neighboring nodes as relay points. Nodes constantly share information with neighbors and when something effects the cost of a path, such as a node failure or the discovery of a less costly route, all nodes upstream along the existing path are made aware and re-route accordingly. A sample network is used to illustrate and verify the functionality of the proposed algorithm. The network and node decisions are simulated to show the evolution of the network routing decisions, and the simulation consistently shows the network converging to an optimal configuration. The speed of convergence depends on the order in which the nodes are assumed to attempt to establish and optimize their connections.
Robert Veillette (Advisor)
Jose Alexis De Abreu Garcia (Committee Member)
Nghi Tran (Committee Member)
63 p.
Applied Mathematics; Computer Engineering; Computer Science; Electrical Engineering; Engineering
Optimal Control; Dynamic Programming; Decentralized Network; Optimal; Routing; Protocol; Bellman; Wireless; Sensing; Nodes; Network; Computer Networking;

Recommended Citations

Citations

  • Batey, A. R. (2022). A Decentralized Application of Dynamic Programming to Communication Network Reconfiguration [Master's thesis, University of Akron]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=akron1661421052825849

    APA Style (7th edition)

  • Batey, Anthony. A Decentralized Application of Dynamic Programming to Communication Network Reconfiguration. 2022. University of Akron, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=akron1661421052825849.

    MLA Style (8th edition)

  • Batey, Anthony. "A Decentralized Application of Dynamic Programming to Communication Network Reconfiguration." Master's thesis, University of Akron, 2022. http://rave.ohiolink.edu/etdc/view?acc_num=akron1661421052825849

    Chicago Manual of Style (17th edition)

akron1661421052825849
197
© 2022, all rights reserved.
This open access ETD is published by University of Akron and OhioLINK.