An Energy Efficient Routing Approach for Cloud-Assisted Green Industrial IoT Networks

The green industrial Internet of things (IIoT) is emerging as a new paradigm, which envisions the concept of connecting different devices and reducing energy consumption. In multi-hop low power and lossy network, a resource-constrained node should aware of its energy consumption while routing the data packets. As part of IoT, the routing protocol for low power and lossy network (RPL) is considered to be a default routing standard. Recently, RPL has gained a significant maturity, but still, energy optimization is one of the main issues, because the default objective function (OF), which makes routing decision mainly based on a single parameter, such as link quality, and ignores the energy cost. Therefore, this paper aims to consider the concept of green IIoT concerning how a routing approach can achieve energy efficiency in resource-constrained IoT networks. For this, we propose a resource aware and reliable OF (RAROF), which constructs an optimum routing path by exploiting the information regarding the duty cycle, link quality, energy condition, and resource availability of a node. In addition, we propose node vulnerability index (NVI), a new routing metric that identifies the vulnerable nodes in terms of energy. To deal with the diverse data traffic of the IIoT network, we implement a multi-queuing based traffic differentiation approach that ensures the application requirements. The extensive simulation results show that the proposed RAROF can effectively extend the lifetime of the network, enhance the energy efficiency, and achieve higher reliability than that of other OFs. In this way, RAROF makes a routing decision with the purpose of extending network lifetime and minimizing energy depletion, paving the way towards green IIoT.


Introduction
In recent years, we have seen considerable advances in terms of utilizing cloud platforms in the industrial Internet of things (IIoT) network architectures [1]. The emerging Internet of things (IoT) concept is expected to be a significant enabler for building the traditional industrial system more intelligent and efficient. Moreover, it also provides the opportunity to transform the traditional functioning of several existing industrial systems such as healthcare and manufacturing. To this end, IIoT plays an important role in improving and simplifying the way to monitor, manage, and control industrial processes through integrated sensors, actuators, data management, and analytics [2]. IIoT is an emerging heterogeneous networking paradigm equipped with various smart devices, sensors, and actuators designed for different industrial domains. Both the classic IoT and IIoT have many technologies in common such as machine-to-machine communication, data analytics, automation, and cloud platform, but they have different objectives, users, and operational processes. In general, IoT applications are more concerned with consumer usages, such as smart appliances, smart homes, and wearables, whereas IIoT is most commonly designed for industrial purposes such as healthcare Besides, for efficient data delivery in IoT applications such as emergency monitoring, the forwarding node should be aware of nodes' sleep and awake states. Based on this understanding, in this paper, we propose a resource aware and reliable OF (RAROF) based on RPL specification to enable the IIoT system more reliable and energy-efficient. For efficient data delivery, RAROF builds an optimum path by exploiting the information regarding the duty cycle, link quality, and energy condition of the node through which a node sends the data packets. Our contribution in this paper can be summarized as follows: • This paper enhances the routing approach in RPL for the IIoT system with different data flows. For this, RAROF selects the reliable path focusing on the node resources. Unlike default path selection, we consider different routing metric that represents the node as well as link characteristics. Besides, these routing metrics are aimed to respond to the requirement of the IIoT applications. • A new routing metric named node vulnerability index (NVI) is proposed, which includes the duty cycle information, link quality, energy profile of a node during the path selection process for network life improvement.

•
We aim to put forward a simple conceptual cloud-assisted emergency monitoring system architecture for RPL based IIoT application. The composite architecture specifies the application of RPL by focusing on reforming industrial operations through cutting-edge technologies.

•
We propose a simple multi-queueing approach to deal with the diverse data traffic generated from the IoT application. In this perspective, the queuing model is responsible for employing the prioritization of each packet according to the traffic sensitivity.

•
We analyze the effectiveness of our proposed approach in different aspects by conducting extensive simulation tests through the Cooja simulator.
The rest of the paper is organized as follows: Section 2 presents the design issue and routing challenges in IIoT networks. The recent related research work is presented in Section 3. The preliminaries of the work are presented in Section 4. Section 5 describes the proposed work in detail, and also provides the cloud-assisted IEMS architecture. Section 6 presents the experimental setup, simulation study, performance evaluation of the proposed RAROF with the comparisons, and discusses the key points of the proposed work. Finally, Section 7 concludes the paper.

Design Issues and Routing Challenges in Green Industrial IoT Networks
Industrial wireless networks are deployed with self-organizing, flexibility, and inherent smart processing ability. In order to make the industrial network green, the underlying communication technologies and routing strategy need to optimize that can satisfy the energy hunger of resource-constrained smart devices. In this paper, the green IoT concept is considered in a viewpoint of how the routing approach can achieve energy efficiency in the resource-constrained IoT system. While state-of-the-art technologies being considered, the industrial wireless network still presents different challenges, for instance, unstable communication links, limited resources (low bandwidth, storage, energy, etc.), and varied traffic pattern. These unique characteristics pose a significant challenge to the design of reliable and efficient routing solutions. Based on the purpose and requirements of the application, routing protocols in IIoT networks may face the following challenges:

Wireless Links and Communication Patterns
Harsh environment in industries are prone to high RF interference due to presence of several equipment, human, and obstacles. This adverse condition may result in wireless link instability and path disruption, which severely impact on data transmission of IIS. Furthermore, this situation leads to increased packet error rate and delay. Based on the application characteristic, the range of link delay may vary from a few seconds to minutes. On the other hand, different wireless communication technologies are used in the IIoT system; for energy efficiency, routing overhead should be reduced. The underlying routing protocol is the key player for path selection should address this instability and maintain reliable communication path.
The heterogeneous nature of industrial networks and applications indicates the presence of different communication patterns, such as point-to-point, point-to-multipoint, and multipoint-to-point. The presence of different communication patterns imposes challenges to data collection and distribution in an industrial environment [19]. Reliable data delivery is an important aspect in IEMS because the data can be transferred for different purposes, such as real-time monitoring, remote control, and emergency response.

Resource Constraints and Interoperability
IoT devices have limited resources in terms of energy supply, storage capacity, processing power, and transmission capacity due to their physical design conditions. Because of the hardware constraints, the routing approach should be implemented with minimal code and require a low routing state to be suitable for the device capacity. As a result, the routing design and implementation of IIoT concept are subject to some restrictions. In this regard, 6LoWPAN technology enables nodes to reduce power consumption and improve robustness due to its low complexity. Overall, these limitations are reflected in the protocol performance, so a lightweight routing protocol with low computational and energy requirements are needed. Moreover, some use cases in IIoT require users to deploy a large number of sensing and monitoring devices to be effective. Node placements range from hundreds to thousands, and the minimality should be considered for maximum benefit and utilization of resources. Therefore, seamless interaction with external networks (i.e., cloud or Internet) infrastructure is essential for making the IEMS more intelligent and pragmatic. Different techniques, such as in [20,21], can be adopted to overcome the energy challenges of routing algorithms.

Data Heterogeneity and Flow
Different applications may need to simultaneously transmit different types of data (critical, non-critical, real-time, etc.) over the same link and to the same destination. In some cases, the traditional wireless networks are assumed to be homogeneous in terms of the data generated by the devices, but IIoT networks are heterogeneous. In IEMS applications, it is normal to have multiple devices installed in different places for specific purposes. Hence, it generates different data traffic depending on the use cases, such as heat monitoring, water and gas leakage, emergency alarm, fault detection, etc. This requires that the underlying communication mechanism reliably handles data delivery with specific requirements in terms of service availability. An efficient channel assignment algorithm and an interference-aware routing scheme could be a solution to some extent for the heterogeneous nature of IoT networks [22].

