This paper studies the problem of maximizing network lifetime for WirelessHART networks under graph routing.

While the WirelessHART standard adopts graph routing to enhance network reliability, the problem of maximizing network lifetime for graph routing becomes a crit ...

Chen, Maximizing Network. Lifetime of WirelessHART Networks under Graph Routing, IEEE International Conference on. Internet-of-Things Design and ...

This paper proposes an optimal algorithm based on integer programming, a linear programming relaxation algorithm and a greedy heuristic algorithm to prolong ...

Experiments in a physical testbed and simulations show our algorithms can improve the network lifetime by up to 60% while preserving the reliability benefits of ...

Maximizing Network Lifetime of WirelessHART Networks under Graph Routing Conference · Overview · Research · Location · Identifiers · Additional Document Info ...

Dive into the research topics of 'Maximizing network lifetime of WirelessHART networks under graph routing'. Together they form a unique fingerprint. Sort by ...

Oct 22, 2013 · Aiming at the highly reliable WirelessHART protocol, this paper proposes a joint routing algorithm for maximizing network lifetime JRMNL. Based ...

May 31, 2024 · We propose a dynamic energy balanced max flow routing algorithm to maximize load flow within the network lifetime and balance energy consumption ...

A joint graph routing algorithm for maximizing the network lifetime (JRMNL) in WirelessHART is proposed, where node communication load factor is ...