The document proposes a new routing protocol called Sector Tree-Based Clustering for Energy Efficient Routing Protocol (STB-EE) for wireless sensor networks. STB-EE partitions the sensor field into dynamic sectors to balance the number of nodes per cluster. Within each sector, STB-EE constructs a minimum spanning tree to connect nodes and reduce long-distance communication. STB-EE selects cluster heads based on remaining energy and distance to the base station. Simulation results show STB-EE can improve network lifespan by about 15-16% compared to other protocols.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENTIJCNCJournal
Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Improved LEACH protocol for increasing the lifetime of WSNsIJECEIAES
Recently, wireless sensor network (WSN) is taking a high place in several applications: military, industry, and environment. The importance of WSNs in current applications makes the WSNs the most developed technology at the research level and especially in the field of communication and computing. However, WSN’s performance deals with a number of challenges. Energy consumption is the most considerable for many researchers because nodes use energy to collect, treat, and send data, but they have restricted energy. For this reason, numerous efficient energy routing protocols have been developed to save the consumption of power. Low energy adaptive clustering hierarchy (LEACH) is considered as the most attractive one in WSNs. In the present document, we evaluate the LEACH approach effectiveness in the cluster-head (CH) choosing and in data transmission, then we propose an enhanced protocol. The proposed algorithm aims to improve energy consumption and prolong the lifetime of WSN through selecting CHs depending on the remaining power, balancing the number of nodes in clusters, determining abandoned nodes in order to send their data to the sink. Then CHs choose the optimal path to achieve the sink. Simulation results exhibit that the enhanced method can decrease the consumption of energy and prolong the life-cycle of the network.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENTIJCNCJournal
Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Improved LEACH protocol for increasing the lifetime of WSNsIJECEIAES
Recently, wireless sensor network (WSN) is taking a high place in several applications: military, industry, and environment. The importance of WSNs in current applications makes the WSNs the most developed technology at the research level and especially in the field of communication and computing. However, WSN’s performance deals with a number of challenges. Energy consumption is the most considerable for many researchers because nodes use energy to collect, treat, and send data, but they have restricted energy. For this reason, numerous efficient energy routing protocols have been developed to save the consumption of power. Low energy adaptive clustering hierarchy (LEACH) is considered as the most attractive one in WSNs. In the present document, we evaluate the LEACH approach effectiveness in the cluster-head (CH) choosing and in data transmission, then we propose an enhanced protocol. The proposed algorithm aims to improve energy consumption and prolong the lifetime of WSN through selecting CHs depending on the remaining power, balancing the number of nodes in clusters, determining abandoned nodes in order to send their data to the sink. Then CHs choose the optimal path to achieve the sink. Simulation results exhibit that the enhanced method can decrease the consumption of energy and prolong the life-cycle of the network.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
An Improved LEACH-C Algorithm for Energy Efficiency in WSN Routingijsrd.com
this paper considered a multi-objective LEACH-C algorithm in the selection of Cluster Head (CH) in such a way so that its energy is used uniformly with load balancing among clusters for delayed disintegration of network. LEACH-C algorithm based single objective clustering approach has been replaced by multi-objective clustering approach where we not only considered the residual energy of nodes but the size of cluster in creating a cluster structure. The improved LEACH-C protocol has been compared with random LEACH and Max Energy LEACH or existing LEACH-C algorithm for energy equi-distribution and load balancing among clusters. Wireless sensor network (WSN) is simulated using a MATLAB programming and power consumption algorithms take into consideration all aspects of power consumption in the operation of the node. The modified LEACH-C routing protocol shows improvements in lifetime as well as in network disintegration criterion
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
Energy balanced improved leach routing protocol for wireless sensor networkscsandit
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Performance evaluation of hierarchical clustering protocols with fuzzy C-means IJECEIAES
The longevity of the network and the lack of resources are the main problems within the WSN. Minimizing energy dissipation and optimizing the lifespan of the WSN network are real challenges in the design of WSN routing protocols. Load balanced clustering increases the reliability of the system and enhances coordination between different nodes within the network. WSN is one of the main technologies dedicated to the detection, sensing, and monitoring of physical phenomena of the environment. For illustration, detection, and measurement of vibration, pressure, temperature, and sound. The WSN can be integrated into many domains, like street parking systems, smart roads, and industrial. This paper examines the efficiency of our two proposed clustering algorithms: Fuzzy C-means based hierarchical routing approach for homogeneous WSN (F-LEACH) and fuzzy distributed energy efficient clustering algorithm (F-DEEC) through a detailed comparison of WSN performance parameters such as the instability and stability duration, lifetime of the network, number of cluster heads per round and the number of alive nodes. The fuzzy C-means based on hierarchical routing approach is based on fuzzy C-means and low-energy adaptive clustering hierarchy (LEACH) protocol. The fuzzy distributed energy efficient clustering algorithm is based on fuzzy C-means and design of a distributed energy efficient clustering (DEEC) protocol. The technical capability of each protocol is measured according to the studied parameters.
THRESHOLD BASED VM PLACEMENT TECHNIQUE FOR LOAD BALANCED RESOURCE PROVISIONIN...IJCNCJournal
The unbalancing load issue is a multi-variation, multi-imperative issue that corrupts the execution and productivity of processing assets. Workload adjusting methods give solutions of load unbalancing circumstances for two bothersome aspects over-burdening and under-stacking. Cloud computing utilizes planning and workload balancing for a virtualized environment, resource partaking in cloud foundation. These two factors must be handled in an improved way in cloud computing to accomplish ideal resource sharing. Henceforth, there requires productive resource, asset reservation for guaranteeing load advancement in the cloud. This work aims to present an incorporated resource, asset reservation, and workload adjusting calculation for effective cloud provisioning. The strategy develops a Priority-based Resource Scheduling Model to acquire the resource, asset reservation with threshold-based load balancing for improving the proficiency in cloud framework. Extending utilization of Virtual Machines through the suitable and sensible outstanding task at hand modifying is then practiced by intensely picking a job from submitting jobs using Priority-based Resource Scheduling Model to acquire resource asset reservation. Experimental evaluations represent, the proposed scheme gives better results by reducing execution time, with minimum resource cost and improved resource utilization in dynamic resource provisioning conditions.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
OPTIMIZED CLUSTER ESTABLISHMENT AND CLUSTER-HEAD SELECTION APPROACH IN WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
An energy efficient optimized cluster establishment methodology for sensor n...nooriasukmaningtyas
The compatibility of WSN is with various applications such as; healthcar eand environmental monitoring. Whereas nodes present in that network have limited ‘battery-life’ that cause difficulty to replace and recharge those batteries after deployment. Energy efficiency is a major problem in the present situation. In present, many algorithms based on energy efficiency have been introduced to improvise the conservation of energy in WSN. The LEACH algorithm improvises the network lifetime in comparison to direct transmission and multi-hop, but it has several limitations. The selection of CHs can be randomly done that doesn’t confirm the optimal solution, proper distribution and it lacks during complete network management. The centralized EE optimized cluster establishment approach (OCEA) for sensor nodes is proposed to decrease the average energy dissipation and provide significant improvement. The proposed EE WSN model with the sensor nodes is examined under a real-time scenario and it is compared with stateof-art techniques where it balances the energy consumption of the network and decreasing the cluster head number.
A NOVEL ENERGY EFFICIENCY PROTOCOL FOR WSN BASED ON OPTIMAL CHAIN ROUTINGKhushbooGupta145
Energy Efficiency in Wireless Sensor Network is one of the most significant aspects of routing in these networks. WSN consist of thousands of sensory nodes densely distributed over wide geographical network. As these nodes are deployed in remote areas where recharging is not possible, even if it is possible it will incur high cost. So there is a need of a protocol which facilitates less energy dissipation and thereby enhances the overall performance of the network. We surveyed several protocols such as LEACH, PEGASIS, ACT etc. and concluded that important performance measures are First Node Die (FND), Half Node Alive (HNA) and Last Node Alive (LNA). Values for above mentioned parameters vary for different protocols. In this paper we present a new protocol Energy Efficient Optimal Chain Protocol (EEOC) which outperforms all above mentioned protocols. We compared the results of all these protocols with EEOC and found that with respect to FND, HNA and LNA EEOC performs way better than others.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
An Improved LEACH-C Algorithm for Energy Efficiency in WSN Routingijsrd.com
this paper considered a multi-objective LEACH-C algorithm in the selection of Cluster Head (CH) in such a way so that its energy is used uniformly with load balancing among clusters for delayed disintegration of network. LEACH-C algorithm based single objective clustering approach has been replaced by multi-objective clustering approach where we not only considered the residual energy of nodes but the size of cluster in creating a cluster structure. The improved LEACH-C protocol has been compared with random LEACH and Max Energy LEACH or existing LEACH-C algorithm for energy equi-distribution and load balancing among clusters. Wireless sensor network (WSN) is simulated using a MATLAB programming and power consumption algorithms take into consideration all aspects of power consumption in the operation of the node. The modified LEACH-C routing protocol shows improvements in lifetime as well as in network disintegration criterion
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
Energy balanced improved leach routing protocol for wireless sensor networkscsandit
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Performance evaluation of hierarchical clustering protocols with fuzzy C-means IJECEIAES
The longevity of the network and the lack of resources are the main problems within the WSN. Minimizing energy dissipation and optimizing the lifespan of the WSN network are real challenges in the design of WSN routing protocols. Load balanced clustering increases the reliability of the system and enhances coordination between different nodes within the network. WSN is one of the main technologies dedicated to the detection, sensing, and monitoring of physical phenomena of the environment. For illustration, detection, and measurement of vibration, pressure, temperature, and sound. The WSN can be integrated into many domains, like street parking systems, smart roads, and industrial. This paper examines the efficiency of our two proposed clustering algorithms: Fuzzy C-means based hierarchical routing approach for homogeneous WSN (F-LEACH) and fuzzy distributed energy efficient clustering algorithm (F-DEEC) through a detailed comparison of WSN performance parameters such as the instability and stability duration, lifetime of the network, number of cluster heads per round and the number of alive nodes. The fuzzy C-means based on hierarchical routing approach is based on fuzzy C-means and low-energy adaptive clustering hierarchy (LEACH) protocol. The fuzzy distributed energy efficient clustering algorithm is based on fuzzy C-means and design of a distributed energy efficient clustering (DEEC) protocol. The technical capability of each protocol is measured according to the studied parameters.
THRESHOLD BASED VM PLACEMENT TECHNIQUE FOR LOAD BALANCED RESOURCE PROVISIONIN...IJCNCJournal
The unbalancing load issue is a multi-variation, multi-imperative issue that corrupts the execution and productivity of processing assets. Workload adjusting methods give solutions of load unbalancing circumstances for two bothersome aspects over-burdening and under-stacking. Cloud computing utilizes planning and workload balancing for a virtualized environment, resource partaking in cloud foundation. These two factors must be handled in an improved way in cloud computing to accomplish ideal resource sharing. Henceforth, there requires productive resource, asset reservation for guaranteeing load advancement in the cloud. This work aims to present an incorporated resource, asset reservation, and workload adjusting calculation for effective cloud provisioning. The strategy develops a Priority-based Resource Scheduling Model to acquire the resource, asset reservation with threshold-based load balancing for improving the proficiency in cloud framework. Extending utilization of Virtual Machines through the suitable and sensible outstanding task at hand modifying is then practiced by intensely picking a job from submitting jobs using Priority-based Resource Scheduling Model to acquire resource asset reservation. Experimental evaluations represent, the proposed scheme gives better results by reducing execution time, with minimum resource cost and improved resource utilization in dynamic resource provisioning conditions.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
OPTIMIZED CLUSTER ESTABLISHMENT AND CLUSTER-HEAD SELECTION APPROACH IN WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
An energy efficient optimized cluster establishment methodology for sensor n...nooriasukmaningtyas
The compatibility of WSN is with various applications such as; healthcar eand environmental monitoring. Whereas nodes present in that network have limited ‘battery-life’ that cause difficulty to replace and recharge those batteries after deployment. Energy efficiency is a major problem in the present situation. In present, many algorithms based on energy efficiency have been introduced to improvise the conservation of energy in WSN. The LEACH algorithm improvises the network lifetime in comparison to direct transmission and multi-hop, but it has several limitations. The selection of CHs can be randomly done that doesn’t confirm the optimal solution, proper distribution and it lacks during complete network management. The centralized EE optimized cluster establishment approach (OCEA) for sensor nodes is proposed to decrease the average energy dissipation and provide significant improvement. The proposed EE WSN model with the sensor nodes is examined under a real-time scenario and it is compared with stateof-art techniques where it balances the energy consumption of the network and decreasing the cluster head number.
A NOVEL ENERGY EFFICIENCY PROTOCOL FOR WSN BASED ON OPTIMAL CHAIN ROUTINGKhushbooGupta145
Energy Efficiency in Wireless Sensor Network is one of the most significant aspects of routing in these networks. WSN consist of thousands of sensory nodes densely distributed over wide geographical network. As these nodes are deployed in remote areas where recharging is not possible, even if it is possible it will incur high cost. So there is a need of a protocol which facilitates less energy dissipation and thereby enhances the overall performance of the network. We surveyed several protocols such as LEACH, PEGASIS, ACT etc. and concluded that important performance measures are First Node Die (FND), Half Node Alive (HNA) and Last Node Alive (LNA). Values for above mentioned parameters vary for different protocols. In this paper we present a new protocol Energy Efficient Optimal Chain Protocol (EEOC) which outperforms all above mentioned protocols. We compared the results of all these protocols with EEOC and found that with respect to FND, HNA and LNA EEOC performs way better than others.
A CLUSTER-BASED ROUTING PROTOCOL AND FAULT DETECTION FOR WIRELESS SENSOR NETWORKIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be
deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a
consequence, the main goal is to reduce the overall energy consumption using clustering protocols which
have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and
routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend
the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices
and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated
widely and the results are compared with related works. The experimental results show that the proposed
algorithm provides an effective improvement in terms of energy consumption, data accuracy and network
lifetime
Energy balanced on demand clustering algorithm based on leach-cijwmn
As the use of Wireless Sensor Networks (WSNs) has grown enormously, the need for energy-efficient management has also risen. With advances in ubiquitous computing environment, WSNs have been broadly studied and many energy-efficient routing protocols had been proposed. LEACH (Low Energy Adaptive Clustering Hierarchy) is a popular cluster-based protocol, which provides distributed adaptive clustering and periodic cluster head (CH) selection rotation. As extension to LEACH, LEACH-C (LEACH Centralized) was proposed, in which the energy is utilized to select CH. However, both can’t guarantee cluster head distribution, in addition to considerable periodic clustering overhead. Furthermore, network topology change is a critical characteristic that has influence on communication path and load distribution among nodes. To resolve such problems, Energy-Balance on Demand Clustering Algorithm Based on LEACH-C is proposed. The algorithm adopts centralized cluster formation and distributed CH selection methods. Minimum energy clustering is used to divide the network into clusters, while energy and total communication distance are considered as secondary criteria to select optimal CH. From simulation results the proposed algorithm outperforms LEACH-C in life time, stability period and performance efficiency.
Data Dissemination in Wireless Sensor Networks: A State-of-the Art SurveyCSCJournals
A wireless sensor network is a network of tiny nodes with wireless sensing capacity for data collection processing and further communicating with the Base Station this paper discusses the overall mechanism of data dissemination right from data collection at the sensor nodes, clustering of sensor nodes, data aggregation at the cluster heads and disseminating data to the Base Station the overall motive of the paper is to conserve energy so that lifetime of the network is extended this paper highlights the existing algorithms and open research gaps in efficient data dissemination.
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
DYNAMIC RE-CLUSTERING LEACH-BASED (DR-LEACH) PROTOCOL FOR WIRELESS SENSOR NET...IJCNCJournal
A Wireless Sensor Network (WSN) contains a large number of sensor nodes equipped with limited energy supplies. In most applications, sensor nodes are deployed in a random fashion. Therefore, battery replacement or charging is considered not practical. As a result, routing protocols must be energy-efficient to prolong the network’s lifetime. In this paper, we propose a new Dynamic Re-clustering LEACH-Based protocol (DR-LEACH) which aims to reduce the energy consumption and extending the network’s lifetime. The idea is to balance energy consumption of Cluster Heads (CHs) by generating clusters with almost equal number of nodes during each round of the network life time. To perform this, we first calculate the optimal number of CHs in each round, and based on that we calculate the optimal size of each cluster. Results show that the proposed protocol improves network lifetime and reduces overall energy consumption compared to LEACH and BCDCP protocols.
ENERGY-BALANCED IMPROVED LEACH ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKScscpconf
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
G-DEEC: GATEWAY BASED MULTI-HOP DISTRIBUTED ENERGY EFFICIENT CLUSTERING PROTO...IJCI JOURNAL
Wireless sensor network is composed of hundreds and thousands of small wireless sensor nodes which
collect information by sensing the physical environment. The sensed data is processed and communicated
to other sensor nodes and finally to Base Station. So energy efficient routing to final destination called base
station is ongoing current requirement in wireless sensor networks. Here in this research paper we propose
a multi-hop DEEC routing scheme i.e. G-DEEC for heterogeneous networks where we deploy rechargeable
intermediate nodes called gateways in-between cluster head and base station for minimizing energy
consumption by sensor nodes in each processing round thereby increasing the network lifetime and
stability of wireless sensor networks unlike DEEC.
Advance in the WIRELESS SENSOR NETWORK (WISENET) technology is energy efficient routing protocols that promises a wide range of potential applications in both civilian and military areas. In the WISNET the sensor node have a limited transmission range and their processing and storage capabilities as well as their energy sources are limited. So the Equalized Cluster Head Election Routing Protocol (ECHERP) and PEGASIS with Double Cluster Head (PDCH) pursues energy conservation through balanced clustering for Energy Efficiency. In WSN, energy efficient routing protocol is important to increase the network lifetime. ECHERP and PDCH both protocol claims to be energy efficient.
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor NetworksCSCJournals
A wireless sensor network (WSN) consists of large number of sensor nodes where each node operates by a finite battery for sensing, computing, and performing wireless communication tasks. Energy aware routing and MAC protocols were proposed to prolong the lifetime of WSNs. MAC protocols reduce energy consumption by putting the nodes into sleep mode for a relatively longer period of time; thereby minimizing collisions and idle listening time. On the other hand, efficient energy aware routing is achieved by finding the best path from the sensor nodes to the Base Sta-tion (BS) where energy consumption is minimal. In almost all solutions there is always a tradeoff between power consumption and delay reduction. This paper presents an improved hierarchical coordination for data gathering (HCDG) routing schema for WSNs based on multi-level chains formation with data aggregation. Also, this paper provides an analytical model for energy consumption in WSN to compare the performance of our proposed HCDG schema with the near optimal energy reduction methodology, PEGASIS. Our results demonstrate that the proposed routing schema provides relatively lower energy consumption with minimum delay for large scale WSNs.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
EEIT2-F: energy-efficient aware IT2-fuzzy based clustering protocol in wirel...IJECEIAES
Improving the network lifetime is still a vital challenge because most wireless sensor networks (WSNs) run in an unreached environment and offer almost impossible human access and tracking. Clustering is one of the most effective methods for ensuring that the relevant device process takes place to improve network scalability, decrease energy consumption and maintain an extended network lifetime. Many researches have been developed on the numerous effective clustering algorithms to address this problem. Such algorithms almost dominate on the cluster head (CH) selection and cluster formation; using the intelligent type1 fuzzy-logic (T1-FL) scheme. In this paper, we suggest an interval type2 FL (IT2-FL) methodology that assumes uncertain levels of a decision to be more efficient than the T1-FL model. It is the so-called energy-efficient interval type2 fuzzy (EEIT2-F) low energy adaptive clustering hierarchical (LEACH) protocol. The IT2-FL system depends on three inputs of the residual energy of each node, the node distance from the base station (sink node), and the centrality of each node. Accordingly, the simulation results show that the suggested clustering protocol outperforms the other existing proposals in terms of energy consumption and network lifetime.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
in the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
CBHRP: A Cluster Based Routing Protocol for Wireless Sensor NetworkCSEIJJournal
A new two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol
(CBHRP) is proposed in this paper. It is an extension of LEACH routing protocol. We introduce cluster
head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to
collect information from target field. On rotation basis, a head-set member receives data from the neighbor
nodes and transmits the aggregated results to the distance base station. This protocol reduces energy
consumption quite significantly and prolongs the life time of sensor network. It is found that CBHRP
performs better than other well accepted hierarchical routing protocols like LEACH in term of energy
consumption and time requirement.
Wireless sensor network consists of several distributed sensor nodes. It is used for several environmental applications, military applications and health related applications. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Most of the research in energy efficient data gathering in data centric applications of wireless sensor networks is motivated by LEACH (Low Energy Adaptive Clustering Hierarchy) scheme. It allows the rotation of cluster head role among the sensor nodes and tries to distribute the energy consumption over the network. Selection of sensor node for such role rotations greatly affects the energy efficiency of the network. Some of the routing protocol has a drawback that the cluster is not evenly distributed due to its randomized rotation of local cluster head. We have surveyed several existing methods for selecting energy efficient cluster head in wireless sensor networks. We have proposed an energy efficient cluster head selection method in which the cluster head selection and replacement cost is reduced and ultimately the network lifetime is increased. Using our proposed method, network life time is increased compared to existing methods. Keywords: WSN, CH, BS, LEACH, LEACH-B, LEACH-F
Similar to SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROGENEOUS WIRELESS SENSOR NETWORK (20)
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
TECHNICAL TRAINING MANUAL GENERAL FAMILIARIZATION COURSEDuvanRamosGarzon1
AIRCRAFT GENERAL
The Single Aisle is the most advanced family aircraft in service today, with fly-by-wire flight controls.
The A318, A319, A320 and A321 are twin-engine subsonic medium range aircraft.
The family offers a choice of engines
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Immunizing Image Classifiers Against Localized Adversary Attacks
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROGENEOUS WIRELESS SENSOR NETWORK
1. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
DOI: 10.5121/ijcnc.2021.13504 57
SECTOR TREE-BASED CLUSTERING FOR ENERGY
EFFICIENT ROUTING PROTOCOL IN
HETEROGENEOUS WIRELESS SENSOR NETWORK
Nguyen Duy Tan, Vu Khanh Quy, Pham Ngoc Hung and Le Van Vinh
Faculty of Information Technology, Hung Yen University of Technology and
Education, Hungyen, Vietnam
ABSTRACT
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to
extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery
power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for
Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic
sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate
with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using
mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to
determine which node will become the cluster head (CH) in each cluster? By calculating the duration of
time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our
simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in
comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient
PEGASIS-based protocol (IEEPB), respectively.
KEYWORDS
Wireless Sensor Networks, energy-efficient, routing protocol, tree-based, data aggregation.
1. INTRODUCTION
Wireless sensor networks consist of so many micro-sensor nodes that can be utilized to carry out
various applications for many human purposes, for instance, monitoring environment, forest fire
detection, battlefield surveillance, smart city, underwater applications, etc. In general, the sensor
nodes have small devices, low cost, restricted bandwidth, memory size, calculator abilities, and
resources; especially, it is very difficult to replace or recharge the little battery size of sensor
nodes during operation time [1]. Hence, how to minimize energy dissipation is one of the most
important problems to design routing protocols in WSN to prolong network lifespan.
Routing protocol cluster-based [25] is very popular which is known as a good technique to
increase energy efficiency. This technique can support both heterogeneous and homogeneous
network topology, such as LEACH (Low Energy Adaptive Clustering Hierarchy) [6], ELEC-
LEACH [7], [8] [9], LEACH-G [10], EE-TLDC [11], IEE-LEACH [12], EACBM [13] and so on.
In the LEACH protocol, sensor nodes are organized into several clusters, each cluster selects a
leader node, which is called cluster head (CH) node, CH nodes responsibly aggregate many
rough data packets that are gathered by the other cluster member node(s) with its data into a
unique packet and transmitting the aggregated data packet to the BS; the other nodes in a cluster
(cluster-members) will transmit environmental monitoring data to the respective CH by a single-
2. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
58
hop mode, periodically. CHs will be quickly drained since they have to communicate on a long
link and handle more jobs than the other nodes in the cluster. Therefore, the leading role of CH
must be passed to another node randomly after duration time (called round time) in order to
balance energy dissipation between nodes in the WSN.
Recently, there are many algorithms based on LEACH that have been proposed, one of them is
EE-TLDC (Energy Efficient Two-Level Distributed Clustering Scheme to Prolong Stability
Period of Wireless Sensor Network), in which the CH criteria selection are based on probability
and their remaining energy in current time. In addition, EE-TLDC decreases the number of CH
nodes by selecting some super-CH (SCH) that forward directly data packets to BS. SCHs will
fuse gathered data packets and send them to the base station; the other CHs will only send the
collected data packets to the closest SCH instead of BS to reduce energy consumption.
IEE-LEACH (An Improved Energy-Efficient Routing Protocol for WSN) used sensitive
threshold T(si) for selecting cluster head nodes to balance energy consumption and extend the
network lifespan, which consists of the initial energy, current energy, and the average remaining
energy of alive nodes in the network. Moreover, IEE-LEACH improved energy efficiency by
considering the distance from the nodes to the BS and that of the nodes to the CHS, if it is nearer
to the base station, it will not take part in clusters, it may directly transmit data packets to the BS.
EACBM (a new Energy Aware Cluster Based Multi-Hop Energy Efficient routing protocol for
WSN) reduces communication energy and extends the network lifespan by using integrating
clustering-based routing and multi-hop communication approaches. Besides, the CHs election in
each round ponders on the current energy and probability of the number of candidate nodes to
become CHs to improve energy efficiency. However, the LEACH protocol and improvements are
still disadvantages, for example, the distance between member nodes and CHs or the BS is far in
single-hop communication, therefore, they will run out of energy quickly, although the
complexity algorithm is small.
To solve these problems, Stephanie Lindsey et al. [14] have presented PEGASIS called a basic
chain-based routing protocol at which sensor nodes are organized into a long chain with only
connecting and communicating with the nearest neighbour base on the distance between two
nodes. In order to forward the aggregated data packets to BS, PEGASIS will select a node as
leader chain (CH) in each round whose location is random in the chain.
Recently, Feng Sen et al. [15] improved PEGASIS called IEEPB (Energy-Efficient PEGASIS-
Based) by reducing "long-distance communication" in the chain by choosing the node, which is
the nearest neighbour node joined in the chain to connect. Furthermore, the cluster head (CH)
selection of the IEEPB in each round ponders on the remaining energy of the candidate nodes and
the distance between it and the BS as Equation (1). The simulation results show that IEEPB
achieves a performance higher than the PEGASIS protocol.
4
4
2
1
ave
toBS
i
init
i
d
d
w
E
E
w
w
(1)
where Einit, Ei is the energy initialization and the remaining energy of candidate CH node i-th,
respectively; dave, dtoBS are the average distance of sensor nodes to BS and the distance from
candidate node i-th to BS, respectively.
In [16], Gautam et al. have proposed TSC (track-sector clustering) scheme where the entire
deployed network zone is divided into equal concentric circular tracks and sectors, each sector is
3. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
59
considered as a cluster. All sensor nodes in the cluster are connected to the chain. The nodes in
the chain fused data to reduce redundant data for transmission and choose the shortest distance
between cluster head nodes and the BS in order to save energy. The simulation results illustrate
that PEGASIS, IEEPB, and TSC achieve performance better than LEACH protocol [17];
however, there are still some disadvantages in this protocol. Firstly, the CH is chosen at a random
location in the chain, which disregards the remaining energy of the candidate node and distance
from it to the BS. Secondly, the chain still exists some "long-distance communication" because of
the simple chain construction algorithm. In addition, at the CH can occur bottleneck and high
delay in the data transmission phase because it only has a single CH node in a "long chain" or the
distributed nodes into clusters is not balanced and the duration of time of each round is not
calculated during the network operation.
Based on the analysis above, in order to advance the energy efficiency, lengthen the network
lifespan, and balanced energy dissipation of all nodes in the network, in this paper, we propose
STB-EE based on LEACH-C (A Centralized Energy-Efficient Routing Protocol for WSN) [18],
on which it applies the advantages of both EE-TLDC, IEEPB, and TSC by partition the network
field into virtual sectors that balance the number of nodes in each cluster and evade "long-
distance communication" by organizing all nodes into a minimum spanning tree with the cluster
head as a root for each cluster base on Kruskal algorithm. In addition, STB-EE chooses CH and
SCH nodes in a current round by merging between the remaining energy of candidate nodes and
distance from them to the BS in order to determine which node will be selected as CH or SCH.
Furthermore, STB-EE calculates the proper duration of time in the data transmission phase of
each round to improve energy efficiency.
The simulation results of our show that the network lifespan per round by using our proposed
protocol can be prolonged by about 15%, and 10% in comparison to PEGASIS and IEEPB,
respectively.
The rest of the paper is as follows: Section 2 discusses some previous related works that are
reviewed. Section III describes the framework. The proposed STB-EE protocol is described in
detail in Section IV. In Section V, we analyze the performance base on simulation results.
Finally, in Section VI, conclusions and future work are described in the paper.
2. THE FRAMEWORK
In this section, we will clearly describe some models, which are used in our proposed scheme
such as the heterogeneous sensor network model and energy-consuming model.
2.1. Heterogeneous Network Model
Here, the hierarchical heterogeneous network model was assumed with N micro-sensor nodes
that have three different energy levels: normal, advanced, and super micro-sensor nodes.
We assume that N1, N2 is the proportion of the overall N nodes that involve advanced and super
sensor nodes that are respective α and β times greater energy than the node normal. Therefore, we
can express:
S
A
N
N
A
S
N
N
N
N
and
N
N
N
N
N
N
N
N
N
N
N
),
1
(
),
1
(
,
1
2
1
2
1
(2)
4. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
60
where NS, NA, and NN indicate the number of suppers, advanced, and normal sensor nodes,
respectively [19, 20, 21]. If we let E0 denote the initial energy of each normal node, then E0(1+β)
and E0(1+α) will be the energy of each supper and advanced node, respectively. So, the total
initial energy of overall alive nodes in the network is expressed by Equation (3) below:
β))
(
α)+N
(
+N
(N
E
E S
A
N
init
1
1
0 (3)
We are implicitly assuming that the N micro-sensor nodes are deployed uniform in Z2
religion,
therefore the probability density function (x,y) is indicated as Equation (4) below:
2
/
1
)
,
( Z
y
x
(4)
Let the coordinate of the BS be (xBS, yBS) and the maximum distance between the CH node and
the furthest member node in a cluster (sector, as shown in Figure 3) is expressed as Equation (5)
below:
k
Z
R
/
(5)
In scenarios simulation, the overall sensor nodes are deployed randomly within a monitored
environment field and one BS node whose position is far from the monitoring area and it is an
unrestricted power resource.
2.2. Energy-Consuming Model
The activities of sensor nodes that consume the most energy of the battery are data transmission
and reception. The radio-energy dissipation for transmitting q-bits data between two nodes with
distance d(a, b), the energy consumption is calculated as Equation (6) below [22, 23]:
(6)
where Eelec is a constant power consumed per bit to operate the transmitter or receiver electronic
circuits, Efriis and Etworay are the energy dissipation unit for amplification that depend on the
communication model and the crossover distance. If it is the free space model, the Efriis will be
used with d2
, meanwhile, the two ray ground model will be Etworay and d4
. Finally, the threshold
distance dcrossover is used in NS2 as in [24] in our simulation scenarios and can be computed as
Equation (7) below:
(7)
where ht and hr are the high transmitter and receiver antennas. is the wavelength; l is the
system loss value, respectively. The values of energy parameters that are used for simulation
illustrated in Table 1, and if = 0.32822(m), ht = hr = 1.5(m), l = 1, then dcrossover = 86.1424 (m)
[25].
In order to receive a particular packet that contains q-bit data, the energy expended is calculated
as Equation (8) below:
crossover
tworay
elec
crossover
friis
elec
Tx
d
d
if
d
E
E
q
d
d
if
d
E
E
q
d
q
E
),
(
),
(
)
,
( 4
2
tworay
friis
r
t
crossover
E
E
h
h
l
d
2
2
2
2
4
5. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
61
(8)
3. THE DESCRIPTION OF STB-EE
In this section, we will discuss our proposed protocol, which has four phases; i) cluster (sector)
division, ii) sector head election, iii) minimum spanning tree construction and iv) data
transmission phase.
3.1. Energy Consumption Analysis in STB-EE
3.1.1. The Energy Dissipation of Nodes in the Setup Phase
Assuming that we use N sensor node with uniform deployment in deployed in the area of Z×Z
size with k clusters (sectors), therefore each sector (cluster) will occupy approximately Z2
/k. The
optimal value of k clusters (trees) is similar 4% or 5% in every round [6], [8]. Therefore, each
cluster will have the average N/k sensor nodes which comprise one CH or SCH and (N/k) − 1
member nodes.
Let Eset_up indicate the energy consumption by sensor nodes in a sector for exchanging
management message with BS at i-tℎ round.
elec
toBS
tworay
elec
up
set qE
k
N
d
qE
qE
k
N
i
E
4
_ )
(
(9)
The first portion of Equation (9) denotes the energy dissipation of nodes in a sector when it
broadcasts messages, which contains the remaining energy, identity, and location to the BS. The
last indicates the power unit used for receiving advertisement messages, which contains
information about CHs or SCHs, tree-based sectoring, and TDMA or CDMA schedule from the
BS.
3.1.2. The Energy Dissipation in the Data Transmission Phase
In the steady data transmission phase, the energy consumption of CH and member nodes can be
described as the following components:
(1). Emem: the energy-dissipating of member nodes for receiving, aggregating, and transmitting a
single packet in the tree (sector) can be expressed as Equation (10) below:
)
(
1
1
2 2
toCH
friis
elec
DA
elec
mem d
qE
qE
k
N
qE
k
N
qE
k
N
E
(10)
where dtoCH denotes the distance between the nodes to its the CH in the sector, which can be
calculated as Equation (11):
drd
r
r
dxdy
y
x
y
x
d
E toCH )
,
(
)
,
(
)
(
]
[ 2
2
2
2
(11)
According to Equation (3) and (5), Equation (11) can be computed as below:
elec
Rx E
q
q
E
)
(
6. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
62
k
Z
k
Z
drd
r
k
d
E
k
Z
r
toCH
2
2
.
]
[
2
4
2
0
/
0
3
2
(12)
(2). ECH: the energy-dissipating of CH node in a sector at which it receives data packets from its
member nodes, aggregates, and forwards them to SCH or BS node whose distance between them
is the smallest, can be described as Equation (13) below:
2
)
( toSCH
friis
elec
DA
elec
CH d
qE
qE
qE
chqE
i
E
(13)
where ch is the number of child nodes that are directly connected to the root (CH), if the root
node only connects to one child node, then ch =1 and:
2
2
)
( toSCH
friis
DA
elec
CH d
qE
qE
qE
i
E
(14)
If CH is selected as SCH then Equation (14) is replaced by (15) as below:
4
2
)
( toBS
tworay
DA
elec
CH d
qE
qE
qE
i
E
(15)
where dtoBS indicates the distance between the SCH node and the BS.
(3). Ecluster: the total energy consumed for a single round in a cluster (sector), which is equal to:
mem
CH
cluster E
k
N
E
E
1
(16)
(4). Eround: the total energy-dissipating of a sector for a single round can be computed as:
cluster
up
set
round mE
E
E
_
(17)
where m is the amount of data packets that are sent by overall nodes in a sector to the BS during
the steady transmission phase. Thus, the total energy-dissipating of the entire network in
operating of STB-EE protocol during each round can be shown below:
mem
CH
up
set
round
total E
k
N
E
m
E
k
kE
E 1
(
_
(18)
Now, we can calculate the derivative of Equation (13) to achieve the optimal number of cluster
heads as Equation (19) below:
)
2
(
2
,
0 4
2
toBS
tworay
DA
elect
friis
opt
total
d
E
E
E
E
NZ
k
dk
dE
(19)
Figure 1 shows our simulation results about the average energy consumption and the number of
the message received in BS in a round (throughput Q) with different number sectors. It is clear
that STB-EE is the most suitable when the number of sectors is 5 with N=100 nodes, the
monitoring area is 100 square meters, and the distance to the base station = 175m.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
63
Figure 1. The average energy consumption of STB-EE for changing the number of clusters
3.1.3. Throughput of Network Q and the Duration Time
In this work, the throughput Q of the network is described as the amount of data packets that are
completely sent from overall alive sensor nodes to the BS in a unit of time [9]. In generality, we
assume that there are mi packets that are transmitted to the BS during the steady data transmission
phase in each round, hence, throughput Q can be calculated as Equation (20 below:
round
N
i i
m
N
Q 1
*
(20)
where, Nround denote the total number of rounds and according to Equation (3) and (17), we can
calculate Nround as Equation (21) below:
round
init
round
kE
E
N
(21)
Let tround indicate the lengthy time of each round. Therefore,
packet
rount T
m
t *
(22)
where, ψ, Tpacket is the interval time in the setup phase and a data packet transmission,
respectively. Therefore, we can view that network throughput Q will raise if value of ψ is small
and m*Tpacket ingredient is large, but both ψ and Tpacket are immobile in each round So, we can
only increase m in the data transmission phase (the duration of time of each round). But, if we
increase too long the duration of time of the round then the current energy of CH or SCHs will
run out of energy faster than the other nodes since it must receive and further forward data
packets to BS, the other nodes in each cluster will be useless, as shown in Figure 2. Therefore, in
the STB-EE protocol, we calculate dynamic tround for the current round, this solution helps to
improve energy efficiency when running the STB-EE protocol.
According to Equation (6), (7), (8), and the parameters in Table 1, we can properly estimate the
duration of time for sending m packets in the steady data transmission phase.
Number of sectors (cluster)
Energy
consumption
(Jules)
0 1 2 3 4 5 6 7 8 9 10
0
2
3
4
5
0
2
4
6
8
10
1
1 2 3 4 5 6 7 8 9 10
3.3 4.32 4.53 4.5 4.75 4.22 4.45 4.49 3.65 3.73
5.0 3.4 3.3 3.4 2.69 3.19 3.19 3.41 3.52 3.79
k
Q
Etotal
The throughput Q (Kbytes)
8. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
64
theshold
DF
Rx
toBS
Tx
SCH E
qE
d
q
E
d
q
E
m
i
E
)
)
,
(
)
,
(
(
)
( 4
(23)
where, Etheshold is the energy threshold value, which is immobile by the user and bigger than zero
to ensure that the CH or SCH is still alive after finishing this round. ESCH(i) and ch denote the
remaining energy of SCH i-th and the number of directly connected child nodes of its on the tree,
respectively, and we have:
)
)
1
((
)
(
4
DF
toBS
tworay
elec
theshold
SCH
E
d
E
E
ch
q
E
r
E
m
(24)
Accordingly, the function object can be presented as:
m
N
Q
f round
max
arg
max
arg (25)
In Figure 2, we have illustrated our simulation results; as we can see that the network throughput
Q will raise if we increase the time duration of the round (tround), but throughput Q only grows to
a certain level and keep stable. This indicates that the SCH node is exhausted energy; this
problem is not good for fixed the time duration of round during the operation network. So, STB-
EE will calculate flexibility in the duration of time for each round to improve energy efficiency.
Furthermore, Figure 2 illustrates the throughput Q too when we modify the distance from the
base station to the monitored network field; according to the simulation results, it is clear that the
longer the distance between SCHs and BS is, the smaller throughput Q is to receive.
Figure 2. The throughput Q with modification tround and network distance to the base station
3.2. The Setup Phase
3.2.1. Sector Separation of a Balanced Number of Nodes
Firstly, BS will communicate with overall alive nodes in the network to get the position and the
remaining energy of them, and then it distributes the monitoring zone into k dynamic sectors.
The optimal number of k is equivalent to 5%, this equals k clusters with virtual circles that cover
the overall sensor zone as shown in Figure 3 in which we illustrate a partition method of the
network topology which is the boundary of 100 100 square meters and BS at (49, 49) [18].
10
20
40
60
80
100
120
140
180
200
300
250
175
100
0
2.5
5.0
7.5
10
12.5
15
17
20
The length of round
(seconds)
tround
Network distance to BS (meters)
The
throughput
Q
(Kbytes)
9. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
65
Figure 3. Network partition into sectors
Considering the central of network sensor field is at the polar coordinates XOY original as Figure
3, we compute φ angle of each node in the network base on the information generated by its
position and coordinates and provided as Equation (26) below:
BS
BS X
X
X
Y
Y
Y
X
Y
,
where
,
180
*
arctan
(26)
where, X, Y is the position of the node on the X-axis and Y-axis, respectively. If its coordinate is
in the second or third quadrant, φ = 180 + ω and if it is in the fourth quadrant, φ = 360 + ω
because, at that coordinate, the tan function value will be a negative value.
Algorithm 1: Sector separation
Input: N sensor nodes and x, y position of their
Output: N sensor nodes in k logical sectors with N/k nodes for each sector
1: N Get the number of alive nodes in the network
2: for each node i-th in {List of the N alive nodes } do
3: Send HELLO message, which contains its ID, remain energy and location, to the BS
end for
5: Compute angle for all alive nodes as in Equation (26)
6: Sort the list of alive nodes according to not decreasing (increase) of angle
7: Partition balancing the network area into k sector with N/k nodes for each sector based on their
angle
as Figure 3 and 4.
8: Go to Algorithm 2;
3.2.2. Sector Head Election Step
In an r-th round of STB-EE, the BS will choose CH node for a current cluster, whose remaining
energy is bigger than or equal Eavg and the cost function is maximum as Equation (27) below:
)
(
1
)
(
1
r
E
nn
r
E
N
j
j
avg
(27)
where Ej(r) is the residual energy of j-th node.
0
100
0
X
R
0
0
100
k
1
2
Sensor field
O
...
S
10. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
66
h
j
i
j
i
d
BS
i
d
h
c
r
E
c
Max
i
t
1
2
1
)
,
(
)
,
(
*
)
(
*
)
(
cos
(28)
where h is the amount of neighbors of node i-th and d(i, j) is the Euclidean distance between the
candidate i-th and j-th node, which can be expressed as Equation (29):
2
2
)
(
)
(
)
,
( j
i
j
i y
y
x
x
j
i
d
(29)
Furthermore, c1 and c2 are the coefficient factors in the cost function, they are also set by the user
for various characteristics of the WSN’s scale. If c1 is bigger than or equal to c2, it intends that the
remaining energy of the candidate node is a more momentous factor than the distance between
node and BS in considering as CH.
3.2.3. Supper Sector Head Selection Step
In STB-EE protocol, there are only a few SCHs which is responsible for forwarding data packets
to the BS to save energy for the other CHs, so the distance between them and BS is as near as
possible. Therefore, if the distance between CH and BS is smaller than the average distance Davg
from them to BS and the position of CH is in the S zone as shown in Figure 3, then CH will be
chosen as SCH. The Davg can be determined as Equation (30) below:
k
i i
avg BS
CH
d
k
D 1
)
,
(
1
(30)
Here, we restrict the number of SCHs by selecting half of the number of CHs whose distances to
BS is smaller than or equal Davg to reduce energy consumption in the network.
Algorithm 2: Sector Leader Selection
Input: N sensor nodes and the position of their
Output: CH and SCH of each cluster
// Sector Head Selection
1: for each sector in the {List of sectors} do
2: Calculate average energy as in Equation (27)
3: Select CH node, whose cost function is the highest as Equation (28)
end for
//Supper Cluster Head Selection Phase
Compute Davg between all CHs and BS as in Equation (30)
6: for each CH in {List of the CH nodes} do
7: if (Davg > d(CHi, BS) and YCHi > 50) then
8: Select CH as SCH and add it into {List of the SCH nodes} node
else
10: Connect CHi to SCHj, whose d(SCHj, BS) is the shortest
end if
12: end for
13: Compute the time duration for this round as in Equation (24) and (25)
Go to Algorithm 3;
11. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
67
3.2.4. Sector-Tree Based Formation Phase
Figure 4. The network topology with STB-EE protocol in one round
Figure 4 illustrates the sector partition for 100 sensor nodes that are deployed in a monitoring
area of 100100 square meters into five sectors that balance the size of the sensor node, and then
all node in each sector are connected together by building into a minimum spanning tree.
Suppose that WSN is modeled as an undirected graph G(D, V, E) completely, at which V
expresses a set of distributed sensor nodes, E indicates a set of communication links connecting
the sensor nodes and D represents the set of distances on E, respectively.
The process of constructing a minimum spanning tree base on Kruskal is illustrated as Algorithm
3 below:
Algorithm 3: Tree Formation Phase
Input: N/k sensor nodes of a cluster
Output: Tree with CH as root node
1: count ← 0;
ei ← 1;
TREE ← {CH};
Set CH as root node;
5: for each edge i in {List of the E edges} do
E[i].mark ← FALSE;
7: Sort({List of the E edges} as not descending of distance)
8: while (ei < {Number of E edges}-1) do
9: Select edge ei in {List of the edges}, whose E[ei].mark is FALSE;
10: u ← get root of (E[ei].u);
11: v ← get root of (E[ei].v);
12: if (u and v are two nodes on two different tree) then
13: Union(E[ei].u, E[ei].v);
14: E[ei].mark ← TRUE;
0
100
Base station
0
Cluster 1
Cluster 2
Cluster 4 Cluster 5
Sensor node Cluster head
Supper Cluster head
C
luster
3
100
12. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
68
count ← count +1;
16: if (count = {number of nodes alive}-1) then break;
end if
ei ← ei + 1;
19: end while
20: for each edge i in {List of the E edges} do
21: if (E[i].mark = TRUE) then
TREE ← TREE {E[i].u, E[i].v};
end if
end for
25: Create TDMA schedule for all nodes in cluster
26: Broadcast the TDMA schedule and TREE to network
27: return {TREE};
3.3. Data Transmission Phase
As soon as STB-EE has completed the cluster header election and the sector tree-based clustering
organization phase above, the data packets are started with intra-sector and inter-sector
transmission. At first, the farthest nodes (leaf nodes) in each tree will sense the environment and
send the collected data packet to their parent node along the tree. The parent nodes receive the
data packets, and fuse this data with its own sensed data packet, compress and transmit it to the
upper-level parent node in the tree toward the BS. Whenever the SCH node receives all the data
from cluster members, it will forward the data packet to the BS after aggregating it in the same
way. After a duration time, the next round will be restarted by the repartition sector, reselecting
CHs, as well as rebuilding minimized spanning trees in each sector for a new round.
4. EVALUATION AND SIMULATION RESULTS
4.1. Performance Measurements
we use the following metrics to evaluate the performance of the STB-EE and compare it with
other protocols [26, 27, 28].
Network lifespan: This performance metric is calculated from the sensor nodes in the
network start to work until the last node dies (LND), which can be calculated by Equation
(31) below:
round
N
i
round i
t
lifetime
Network
1
)
(
_
(31)
Energy consumption: The total energy consumption of the entire nodes in the network in
monitoring, processing, communicating, and the other activities during the simulation time,
which can be computed by Equation (17) above.
Energy Efficiency (EE): Energy efficiency is described as the ratio between the amount of
data packets accomplished to the BS (the throughput of network Q) and the total energy
consumption in the network (Kbytes/Joule) that can be calculated by Equation (32) below:
total
E
Q
efficiency
Energy
_
(32)
13. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
69
The total number of data packets received in the BS: It is the total number of data packets
that are exactly received by the base station from the overall nodes in WSN during the
network working.
4.2. Simulation Parameters
To evaluate the performance of STB-EE, the scenarios simulations are executed by using ns-2
(v.2.34) simulator tool as in [24, 25] and compared to LEACH-C, EE-TLDC, PEGASIS, and
IEEPB with simulation parameters that are expressed as in Table 1, [18] [16].
Table 1. The simulation environment
No.
Item
Parameters Description Value
1 Simulation region 100m x 100m
2 Network size 100 nodes
3 Etworay(Radio amplifier energy) 100 pJ/bit/m2
4 E0 (Initial energy of node) 1J
5 Efriis(Radio free space) 0.0013pJ/bit/m4
6 Eelec(Radio electronics energy) 50 nJ/bit
7 EDA (Data aggregation) 5 nJ/bit/packet
8 Energy model Battery
9 Packet size 1024 bytes
10 Simulation time 3600s
11 Base station at 49,175
12 Channel type Wireless channel
13 Antennae mode Antenna/Omni antenna
14 Bandwidth 100Mbps
15 α 0.5
16 β 2
17 N1 0.5
18 N2 0.4
19 c1 100J
20 c2 0.3m
4.3. Simulation Results
Figure 5 illustrates the changing of the total number of alive nodes in the entire network when
increasing the network lifespan. Here, the Y-axis represents the number of alive nodes and the X-
axis denotes the network the lifespan in rounds with BS location at (49, 175). It is observable that
STB-EE exhibits a longer network lifespan in the LND approximately 15% and 10% compared
with PEGASIS and IEEPB protocol, respectively.
In Figure 6, we demonstrate the total energy consumed by all nodes for five protocols during the
simulation time (rounds). It is clear that STB-EE consumes the least energy in comparison to
IEEPB and PEGASIS protocols because STB-EE chooses CH considering the remaining energy
and distance of aspirant nodes to BS. Moreover, in PEGASIS and IEEPB, most of the CH
forward data packets directly to the BS while in STB-EE, only a few SCH nodes forward data
packets to the BS with short distances, and the other nodes only transmit aggregated data on the
tree. So, STB-EE helps to achieve better energy efficiency and extend the WSN lifespan.
14. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
70
Figure 5. Number of nodes alive per round with BS location at (50,175)
Figure 6. Total energy consumption of the network per round with BS position at (50,175)
Figure 7 illustrates the percentage of dead sensor nodes during the simulation time and the
number of rounds. As exhibited in Figure 7, STB-EE achieves better performance than LEACH
and PEGASIS in terms of network lifespan with BS location at (50,175).
Figure 8 illustrates the number of data packets transmitted during the network operation by the
alive node to the base station when the location of BS is being changed. It is clear that there is a
memorable decline in the data packets received in the BS when the location of the BS is modified
from the initial location (49, 100) to the farthest location (49, 265) in the simulation region.
However, the total number of received data packets of our proposed are still higher than
PEGASIS and IEEPB since STB-EE suitably calculates the duration of time for each round
therefore it advances energy efficiency and prolongs the network lifespan. Furthermore, STB-EE
achieves balance the energy consumption among sensor nodes in the network because of
distributing equal alive nodes into the clusters and rotating the CH role in each round, the more
balanced the energy consumption in the network, the more performance protocol achieves [29].
PEGASIS
LEACH-C
STB-EE
IEEPB
EE-TLDC
Number of rounds
0 1500
1000
500 2000
20
100
0
40
60
80
Number
of
Nodes
alive
Number of rounds
0 1500
1000
500 2000
20
100
0
40
60
80
Enery
Consumption
in
Joules
120
140
160
PEGASIS
LEACH-C
STB-EE
IEEPB
EE-TLDC
15. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
71
Figure 7. The percentage of sensor node dead
Figure 8. The amount of data packets received successfully by BS when positioning modifies
Moreover, Figure 9 illustrates the energy efficiency of LEACH-C, EE-TLDC, PEGASIS, IEEPB,
and STB-EE protocols with modification of the duration time of rounds, (tround) from 10 to 500
(seconds) in the heterogeneous network model. As can be observed in Figure 9, if we increase the
time duration the data transmission phase (tround), the energy efficiency (throughput Q) will
increase to the pick in tround =100 with LEACH-C, EE-TLDC and tround = 300 seconds with
PEGASIS, IEEPB, and STB-EE, and then that will decrease with all protocol. But STB-EE
protocol still achieves energy efficiency better than other protocols because our proposed
protocol chooses CHs base on the residual energy of candidate nodes and reduces the distance
communication among nodes in the network by constructing a minimum spanning tree. However,
the STB-EE approach is not good at tround = 10 seconds due to more energy consumption in the
setup phase for each round.
Number
of
rounds
The percentage of dead nodes
0
1500
1000
500
2000
10% 75%
25%
20% 95%
PEGASIS
LEACH-C
STB-EE
IEEPB
EE-TLDC
Number
of
Ps
received
by
BS
0
1500
1000
500
2000
The base station at (49,100), (49,175), ...
(49,100) (215,47)
(49,175) (49,265)
PEGASIS
LEACH-C
STB-EE
IEEPB
EE-TLDC
16. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
72
Figure 9. The energy efficiency per throughput with changing the time duration of rounds
5. CONCLUSIONS
In this paper, we have developed a new sector tree-based routing protocol in our proposition
which integrates sector division and tree-based clustering routines in order to diminish energy
dissipation in data transportation in WSN. STB-EE can balance the energy consumption by
distributing balance the number of nodes into clusters because the more balanced the energy
consumption in the network, the more data packets the BS receives. Moreover, STB-EE reduces
energy consumption and extends the network lifespan by constructing a minimized tree in each
sector according to the Kruskal algorithm and aggregating sensed data before forwarding it to the
BS. The simulation results show that the energy efficiency of STB-EE is higher than that of
PEGASIS and IEEPB about 15% and 10% in terms of network lifespan, respectively in the
simulation scenario (100 nodes deployed in 100m100m region). In the future, we would like to
further improve energy efficiency by reducing the total distance of control packets (i.e., routing
overhead) transmitted to the BS in the setup phase of each round.
CONFLICTS OF INTEREST
The authors declare no conflict of interest.
REFERENCES
[1] Khan, M. K., Shiraz, M., Ghafoor, K. Z., Khan, S., Sadiq, A. S., & Ahmed, G. (2018). "EE-MRP:
Energy-Efficient Multistage Routing Protocol for Wireless Sensor Networks", Wireless
Communications and Mobile Computing, pp. 1–13.
[2] Liu, X. (2012). "A Survey on Clustering Routing Protocols in Wireless Sensor Networks". Sensors
Open Access Journal, Vol. 12, No. 8, pp. 11113–11153.
[3] Morsi, M. A., Barakat, M. T., & Nashaat, A. A. (2020). "An Efficient And Secure Malicious Node
Detection Model For Wireless Sensor Networks". International Journal of Computer Networks &
Communications (IJCNC), 12(1). 97-108.
[4] Ravikiran, N, D., & Dethe, G, C. (2018). Improvements In Routing Algorithms To Enhance Lifetime
Of Wireless Sensor Networks. International Journal of Computer Networks & Communications
(IJCNC), 10(2). 23-32.
[5] Salti, A, F., Alzeidi, N., & Day, K. (2020). "Localization Schemes For Underwater Wireless Sensor
Networks: Survey". International Journal of Computer Networks & Communications (IJCNC), 12(3).
113-130.
PEGASIS
LEACH-C
STB-EE
IEEPB
EE-TLDC
The time length of rounds (seconds)
0 300
100
10 700
20 50 200 500
400
1200
0
600
800
1000
Energy
efficiency
(Kbps/Joule)
200
17. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
73
[6] Heinzelman, W. B., Chandrakasan, A. P., & Balakrishnan, H. (2002). "An Application Specific
Protocol Architecture for Wireless Microsensor Networks". IEEE Transactions on wireless
communication, Vol. 1 No. 4, pp. 660–670.
[7] Sama, N.U., Zen, K. B., Rahman, A. U. BiBi, B., Rahman, A. U., & Ikra Afzal Chesti, I. A. (2020).
"Energy Efficient Least Edge Computation LEACH in Wireless sensor network", International
Conference on Computer and Information Sciences (ICCIS), Sakaka, Saudi Arabia, pp. 1-6.
[8] Yang, Z., Liu, J., & Chen, X. (2009). "An Optimal Mechanism of LEACH Protocol for Wireless
Sensor Networks". In The Second ISECS International Colloquium on Computing, Communication,
Control, and Management (CCCM), Sanya, China, pp. 254 257.
[9] Li, Y., Yu, N., Zhang, W., Zhao, W., You, X., & Daneshmand, M. (2011). Enhancing the
Performance of LEACH Protocol in Wireless Sensor Networks. In IEEE Conference on Computer
Communications Workshops (INFOCOM WK-SHPS), Shanghai, China, pp. 223–228.
[10] Chen, H., Zhang, C., Zong, X., & Wang, C. (2013). "LEACH-G: an Optimal Cluster-heads Selection
Algorithm based on LEACH". Journal of Software, Vol. 8, No. 10, pp. 2660 2667.
[11] Kaur, M., Jain, A., & Goel, A. K. (2014). Energy Efficient Two Level Distributed Clustering Scheme
to Prolong Stability Period of Wireless Sensor Network. In International Conference on Advances in
Computing, Communications and Informatics (ICACCI), Delhi, India, pp. 68–73.
[12] Liu, Y., Wu, Q., Zhao, T., Tie, Y., Bai, F., $ Jin, M. (2019), "An Improved Energy-Efficient Routing
Protocol for Wireless Sensor Networks", Sensors, Vol. 19, No. 20, pp. 1–20.
[13] Toor, A. S., & Jain, A. K. (2018). "A new Energy Aware Cluster Based Multi-hop Energy
Efficient routing protocol for Wireless Sensor Networks", the 6th IEEE International Conference on
Smart Energy Grid Engineering, Oshawa, Canada, pp. 133–137.
[14] Lindsey, S., & Raghavendra, C. S. (2002). "PEGASIS: Power-Efficient Gathering in Sensor
Information System". In IEEE Aerospace Conference Proceedings, Big Sky, Montana, pp. 1125–
1130.
[15] Sen, F., Bing, Q., & Liangrui, T. (2011). "An Improved Energy-Efficient PEGASIS-Based Protocol
in Wireless Sensor Networks". In Eighth International Conference on Fuzzy Systems and Knowledge
Discovery, Shanghai, China, pp. 2230–2233.
[16] Gautam, N., Lee, W.I., & Pyun, J.Y. (2009). "Track-Sector Clustering for Energy Efficient Routing
in Wireless Sensor Networks". In Ninth IEEE International Conference on Computer and Information
Technology, Xiamen, China, pp. 116–121.
[17] Yu, J. D., Kim, K. T., Jung, B. Y., & Youn, H. Y. (2009). An Energy Efficient Chain-Based
Clustering Routing Protocol for Wireless Sensor Networks". In The IEEE 23rd International
Conference on Advanced Information Networking and Applications Workshops, Bradford, United
Kingdom, pp. 383–388.
[18] Muruganthan, S. D., Ma, D. C. F., Bhasin. R, I., & Fapojuwo, A. (2005). "A Centralized energy-
efficient routing protocol for wireless sensor networks". IEEE Radio Communications, Vol. 43, No.
3, pp. 8–13.
[19] Zytoune, O., Ab outa jdine, D., & Tazi, M. (2010). "Energy Balanced Clustering Algorithm for
Routing in heterogeneous Wireless Sensor Networks". In The 5th International Symposium on I V
Communications and Mobile Network (ISVC), Rabat, Morocco, pp. 1 4.
[20] Saxena, R., Rishiwal, V., & Singh, O. (2018). "Performance Evaluation of Routing Protocols in
Wireless Sensor Networks", International Conference on Internet of Things: Smart Innovation and
Usages (IoT-SIU), Bhimtal, India, pp. 1 6.
[21] Mittal, N., Singh, U., & Rohit Salgotra (2019). Tree Based Threshold-Sensitive Energy Efficient
Routing Approach For Wireless Sensor Networks. Wireless Personal Communications, 108 (1),
473−492.
[22] Li, A., & Chen, G. (2018). "Clustering Routing Algorithm Based on Energy Threshold and Location
Distribution for Wireless Sensor Network", the 37th Chinese Control Conference (CCC), Wuhan,
China, pp. 7231–7235.
[23] Assari, E. Y., Fallah, A. S., Aasri, E. J., Arioua, M., & Oualkadi, E. A. (2020). "Energy-Efficient
Multi-Hop Routing With Unequal Clustering Approach For Wireless Sensor Networks". International
Journal of Computer Networks & Communications (IJCNC), 12(3). 55-73.
[24] Project, 1997. "The Network Simulator - NS2". The Network Simulator - NS2. Available:
http://www.isi.edu/nsnam/ns. (Accessed 24 June 2020).
[25] Heinzelman, W. (2004) MIT uAMPS LEACH ns Extensions. Available:
http://www.ece.rochester.edu/research/wcng/code/index.htm. (Accessed 24 June 2020).
18. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September 2021
74
[26] Osamy, W., ed Salim, A., & Khedr, A. M. (2020). "An information entropy based-clustering
algorithm for heterogeneous wireless sensor networks". Wireless Networks, 26 (3), 1869−1886.
[27] Li, X., Keegan, B., Mtenzi, F., Weise, T., & Tan, M. (2019). "Energy-Efficient Load Balancing Ant
Based Routing Algorithm for Wireless Sensor Networks". IEEE Access, 4, 1−14.
[28] Thyagarajan, J., & Suganthi K. (2019). "A Novel Hybrid Opportunistic Scalable Energy Efficient
Routing Design For Low Power, Lossy Wireless Sensor Networks". International Journal of
Computer Networks & Communications (IJCNC), 11(6). 23-44.
[29] Liang, H., Yang, S., LiLi, & Gao, J. (2019). "Research on routing optimization of WSNs based on
improved LEACH protocol". EURASIP Journal on Wireless Communications and Networking, 1
(2019), 1−12.