REINFORCEMENT OF ROUTING PERFORMANCE IN WSN THROUGH DYNAMIC PROGRAMMING
| Author(s) | : | T.ANITHA, G.GAYATHRI |
| Institution | : | ASSISTANT PROFESSOR CSE DEPARTMENT ANITS |
| Published In | : | Vol. 5, Issue 4 — April 2018 |
| Page No. | : | 2138-2148 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
The Internet of Things has become a spotlight for a long period of time and generates massive amounts of sensordata. Thus, data centers play more and more crucial roles in processing and analyzing the explosively increasing data. Toremedy the shortcomings of traditional tree-based structure, many novel server-centric network structures have beenproposed in recent years. Their original routing mechanisms based on divide and conquer (DC) are not able to work out theshortest paths. So, there is still promotion room for communication delay reduction. Since dynamic programming (DP) is aclassical strategy to obtain optimal solution, this paper proposes a routing mechanism based on DP and applies it to datacenter for better solving the weakness occurred by DC. Experiments firmly support the conclusion that adopting DP inrouting calculation achieves appealing performance of short latency, great fault-tolerance and reasonable resourceconsumption. Theoretical analysis also proves that it is applicable to most popular structures
T.ANITHA, G.GAYATHRI, “REINFORCEMENT OF ROUTING PERFORMANCE IN WSN THROUGH DYNAMIC PROGRAMMING”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 5, Issue 4, pp. 2138-2148, April 2018.