QoS Provision in Resource-constrained Networks
The extensive use of the IoT concept has contributed to the presence of RPL, which enables smart devices to interact or communicate in the surrounding ambient at anytime and anywhere. Recently, many studies have been conducted on the various aspect of RPL optimization, such as congestion control [23], data aggregation [24], security and mobility [25,26], and OF design [27]. While RPL significantly satisfies the requirements of LLN for IoT based applications, to be fit in the IIoT concept, some aspects are crucial, such as energy efficiency and reliable routing. Due to the unique characteristic of wireless networks, it is difficult to define QoS parameters, and also poses additional challenges for QoS support. Therefore, to overcome these challenges, the authors in [28,29] provide different solutions for various application domains. There are two common approaches for QoS provisioning one is layered, and the other is cross-layered. In the individual layer, QoS provisioning depends upon layer capability. The layered approach provides the QoS with protocols that operate merely in each Sustainability 2020, 12, 7358 6 of 26 layer of the communication protocol stack, whereas the cross-layered approach achieves the QoS provisioning through the interaction of multiple layers concurrently. However, there is no variation between both approaches in terms of QoS support. The authors in [30] have conformed the widespread use of QoS provisioning with service differentiation compared to deterministic based QoS provisioning approaches. Therefore, most protocols follow the classification of packets based on traffic type, and packets from different classes are processed according to their requirements by tuning the MAC layer parameters. The traditional methods based on the resource reservation, route recovery during topological changes, and end-to-end path discovery are not suitable in LLNs for several reasons.
Based on this understanding, in the IIoT networks, it is essential to facilitate prioritization among different traffic classes when designing routing algorithms. This characteristic could be considered through different mechanisms. For instance, a priority queue system could be applied to differentiating the traffic with different QoS requirements. On the contrary, the mechanism implemented for QoS provisioning can exploit the multipath routing system. The authors in [31] presented a comprehensive survey on multipath routing protocols for QoS assurance. The study primarily focused on real-time multipath routing techniques for wireless multimedia sensor networks. In terms of QoS, a recent study shows that unlike single-path routing protocols, multipath routing protocols are suitable for WSNs. In fact, multipath routing protocols reduce the possibility of packet loss while utilizing redundant paths to the root [32]. Therefore, this mechanism can be used for a reliable-sensitive network where reliable information forwarding is essential, whereas real-time applications where delay-sensitivity is considered as basic QoS support this system may violate the specific application requirement. Multipath forwarding optimization has been proposed in [33] to minimize the average delay towards the root node based on the composite metric. The proposed work points out that default single-metric-based OFs are vulnerable in situations where congestion occurs due to a sudden increase in traffic volume, resulting in packet loss and delay. In this context, multipath forwarding techniques are desirable in LLN environments to achieve the desired QoS. However, some issues should be considered carefully while designing a routing protocol. Some of the issues about multipath approaches are high complexity, fragmentation, and overhead. Moreover, the high overheads incurred by multipath techniques in terms of communication and computation is unsuitable for devices with limited resources as well as for large-scale networks like the IIoT.

Emergeing Technologies for Resource-Constrained Networks
With rapid technological development, the new green IoT Concept aims to realize a sustainable smart world by reducing the energy consumption of the IoT ecosystem. The authors in [34], review the green information and communication technology (ICT) principles, and summarize the contemporary developments regarding future and current sensor-cloud. Moreover, future research directions and open issues related to green IoT has been presented. Turn off facilities that are not needed is the one widely used green ICT principles. Sleep schedule is the key technique for saving energy consumption by allowing nodes to wake up and sleep dynamically. With this understanding, we can conclude that green IoT focuses mainly on energy efficiency in the IoT ecosystem. Recently, in [2], many technological solutions have been proposed for implementing green IoT. Likewise, the authors in [35] presents the comparative analysis of different green IoT approaches. Besides, the energy efficiency models have been categorized based on the used technologies. Regarding the energy-efficient deployment of IoT devices, the authors in [36] have presented a framework for implementing the green IoT.
On the other hand, the sensor-cloud concept is attracting great interest from the research community, paving the way towards green IoT. It is a new concept, aimed to implement as an interface between the physical and cyber worlds with the data collection and processing capabilities of wireless networks. The basic model of the cloud-sensor is to collect various sensing data from the surrounding ambient and transmit to the cloud for further processing and storage. The authors in [37] explained the motivation behind using the cloud sensor. The concept is fundamentally a cloud platform for the collection, storage, Sustainability 2020, 12, 7358 7 of 26 and analysis of a large amount of sensed data in a seamless manner. Cloud integration has many promising advantages, which can contribute to the benefits for users and industrial wireless networks.

RPL Optimization for Resource-Constrained Networks
In the RPL scope, route selection is primarily based on a single metric, which may lead to an unbalanced network load. The overloaded node may consume more energy, thus draining their battery quickly than others, which eventually causes a network partition; this results in a significant impact on overall network performance and QoS requirements. Hence, an energy-oriented routing approach for QoS support is one of the key challenges in the resource-constrained network like IIoT. In this regard, some energy optimization approaches for RPL implementation have been presented by the research community in the recent years. Most of the work focuses on designing the OF that includes new energy related routing metrics.
The authors in [38] proposed an energy efficient and reliable composite metric for RPL organized networks. The proposed composite metric considers both energy and reliability parameters to select the optimum path. It takes into account the reliability through link metric, i.e., expected transmission count (ETX), and balances the network energy consumption through considering the nodes' energy availability. To make the energy-efficient and reliable RPL, the proposed metric named lifetime and latency agreeable metric (L 2 AM) allows the nodes to select the best parent by avoiding the congested one by estimating the traffic. However, it ignores the duty cycle status of a node during the parent selection process. In addition, the congestion alleviation process can cause frequent parent change in the network, making the network unstable, which is not appropriate for emergency monitoring IIoT network.
The authors in [39] proposed a virtual version of the RPL protocol, referred to as optimized multi-class RPL (OMC-RPL), based on a software-defined networking approach and virtualization. OMC-RPL focused on designing the enhanced OF with a composite routing metric. For this, it combines four weighted metrics to support multi-class traffic using software-defined networking (SDN)techniques. The weights of the metric are determined using the particle swarm optimization algorithm. Out of four metrics, the energy metric is considered as a secondary metric (optional) and therefore used whenever required. Even though the OMC-RPL considers different metrics, including the energy parameter, this virtual version of RPL may not fulfill the IIoT application requirements because it limits the energy profile of the nodes.
Recently, a new mobility-aware and energy-efficient parent selection method for LLNs has been proposed in [40]. The parent selection scheme select the optimum parent based on different routing metrics, such as ETX, expected lifetime, received signal strength indicator (RSSI), and distance of the mobile node and the parent node. Additionally, the authors proposed an optimized version of the Trickle timer called dynamic Trickle. This parent selection method mainly focuses on the issue of switching from one parent to another due to mobility. To prolong the network lifetime and minimize the energy use in smart grid networks, the authors in [41] proposed the new routing mechanism. For this, an efficient routing metric named energy and congestion-aware routing metric (ECRM) has been designed. ECRM considers the nodes' queue and residual energy information to select the next-hop node towards the root. To improve overall network performance, the node simply selects a parent node with a less queue occupancy and high remaining energy. However, finding such a node is not always be feasible. Different metric composition techniques have been presented in the literature to enhance the OF implementations in RPL and optimize the network resources. In this regard, the authors in [42] presented a new objective function named context-oriented OF (COOF) to utilize the network resources efficiently. COOF selects the best route based on the fuzzy logic technique using contextual information in which the node's queue, energy, and link status are considered as resource context. Another enhancement of RPL to satisfy the challenges imposed by the Internet of multimedia things has been proposed in [43]. The authors proposed a new version of the RPL routing protocol named green-RPL to enable green communication for multimedia connected networks. Such energy-efficient routing solution reduces the network carbon footprint emissions by ensuring the QoS requirements of the multimedia application. In green-RPL, a node selects the preferred parent based on the set of network metrics, including battery consumption and energy source types. In terms of packet delivery, the green-RPL is better as compared to the default RPL OFs; on the other hand, green-RPL is less energy efficient than ETX.
In [44], the authors have proposed a new energy consumption(EC) aware RPL-compliant OF using fuzzy logic named OF-EC. It combines multiple metrics such as ETX, hop count, and energy consumption to deal with the limitations of the single metric based RPL implementation. Although OF-EC combines node and link metric using membership function to select a parent node, it has neglected the resource utilization of a node, whilst it is one of the main concerns for resource-constrained networks. Similarly, the authors in [45] have introduced a new OF for efficient routing (ER) called OF-ER. To select the best parent, OF-ER uses the composite efficient routing metric. This metric takes into account multiple metrics, namely, ETX, queue utilization, delay, lifetime of node, and number of bottleneck nodes. However, it simply combines these metrics regardless of the isotonicity and monotonicity characteristics of the routing metrics.
Although energy metrics have been widely used in RPL optimization, there have been limited studies on consideration of duty cycling for energy profiling during routing metric design. Moreover, most of the above RPL extensions adopt the residual energy of a node, either alone or in combination with other nodes or link metrics, so as to choose the best path. Besides, RPL enhancements have been made either for specific purposes, such as congestion control, mobility or designed to support various protocol functioning using techniques such as fuzzy logic, SDN, etc. Reliable data communication in order to ensure the ideal emergency monitoring system in different industrial operations is essential, in which the IIoT network may generate various types of data traffic such as time-critical and delay-tolerant. This backdrop motivates the authors to design the new composite routing metrics and OF to optimize RPL for the IEMS use case of IIoT. In order to extend the network life through reliable data delivery for the resource-constrained network, not only the resource availability is important but also the nodes' sleep and awake status is vital. Moreover, heavy computational systems like fuzzy logic, particle swarm optimization may degrade the performance of a resource-constrained network. Therefore, to distinguish the efficiency of the RAROF, we have considered fuzzy logic-based OF-EC and resource-aware OF-ER as benchmarks for the comparison.

