Recently,the fundamental problem with Hybrid Mobile Ad-hoc Net-works(H-MANETs)is tofind a suitable and secure way of balancing the load through Internet gateways.Moreover,the selection of the gateway and overload of th...Recently,the fundamental problem with Hybrid Mobile Ad-hoc Net-works(H-MANETs)is tofind a suitable and secure way of balancing the load through Internet gateways.Moreover,the selection of the gateway and overload of the network results in packet loss and Delay(DL).For optimal performance,it is important to load balance between different gateways.As a result,a stable load balancing procedure is implemented,which selects gateways based on Fuzzy Logic(FL)and increases the efficiency of the network.In this case,since gate-ways are selected based on the number of nodes,the Energy Consumption(EC)was high.This paper presents a novel Node Quality-based Clustering Algo-rithm(NQCA)based on Fuzzy-Genetic for Cluster Head and Gateway Selection(FGCHGS).This algorithm combines NQCA with the Improved Weighted Clus-tering Algorithm(IWCA).The NQCA algorithm divides the network into clusters based upon node priority,transmission range,and neighbourfidelity.In addition,the simulation results tend to evaluate the performance effectiveness of the FFFCHGS algorithm in terms of EC,packet loss rate(PLR),etc.展开更多
Mobile Ad hoc Network (MANET) is a significant concept of wireless networks which comprises of thousands of nodes that are mobile as well as autonomous and they do not requires any existing network infrastructure. The...Mobile Ad hoc Network (MANET) is a significant concept of wireless networks which comprises of thousands of nodes that are mobile as well as autonomous and they do not requires any existing network infrastructure. The autonomous nodes can freely and randomly move within the network which can create temporary dynamic network and these networks can change their topology frequently. The security is the primary issue in MANET which degrades the network performance significantly. In this paper, cluster based malicious node detection methodology is proposed to detect and remove the malicious nodes. Each node within the cluster gets the cluster key from the cluster head and this key is used for the data transaction between cluster head and node. The cluster head checks this key for every data transaction from node and match with their cluster table. If match is valid, and then only it will recognize that this node is belongs to this cluster, otherwise it is decided as malicious node. This paper also discusses the detection of link failure due to the presence of malicious node by determining the gain of each link in the network. The performance of the proposed method is analyzed using packet delivery ratio, network life time, and throughput and energy consumption. The proposed malicious node detection system is compared with the conventional techniques as OEERP (Optimized energy efficient routing protocol), LEACH (Low energy adaptive clustering hierarchy), DRINA (Data routing for In-network aggregation) and BCDCP (Base station controlled dynamic clustering protocol).展开更多
Aiming at the problem that node load is rarely considered in existing clustering routing algorithm for Wireless Sensor Networks (WSNs), a dynamic clustering routing algorithm for WSN is presented in this paper called ...Aiming at the problem that node load is rarely considered in existing clustering routing algorithm for Wireless Sensor Networks (WSNs), a dynamic clustering routing algorithm for WSN is presented in this paper called DCRCL (Dynamic Clustering Routing Considering Load). This algorithm is comprised of three phases including cluster head (CH) selection, cluster setup and inter-cluster routing. First, the CHs are selected based on residual energy and node load. Then the non-CH nodes choose a cluster by comparing the cost function of its neighbor CHs. At last, each CH communicates with base station by using multi-hop communication. The simulation results show that comparing with the existing one, the techniques life cycle and date volume of the network are increased by 30.7 percent and 29.8 percent respectively by using the proposed algorithm DCRCL.展开更多
Mobile Ad hoc Networks (MANET) are infrastructure less networks which provide multi-hop wireless links between nodes. The main applications of MANET in real time environment are military and emergency areas where the ...Mobile Ad hoc Networks (MANET) are infrastructure less networks which provide multi-hop wireless links between nodes. The main applications of MANET in real time environment are military and emergency areas where the fixed infrastructure is not required. It is a temporary communication infrastructure network for quick communication with minimal configuration settings among the group of nodes. The security is one of the primary concerns in MANET. The malicious nodes in MANET environment degrade the performance of the network. In this paper, the nodes in MANET are grouped using back-off duration technique and further the malicious nodes are detected using this algorithm. The proposed clustering based malicious nodes detection in MANET achieves higher performance in terms of packet delivery ratio, latency and energy consumption. The proposed method achieves 89.35% of packet delivery ratio, 36.2 ms latency and 26.91 mJ of energy consumption.展开更多
With the growing popularity of wireless sensor networks, network stability has become a key area of current research. Different applications of wireless sensor networks demand stable sensing, coverage, and connectivit...With the growing popularity of wireless sensor networks, network stability has become a key area of current research. Different applications of wireless sensor networks demand stable sensing, coverage, and connectivity throughout their operational periods. In some cases, the death of just a single sensor node might disrupt the stability of the entire network. Therefore, a number of techniques have been proposed to improve the network stability. Clustering is one of the most commonly used techniques in this regard. Most clustering techniques assume the presence of high power sensor nodes called relay nodes and implicitly assume that these relay nodes serve as cluster heads in the network. This assumption may lead to faulty network behavior when any of the relay nodes becomes unavailable to its followers. Moreover, relay node based clustering techniques do not address the heterogeneity of sensor nodes in terms of their residual energies, which frequently occur during the operation of a network. To address these two issues, we present a novel clustering technique, Dynamic Clustering with Relay Nodes (DCRN), by considering the heterogeneity in residual battery capacity and by removing the assumption that relay nodes always serve as cluster-heads. We use an essence of the underlying mechanism of LEACH (Low-Energy Adaptive Clustering Hierarchy), which is one of the most popular clustering solutions for wireless sensor networks. In our work, we present four heuristics to increase network stability periods in terms of the time elapsed before the death of the first node in the network. Based on the proposed heuristics, we devise an algorithm for DCRN and formulate a mathematical model for its long-term rate of energy consumption. Further, we calculate the optimal percentage of relay nodes from our mathematical model. Finally, we verify the efficiency of DCRN and correctness of the mathematical model by exhaustive simulation results. Our simulation results reveal that DCRN enhances the network stability period by a significant margin in comparison to LEACH and its best-known variant.展开更多
One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques ...One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. Simulation results show that our approach consumes less energy and effectively extends network utilization.展开更多
As each cluster head(CH)sensor node is used to aggregate,fuse,and forward data from different sensor nodes in an underwater acoustic sensor network(UASN),guaranteeing the data security in a CH is very critical.In this...As each cluster head(CH)sensor node is used to aggregate,fuse,and forward data from different sensor nodes in an underwater acoustic sensor network(UASN),guaranteeing the data security in a CH is very critical.In this paper,a cooperative security monitoring mechanism aided by multiple slave cluster heads(SCHs)is proposed to keep track of the data security of a CH.By designing a low complexity“equilateral triangle algorithm(ETA)”,the optimal SCHs(named as ETA-based multiple SCHs)are selected from the candidate SCHs so as to improve the dispersion and coverage of SCHs and achieve largescale data security monitoring.In addition,by analyzing the entire monitoring process,the close form expression of the probability of the failure attack identification for the SCHs with respect to the probability of attack launched by ordinary nodes is deduced.The simulation results show that the proposed optimal ETA-based multiple SCH cooperation scheme has lower probability of the failure attack identification than that of the existing schemes.In addition,the numerical simulation results are consistent with the theoretical analysis results,thus verifying the effectiveness of the proposed scheme.展开更多
In wireless sensor networks(WSNs), due to the limited battery power of the sensor nodes, the communication energy consumption is the main factor to affect the lifetime of the networks. A reasonable design of the commu...In wireless sensor networks(WSNs), due to the limited battery power of the sensor nodes, the communication energy consumption is the main factor to affect the lifetime of the networks. A reasonable design of the communication protocol can effectively reduce the energy consumption of the network system. Based on low-energy adaptive clustering hierarchy(LEACH), an improved LEACH protocol in WSNs is proposed. In order to optimize the cluster head(CH) election in the cluster setup phase, the improved LEACH takes into account a number of factors, including energy consumption of communication between nodes, remaining energy of the nodes,and the distance between nodes and base station(BS). In the steady phase, one-hop routing and multiple-hop routing are combined to transmit data between CHs to improve energy efficiency. The forward CH is selected as relay node according to the values of path cost. The simulation results show that the proposed algorithm performs better in balancing network energy consumption, and it can effectively improve the data transmission efficiency and prolong the network lifetime, as compared with LEACH, LEACH-C(LEACH-centralized) and NDAPSO-C(an adaptive clustering protocol based on improved particle swarm optimization) algorithms.展开更多
文摘Recently,the fundamental problem with Hybrid Mobile Ad-hoc Net-works(H-MANETs)is tofind a suitable and secure way of balancing the load through Internet gateways.Moreover,the selection of the gateway and overload of the network results in packet loss and Delay(DL).For optimal performance,it is important to load balance between different gateways.As a result,a stable load balancing procedure is implemented,which selects gateways based on Fuzzy Logic(FL)and increases the efficiency of the network.In this case,since gate-ways are selected based on the number of nodes,the Energy Consumption(EC)was high.This paper presents a novel Node Quality-based Clustering Algo-rithm(NQCA)based on Fuzzy-Genetic for Cluster Head and Gateway Selection(FGCHGS).This algorithm combines NQCA with the Improved Weighted Clus-tering Algorithm(IWCA).The NQCA algorithm divides the network into clusters based upon node priority,transmission range,and neighbourfidelity.In addition,the simulation results tend to evaluate the performance effectiveness of the FFFCHGS algorithm in terms of EC,packet loss rate(PLR),etc.
文摘Mobile Ad hoc Network (MANET) is a significant concept of wireless networks which comprises of thousands of nodes that are mobile as well as autonomous and they do not requires any existing network infrastructure. The autonomous nodes can freely and randomly move within the network which can create temporary dynamic network and these networks can change their topology frequently. The security is the primary issue in MANET which degrades the network performance significantly. In this paper, cluster based malicious node detection methodology is proposed to detect and remove the malicious nodes. Each node within the cluster gets the cluster key from the cluster head and this key is used for the data transaction between cluster head and node. The cluster head checks this key for every data transaction from node and match with their cluster table. If match is valid, and then only it will recognize that this node is belongs to this cluster, otherwise it is decided as malicious node. This paper also discusses the detection of link failure due to the presence of malicious node by determining the gain of each link in the network. The performance of the proposed method is analyzed using packet delivery ratio, network life time, and throughput and energy consumption. The proposed malicious node detection system is compared with the conventional techniques as OEERP (Optimized energy efficient routing protocol), LEACH (Low energy adaptive clustering hierarchy), DRINA (Data routing for In-network aggregation) and BCDCP (Base station controlled dynamic clustering protocol).
文摘Aiming at the problem that node load is rarely considered in existing clustering routing algorithm for Wireless Sensor Networks (WSNs), a dynamic clustering routing algorithm for WSN is presented in this paper called DCRCL (Dynamic Clustering Routing Considering Load). This algorithm is comprised of three phases including cluster head (CH) selection, cluster setup and inter-cluster routing. First, the CHs are selected based on residual energy and node load. Then the non-CH nodes choose a cluster by comparing the cost function of its neighbor CHs. At last, each CH communicates with base station by using multi-hop communication. The simulation results show that comparing with the existing one, the techniques life cycle and date volume of the network are increased by 30.7 percent and 29.8 percent respectively by using the proposed algorithm DCRCL.
文摘Mobile Ad hoc Networks (MANET) are infrastructure less networks which provide multi-hop wireless links between nodes. The main applications of MANET in real time environment are military and emergency areas where the fixed infrastructure is not required. It is a temporary communication infrastructure network for quick communication with minimal configuration settings among the group of nodes. The security is one of the primary concerns in MANET. The malicious nodes in MANET environment degrade the performance of the network. In this paper, the nodes in MANET are grouped using back-off duration technique and further the malicious nodes are detected using this algorithm. The proposed clustering based malicious nodes detection in MANET achieves higher performance in terms of packet delivery ratio, latency and energy consumption. The proposed method achieves 89.35% of packet delivery ratio, 36.2 ms latency and 26.91 mJ of energy consumption.
文摘With the growing popularity of wireless sensor networks, network stability has become a key area of current research. Different applications of wireless sensor networks demand stable sensing, coverage, and connectivity throughout their operational periods. In some cases, the death of just a single sensor node might disrupt the stability of the entire network. Therefore, a number of techniques have been proposed to improve the network stability. Clustering is one of the most commonly used techniques in this regard. Most clustering techniques assume the presence of high power sensor nodes called relay nodes and implicitly assume that these relay nodes serve as cluster heads in the network. This assumption may lead to faulty network behavior when any of the relay nodes becomes unavailable to its followers. Moreover, relay node based clustering techniques do not address the heterogeneity of sensor nodes in terms of their residual energies, which frequently occur during the operation of a network. To address these two issues, we present a novel clustering technique, Dynamic Clustering with Relay Nodes (DCRN), by considering the heterogeneity in residual battery capacity and by removing the assumption that relay nodes always serve as cluster-heads. We use an essence of the underlying mechanism of LEACH (Low-Energy Adaptive Clustering Hierarchy), which is one of the most popular clustering solutions for wireless sensor networks. In our work, we present four heuristics to increase network stability periods in terms of the time elapsed before the death of the first node in the network. Based on the proposed heuristics, we devise an algorithm for DCRN and formulate a mathematical model for its long-term rate of energy consumption. Further, we calculate the optimal percentage of relay nodes from our mathematical model. Finally, we verify the efficiency of DCRN and correctness of the mathematical model by exhaustive simulation results. Our simulation results reveal that DCRN enhances the network stability period by a significant margin in comparison to LEACH and its best-known variant.
文摘One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. Simulation results show that our approach consumes less energy and effectively extends network utilization.
基金supported in part by the Joint Fund of Science and Technology Department of Liaoning Province and State Key Laboratory of Robotics,China under Grant 2021-KF-22-08in part by the Basic Research Program of Science and Technology of Shenzhen,China under Grant JCYJ20190809161805508in part by the National Natural Science Foundation of China under Grant 62271423 and Grant 41976178.
文摘As each cluster head(CH)sensor node is used to aggregate,fuse,and forward data from different sensor nodes in an underwater acoustic sensor network(UASN),guaranteeing the data security in a CH is very critical.In this paper,a cooperative security monitoring mechanism aided by multiple slave cluster heads(SCHs)is proposed to keep track of the data security of a CH.By designing a low complexity“equilateral triangle algorithm(ETA)”,the optimal SCHs(named as ETA-based multiple SCHs)are selected from the candidate SCHs so as to improve the dispersion and coverage of SCHs and achieve largescale data security monitoring.In addition,by analyzing the entire monitoring process,the close form expression of the probability of the failure attack identification for the SCHs with respect to the probability of attack launched by ordinary nodes is deduced.The simulation results show that the proposed optimal ETA-based multiple SCH cooperation scheme has lower probability of the failure attack identification than that of the existing schemes.In addition,the numerical simulation results are consistent with the theoretical analysis results,thus verifying the effectiveness of the proposed scheme.
基金the National Natural Science Foundation of China(No.61673259)the International Exchanges and Cooperation Projects of Shanghai Science and Technology Committee(No.15220721800)
文摘In wireless sensor networks(WSNs), due to the limited battery power of the sensor nodes, the communication energy consumption is the main factor to affect the lifetime of the networks. A reasonable design of the communication protocol can effectively reduce the energy consumption of the network system. Based on low-energy adaptive clustering hierarchy(LEACH), an improved LEACH protocol in WSNs is proposed. In order to optimize the cluster head(CH) election in the cluster setup phase, the improved LEACH takes into account a number of factors, including energy consumption of communication between nodes, remaining energy of the nodes,and the distance between nodes and base station(BS). In the steady phase, one-hop routing and multiple-hop routing are combined to transmit data between CHs to improve energy efficiency. The forward CH is selected as relay node according to the values of path cost. The simulation results show that the proposed algorithm performs better in balancing network energy consumption, and it can effectively improve the data transmission efficiency and prolong the network lifetime, as compared with LEACH, LEACH-C(LEACH-centralized) and NDAPSO-C(an adaptive clustering protocol based on improved particle swarm optimization) algorithms.
