GDL

The Multi-Constrained Dynamic Programming Problem in View of Routing Strategies in Wireless Mesh Networks

Journal from gdlhub / 2017-08-14 11:52:32
Oleh : Sabreen M. Shukr , Nuha A. S. Alwan , Ibraheem K. Ibraheem , International Journal of Information and Communication Technology Research
Dibuat : 2012-06-23, dengan 1 file

Keyword : We address the problem of satisfying multiple constraints in a shortest-path Dijkstra-based dynamic programming (DP) framework. We solve this problem considering its applicability to routing in wireless mesh networks. Our work, therefore, relates to quality-of- service (QoS) metrics such as bandwidth, delay and the number of hops between network nodes. The present work is based on the optimization of one or more metrics while bounding the other. Specifically, we compute high-capacity paths while simultaneously bounding the end-to-end delay and the number of hops to an upper limit. We prospectively call the resulting algorithm the comprehensive mesh routing algorithm (CMRA). We show by computer simulations that the proposed algorithm features wide versatility when dealing with multiple constraints as compared to other approaches involving the optimization of a weighting function. This latter technique is not easily applicable to wireless networks due to different networking metrics having values with widely different orders of magnitude.
Subjek : The Multi-Constrained Dynamic Programming Problem in View of Routing Strategies in Wireless Mesh Networks
Url : http://esjournals.org/journaloftechnology/archive/vol2no6/vol2no6_1.pdf
Sumber pengambilan dokumen : Internet

We address the problem of satisfying multiple constraints in a shortest-path Dijkstra-based dynamic programming (DP) framework.


We solve this problem considering its applicability to routing in wireless mesh networks. Our work, therefore, relates to quality-of-


service (QoS) metrics such as bandwidth, delay and the number of hops between network nodes. The present work is based on the


optimization of one or more metrics while bounding the other. Specifically, we compute high-capacity paths while simultaneously


bounding the end-to-end delay and the number of hops to an upper limit. We prospectively call the resulting algorithm the


comprehensive mesh routing algorithm (CMRA). We show by computer simulations that the proposed algorithm features wide


versatility when dealing with multiple constraints as compared to other approaches involving the optimization of a weighting


function. This latter technique is not easily applicable to wireless networks due to different networking metrics having values with


widely different orders of magnitude.

Deskripsi Alternatif :

We address the problem of satisfying multiple constraints in a shortest-path Dijkstra-based dynamic programming (DP) framework.


We solve this problem considering its applicability to routing in wireless mesh networks. Our work, therefore, relates to quality-of-


service (QoS) metrics such as bandwidth, delay and the number of hops between network nodes. The present work is based on the


optimization of one or more metrics while bounding the other. Specifically, we compute high-capacity paths while simultaneously


bounding the end-to-end delay and the number of hops to an upper limit. We prospectively call the resulting algorithm the


comprehensive mesh routing algorithm (CMRA). We show by computer simulations that the proposed algorithm features wide


versatility when dealing with multiple constraints as compared to other approaches involving the optimization of a weighting


function. This latter technique is not easily applicable to wireless networks due to different networking metrics having values with


widely different orders of magnitude.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	International Journal of Information and Communication Technology Research
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com