Joint design of Dijkstra's shortest path routing and sleep-wake scheduling in wireless sensor networks

Thomas, Susan; Gayathri, I. K.; Raj, Aiswariya

doi:10.1109/icecds.2017.8389583

Cited by 10 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the topology in Figure 13, the number of published samples and subscriber hosts changed and the test was performed. In the experimental environment, all paths were specified as the minimum path using Dijkstra’s algorithm [57].…”

Section: Discussionmentioning

confidence: 99%

Dependable Fire Detection System with Multifunctional Artificial Intelligence Framework

Park

Lee

Yun

et al. 2019

Sensors

View full text Add to dashboard Cite

A fire detection system requires accurate and fast mechanisms to make the right decision in a fire situation. Since most commercial fire detection systems use a simple sensor, their fire recognition accuracy is deficient because of the limitations of the detection capability of the sensor. Existing proposals, which use rule-based algorithms or image-based machine learning can hardly adapt to the changes in the environment because of their static features. Since the legacy fire detection systems and network services do not guarantee data transfer latency, the required need for promptness is unmet. In this paper, we propose a new fire detection system with a multifunctional artificial intelligence framework and a data transfer delay minimization mechanism for the safety of smart cities. The framework includes a set of multiple machine learning algorithms and an adaptive fuzzy algorithm. In addition, Direct-MQTT based on SDN is introduced to solve the traffic concentration problems of the traditional MQTT. We verify the performance of the proposed system in terms of accuracy and delay time and found a fire detection accuracy of over 95%. The end-to-end delay, which comprises the transfer and decision delays, is reduced by an average of 72%.

show abstract

Section: Discussionmentioning

confidence: 99%

Dependable Fire Detection System with Multifunctional Artificial Intelligence Framework

Park

Lee

Yun

et al. 2019

Sensors

View full text Add to dashboard Cite

show abstract

“…Once defined, it is possible to connect all settlements within each modeling region by fitting a minimum spanning tree based on Dijkstra's algorithm, which is a common approach for least-cost telecom network design and routing [98]- [100]. Thus, the shortest potential path is estimated to create the leastcost network structure that connects all nodes in each modeling region.…”

Section: B Spatial Processingmentioning

confidence: 99%

Engineering-Economic Evaluation of Diffractive NLOS Backhaul (e3nb): A Techno-economic Model for 3D Wireless Backhaul Assessment

2022

View full text Add to dashboard Cite

show abstract

“…The Dijkstra's shortest path routing and sleep-wake scheduling (DSRSS) uses the Dijkstra's protocol related to the routing optimization of network lifetime of nodes. However, this protocol does not consider the QoS requirements for multimedia applications [22]. However, the above protocols have not considered routing metrics such as maximum energy, energy threshold, and delay as the basis for making routing decisions simultaneously.…”

Section: Introductionmentioning

confidence: 99%

A novel energy-efficient dynamic programming routing protocol in wireless multimedia sensor networks

Putra,

Satria,

Azwar

et al. 2024

Bulletin EEI

View full text Add to dashboard Cite

Wireless multimedia sensor networks (WMSNs) have characteristics that may influence the routing decisions, such as limited energy resources, storage and computing capacity. Therefore, a routing optimization needs to be done to match the characteristics of the WMSNs. Existing routing protocols only consider energy efficiency regardless of energy threshold, maximum energy, and link cost collectively as the primary basis of routing. In this work, the energy-efficient dynamic programming (EEDP) protocol is proposed to optimize routing decisions that take into account the energy threshold, the maximum energy, and the link cost. Then, the protocol is compared with the dynamic programming (DP), and the ant colony optimization (ACO) protocol. The simulation results show that the EEDP protocol can improve energy efficiency of nodes and network lifetime of the WMSNs. Then, the EEDP protocol is also implemented into a network topology of 10 NodeMCU ESP32 devices. As a result, the EEDP protocol can work very well by selecting routes based on nodes that have the remaining energy above 50 and has the shortest distance. The average delay in sending data for the entire route for the 10 iterations of sending data is 3.99 seconds.

show abstract

Joint design of Dijkstra's shortest path routing and sleep-wake scheduling in wireless sensor networks

Cited by 10 publications

References 16 publications

Dependable Fire Detection System with Multifunctional Artificial Intelligence Framework

Dependable Fire Detection System with Multifunctional Artificial Intelligence Framework

Engineering-Economic Evaluation of Diffractive NLOS Backhaul (e3nb): A Techno-economic Model for 3D Wireless Backhaul Assessment

A novel energy-efficient dynamic programming routing protocol in wireless multimedia sensor networks

Contact Info

Product

Resources

About