Least-Latency Routing over Time-Dependent Wireless Sensor Networks

Abstract:

                    When compared with static networks, link changes and node changes are more frequent in duty-cycled WSNs. The proposed algorithms, referred to as FTSP-M (“M” meaning maintenance), focus on per-node update and can be easily extended to node insertion and deletion. The main focus of route maintenance is on routing data to sink node through highest energy level of node to base station.The proposed work concentrates on least latency of data routing, the high reliable data are given as higher priority for transmission to base station. The proposed algorithm shortest job first algorithm also investigate on the time-dependent minimum spanning tree problem, which is NP-Hard in duty-cycled WSNs .