Preliminaries
In this section, we introduce an overview of the RPL routing protocol and the IEEE 802.15.4 standard in brief.

IEEE 802.15.4 Based Low-Power Wireless Networks
The IEEE 802.15.4 standard is considered to be fit for constrained networks in the IIoT domain because it allows low-rate low-cost communications [46]. It defines the media access control (MAC) and PHY layers for low-rate wireless personal area networks. This standard is the basis for many other technologies, such as WirelessHART and ZigBee. Furthermore, it is also used with RPL and 6LoWPAN for energy efficient operation. IEEE 802.15.4 based network supports two types of node full function devices and reduced function devices and can form a star, point-to-point, and cluster-tree topology. Principally, IEEE 802.15.4 defines two modes of operation, i.e., beacon-enabled and non-beacon, in which both operations make use of the carrier sense multiple access/collision avoidance (CSMA/CA) mechanism for channel access. In non-beacon-enabled mode, each node access the channel using a typical unslotted CSMA/CA technique, whereas beacon-enabled mode employs the superframe structure for channel access with slotted CSMA/CA mechanism. In our proposition, we take into account the beacon-enabled mode of operation because it enables an active and inactive section of the beacon interval for energy-efficient operation. Hence, in the following, we only describe slotted CSMA/CA and the superframe structure.
Even though IEEE 802.15.4 protocol supports three different network topologies, beacon-enabled mode functions only in star or cluster-tree topology. The router or coordinator periodically transmits beacon frames to end devices to ensure node synchronization. This synchronization allows the device to sleep between coordinated transmissions to avoid idle listening, which results in increasing the life of the network. Since the beacon frames are broadcasted periodically, each beacon interval is divided into an active period, called a superframe, and an inactive period in which the node is in a low power state. Based on the duration of these two sections, the duty cycle of a node is determined. Figure 1 show the superframe structure of IEEE 802. 15.4. On the other hand, during CFP, no transmission use CSMA/CA to access the channel. IEEE 802.15.4 standard allows nodes to use their reserved slots by providing guaranteed time slots (GTS) for QoS demanding applications. In our proposition, to provide the emergency monitoring service guarantee we use GTS for transmitting real-time traffic. To save the energy nodes can sleep during inactive period and the router define this period by selecting BI must be greater than SD ( BI SD  ). The length of BI and SD is determined by the beacon order (BO) and superframe order (SO) as follows.
where aBaseSuperframeDuration is the number of symbols defined by the standard based on the data rate and frequency. Therefore, it denotes the minimum superframe duration corresponding to 0 SO = , which is 15.36 ms while assuming 2.4 GHz frequency band and 250 kbps rate. Therefore, in our proposal, we consider this for defining the superframe duration. When non beacon-enabled mode is selected both the BO and SO is set to 15 and the router will not send any beacons and guaranteed service is not permitted.

RPL Routing Specification
RPL is a distance vector routing protocol that makes use of IPv6 based addressing technique and operates on top of the IEEE 802.15.4 and supports various types of link-layer technologies such as ZigBee and Bluetooth. It is capable of constructing a robust tree-like topology that connects hundreds of resource-constrained devices in the network, typically known as a directed acyclic graph (DAG). Each node in a graph connects in a way where there exist no cycles. The DAG is destined to one or more root and generally known as destination oriented DAG (DODAG). The DODAG root constructs and maintain the network through different control messages. For this, RPL specifies three main Internet control message protocol version 6 (ICMPv6) messages and exchange the network-related information. These messages are DODAG information object (DIO), DODAG information solicitation (DIS), and designation advertisement object (DAO). The DODAG root node initiates the topology formation process by broadcasting the network information through the DIO message. Once the DIO message is received by the neighboring nodes, they decide whether to join the network or not, based on the OF and policy. Afterward, the node adds the address of the DIO sender in its candidate parent table and calculates the rank, abstract distance between a node and the root node, based on the defined metric and OF, which must monotonically increase towards the leaf node. Each node selects the preferred parent (next hop towards the DODAG root) from the candidate parent set that has the best rank. In this way, the upward path from leaf nodes to the root node can be established. In RPL The superframe structure is bounded by beacons and divided into equal 16 slots. The coordinator or router defines the format of the superframe based on the two fundamental parameters, which are beacon interval (BI) and superframe duration (SD). The coordinator transmits the next network beacons at the end of the BI, so BI is the time duration between two consecutive beacons. The BI is divided into two portions active and inactive period. The active portion of the BI duration is known as the SD in which frames can be transmitted. Further, the SD is composed of the fixed sized slots of a contention access period (CAP) and a contention free period (CFP). During CAP, any node wishing to communicate shall compete to access the channel using a slotted CSMA/CA mechanism. On the other hand, during CFP, no transmission use CSMA/CA to access the channel. IEEE 802.15.4 standard allows nodes to use their reserved slots by providing guaranteed time slots (GTS) for QoS demanding applications. In our proposition, to provide the emergency monitoring service guarantee we use GTS for transmitting real-time traffic. To save the energy nodes can sleep during inactive period and the router define this period by selecting BI must be greater than SD (BI SD). The length of BI and SD is determined by the beacon order (BO) and superframe order (SO) as follows.
where aBaseSuperframeDuration is the number of symbols defined by the standard based on the data rate and frequency. Therefore, it denotes the minimum superframe duration corresponding to SO = 0, which is 15.36 ms while assuming 2.4 GHz frequency band and 250 kbps rate. Therefore, in our proposal, we consider this for defining the superframe duration. When non beacon-enabled mode is selected both the BO and SO is set to 15 and the router will not send any beacons and guaranteed service is not permitted.

RPL Routing Specification
RPL is a distance vector routing protocol that makes use of IPv6 based addressing technique and operates on top of the IEEE 802.15.4 and supports various types of link-layer technologies such as ZigBee and Bluetooth. It is capable of constructing a robust tree-like topology that connects hundreds of resource-constrained devices in the network, typically known as a directed acyclic graph (DAG).
Each node in a graph connects in a way where there exist no cycles. The DAG is destined to one or more root and generally known as destination oriented DAG (DODAG). The DODAG root constructs and maintain the network through different control messages. For this, RPL specifies three main Internet control message protocol version 6 (ICMPv6) messages and exchange the network-related information. These messages are DODAG information object (DIO), DODAG information solicitation (DIS), and designation advertisement object (DAO). The DODAG root node initiates the topology formation process by broadcasting the network information through the DIO message. Once the DIO message is received by the neighboring nodes, they decide whether to join the network or not, based on the OF and policy. Afterward, the node adds the address of the DIO sender in its candidate parent table and calculates the rank, abstract distance between a node and the root node, based on the defined metric and OF, which must monotonically increase towards the leaf node. Each node selects the preferred parent (next hop towards the DODAG root) from the candidate parent set that has the best rank. In this way, the upward path from leaf nodes to the root node can be established. In RPL scope, it is not mandatory that OF should use a particular routing metric, consequently, the OF can be defined according to the application requirements. Technically, we can use OF for two purposes, the rank calculation and optimum path selection based on routing metrics and constraints. As described in [16], different node and link metrics can be used during topology construction and route selection. Therefore, it is possible to use multiple routing metrics to fulfill the application goal, which is one of the objectives of this paper.

