One of the fundamental properties of an ad hoc network is its connectivity. Maintaining connectivity in wireless networks is extremely difficult due to dynamic changing topology of MANETs. There are several techniques...One of the fundamental properties of an ad hoc network is its connectivity. Maintaining connectivity in wireless networks is extremely difficult due to dynamic changing topology of MANETs. There are several techniques to understand the connectivity level for a given network topology. In this paper, we examine the existing methods and discuss the issues and challenges that are still insurmountable in order to enhance the connectivity properties of wireless multi hop networks.展开更多
Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Str...Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Strategy to tolerate the failure of one critical node. Because of the energy restriction of sensor nodes, the energy overhead of the recovery process should be minimized to extend the lifetime of the network. To achieve it, we first design a novel algorithm to identify 2-critical nodes only relying on the positional information of 1-hop neighbors and some 2-hop neighbors, and then we present the criteria to select an appropriate backup for each critical node. Finally, we improve the cascaded node movement algorithm by determining whether a node can move to another non-adjacent node directly or not to reduce the number of nodes moved. The effectiveness of DCRS is validated through extensive simulation experiments.展开更多
Node failure in Wireless Sensor Networks(WSNs)is a fundamental problem because WSNs operate in hostile environments.The failure of nodes leads to network partitioning that may compromise the basic operation of the sen...Node failure in Wireless Sensor Networks(WSNs)is a fundamental problem because WSNs operate in hostile environments.The failure of nodes leads to network partitioning that may compromise the basic operation of the sensor network.To deal with such situations,a rapid recovery mechanism is required for restoring inter-node connectivity.Due to the immense importance and need for a recovery mechanism,several different approaches are proposed in the literature.However,the proposed approaches have shortcomings because they do not focus on energy-efficient operation and coverage-aware mechanisms while performing connectivity restoration.Moreover,most of these approaches rely on the excessive mobility of nodes for restoration connectivity that affects both coverage and energy consumption.This paper proposes a novel technique called ECRT(Efficient Connectivity Restoration Technique).This technique is capable of restoring connectivity due to single and multiple node failures.ECRT achieves energy efficiency by transmitting a minimal number of control packets.It is also coverage-aware as it relocates minimal nodes while trying to restore connectivity.With the help of extensive simulations,it is proven that ECRT is effective in connectivity restoration for single and multiple node failures.Results also show that ECRT exchanges a much smaller number of packets than other techniques.Moreover,it also yields the least reduction in field coverage,proving its versatility for connectivity restoration.展开更多
Wireless Sensor Networks(WSNs)are an integral part of the Internet of Things(IoT)and are widely used in a plethora of applications.Typically,sensor networks operate in harsh environments where human intervention is of...Wireless Sensor Networks(WSNs)are an integral part of the Internet of Things(IoT)and are widely used in a plethora of applications.Typically,sensor networks operate in harsh environments where human intervention is often restricted,which makes battery replacement for sensor nodes impractical.Node failure due to battery drainage or harsh environmental conditions poses serious challenges to the connectivity of the network.Without a connectivity restoration mechanism,node failures ultimately lead to a network partition,which affects the basic function of the sensor network.Therefore,the research community actively concentrates on addressing and solving the challenges associated with connectivity restoration in sensor networks.Since energy is a scarce resource in sensor networks,it becomes the focus of research,and researchers strive to propose new solutions that are energy efficient.The common issue that is well studied and considered is how to increase the network’s life span by solving the node failure problem and achieving efficient energy utilization.This paper introduces a Clusterbased Node Recovery(CNR)connectivity restoration mechanism based on the concept of clustering.Clustering is a well-known mechanism in sensor networks,and it is known for its energy-efficient operation and scalability.The proposed technique utilizes a distributed cluster-based approach to identify the failed nodes,while Cluster Heads(CHs)play a significant role in the restoration of connectivity.Extensive simulations were conducted to evaluate the performance of the proposed technique and compare it with the existing techniques.The simulation results show that the proposed technique efficiently addresses node failure and restores connectivity by moving fewer nodes than other existing connectivity restoration mechanisms.The proposed mechanism also yields an improved field coverage as well as a lesser number of packets exchanged as compared to existing state-of-the-art mechanisms.展开更多
The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider at...The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider attack to WSN is hard to solve. Insider attack is different from outsider attack, because it can’t be solved by the traditional encryption and message authentication. Therefore, a reliable secure routing protocol should be proposed in order to defense the insider attack. In this paper, we focus on insider selective forwarding attack. The existing detection mechanisms, such as watchdog, multipath retreat, neighbor-based monitoring and so on, have both advantages and disadvantages. According to their characteristics, we proposed a secure routing protocol based on monitor node and trust mechanism. The reputation value is made up with packet forwarding rate and node’s residual energy. So this detection and routing mechanism is universal because it can take account of both the safety and lifetime of network. Finally, we use OPNET simulation to verify the performance of our algorithm.展开更多
Wireless sensor networks have been applied in farmland and greenhouse.However,poor connectivity always results in a lot of nodes isolation in the network in a scenario.For this reason,the network connectivity is worth...Wireless sensor networks have been applied in farmland and greenhouse.However,poor connectivity always results in a lot of nodes isolation in the network in a scenario.For this reason,the network connectivity is worth considering to improve its quality,especially when the collected data cannot be sent to the data center because of the obstacles such as the growth of crop plants and weeds.Therefore,how to reduce the effect of crop growth on network connectivity,and enable the reliable transmission of field information,are the key problems to be resolved.To solve these problems,the method which adds long distance routing nodes to the WSN to reduce the deterioration of WSN connectivity during the growth of plants was proposed.To verify this method,the network connectivity of the deployed WSN was represented by the rank of connection matrix based on the graph theory.Consequently,the rank with value of 1 indicates a fully connected network.Moreover,the smaller value of rank means the better connectedness.In addition,the network simulator NS2 simulation results showed that the addition of long-distance backup routing nodes can improve the network connectivity.Furthermore,in experiments,using ZigBee-based wireless sensor network,a remote monitoring system in greenhouse was established,which can obtain environmental information for crops,e.g.temperature,humidity,light intensity and other environmental parameters as well as the wireless link quality especially.Experimental results showed adding of long-distance backup routing nodes can guarantee network connectivity in the region where received signal strength indication(RSSI)was poor,i.e.RSSI value was less than−100 dBm,and the energy was low.In conclusion,this method was essential to improve the connectivity of WSN,and the optimized method still needs further research.展开更多
The advances in recent technology have lead to the development of wireless sensor nodes forming a wireless network, which over the years is used from military application to industry, household, medical etc. The deplo...The advances in recent technology have lead to the development of wireless sensor nodes forming a wireless network, which over the years is used from military application to industry, household, medical etc. The deployment pattern of sensor nodes in Wireless Sensor Network (WSN) is always random for most of the applications. Such technique will lead to ineffective utilization of the network;for example fewer nodes are located at far distance and dense nodes are located at some reason and part of the region may be without the surveillance of any node, where the networks do consume additional energy or even may not transfer the data. The proposed work is intended to develop the optimized network by effective placement of nodes in circular and grid pattern, which we call as uniformity of nodes to be compared with random placement of nodes. Each of the nodes is in optimized positions at uniform distance with neighbors, followed by running a energy efficient routing algorithm that saves an additional energy further to provide connectivity management by connecting all the nodes. Simulation results are compared with the random placement of nodes, the residual energy of a network, lifetime of a network, energy consumption of a network shows a definite improvement for uniform network as that of with the random network.展开更多
In Ad-hoc wireless network, connectivity is a fundamental issue which restricts the design of system protocol. Based on the theory of stochastic geometry, a connectivity model focused on signal-to-interference （SIR）...In Ad-hoc wireless network, connectivity is a fundamental issue which restricts the design of system protocol. Based on the theory of stochastic geometry, a connectivity model focused on signal-to-interference （SIR） ratio is set up in presence of Nakagami-m fading and interference. This paper derives a close formula of connectivity probability with interference and Nakagami-m fading which is never obtained in previous works. Two-dimension shot-noise theory in stochastic geometry for interference is well applied. The formula is verified by simulation. The results show that the connectivity is affected by the scatter of users, wireless propagation environment, interference and so on.展开更多
In this paper, we study the connectivity of multihop wireless networks under the log-normal shadowing model by investigating the precise distribution of the number of isolated nodes. Under such a realistic shadowing m...In this paper, we study the connectivity of multihop wireless networks under the log-normal shadowing model by investigating the precise distribution of the number of isolated nodes. Under such a realistic shadowing model, all previous known works on the distribution of the number of isolated nodes were obtained only based on simulation studies or by ignoring the important boundary effect to avoid the challenging technical analysis, and thus cannot be applied to any practical wireless networks. It is extremely challenging to take the complicated boundary effect into consideration under such a realistic model because the transmission area of each node is an irregular region other than a circular area. Assume that the wireless nodes are represented by a Poisson point process with densitynover a unit-area disk, and that the transmission power is properly chosen so that the expected node degree of the network equals lnn + ξ (n), where ξ (n) approaches to a constant ξ as n →?∞. Under such a shadowing model with the boundary effect taken into consideration, we proved that the total number of isolated nodes is asymptotically Poisson with mean e$ {-ξ}. The Brun’s sieve is utilized to derive the precise asymptotic distribution. Our results can be used as design guidelines for any practical multihop wireless network where both the shadowing and boundary effects must be taken into consideration.展开更多
The identification of influential nodes in complex networks is one of the most exciting topics in network science.The latest work successfully compares each node using local connectivity and weak tie theory from a new...The identification of influential nodes in complex networks is one of the most exciting topics in network science.The latest work successfully compares each node using local connectivity and weak tie theory from a new perspective.We study the structural properties of networks in depth and extend this successful node evaluation from single-scale to multi-scale.In particular,one novel position parameter based on node transmission efficiency is proposed,which mainly depends on the shortest distances from target nodes to high-degree nodes.In this regard,the novel multi-scale information importance(MSII)method is proposed to better identify the crucial nodes by combining the network's local connectivity and global position information.In simulation comparisons,five state-of-the-art algorithms,i.e.the neighbor nodes degree algorithm(NND),betweenness centrality,closeness centrality,Katz centrality and the k-shell decomposition method,are selected to compare with our MSII.The results demonstrate that our method obtains superior performance in terms of robustness and spreading propagation for both real-world and artificial networks.展开更多
Aiming at developing a node scheduling protocol for sensor networks with fewer active nodes,we propose a coordinated node scheduling protocol based on the presentation of a solution and its optimization to determine w...Aiming at developing a node scheduling protocol for sensor networks with fewer active nodes,we propose a coordinated node scheduling protocol based on the presentation of a solution and its optimization to determine whether a node is redundant.The proposed protocol can reduce the number of working nodes by turning off as many redundant nodes as possible without degrading the coverage and connectivity.The simulation result shows that our protocol outperforms the peer with respect to the working node number and dynamic coverage percentage.展开更多
In Mobile Ad Hoc Networks(MANET),Quality of Service(QoS)is an important factor that must be analysed for the showing the better performance.The Node Quality-based Clustering Algorithm using Fuzzy-Fruit Fly Optimiza-ti...In Mobile Ad Hoc Networks(MANET),Quality of Service(QoS)is an important factor that must be analysed for the showing the better performance.The Node Quality-based Clustering Algorithm using Fuzzy-Fruit Fly Optimiza-tion for Cluster Head and Gateway Selection(NQCAFFFOCHGS)has the best network performance because it uses the Improved Weighted Clustering Algo-rithm(IWCA)to cluster the network and the FFO algorithm,which uses fuzzy-based network metrics to select the best CH and entryway.However,the major drawback of the fuzzy system was to appropriately select the membership func-tions.Also,the network metrics related to the path or link connectivity were not considered to effectively choose the CH and gateway.When learning fuzzy sets,this algorithm employs a new Continuous Action-set Learning Automata(CALA)approach that correctly modifies and chooses the fuzzy membership functions.Despite the fact that it extends the network’s lifespan,it does not assist in the detection of defective nodes in the routing route.Because of this,a new Fault Tolerance(NQCAEFFFOCHGS-FT)mechanism based on the Distributed Connectivity Restoration(DCR)mechanism is proposed,which allows the net-work to self-heal as a consequence of the algorithm’s self-healing capacity.Because of the way this method is designed,node failures may be utilised to rebuild the network topology via the use of cascaded node moves.Founded on the fractional network information and topologic overhead related with each node,the DCR is suggested as an alternative to the DCR.When compared to the NQCAFFFOCHGS algorithm,the recreation results display that the proposed NQCAEFFFOCHGS-FT algorithm improves network performance in terms of end-to-end delay,energy consumption,Packet Loss Ratio(PLR),Normalized Routing Overhead(NRO),and Balanced Load Index(BLI).展开更多
文摘One of the fundamental properties of an ad hoc network is its connectivity. Maintaining connectivity in wireless networks is extremely difficult due to dynamic changing topology of MANETs. There are several techniques to understand the connectivity level for a given network topology. In this paper, we examine the existing methods and discuss the issues and challenges that are still insurmountable in order to enhance the connectivity properties of wireless multi hop networks.
文摘Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Strategy to tolerate the failure of one critical node. Because of the energy restriction of sensor nodes, the energy overhead of the recovery process should be minimized to extend the lifetime of the network. To achieve it, we first design a novel algorithm to identify 2-critical nodes only relying on the positional information of 1-hop neighbors and some 2-hop neighbors, and then we present the criteria to select an appropriate backup for each critical node. Finally, we improve the cascaded node movement algorithm by determining whether a node can move to another non-adjacent node directly or not to reduce the number of nodes moved. The effectiveness of DCRS is validated through extensive simulation experiments.
基金This research is funded by Jouf University Saudi Arabia,under the research Project Number 40/117.URL:www.ju.edu.sa.
文摘Node failure in Wireless Sensor Networks(WSNs)is a fundamental problem because WSNs operate in hostile environments.The failure of nodes leads to network partitioning that may compromise the basic operation of the sensor network.To deal with such situations,a rapid recovery mechanism is required for restoring inter-node connectivity.Due to the immense importance and need for a recovery mechanism,several different approaches are proposed in the literature.However,the proposed approaches have shortcomings because they do not focus on energy-efficient operation and coverage-aware mechanisms while performing connectivity restoration.Moreover,most of these approaches rely on the excessive mobility of nodes for restoration connectivity that affects both coverage and energy consumption.This paper proposes a novel technique called ECRT(Efficient Connectivity Restoration Technique).This technique is capable of restoring connectivity due to single and multiple node failures.ECRT achieves energy efficiency by transmitting a minimal number of control packets.It is also coverage-aware as it relocates minimal nodes while trying to restore connectivity.With the help of extensive simulations,it is proven that ECRT is effective in connectivity restoration for single and multiple node failures.Results also show that ECRT exchanges a much smaller number of packets than other techniques.Moreover,it also yields the least reduction in field coverage,proving its versatility for connectivity restoration.
基金This research is funded by Najran University Saudi Arabia,under the research Project Number(NU/ESCI/17/093).URL:www.nu.edu.sa。
文摘Wireless Sensor Networks(WSNs)are an integral part of the Internet of Things(IoT)and are widely used in a plethora of applications.Typically,sensor networks operate in harsh environments where human intervention is often restricted,which makes battery replacement for sensor nodes impractical.Node failure due to battery drainage or harsh environmental conditions poses serious challenges to the connectivity of the network.Without a connectivity restoration mechanism,node failures ultimately lead to a network partition,which affects the basic function of the sensor network.Therefore,the research community actively concentrates on addressing and solving the challenges associated with connectivity restoration in sensor networks.Since energy is a scarce resource in sensor networks,it becomes the focus of research,and researchers strive to propose new solutions that are energy efficient.The common issue that is well studied and considered is how to increase the network’s life span by solving the node failure problem and achieving efficient energy utilization.This paper introduces a Clusterbased Node Recovery(CNR)connectivity restoration mechanism based on the concept of clustering.Clustering is a well-known mechanism in sensor networks,and it is known for its energy-efficient operation and scalability.The proposed technique utilizes a distributed cluster-based approach to identify the failed nodes,while Cluster Heads(CHs)play a significant role in the restoration of connectivity.Extensive simulations were conducted to evaluate the performance of the proposed technique and compare it with the existing techniques.The simulation results show that the proposed technique efficiently addresses node failure and restores connectivity by moving fewer nodes than other existing connectivity restoration mechanisms.The proposed mechanism also yields an improved field coverage as well as a lesser number of packets exchanged as compared to existing state-of-the-art mechanisms.
文摘The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider attack to WSN is hard to solve. Insider attack is different from outsider attack, because it can’t be solved by the traditional encryption and message authentication. Therefore, a reliable secure routing protocol should be proposed in order to defense the insider attack. In this paper, we focus on insider selective forwarding attack. The existing detection mechanisms, such as watchdog, multipath retreat, neighbor-based monitoring and so on, have both advantages and disadvantages. According to their characteristics, we proposed a secure routing protocol based on monitor node and trust mechanism. The reputation value is made up with packet forwarding rate and node’s residual energy. So this detection and routing mechanism is universal because it can take account of both the safety and lifetime of network. Finally, we use OPNET simulation to verify the performance of our algorithm.
文摘Wireless sensor networks have been applied in farmland and greenhouse.However,poor connectivity always results in a lot of nodes isolation in the network in a scenario.For this reason,the network connectivity is worth considering to improve its quality,especially when the collected data cannot be sent to the data center because of the obstacles such as the growth of crop plants and weeds.Therefore,how to reduce the effect of crop growth on network connectivity,and enable the reliable transmission of field information,are the key problems to be resolved.To solve these problems,the method which adds long distance routing nodes to the WSN to reduce the deterioration of WSN connectivity during the growth of plants was proposed.To verify this method,the network connectivity of the deployed WSN was represented by the rank of connection matrix based on the graph theory.Consequently,the rank with value of 1 indicates a fully connected network.Moreover,the smaller value of rank means the better connectedness.In addition,the network simulator NS2 simulation results showed that the addition of long-distance backup routing nodes can improve the network connectivity.Furthermore,in experiments,using ZigBee-based wireless sensor network,a remote monitoring system in greenhouse was established,which can obtain environmental information for crops,e.g.temperature,humidity,light intensity and other environmental parameters as well as the wireless link quality especially.Experimental results showed adding of long-distance backup routing nodes can guarantee network connectivity in the region where received signal strength indication(RSSI)was poor,i.e.RSSI value was less than−100 dBm,and the energy was low.In conclusion,this method was essential to improve the connectivity of WSN,and the optimized method still needs further research.
文摘The advances in recent technology have lead to the development of wireless sensor nodes forming a wireless network, which over the years is used from military application to industry, household, medical etc. The deployment pattern of sensor nodes in Wireless Sensor Network (WSN) is always random for most of the applications. Such technique will lead to ineffective utilization of the network;for example fewer nodes are located at far distance and dense nodes are located at some reason and part of the region may be without the surveillance of any node, where the networks do consume additional energy or even may not transfer the data. The proposed work is intended to develop the optimized network by effective placement of nodes in circular and grid pattern, which we call as uniformity of nodes to be compared with random placement of nodes. Each of the nodes is in optimized positions at uniform distance with neighbors, followed by running a energy efficient routing algorithm that saves an additional energy further to provide connectivity management by connecting all the nodes. Simulation results are compared with the random placement of nodes, the residual energy of a network, lifetime of a network, energy consumption of a network shows a definite improvement for uniform network as that of with the random network.
基金supported by the National Natural Science Foundation of China(61171094)National Science & Technology Key Project(2011ZX03001-006-02,2011ZX03005-004-03)+1 种基金the Key Project of Jiangsu Provincial Natural Science Foundation (BK2011027)the Graduate Student Innovation Plan of Jiangsu Province(CXZZ11_0387)
文摘In Ad-hoc wireless network, connectivity is a fundamental issue which restricts the design of system protocol. Based on the theory of stochastic geometry, a connectivity model focused on signal-to-interference （SIR） ratio is set up in presence of Nakagami-m fading and interference. This paper derives a close formula of connectivity probability with interference and Nakagami-m fading which is never obtained in previous works. Two-dimension shot-noise theory in stochastic geometry for interference is well applied. The formula is verified by simulation. The results show that the connectivity is affected by the scatter of users, wireless propagation environment, interference and so on.
文摘In this paper, we study the connectivity of multihop wireless networks under the log-normal shadowing model by investigating the precise distribution of the number of isolated nodes. Under such a realistic shadowing model, all previous known works on the distribution of the number of isolated nodes were obtained only based on simulation studies or by ignoring the important boundary effect to avoid the challenging technical analysis, and thus cannot be applied to any practical wireless networks. It is extremely challenging to take the complicated boundary effect into consideration under such a realistic model because the transmission area of each node is an irregular region other than a circular area. Assume that the wireless nodes are represented by a Poisson point process with densitynover a unit-area disk, and that the transmission power is properly chosen so that the expected node degree of the network equals lnn + ξ (n), where ξ (n) approaches to a constant ξ as n →?∞. Under such a shadowing model with the boundary effect taken into consideration, we proved that the total number of isolated nodes is asymptotically Poisson with mean e$ {-ξ}. The Brun’s sieve is utilized to derive the precise asymptotic distribution. Our results can be used as design guidelines for any practical multihop wireless network where both the shadowing and boundary effects must be taken into consideration.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11801430,11801200,61877046,and 61877047).
文摘The identification of influential nodes in complex networks is one of the most exciting topics in network science.The latest work successfully compares each node using local connectivity and weak tie theory from a new perspective.We study the structural properties of networks in depth and extend this successful node evaluation from single-scale to multi-scale.In particular,one novel position parameter based on node transmission efficiency is proposed,which mainly depends on the shortest distances from target nodes to high-degree nodes.In this regard,the novel multi-scale information importance(MSII)method is proposed to better identify the crucial nodes by combining the network's local connectivity and global position information.In simulation comparisons,five state-of-the-art algorithms,i.e.the neighbor nodes degree algorithm(NND),betweenness centrality,closeness centrality,Katz centrality and the k-shell decomposition method,are selected to compare with our MSII.The results demonstrate that our method obtains superior performance in terms of robustness and spreading propagation for both real-world and artificial networks.
基金the National Natural Science Foundation of China(Grant No.60533110 and No.90604013)the Scientific Research Foundation of Harbin Institute of Technology(Grant No. HIT2002.74)
文摘Aiming at developing a node scheduling protocol for sensor networks with fewer active nodes,we propose a coordinated node scheduling protocol based on the presentation of a solution and its optimization to determine whether a node is redundant.The proposed protocol can reduce the number of working nodes by turning off as many redundant nodes as possible without degrading the coverage and connectivity.The simulation result shows that our protocol outperforms the peer with respect to the working node number and dynamic coverage percentage.
文摘In Mobile Ad Hoc Networks(MANET),Quality of Service(QoS)is an important factor that must be analysed for the showing the better performance.The Node Quality-based Clustering Algorithm using Fuzzy-Fruit Fly Optimiza-tion for Cluster Head and Gateway Selection(NQCAFFFOCHGS)has the best network performance because it uses the Improved Weighted Clustering Algo-rithm(IWCA)to cluster the network and the FFO algorithm,which uses fuzzy-based network metrics to select the best CH and entryway.However,the major drawback of the fuzzy system was to appropriately select the membership func-tions.Also,the network metrics related to the path or link connectivity were not considered to effectively choose the CH and gateway.When learning fuzzy sets,this algorithm employs a new Continuous Action-set Learning Automata(CALA)approach that correctly modifies and chooses the fuzzy membership functions.Despite the fact that it extends the network’s lifespan,it does not assist in the detection of defective nodes in the routing route.Because of this,a new Fault Tolerance(NQCAEFFFOCHGS-FT)mechanism based on the Distributed Connectivity Restoration(DCR)mechanism is proposed,which allows the net-work to self-heal as a consequence of the algorithm’s self-healing capacity.Because of the way this method is designed,node failures may be utilised to rebuild the network topology via the use of cascaded node moves.Founded on the fractional network information and topologic overhead related with each node,the DCR is suggested as an alternative to the DCR.When compared to the NQCAFFFOCHGS algorithm,the recreation results display that the proposed NQCAEFFFOCHGS-FT algorithm improves network performance in terms of end-to-end delay,energy consumption,Packet Loss Ratio(PLR),Normalized Routing Overhead(NRO),and Balanced Load Index(BLI).