Integration Between RPL and IEEE 802.15.4
Our proposal attempts the coupling of the RPL routing protocol and the beacon-enabled IEEE 802.15.4 to support different QoS requirements of the emergency monitoring IIoT application. This integration enables efficient data delivery while reducing the energy consumption. These standards operate in two different layers therefore the network structure maintained by RPL is different with topology required in IEEE 802.15.4. In RPL structure, one node may associate with multiple parent nodes, while in IEEE 802.15.4 multi-hop structure, a node can associate with only one parent node. As a result, this structure may suffer from the beacons collisions while networking synchronization. Therefore, the superframe needs to schedule in a way that collision-free slots can be assigned and handling the overlapping superframes. Therefore, in our proposition, we implement the simple distributed beacon scheduling algorithm presented in [47]. Basically, the algorithm assigns the superframe slots randomly as well as on a greedy basis.

Proposed Energy Efficient and Reliable Routing Approach
In this section, we first present a general idea of the network model and assumptions related to the energy-efficient routing approach. Following this, we describe the routing metric and OF to support the traffic differentiation for the IIoT network, employing the RPL routing strategy.

Network Model and Assumptions
We consider an IIoT based emergency monitoring network scenario in RPL that consists of a number of LLN devices communicating in a multi-hop manner and form the directed acyclic graph. The devices in the network are deployed as V = N ∪ R, where N = {n 1 , n 2 , n 3 , . . . , n n } denotes the set of nodes that can generate and transmit data packets, and R denotes the set of all DODAG roots that can collect the data packets generated by the network. The whole network is modeled as a directed , v m } is the set of all the devices in the network, and E is the set of all communication links among these devices. A connection link e exists between nodes (e(v i , v j ) ∈ V) if v i and v j are in the transmission range of each other. The proposed monitoring network is heterogeneous in which resource-rich routers manage each of the DAG. Each node in the DAG connects in a way that the tree-shaped topology is formed. If the node is configured as a router, the node sends updated DIO messages to its neighbors to join the network. Otherwise, if the node is configured as a normal node, it simply joins the network and operates as a leaf (child node) in a tree to send their sensing information to the router (parent node). In a DAG structure, unlike a typical tree structure, a node can have multiple parent nodes. The node selects one as a preferred parent from the parent set. We assume that N devices are distributed randomly in the monitoring network region controlled by the DODAG roots R. The transmission power range of every node is equal, and each node in the network is identified by a unique identifier, for example, an IPv6 address. Thus, a network is fully connected, and data can be sent from one node to another in a multi-hop manner. We also assume that the LLN devices are stationary for their lifetime. In regards to the neighbor discovery in the network, we consider the IPv6 neighbor discovery protocol. Furthermore, at any time, each LLN device can compute its energy level and has precise information about their local state (state information about all outgoing links). For this, we use the energy estimation module of Contiki OS. The entire tree-shaped network is divided into two DODAGs, each having a root, which is responsible for controlling the routing. Each DODAG root performs data aggregation and forwards it to the local cloud for further action. The routing path Rp from source node v i to destination node v j Here, R is a finite set of all the potential routing paths in the network. In a routing path, v x are nodes, such that i ≤ x ≤ j. If all nodes from v i to v j are distinct, then the routing path Rp is simple. Otherwise, if v i = v j , then it is the form of a loop in a routing path Rp. For more detail, please refer to [16].

Primitive Requirements for Routing Metric
The use of the RAROF is to optimize the RPL performance for emergency monitoring IIoT network, so the applied metric needs to comply with the properties of consistency, optimality, and loop-freeness as defined in [48]. Let's assume, Rp is a path from the source to the destination node, and v j is the on-path node, then ϕ(Rp, v j ) signifies the next-hop of v j on Rp. In this case, if v j is the destination node of Rp, then ϕ(Rp, v j ) = NULL. Therefore, ϕ(Rp, v j ) represents the next-hop on the path to the destination in a multi-hop routing in which v j stores routing information in its table. Each node updates the information when the trickle timer is reset. As explained in [16], the DAG metric container object of DIO message carries the routing metrics and other network information. In the proposed RAROF, the route selection mechanism is represented by a mapping function Γ((Rp i→ j ) ∈ R), which determines the route by calculating the different metric values (i.e., remaining energy, buffer occupancy, ETX, hop count, delay, etc.) of a path between the source node i and the destination node j. As a result, each path between nodes i and j has a cost (path weight) that can be ordered, leading to the best path selection, and packets can be routed along the lightest path.
A routing protocol is consistent if data packets from any source node v i ∈ V to any destination node v j ∈ V are delivered through any on-path node v j of Γ(Rp i→j ), then other nodes on Γ(Rp i→ j ) must take the same decision; i.e., v j forwards packets from v i to v j to ϕ(Γ(Rp i→ j ), v j ). According to [49], the routing protocol is known to be optimal if it forwards the data packets through the lightest route (minimum latency, overhead, and energy consumption, etc.) between every pair of nodes in the network. As described in [48,50], the isotonicity and monotonicity characteristics of the routing metric are pertinent to ensure whether a routing protocol can satisfy the consistency, optimality, and loop-free requirements during path construction. Therefore, in this paper, we only consider the isotonicity and monotonicity properties of the routing metrics as follows.
Suppose ≤ is used to characterize an order relation, and ⊕ is the operator used to concatenate any two routes. The isotonicity of the routing metric states that the order relation among the weights of any two routes is preserved when both routes are prefixed or suffixed by a third common route. It can be expressed mathematically, as follows.
On the other hand, the routing metric is monotonic if the path cost or weight does not improve when prefixed or suffixed by another path. Mathematically, it can be expressed as follow.

The Routing Metrics and RAROF Design
In the RPL objective function, the use of the routing metric is not only to select the path between source and destination but also to find the optimal route among all the potential routes between them. Therefore, the proposed RAROF considers different routing metrics as the route selection criteria. As explained in [27], different OFs are designed to achieve different application goals that consider the link as well as nodes' characteristics, during the parent selection process. Therefore, we consider both node and link representative routing metrics to create a composite routing metric that RAROF can use to select the best path, and through which a node forwards the data packets to ensure the reliability and energy efficiency. In order to define RPL compliant OF for IIoT networks, in which resource is the key concern, in particular the energy consumption, it is inevitable to include node metric that takes into account the energy consumption tendency and state. To this end, we have used energy-oriented metrics that anticipate the energy vulnerability of nodes and enables making a wise decision on route selection.
The NVI metric is proposed to identify the vulnerable node in terms of remaining energy (life of a node) during path construction. Since the emergency monitoring network needs a seamless operation to ensure reliable data delivery, the NVI metric is reasonable to include in routing decisions that prolong the network lifetime and provide reliability. If the maximum energy capacity and the energy already consumed by a node v i is given by Ecap(v i ) and Econ(v i ), respectively, then the NVI can be defined as follows.
where δ is a constant normalization factor used to normalize the metric value and Dc denotes the duty cycle, which is defined as the ratio of time in which the node is in active in SD within a BI. In this work, we define Ecap(v i ) as the maximum initial energy of a node. In our experiment, the value of δ is set to 10. According to [51], the appropriate Dc can be obtained based on the potential combination between SOs and BOs that satisfies Equation (1). In our proposal, we use the same function to define the duty cycle in the network. The energy consumption tendency of a node typically depends on its position, its role in the network, and other factors. To understand the energy vulnerability, we explicitly take into account the level of energy depletion within the available active duration for communication. Therefore, we ignore the idle state of the node, as radio communication is the dominant energy consumer of a node's battery. Hence, the energy consumed, Econ(v i ), by a node can be calculated as follows: where Pc(v i ) is the energy disbursed on each transmitted bit by a node i, T tr d (v i ) is the total data traffic transmitted by a node i, is the quality of the link, and D b r is the specified data rate in bits per second; where T tx (v i ) is data traffic transmitted by a node itself, T rx (v i−1 ) is the data traffic received from all the associated child nodes of a node, x denotes the set of child nodes associated in under single hop. In our experiment, we use Energest, an energy estimation module of Contiki OS. This module is used to know how long the operating states (i.e., transmission reception, processing, and low power mode) last. To know the power consumed by these states, we have used CC2420 chipset datasheet [52]. Moreover, we have used Tmote Sky nodes using CC2420, whose Tx and Rx consume almost similar energy per unit time.
Besides, to represent the quality of link ( ), we condition the ETX metric. ETX is a reliability metric and indicates the expected number of transmissions that a node required for successful data packet delivery to the destination. Suppose l i→ j is the link between two nodes i and j, then lq(i, j) represents the ETX metric in a path connecting node v i to node v j in R. Therefore, the link quality metric, lq, is an additive when it adds ETX of each link in the path to the destination node as follows: The link quality increases as the value of lq decreases, so the metric value near one indicates the optimum communication link. Consequently, the best lq metric helps in the optimal path selection, which eventually contributes to prolonging the network lifetime. The advantage of using this metric during the RPL route selection process is to avoid links with poor communication quality. In our proposal, at each node, the lq metric is measured as in Equation (7).
where lq old is the prior average ETX for a node and stores this value in its routing table, lq recent is the recent measured ETX, which can be obtained as in Equation (8), and α is the learning ratio such that 0 < α < 1. We have set α = 0.9, according to the Contiki RPL for the better smoothing effect.
where d i→ j is the probability that the data packet successfully delivered to the recipient node and d j→i is the probability that the acknowledgment is successfully received by the sender node. The other metric used in our proposal is the resource availability, R av , which indicates the available resource in terms of the buffer capacity availability in the node. To this end, we have mapped R av with the binary parameters 0 and 1, as shown in Equation (9), which indicates either the resource in a node is available or not.
where B av is the available buffer space of a node and T bu f is the total buffer size of node i. τ th is a predefined buffer threshold. For our experiment, we use a static threshold and set to 85% of the total size of the queue of a node. When the buffer utilization of a node is higher than the threshold τ th , the resource availability set to zero, and the RAROF ignores such nodes during the route selection process. Now, the proposed RAROF dynamically select the routing path based on the routing metrics defined above. Like the default RPL, in this implementation, RAROF performs globally throughout the network. In the RPL scope, a node construct the routing path to the DODAG root by selecting the preferred parent from the candidate parent set. Let assume that for each node v i ∈ V (i = 1, 2, 3, . . . , n), NB(i) ⊆ V is the subset of all eligible neighbor nodes that can communicate with each other. Each node i maintains its neighbor table and adds a new node j ∈ NB(i), only if there is space in the table to store. Afterward, each node v i ∈ V creates a candidate parent set Cp(v i ) = p 1 , p 2 , p 3 , . . . , p n from its neighbor table, from which a node chooses its next-hop toward the DODAG root, i.e., preferred parent Pp(v i ) and establishing the routing path to forward the data packets. In this entire process, a node v j can be a candidate parent node of node v i , only if it satisfies the following conditions. p ∈ NB(v i ); v j ∈ NB(p); r(p) ≺ r(v j ) (10) where r denotes the rank of a node. Unlike default RPL implementation [16], in this paper, the preferred parent selection and the rank calculation is detached. Thus, RAROF constructs the DODAG tree structure based on the node's rank, for which the ETX metric is used, and the rank of a node r(v i ) is computed as in Equation (11).
Here, r(Pp(v i )) is the rank value of the preferred parent of the node v i , and γ is the constant integer used to confirm the loop-freeness in the network and satisfying the Equation (10). It is defined to ensure the rank increment of a node that satisfies the rank policy of the DODAG-tree structure specified in [16]. Finally, the proposed RAROF selects the next-hop node based on the minimum function and determines the data forwarding path as follows.
Furthermore, the proposed metric also meets the primitive requirements such as isotonicity and monotonicity, the proof is as follows.
Let us assume that there exist n routing paths Rp n ∈ R, where n = 3. These three routing paths are represented as . . , v j ). Next, the metric values of these paths are as follows.

Γ(NVI(Rp
Here, x is the traversed node in Rp n ∈ R. The metric value of each routing path is always ≥ 0. If the path function ΓNVI(Rp 1 ) ≤ ΓNVI(Rp 3 ), then ΓNVI(Rp 1 ) + ΓNVI(Rp 2 ) ≤ ΓNVI(Rp 3 ) + ΓNVI(Rp 2 ) can be easily proved, regardless of the prefixed or suffixed by third common path such as Rp 2 . Therefore, it is proved that the proposed metric satisfies the isotonicity requirement. On the other hand, the metric value of each routing path is always ≥ 0, so, ΓNVI(Rp 1 ) ≤ ΓNVI(RP 1 ) + ΓNVI(Rp 2 ) can be easily proved regardless of the prefixed or suffixed by a third common path such as Rp 2 . In this way, it also proves that the proposed metric meets the monotonic requirement.

Multi-Queuing Scheme for Efficient Data Delivery
Aiming to ensure efficient data delivery for IEMS, in our proposal, we adopt the queuing model presented in [53] to handle the critical and non-critical traffic types. To achieve high reliability and lower delay when routing critical data traffic, reliability sensitive packets should be given high priority as compared to regular packets. Hence, this priority can be specified through a multi-queuing system, which is controlled by each node. Consequently, the implementation of a multi-queuing strategy allows the prioritization of data traffic to ensure high reliability to critical packets. In our priority queuing approach, we use two different queues, one for critical traffic, and the other abide non-critical traffic (i.e., regular traffic). The queuing model sends packets from the highest priority queue first, followed by the lowest priority queue. The high priority queue is referred to as a critical traffic queue (CTQ), which is used by critical packets, the low priority queue is denoted as regular traffic queue (RTQ), which is used by the non-critical packets or regular packets. We undertake that each source node is aware of the importance of each data packet it is transmitting that can be translated into a predetermined priority level. For the IEMS use case of IIoT, the application layer defines the priority level of each data packet generated by adding extra information to differentiate critical and non-critical packets. Subsequently, the classifier routes the packets into the appropriate queue based on the packet type. In the emergency monitoring network, when an unusual situation occurs, the node generates data for the appropriate action; therefore, the number of critical packets in the queue would be relatively low compared to regular packets, and for some time extent, the queue could be empty. Meanwhile, lower priority traffic may be obstructed by high priority traffic indefinitely. To overcome this situation, we use the timeout policy for each packet, so that contention priorities can be specified explicitly between packets from the same node. Algorithm 1 describes the implementation of the multi-queuing strategy in this paper.

Conceptual Cloud-Assisted IEMS Architecture for RPL Based IIoT Network
The idea behind the IIoT is to break down technical barriers and facilitate the integration of the physical and digital worlds. The promising potential of the cloud services has played a significant role in the feasibility of the IIoT. Because of the sensitive and critical ambient in the industries, the real-time monitoring system is an important aspect for analyzing data to enhance the proficiency, service quality, and providing an immediate response. IEMS is a combination of applications, people, interconnected things such as sensors, actuators, embedded devices, etc., and state of art technologies, which would function together to collect, monitor, track, control, store, and share information for better results. In this section, we present the theoretical IEMS design that provides the emergency monitoring framework, to which the surrounding and other functioning data are collected and sent to the cloud for analysis and evaluation, which enables the seamless access to authorities, engineers, and operators. The cloud-assisted IEMS architecture is as shown in Figure 2.
The architecture outlines how the flow of the IEMS data is captured and seamlessly forwarded to the IIoT cloud center via a communication gateway for further analysis and processing. Later, the processed information is either assessed and used by engineers, operators, paramedics, and control center or delivered to the exterior system for a specific solution. The main components in this architecture are as follows.

Conceptual Cloud-Assisted IEMS Architecture for RPL Based IIoT Network
The idea behind the IIoT is to break down technical barriers and facilitate the integration of the physical and digital worlds. The promising potential of the cloud services has played a significant role in the feasibility of the IIoT. Because of the sensitive and critical ambient in the industries, the real-time monitoring system is an important aspect for analyzing data to enhance the proficiency, service quality, and providing an immediate response. IEMS is a combination of applications, people, interconnected things such as sensors, actuators, embedded devices, etc., and state of art technologies, which would function together to collect, monitor, track, control, store, and share information for better results. In this section, we present the theoretical IEMS design that provides the emergency monitoring framework, to which the surrounding and other functioning data are collected and sent to the cloud for analysis and evaluation, which enables the seamless access to authorities, engineers, and operators. The cloud-assisted IEMS architecture is as shown in Figure 2.
decrease costs and provide better real-time information.
IEMS Service Directory: It registers and accumulates data from the sensing regions. Besides, it records and issues multiple services that take part in the IEMS. Some of the typical services in this directory are alert notification, predictive maintenance, and relief and rescue classification.
The steady and uninterrupted nature of various services in the industries has challenged traditional monitoring ways and means. In recent years, sophisticated techniques for monitoring and analyzing the situation has evolved due to the advancement of technology, smart devices, and tiny chips. Therefore, it is clear that the IIoT plays a significant role in the next-generation emergency monitoring system.

Experimental Results and Evaluation
In this section, we present the performance evaluation of our proposed routing scheme based on RAROF by using simulation. Furthermore, we describe the simulation environment, simulation parameters, and depict the comparative simulation results. The extensive simulation experiments are performed in the COOJA simulator and compared with other OFs to validate the proposed OF in the IIoT scope.

Simulation Environment and Parameters
In our simulation study, we have used topology with two aggregators (i.e., DODAG root) and 140 smart devices (i.e., sensor nodes), randomly scattered in the area of 300 m × 300 m. The DODAG roots were placed at the center of the simulation area, and other nodes were spread over the sensing area. In the network, the nodes communicate with each other either directly or in a hop-by-hop manner. In our simulated scenario, all the nodes were configured as Tmote Sky motes with CC2420 The architecture outlines how the flow of the IEMS data is captured and seamlessly forwarded to the IIoT cloud center via a communication gateway for further analysis and processing. Later, the processed information is either assessed and used by engineers, operators, paramedics, and control center or delivered to the exterior system for a specific solution. The main components in this architecture are as follows.
Connected Network: Data acquisition is performed by different sensors, embedded devices, equipment, and actuators through connection with an intermediate data aggregator. Using the network connection, the data aggregator sends the information to the cloud system where the concentrator extract some features, classify them, and process further.
Resource Manager: Assigns the resources to virtual machines as required. It manages services that fulfill user requirements. Moreover, it provides a cost-efficient platform to IEMS IIoT.
Data Transmission: It is responsible for conveying the acquired data to the cloud system, typically in real-time with the assured security and privacy. Generally, the sensing layer is equipped with a low-power and short-range radio such as low-power Bluetooth, IEEE 802.15.4, or ZigBee.
Individuals and Related Stakeholders: After data processing and analysis in the cloud system, the surrounding and other operational records are stored in the database, in which professionals and other stakeholders can assess and review it for further action.
Cloud System Manager: Defines and assigns the appropriate resources via resource manager and controls all the virtual machines for different services. In addition, it provides the IEMS service interaction method to application and services through a service directory.
Data Storage and Processing: It stores the aggregated sensory records and other information to be used for the long term. Data storage to the cloud system offers the benefits of providing scalability and accessibility on request for both users and other stakeholders. Furthermore, cloud processing can decrease costs and provide better real-time information.
IEMS Service Directory: It registers and accumulates data from the sensing regions. Besides, it records and issues multiple services that take part in the IEMS. Some of the typical services in this directory are alert notification, predictive maintenance, and relief and rescue classification.
The steady and uninterrupted nature of various services in the industries has challenged traditional monitoring ways and means. In recent years, sophisticated techniques for monitoring and analyzing the situation has evolved due to the advancement of technology, smart devices, and tiny chips. Therefore, it is clear that the IIoT plays a significant role in the next-generation emergency monitoring system.

Experimental Results and Evaluation
In this section, we present the performance evaluation of our proposed routing scheme based on RAROF by using simulation. Furthermore, we describe the simulation environment, simulation parameters, and depict the comparative simulation results. The extensive simulation experiments are performed in the COOJA simulator and compared with other OFs to validate the proposed OF in the IIoT scope.

Simulation Environment and Parameters
In our simulation study, we have used topology with two aggregators (i.e., DODAG root) and 140 smart devices (i.e., sensor nodes), randomly scattered in the area of 300 m × 300 m. The DODAG roots were placed at the center of the simulation area, and other nodes were spread over the sensing area. In the network, the nodes communicate with each other either directly or in a hop-by-hop manner. In our simulated scenario, all the nodes were configured as Tmote Sky motes with CC2420 wireless transceiver. We considered that the network generates frames of different sizes at varying intervals. Therefore, the maximum size of each data packet was restricted to 127 bytes, and data rate to 250 kbps. The total time for each simulation run was 1800 s. We performed our simulation 10 times for each test and drawn the average results to minimize the errors. The trickle timer parameters are set to the default value. In the graphical description, the error bar shows 95% confidence intervals. Table 1 shows the remaining key simulation parameters of our experiment.

Performance Metrics
To compare and analyze the performance of the routing techniques with other OFs available, we have defined the following qualitative performance metrics.
Packet delivery ratio (PDR): This is the ratio of the number of the data packet received at the root node and the total number of packets sent by the source nodes, which is as follows: PDR = # of packets successfully received at root node # of packets sent (13) # of pacekts sent = # of packets sent by each node × n v i = 1 # of nodes (14) Network lifetime: We considered it as the time to network partition. Network partition occurs when the average number of nodes dead in the network. Similar to [54], in our evaluation, we use it as a metric that will use energy variance, which can be defined as follows.
where I e is the initial energy of a node, U e is the average used energy, and N is the total number of nodes in the network. The energy is calculated based on the power consumed by the node in each of the states such as Tx, Rx, idle, and CPU (radio is off, but the system is active while processing) in which a node can function. Now, ς can be expressed as follows: Number of nodes alive: This is known as the number of active nodes in the network that can operate. In our analysis, we have considered the node to be alive, whose remaining energy is more than 2% of its initial energy.
Energy cost per data received: This is defined as the average energy consumed for a successful data packet delivered to the destination node.

Simulation Results and Discussion
The performance of OF-EC, OF-ER, and RAROF are intensively evaluated in various aspects. We first examine the impact of transmission range for all OFs in terms of energy efficiency, lifetime, and reliability. Figure 3a shows the energy expenditure of a successfully delivered data packet at the destination by OF-EC, OF-ER, and RAROF with respect to the varied transmission range. As the transmission range increases, the energy consumption of each OF decreases accordingly. It is clear that the reduced energy consumption can be achieved with RAROF compared to other OFs. This is because, the higher transmission range helps each node making more successful data transmission, which reduces the number of lossy links that a node should traverse to reach its destination. Besides, the traffic differentiation through the multi-queuing technique allows the node to prioritize the data packet according to the traffic types. Furthermore, the RAROF adopts the duty cycle information in a routing process, which enables nodes aware of the active and inactive status. In this manner, the possibility of re-transmission is reduced, which results in an energy cost reduction. As compared to OF-EC, OF-ER have achieved better energy cost because it considers various metric while selecting parent such as queue, delay, link quality, etc.
From Figure 3b, we notice that for the varied transmission capacity, RAROF achieves the higher numbers of alive nodes in the network compared to OF-ER and OF-EC. When the transmission range of each node is 60 m, RAROF outperforms OF-ER and OF-EC by achieving about 11% and 21% of more alive nodes, respectively. On the other hand, when the transmission range is 20 m, the performance is very similar. Therefore, we consider 60m as default for our simulation experiments. Figure 3c shows the packet delivery ratio of OF-EC, OF-ER, and RAROF in percentage under varying transmission range. The result depicts that with the increasing transmission range, the packet delivery ratio also increases for all OFs. Nevertheless, RAROF obtains the higher PDR than OF-EC and OF-ER. Compared to others, RAROF significantly achieves more alive nodes in the network, which provides an opportunity to find the optimal routing path, resulting in the higher PDR. Besides, it adopts a multi-queuing approach for traffic differentiation, and data packets are forwarded, to the proper channel (i.e., fixed sized slots or reserved slots), according to the traffic priority. Thus, RAROF can maintain its reliability of a maximum of 86.7% and a minimum of 32.5% when the transmission range is 60 and 20 m, respectively. In contrast, OF-ER improves its reliability by 15.4% and 4.5% higher than OF-EC when the transmission range is 60 and 20 m, respectively. It was expected because OF-EC is not aware of its resources in terms of queue utilization and the number of overburden nodes. On the other hand, at the transmission range of 60 m, OF-EC maintains the reliability of a maximum of 56.7%, which is about 30% less than RAROF, and it is not acceptable for emergency monitoring application of IIoT. Besides, during parent selection, both OF-ER and OF-EC do not allow to be aware of nodes' sleep and awake states, which leads to higher packet retransmission, eventually affecting the network reliability.
Sustainability 2020, 12, x FOR PEER REVIEW 19 of 25 reserved slots for critical data packets and contention access period for regular data packets. Due to the prioritization, RAROF not only achieves the higher PDR but also increases the network lifetime by reducing the packet retransmission. Afterward, we examined the impact of the varying traffic load on RAROF performance. To this end, we set the transmission range of each node to 60 m. To study the network performance in terms of energy efficiency, reliability, and lifetime, the varied traffic load is offered from 15 to 60 packets per minute. In Figure 4a-d, we have presented the performance of OFs considering different traffic loads. Figure 4a illustrates that the network with higher traffic load has increased energy consumption while delivering data successfully to the destination. The great deal of energy expenses is conserved by RAROF during data delivery under high traffic load. Whereas, OF-EC and OF-ER have comparatively consumed higher energy for successfully delivering data packets. In Figure 4b, it can be seen that as the traffic load increases, the number of alive nodes decreases significantly for all OFs. However, as compared to others, RAROF obtains a higher number of alive nodes in the network. After these analyses, we examined the reliability of the network under different traffic load. Figure 4c shows that as the traffic load increases, the packet delivery ratio of RAROF, OF-ER, and OF-EC decreases. This tendency can be described by the fact that under heavy traffic flow, generated and received data packets often backlogged at the node's buffer, which leads to more retransmission and packet loss, resulting in a lower PDR. However, in this regard, RAROF prioritizes the traffic types and differentiate them using a multi-queuing system, as a result, achieves higher PDR as compared to others. Moreover, RAROF not only differentiates the traffic type but also aware of the node's buffer utilization during route construction. Therefore, it achieves a minimum and maximum reliability of 44% and 86%, respectively, when the traffic load is 60 and 15 ppm. On the other hand, OF-ER maintains higher reliability than OF-EC, one of the main reasons for this achievement is that it includes the node's queue utilization metric during route construction. From As can be seen in Figure 3d, with the increasing transmission range, the network lifetime also increases consistently. The result reveals that RAROF can effectively delay the occurrence of the network partition as compared to OF-ER and OF-EC. When the transmission range is 20 and 60 m, RAROF shows the superiority in the network lifetime performance than OF-ER and OF-EC by about 5.2% and 8.7% and 8.2% and 16.3%, respectively. This is because the routing mechanism of RAROF can effectively reduce the interruption of communication due to network partition. Besides, RAROF makes use of network resources effectively during the route construction process, resulting in more numbers of alive nodes. Consequently, it prolongs the network lifetime as compared to others. On the other hand, as compared to OF-EC, OF-ER provides a better network lifetime because it also considers the resources during the parent selection process, however, it does not include the radio duty cycle, which is one of the key aspects of evaluating the energy consumption of a node. Moreover, the result shows that a multi-queuing based traffic differentiation scheme in RAROF can prolong the network lifetime. This is because data packets are prioritized to access the channel, through which the tendency of packet drop reduces significantly, consequently decreases packet retransmission and saves the node's energy. To obtain high reliability when routing critical data packets, higher priority is given to these packets in channel contention than the regular packets. For this, a node uses its reserved slots for critical data packets and contention access period for regular data packets. Due to the prioritization, RAROF not only achieves the higher PDR but also increases the network lifetime by reducing the packet retransmission.
Afterward, we examined the impact of the varying traffic load on RAROF performance. To this end, we set the transmission range of each node to 60 m. To study the network performance in terms of energy efficiency, reliability, and lifetime, the varied traffic load is offered from 15 to 60 packets per minute. In Figure 4a-d, we have presented the performance of OFs considering different traffic loads. Figure 4a illustrates that the network with higher traffic load has increased energy consumption while delivering data successfully to the destination. The great deal of energy expenses is conserved by RAROF during data delivery under high traffic load. Whereas, OF-EC and OF-ER have comparatively consumed higher energy for successfully delivering data packets. In Figure 4b, it can be seen that as the traffic load increases, the number of alive nodes decreases significantly for all OFs. However, as compared to others, RAROF obtains a higher number of alive nodes in the network. After these analyses, we examined the reliability of the network under different traffic load.  After these assessments, we analyzed the effect of the reporting interval on network partition. In this regard, we utilized various reporting intervals ranging from 2 to 8 s. It is define as the time interval between the arrival of data packets. We set the transmission range of each node to 60 m. Figure 5a shows that RAROF can keep the nodes alive to a higher number as compared to other OFs. It also illustrates that as the reporting interval increases, so does the number of active nodes in the network. When the interval is 2 s, the number of alive nodes of OF-EC, OF-ER, and RAROF are almost the same, because the low inter-packet interval leads to higher energy consumption. However, in this situation, RAROF obtains 4.2% and 5.9% more alive nodes than OF-ER and OF-EC, respectively. Then, we examined the node's lifespan over time. The number of nodes alive in the network is shown in Figure 5b. From the result, we can observe that the alive nodes in the network decrease for all OFs over time. Nevertheless, RAROF comparatively achieves more alive nodes during simulation time. OF-EC, on the other hand, achieves the lowest number of active nodes over time.  Figure 4c shows that as the traffic load increases, the packet delivery ratio of RAROF, OF-ER, and OF-EC decreases. This tendency can be described by the fact that under heavy traffic flow, generated and received data packets often backlogged at the node's buffer, which leads to more retransmission and packet loss, resulting in a lower PDR. However, in this regard, RAROF prioritizes the traffic types and differentiate them using a multi-queuing system, as a result, achieves higher PDR as compared to others. Moreover, RAROF not only differentiates the traffic type but also aware of the node's buffer utilization during route construction. Therefore, it achieves a minimum and maximum reliability of 44% and 86%, respectively, when the traffic load is 60 and 15 ppm. On the other hand, OF-ER maintains higher reliability than OF-EC, one of the main reasons for this achievement is that it includes the node's queue utilization metric during route construction. From Figure 4d, we can observe that the network lifetime decreases constantly for all OFs with the increased traffic load. The network topology constructed under RAROF alleviates partition for a long time as compared to OF-ER and OF-EC. This indicates that RAROF can delay the death of a node in the network due to the node's energy consumption.
After these assessments, we analyzed the effect of the reporting interval on network partition. In this regard, we utilized various reporting intervals ranging from 2 to 8 s. It is define as the time interval between the arrival of data packets. We set the transmission range of each node to 60 m. Figure 5a shows that RAROF can keep the nodes alive to a higher number as compared to other OFs. It also illustrates that as the reporting interval increases, so does the number of active nodes in the network. When the interval is 2 s, the number of alive nodes of OF-EC, OF-ER, and RAROF are almost the same, because the low inter-packet interval leads to higher energy consumption. However, in this situation, RAROF obtains 4.2% and 5.9% more alive nodes than OF-ER and OF-EC, respectively. Then, we examined the node's lifespan over time. The number of nodes alive in the network is shown in Figure 5b. From the result, we can observe that the alive nodes in the network decrease for all OFs over time. Nevertheless, RAROF comparatively achieves more alive nodes during simulation time. OF-EC, on the other hand, achieves the lowest number of active nodes over time. Similarly, we examine the network lifetime in terms of the varied reporting interval. Figure 6a illustrates the lifetime of the network with respect to the reporting interval. The result depicts that with the increasing time interval, the lifetime of the network also increases significantly. This is because the higher the intervals between packets, the lesser the node's buffer filled, resulting in lower packet loss due to buffer overflow, which eventually reduces packet re-transmission and thereby saves energy. At each reporting interval, the network lifetime in RAROF increases, which shows that RAROF can effectively reduce the death of nodes due to energy-constrained. After that, we analyzed the network lifetime over time. Figure 6b shows that for each OFs, the network lifetime decreases over time. From the result, it is clear that the network lifetime of RAROF is higher than OF-EC and OF-ER. Moreover, it can be noticed that the occurrence of a network partition is gradually rising with time, and for all OFs, the energy-constrained is negligible at the initial stage of network operation is low. However, OF-EC is most energy vulnerable as compared to OF-ER and RAROF. Similarly, we examine the network lifetime in terms of the varied reporting interval. Figure 6a illustrates the lifetime of the network with respect to the reporting interval. The result depicts that with the increasing time interval, the lifetime of the network also increases significantly. This is because the higher the intervals between packets, the lesser the node's buffer filled, resulting in lower packet loss due to buffer overflow, which eventually reduces packet re-transmission and thereby saves energy. At each reporting interval, the network lifetime in RAROF increases, which shows that RAROF can effectively reduce the death of nodes due to energy-constrained. After that, we analyzed the network lifetime over time. Figure 6b shows that for each OFs, the network lifetime decreases over time. From the result, it is clear that the network lifetime of RAROF is higher than OF-EC and OF-ER. Moreover, it can be noticed that the occurrence of a network partition is gradually rising with time, and for all OFs, the energy-constrained is negligible at the initial stage of network operation is low. However, OF-EC is most energy vulnerable as compared to OF-ER and RAROF.
Next, we examined the overhead comparison of the OFs. For this, we only considered the overhead of the DIO control messages of each node. In this simulation experiment, we set the traffic load to 15 ppm, and the transmission range of each node set to 60m. We look into more detail about the overhead of route construction and topology management through Figure 7a-d. Therefore, we take into account the traffic load and transmission range to analyze the overhead. Figure 7a shows the average parent change per node vs traffic load. In a resource-constrained network, frequent parent change also has an impact on energy consumption. Consequently, the network lifetime may be affected. However, the average parent changes in RAROF is lower than others. It indicates that RAROF selects a reliable next-hop node than OF-ER and OF-EC. This is because RAROF selects the parent based on the minimum function of the NVI metric. Besides, RAROF can be aware of the node's resources availability during parent selection. Likewise, Figure 7b shows that RAROF generates a minimum number of control packet even when the traffic load becomes heavy. When the traffic load is high, OF-EC incurs comparatively more routing overhead than RAROF and OF-ER. with the increasing time interval, the lifetime of the network also increases significantly. This is because the higher the intervals between packets, the lesser the node's buffer filled, resulting in lower packet loss due to buffer overflow, which eventually reduces packet re-transmission and thereby saves energy. At each reporting interval, the network lifetime in RAROF increases, which shows that RAROF can effectively reduce the death of nodes due to energy-constrained. After that, we analyzed the network lifetime over time. Figure 6b shows that for each OFs, the network lifetime decreases over time. From the result, it is clear that the network lifetime of RAROF is higher than OF-EC and OF-ER. Moreover, it can be noticed that the occurrence of a network partition is gradually rising with time, and for all OFs, the energy-constrained is negligible at the initial stage of network operation is low. However, OF-EC is most energy vulnerable as compared to OF-ER and RAROF. Next, we examined the overhead comparison of the OFs. For this, we only considered the overhead of the DIO control messages of each node. In this simulation experiment, we set the traffic load to 15 ppm, and the transmission range of each node set to 60m. We look into more detail about the overhead of route construction and topology management through Figure 7a-d. Therefore, we take into account the traffic load and transmission range to analyze the overhead. Figure 7a shows the average parent change per node vs traffic load. In a resource-constrained network, frequent parent change also has an impact on energy consumption. Consequently, the network lifetime may be affected. However, the average parent changes in RAROF is lower than others. It indicates that RAROF selects a reliable next-hop node than OF-ER and OF-EC. This is because RAROF selects the parent based on the minimum function of the NVI metric. Besides, RAROF can be aware of the node's resources availability during parent selection. Likewise, Figure 7b shows that RAROF generates a minimum number of control packet even when the traffic load becomes heavy. When the traffic load is high, OF-EC incurs comparatively more routing overhead than RAROF and OF-ER. Furthermore, we have investigated the different aspect of topology management with varied transmission range. To this end, we consider the DODAG repair execution and DODAG depth as an evaluation criterion. The DODAG repair execution is the topology repair frequency performed by the DODAG root, and DODAG depth is the number of hops from DODAG root. From Figure 7c, it can be seen that OF-EC frequently triggers DODAG repair compared to OF-ER and RAROF. It can be seen that there is a correlation between DODAG repair and routing overhead because when the route failure detects, each node reset the trickle timer for DODAG construction, which leads to a large number of DIO message generation. However, in both cases, RAROF outperforms OF-ER and OF-EC, and hence enhance energy efficiency. Similarly, Figure 7d reveals that RAROF constructs topology with lower hop distance than OF-ER and OF-EC. We believe this achievement is because of the rank calculation technique of RAROF. In heterogeneous low power and lossy networks, the routing technique is one of the main affecting factors for enhancing the performance of emergency monitoring IIoT application. The sensitivity of the application in terms of resource availability and reliability are extensively analyzed broadly in this paper. According to our study, we presume the proposed RAROF is very promising for mission-critical IoT applications due to its energy efficiency, stability, and reliability. Before our conclusion, we summarize the several relevant features of our proposition. The proposed multiqueuing traffic differentiation approach proved its effectiveness, and the approach of dealing with traffic sensitivity using the timer was reasonable. The strength and efficiency of IEMS rely on the RAROF provision of duty cycle adaptation and quantifying node's resource availability. The interpacket interval, traffic generation rate, and transmission range of the node have a direct impact on the network performances, which can lead to more energy consumption, reliability degradation, and faster network partition. In addition, resource-ignoring path selection techniques can also affect the resource-constrained nodes, thereby disrupting overall network performance. In contrast to the default single metric based rank calculation and route selection technique, RAROF is based on multiple metrics including the duty cycle. Therefore, our resource aware route selection approach is more efficient and have significant influence on the network performance. Overall, with RAROF, the routing performance can be significantly improved for IoT based applications, and it is preferable Furthermore, we have investigated the different aspect of topology management with varied transmission range. To this end, we consider the DODAG repair execution and DODAG depth as an evaluation criterion. The DODAG repair execution is the topology repair frequency performed by the DODAG root, and DODAG depth is the number of hops from DODAG root. From Figure 7c, it can be seen that OF-EC frequently triggers DODAG repair compared to OF-ER and RAROF. It can be seen that there is a correlation between DODAG repair and routing overhead because when the route failure detects, each node reset the trickle timer for DODAG construction, which leads to a large number of DIO message generation. However, in both cases, RAROF outperforms OF-ER and OF-EC, and hence enhance energy efficiency. Similarly, Figure 7d reveals that RAROF constructs topology with lower hop distance than OF-ER and OF-EC. We believe this achievement is because of the rank calculation technique of RAROF.
In heterogeneous low power and lossy networks, the routing technique is one of the main affecting factors for enhancing the performance of emergency monitoring IIoT application. The sensitivity of the application in terms of resource availability and reliability are extensively analyzed broadly in this paper. According to our study, we presume the proposed RAROF is very promising for mission-critical IoT applications due to its energy efficiency, stability, and reliability. Before our conclusion, we summarize the several relevant features of our proposition. The proposed multi-queuing traffic differentiation approach proved its effectiveness, and the approach of dealing with traffic sensitivity using the timer was reasonable. The strength and efficiency of IEMS rely on the RAROF provision of duty cycle adaptation and quantifying node's resource availability. The inter-packet interval, traffic generation rate, and transmission range of the node have a direct impact on the network performances, which can lead to more energy consumption, reliability degradation, and faster network partition. In addition, resource-ignoring path selection techniques can also affect the resource-constrained nodes, thereby disrupting overall network performance. In contrast to the default single metric based rank calculation and route selection technique, RAROF is based on multiple metrics including the duty cycle. Therefore, our resource aware route selection approach is more efficient and have significant influence on the network performance. Overall, with RAROF, the routing performance can be significantly improved for IoT based applications, and it is preferable than the existing OFs.

Conclusions
In this paper, to extend the lifetime of low power and lossy network and minimize the energy consumption, a new resource-aware and reliable objective function, RAROF, has been presented. In RAROF, both node characteristics and resource availability are taken into consideration to select the routing path. Reliable data communication is essential to ensure the ideal emergency monitoring system in different industries, for which the multi-queuing based traffic differentiation approach has been adopted that prioritizes the packets according to their sensitivity. With this approach, each node forwards the data packets to the channel of fixed-sized slots or reserved slots according to the traffic priority. In a heterogeneous network, the RAROF constructs routing path with the aim of extending node's life and minimizing energy consumption, paving the way towards green IIoT. Besides, a simple conceptual cloud-assisted IEMS architecture provides the promising potential functionality that collects, monitor, store, and analyze the data to reinforce the real-time emergency monitoring system. In this study, we found that the occurrence of network partition due to energy-constrained nodes increase when the nodes have low transmission range and inter-packet interval and high traffic flow. The simulation results obtained indicate that the proposed RAROF makes significant improvements in network lifetime, energy consumption, and reliability, as compared to OF-ER and OF-EC. During the study, we noticed that congestion is more likely to occur in resource-constrained networks due to fixed-sized channel slots. An efficient message scheduling technique is necessary to resolve this issue; however, it is part of our future work.