# Selfish Node Detection for Effective Data Transmission Using Modified Incentive Sorted Pathway Selection in Wireless Sensor Networks

Authors: P. Ashok Babu; L. Kavisankar; Jasmine Xavier; V. Senthilkumar; Gokul Kumar; T. Kavitha; A. Rajendran; G. Harikrishnan; A. Rajaram; Amsalu Gosu Adigo
Journal: Wireless Communications and Mobile Computing
 (2022)

---

## Abstract

Wireless nodes have time-varying behavior in their nature because the energy usage of each node is not being constant. Packet transmission among cluster nodes gets overloaded when multi-input and multioutput is made; multitask is performed causing more energy usage; also, selfish node could not transfer the data packet to the target node. Selfish nodes need to hide some important data and then only transmit normal data that try to misuse those data, so packet delivery rate is reduced. This normal method does not identify selfish nodes in the routing path. Proposed Incentive Sorted Path Selection Scheme (ISPSS), the progressively stable algorithm, enables the identification of such selfish nodes. The results confirm the enhancement in the lifetime of the network, the energy efficiency, and the delivery rates of the packets with reduced end-to-end delay.


---

## Body

## 1. Introduction

The latest techniques move forwards the arrangement of little low-cost sensor nodes against a section of concentration to organize position information, to provide a route for packet sharing with also a path to a sink node for packet organization, that in total contain a sensor network [1]. It is used in several uses in temperature analyzing, adversity managing, record analyzing, smart spaces, exactness gardening, end monitoring, and observation. In a multihop wireless sensor network with a permanent overloading state, every sensor node functions as an information collector node that generates data packets to the network at a nominal time gap, to send its data packets to the base station sink node [2].At a similar time, all nodes should work as transmitters to broadcast the remaining data packets to the base station node through various routes. In different uses, the sensor nodes have more energy and lack any renewing service [3]. Mainly of the sensor nodes energy level is low in the communication performed in network environment. While the energy level is worn out, a node fails to work and predictably this stops the lifespan of the network that shows the time period of communication until the drop in initial node, mostly because of the lacking energy in the network [4]. Consequently, for the efficient energy use, the predominant thing to be minimized is the entire quantity of packet communication in sensor environment.Packet overload is total amount of packets should be reached into the sink node is lesser surrounded by the reporting restriction [5]. Those clear, it is evident that all packet must follow the route with lesser hop to minimize the total quantity of communications. Except if nodes forever broadcast their packets to the base station node through minimum hop routes, nodes quicker to the base station should take more load and will drain their energy sooner, generating energy holes [6] in the order of the base station node.Therefore, in the wireless multihop sensor network, the demanding problem is to use the energy or power of all the nodes consistently to enhance the lifespan of the entire network [7]. Data collecting with traffic management in conditions of energy broadcast at each entity node may be a well-organized method to increase the network lifespan. It should report newly on this problem. But in most of the previous processes, load evaluation should be obtained at the expenditure of communicating through more distance path that is not the best from energy direction of vision [8]. Here, nodes take a choice to broadcast data packets more overstraight through different routes direct to assurance energy management.The higher and lesser limits on well-designed lifespan are derived. Heuristic method with communication energy control ensures higher network lifespan by managing overhead communication as equally as probable [9]. Those methods traffic management is besieged at the charge of improved energy usage in communication among inefficient paths. Normal conditions for the correct allocation of the base station node, else intermediate nodes, are used. For using more data association, transmitting with data combination [10] has emerged as a helpful concept for traffic management which should not decide the energy hole issues completely. At the same time, it needs multifaceted calculation to avoid defeat of very important data.This obtains traffic-free packet transmission among wireless sensor nodes. The routing paths are sorted based on their distance and energy usage. Thus, the effective pathway for transmission from the source node to the base sink node utilizes relatively less energy and is at a shorter distance. The selfish node exists in the clusters.From here the paper is discussed in sections as given below. Section2 discusses the related previous works. In Section 3, the details of the proposed Modified Incentive Sorted Pathway Selection Approach (ISPS) are discussed to opt for an efficient way for the communication in the wireless sensor network (WSN) technology. It also deals with the identification and deletion of the selfish nodes present in the clusters. Section 4 provides detailed insights to carry the simulation and analysis of the results to examine the performance obtained with respect to various parametric conditions. Finally, Section 5 concludes the proposed work and also elaborates an idea for future work.


## 2. Previous Works

Naeem, Muhammad, and team [11] presented an understanding through group of Multiple Input Multiple Output path; also continuation of a reply path among the groups with fusion center is the input of the present environment. The energetic characteristics should bead opt within the environment are present guide copied from the accepted analyzing of the path superiority that has been attain among the reply path from the mixture center. The energetic possessions of the present environment make it strong over time, adjusting character of the spread infrastructure. Network is self-governing of the character of the analyzing use, obtained with general character. When compared to the existing DDEEC and EDDEEC methods, the experimental output of the clustering method has the longest network lifetime. In addition, it is validated by output of proposed framework obtaining a trade-off model among network life span with communication trust worthiness.Chatterjee et al. [12] present a method which creates lesser overload, enough for reporting. Depending on this node sharing, a dispersed, almost traffic managing data collecting scheme is launched for packets to reach the base station through less hop routes that also in turn supports boundary of the overload. A standard case probabilistic investigation is made which depends on great identical random links to find an imaginary lesser hop on the amount of nodes to be arranged. Output indicates the proposed model has higher lifespan of network and minimum cost routing path compared to previous methods.Feng et al. [13] proposed adaptive packet broadcasting in sensor network afflicted with possible selfish nodes. Well Suited ICMP motivation is more copy of information. Allow for the rules that node’s broadcasting decision in this method damaged by its present energy level; with network infrastructure it is difficult to share data through nodes to guide their broadcasting characters. In the meantime, the broadcasting character updates create the evolutionary stable method for this environment. It reduces error and improves accuracy of packet transmission.Nithyakalyani and Suresh Kumar [14] present various analyzing methods that suggest various group head choice methods for data collection. This method studies the data relay K-means grouping method, with unclear grouping methods with inherited grouping technique. Important factors for estimating and distinguishing these algorithms are distinct, characterized, and conclude. To consider a thought that the sensor nodes are aimlessly dispersed and are not fixed, data packets organization of the sink node with the size of the sensor ground is identified.Dey et al. [15] proposed work on constructing a grouping method stimulated from Fruit Fly association to optimize energy efficiency of the nodes in the sensor network with reduced pathway route for the communication. Also, they are involved in improving the lifespan of nodes since each node has more energy. The overall network is partitioned with various ranges by the Fruit Fly model. The primary effectiveness of energy usage is essential to design the FF method. Lifespan of network is measured based on cluster head chosen scheme with data transmission effectiveness being analyzed depending on groups in network. It easy to find misroute data packet compared to previous method.Justus and Chandra Sekar [16] presented that many routing techniques are used to find and remove blocking in sensor network. For traffic management in sensor network, there is want to place and find routing Data packets concerning all node in the network for Better communication route discovering from source node to target node in network. Path Selection approach is altered by the DalPaS Hybridized Dynamic for the traffic management in the sensor networks. The collected packets are done with the nodes that exist on the network. For reduced overload, routing procedure is carried out. Better transmission rate is achieved in present method compared to existing method.Kurt et al. [17] proposed broadcast energy task with packet size chosen to be consistent. Consequently, joint analyzing of communication energy also packet size is of greatest vital one in sensor network lifespan improvement. To design a complete LL-link layer model, the behavior of the sky network sensor nodes and their path depends on the normal analyzing with route failure of different infrastructures. A novel MIP-Mixed Integer training generates support for the link layer model to enhance sensor’s lifespan by the joint optimization of communication energy range with data packet size. It obtains network infrastructure through the numerical results of the optimization scheme.Celik and Kamal [18] proposed effective cluster head that provides the lesser collision rate in communication and best routing routes from sender to target node. Exploit Poisson-Binomial sharing, widespread K-out-of N voting condition is launched for heterogeneous nodes to accept sender to have various normal identification of collision. This convex optimization method is well-known to reduce the intracluster energy usage by jointly obtaining the better sensing times and limits of feature identifiers for this condition. A common fixed sample size examination is done to create a weighted sample size survey for quantized flexible decision combination to achieve a more energetic communication. It is better one for cluster head chosen compared to existing methods.Gong et al. [19] proposed WARAS-adaptive path chosen motivated by metabolism characters of Escherichia coli. It contains of two things; the first one is a path activity model to show alteration integrity of multipath overload in communication to normal network, that is in reverse relative to total dissimilarity among current route capacity and better route capacity. Next are multiattractor rules reconstructed by specifying important effects of congestion on the route chosen. It is easy for present scheme to find congestion compared with lots of attack identification methods. It performs smooth communication so minimum energy is used.Li et al. [20] proposed an RNs’ NSI which contains DeN (degree of node) intrinsic selfishness and extrinsic selfishness. Below the disseminated node self-interest control, a route chosen is constructed to choose the most effective and minimum distance routes that cause more energy usage. Present method finds the misbehaving node and source broadcast data packet to target node in best route. Experimental output manages the selfish node behavior and provides effective communication in wireless sensor network environment.Gong et al. [21] presented scheme adaptive path chosen scheme which is also known as WSN path chosen scheme depending on the adaptive response by characteristics selection model that is inspired.Mohanty and Kabat [22] presented a method to keep away from congested node traffics with the calculation of the possibilities for jamming in the nodes, relay nodes, speedy transmission, and the data packet broadcast range in the relaying node that is known. The storage limit at each node is the distribution to hold for the reasonable and prominent data rate successes.Premanand and Rajaram [23] present an improved architecture for solving data inaccuracy problem in route selection. Due to the dynamic nature of mobile nodes, optimum path selection for enhancing the data transmission ratio is a challenging task. To address this issue, higher accuracy is achieved through the new routing protocol. This is executed for every successful and unsuccessful data communication.Palaniswami and Rajaram [24] propose the malicious node detection technique for MANET environment via managing the trustworthiness of each mobile user in the network. For that, trust value of mobile node is computed and added in the packet header. Based on the information, packet forwarding node is selected and also malicious node is detected.Palaniswamy and Rajaram [25] propose a security architecture for providing the data integrity, confidentiality, and authentication features to detect and mitigate the security attacks. For security improvement, Shamir’s Secret Sharing is proposed for two operations such as Certificate Revocation and Certificate Renewal at the Certificate Authority.


## 3. Overview of Proposed Model

Wireless sensor nodes perform packet transmission in cluster, but traffic occurred when packet transmission is delayed by selfish node that is present in routing path. There is selfish node available in routing path, it hides the vital information from packet, and it forwards normal data to next neighbor node in routing path to sink node. Incentive Sorted Path Selection Scheme is present to control the packet overload for each transmission. Progressive stable algorithm is implemented to detect the selfish node, depending on behavior that node adjusts the frequency level from low to high; in that time packet information is hidden by selfish node.Figure1 shows the Modified Incentive Sorted Pathway Selection Model. The nodes that act as the cluster head are involved in coordination with all other members in the network. It performs the collection of information of the entire nodes present in that particular cluster. Modified Incentive Sorted Pathway selection model is proposed to identify the traffic rates in the network. This is done by implementing the progressively stable algorithm concept. This algorithm periodically monitors the node frequency updates and encounters the selfish node. For instance, if there exists no traffic in the network, it indicates that there is the possibility for smooth transmission in the path. Thus, it enhanced delivery rate of the packets and minimized traffic or overhead of communication.Figure 1
Block diagram of the Modified Incentive Sorted Pathway selection model.The nodes of the self-directed transmitting packets are suffered due to selfishness. Pointing to the selfishness of any particular node that exists in the network environment is considered to merit, irrespective of the broadcasting data packet construction; it also controls the protection issues. In the WSN communication process, two different types of selfishness are analyzed, they are the entity and the common methods. The detection of single selfishness denotes the irregularity in the node network that concentrates on their own security reasons. Also, the selection of the selfish nodes supports the remaining members.


### 3.1. Cluster Heads Coordinate Their Member

A preparation of sensor nodes into various effective clusters is called grouping. Each group is comprised of a cluster head and its fellow member nodes. The functionality of the cluster head is to monitor and manage the member nodes in the group and perform intercluster packet organization and broadcasting of the data packets. They segregate the data packets that are transmitted to the base station node. Thus, reduced traffic is witnessed.An energetic grouping and the formation of relay method are done for the time-driven and the event-driven purposes. Furthermore, a common network is used for the adaptive operation of the aforesaid analyzing situation to improve its possibility of construction for a dissimilar choice of uses. Additionally, the dynamic portion of the quantity of cooperation depending on path broadcast conditions is also measured. The structured sensor network selects the decisions, the choice of the cluster head, organizing groups with its nodes intermediate, and the option of sensor nodes support for the coverage to the center combination which happened within the individual group’s transmission range in the network.Co is the coordination of cluster coordination and it is expressed as(1)Co=Cm∗DC|DB,Cm is cluster member, and DC|DB is data collection with data broadcasting. If the networks are individual hop models then each sensor node broadcasts its packets straight to the base station in the network. Those designs do not support the large area because communication cost becomes so costly for energy usage. In the multihop flat scheme, sensor nodes broadcast similar data packets such as routing tables. Network overhead and energy usage are improved, and usage of the resource is not to be more. At last in the grouping scheme, sensor nodes have minimum traffic with minimum energy usage due to the data organization scheme being done in cluster head; also cluster head intermediate should aggregate data packets to the base station node. In the grouping method, resources are assigned to all groups to minimize intrusion among cluster members, so network lifetime is improved, and nodes are active for a long period of time. In simulation output, many clustering methods are suitable for the remote large-scale area network.(2)Cm=limmn,(3)limmn=∑csc−1nm.A dispersed group head chosen method is present in which each of the sensor nodes that can provide the role with lesser energy usage has an option to become head group node. Initially, each of the sensor nodes will transmit information to the cluster heads and finally to the sink node of the network. At first, each of the sensor nodes is normal to estimate their space from the center of its base station node.


### 3.2. Modified Incentive Sorted Pathway Selection

The sensor nodes are normal to grade depending on their distance from the mid of the group individually. The nearest source node of the mid to the grid has the maximum chance of becoming the group head. The threshold for energy consumption of a particular channel is suspiciously definite, if the energy usage of a cluster head categorizes to down the energy level for each channel. The position of the group report is usually to be broadcast to the next maximum chance node. Previously each cluster head is chosen; the residual nodes discover the nearest cluster head nodes and add them irrespective of their original group obligation. It selects the group header nodes, with the designing of new groups in the network.(4)csc−1nm=mn↔logm.Cluster heads carry out more processes for their individual source nodes’ performance at efficient energy than the nongroup head node. Popularly used grouping methods perform, revolving the group headeract between sensor nodes when reducing the regularity of regrouping, it is vital to discover the best routing in an efficient manner.(5)mn↔logm=mn↔logmSP.Process for nodes construction is used to discover the better value to describe path that needs extensive experimental output. As the sharing of sensor nodes is normal to be chance in most of the uses, unstable grouping is needed to construct that adjustment with changeable rules within the network. Subsequently, the methods to discover the best limit strength modify transmission rate so the lifetime of the network is reduced since the selfish node is caused to damage packet transmission on the choosing of the routing path and therefore can cause more energy usage in the network environment. To defeat these boundaries aforesaid limit is fixed for selection technique; a soft decision depends on threshold chosen scheme.(6)Cm=mn↔logmSP,(7)DC|DB=êDCêDB.The data creator nodes alter the amount of information collected in a particular routing path. It is an efficient way in which the amount of packet improves; the proportion of router nodes increase quickly with the percentage of data creator nodes should not be important. The minimum amount of information creator nodes limits the quantity of data packets created in the routing path and therefore improves the lifespan of the network considerably. In addition, it is obvious that networks with more packets should reduce traffic occurrence when the selfish node is identified.(8)êDC2êDB=DC2DB.This incentive sorted path choosing method removes the selfish node which presents in the routing path; cluster head collects data packets in a frequent manner. Selfish node disturbance causes data packet transmission traffic to occur. By using ISPS method packet latency is reduced, because it does not allow traffic occurrence in every time slot. The energy level of all nodes in the cluster maintains a similar range, as the delivery rate of the packets increases (Algorithms). Progressively stable routing analyzes each node’s behavior if the node varying the frequency level causes loss of data packets during the transmission time period. These nodes are identified and marked to remove from the particular cluster, which is the selfish node for transmission. Initially, it hides some of the essential details and broadcasts the normal details alone to the cluster head and finally to the base sink node (Algorithm2).Algorithm 1: Modified Incentive Sorted Pathway selection algorithm.
(1)
for every selection of sorted path(2)
ifpath==selfishnode(3)
ill-treat transmitted data packets(4)
hiding confidential information, broadcasting only the normal information.(5)
thus, identify and discard the selfish node(6)
else,(7)
if{selfish node = path! }(8)
proceed transmission of packets efficiently(9)
packet data organization by the cluster head(10)
END_if(11)
END_for


### 3.3. Progressively Stable Algorithm

The header node quantities are chosen arbitrarily. The header node begins to increase in wraps approximately. During each transmission, the nodes of a wrap choose a single-hop intermediate node, which improves the coverage and broadcasts the data packet to the header. Surrounded by all these nodes header chooses the efficient path that should contain higher coverage range and transmit data packets. All header finishes while its separation outputs the needed coverage; else no linked intermediate node of the divider is gone. Last, headers that are doing well broadcast its separation to the base station node.(9)Co=Cm∗DC2DB,(10)Co=mn↔logmSP∗DC2DB.It is assured that all information is created by a data creators to effectively attain the base station node through single transmitter nodes in straight data maintaining the network’s practical traffic management. The chance of nonuniform node distribution does not assure that great corresponding should exist. By using the progressively stable algorithm, whether a node contains data packets should lose to discover an equal data its packet is should be dropped which should make some region of the neighborhood to stay exposed.Progressively stable routing analyzes each node’s behavior if the node varying the frequency level causes loss of data packets during the transmission time period. Those nodes are identified and marked to remove from the particular cluster, which is the selfish node for transmission. Initially, it hides some of the essential details and broadcasts the normal details alone to the cluster head, and finally to the base sink node.Algorithm 2: Progressively stable algorithm.
(1)
ifNode==Stablecommunication(2)
for individual path checked(3)
frequency update analysis results as no change in frequency.(4)
establishment of connections for the packet transmission(5)
forward the collected cluster head to the sink node.(6)
else(7)
ifnode==Unstablecommunication(8)
frequency update analysis results in a lot of changes in frequency.(9)
selfish node discard in the routing path.Step10: END_forStep 11: END_ifIt enables the Modified Incentive Sorted Pathway for the packet collected by the cluster header node. Progressively stable energy-based routing is obtained, when the efficient nodes are only chosen to perform communication between cluster member node and base station node or sink node. It improves the packet delivery ratio and also minimizes energy and end-to-end delay.Packet ID: It comprises a whole wireless sensor network node data based on its behavior and node deployment in the network environment.In Figure2, the existing packet format is presented. Three bytes are consumed by the source node ID field and three bytes are consumed by the destination node ID field. The third one is cluster heads to coordinate its member to carry 5 bytes. The fourth field occupies 6 bytes. The Modified Incentive Sorted Pathway selection model is applied to clustering; cluster head organizes data packets in an effective routing path. So energy consumption is reduced. The fifth has 3 bytes. Progressive stable algorithm is constructed to improve stable communication and monitor the frequency changes of each node. The final file is the improved packet delivery ratio, and it consumes 4 bytes of data. Thus the identification and removal of selfish nodes are done in the routing path.Figure 2
The projected internet service provider’s packet format.


## 3.1. Cluster Heads Coordinate Their Member

A preparation of sensor nodes into various effective clusters is called grouping. Each group is comprised of a cluster head and its fellow member nodes. The functionality of the cluster head is to monitor and manage the member nodes in the group and perform intercluster packet organization and broadcasting of the data packets. They segregate the data packets that are transmitted to the base station node. Thus, reduced traffic is witnessed.An energetic grouping and the formation of relay method are done for the time-driven and the event-driven purposes. Furthermore, a common network is used for the adaptive operation of the aforesaid analyzing situation to improve its possibility of construction for a dissimilar choice of uses. Additionally, the dynamic portion of the quantity of cooperation depending on path broadcast conditions is also measured. The structured sensor network selects the decisions, the choice of the cluster head, organizing groups with its nodes intermediate, and the option of sensor nodes support for the coverage to the center combination which happened within the individual group’s transmission range in the network.Co is the coordination of cluster coordination and it is expressed as(1)Co=Cm∗DC|DB,Cm is cluster member, and DC|DB is data collection with data broadcasting. If the networks are individual hop models then each sensor node broadcasts its packets straight to the base station in the network. Those designs do not support the large area because communication cost becomes so costly for energy usage. In the multihop flat scheme, sensor nodes broadcast similar data packets such as routing tables. Network overhead and energy usage are improved, and usage of the resource is not to be more. At last in the grouping scheme, sensor nodes have minimum traffic with minimum energy usage due to the data organization scheme being done in cluster head; also cluster head intermediate should aggregate data packets to the base station node. In the grouping method, resources are assigned to all groups to minimize intrusion among cluster members, so network lifetime is improved, and nodes are active for a long period of time. In simulation output, many clustering methods are suitable for the remote large-scale area network.(2)Cm=limmn,(3)limmn=∑csc−1nm.A dispersed group head chosen method is present in which each of the sensor nodes that can provide the role with lesser energy usage has an option to become head group node. Initially, each of the sensor nodes will transmit information to the cluster heads and finally to the sink node of the network. At first, each of the sensor nodes is normal to estimate their space from the center of its base station node.


## 3.2. Modified Incentive Sorted Pathway Selection

The sensor nodes are normal to grade depending on their distance from the mid of the group individually. The nearest source node of the mid to the grid has the maximum chance of becoming the group head. The threshold for energy consumption of a particular channel is suspiciously definite, if the energy usage of a cluster head categorizes to down the energy level for each channel. The position of the group report is usually to be broadcast to the next maximum chance node. Previously each cluster head is chosen; the residual nodes discover the nearest cluster head nodes and add them irrespective of their original group obligation. It selects the group header nodes, with the designing of new groups in the network.(4)csc−1nm=mn↔logm.Cluster heads carry out more processes for their individual source nodes’ performance at efficient energy than the nongroup head node. Popularly used grouping methods perform, revolving the group headeract between sensor nodes when reducing the regularity of regrouping, it is vital to discover the best routing in an efficient manner.(5)mn↔logm=mn↔logmSP.Process for nodes construction is used to discover the better value to describe path that needs extensive experimental output. As the sharing of sensor nodes is normal to be chance in most of the uses, unstable grouping is needed to construct that adjustment with changeable rules within the network. Subsequently, the methods to discover the best limit strength modify transmission rate so the lifetime of the network is reduced since the selfish node is caused to damage packet transmission on the choosing of the routing path and therefore can cause more energy usage in the network environment. To defeat these boundaries aforesaid limit is fixed for selection technique; a soft decision depends on threshold chosen scheme.(6)Cm=mn↔logmSP,(7)DC|DB=êDCêDB.The data creator nodes alter the amount of information collected in a particular routing path. It is an efficient way in which the amount of packet improves; the proportion of router nodes increase quickly with the percentage of data creator nodes should not be important. The minimum amount of information creator nodes limits the quantity of data packets created in the routing path and therefore improves the lifespan of the network considerably. In addition, it is obvious that networks with more packets should reduce traffic occurrence when the selfish node is identified.(8)êDC2êDB=DC2DB.This incentive sorted path choosing method removes the selfish node which presents in the routing path; cluster head collects data packets in a frequent manner. Selfish node disturbance causes data packet transmission traffic to occur. By using ISPS method packet latency is reduced, because it does not allow traffic occurrence in every time slot. The energy level of all nodes in the cluster maintains a similar range, as the delivery rate of the packets increases (Algorithms). Progressively stable routing analyzes each node’s behavior if the node varying the frequency level causes loss of data packets during the transmission time period. These nodes are identified and marked to remove from the particular cluster, which is the selfish node for transmission. Initially, it hides some of the essential details and broadcasts the normal details alone to the cluster head and finally to the base sink node (Algorithm2).Algorithm 1: Modified Incentive Sorted Pathway selection algorithm.
(1)
for every selection of sorted path(2)
ifpath==selfishnode(3)
ill-treat transmitted data packets(4)
hiding confidential information, broadcasting only the normal information.(5)
thus, identify and discard the selfish node(6)
else,(7)
if{selfish node = path! }(8)
proceed transmission of packets efficiently(9)
packet data organization by the cluster head(10)
END_if(11)
END_for


## 3.3. Progressively Stable Algorithm

The header node quantities are chosen arbitrarily. The header node begins to increase in wraps approximately. During each transmission, the nodes of a wrap choose a single-hop intermediate node, which improves the coverage and broadcasts the data packet to the header. Surrounded by all these nodes header chooses the efficient path that should contain higher coverage range and transmit data packets. All header finishes while its separation outputs the needed coverage; else no linked intermediate node of the divider is gone. Last, headers that are doing well broadcast its separation to the base station node.(9)Co=Cm∗DC2DB,(10)Co=mn↔logmSP∗DC2DB.It is assured that all information is created by a data creators to effectively attain the base station node through single transmitter nodes in straight data maintaining the network’s practical traffic management. The chance of nonuniform node distribution does not assure that great corresponding should exist. By using the progressively stable algorithm, whether a node contains data packets should lose to discover an equal data its packet is should be dropped which should make some region of the neighborhood to stay exposed.Progressively stable routing analyzes each node’s behavior if the node varying the frequency level causes loss of data packets during the transmission time period. Those nodes are identified and marked to remove from the particular cluster, which is the selfish node for transmission. Initially, it hides some of the essential details and broadcasts the normal details alone to the cluster head, and finally to the base sink node.Algorithm 2: Progressively stable algorithm.
(1)
ifNode==Stablecommunication(2)
for individual path checked(3)
frequency update analysis results as no change in frequency.(4)
establishment of connections for the packet transmission(5)
forward the collected cluster head to the sink node.(6)
else(7)
ifnode==Unstablecommunication(8)
frequency update analysis results in a lot of changes in frequency.(9)
selfish node discard in the routing path.Step10: END_forStep 11: END_ifIt enables the Modified Incentive Sorted Pathway for the packet collected by the cluster header node. Progressively stable energy-based routing is obtained, when the efficient nodes are only chosen to perform communication between cluster member node and base station node or sink node. It improves the packet delivery ratio and also minimizes energy and end-to-end delay.Packet ID: It comprises a whole wireless sensor network node data based on its behavior and node deployment in the network environment.In Figure2, the existing packet format is presented. Three bytes are consumed by the source node ID field and three bytes are consumed by the destination node ID field. The third one is cluster heads to coordinate its member to carry 5 bytes. The fourth field occupies 6 bytes. The Modified Incentive Sorted Pathway selection model is applied to clustering; cluster head organizes data packets in an effective routing path. So energy consumption is reduced. The fifth has 3 bytes. Progressive stable algorithm is constructed to improve stable communication and monitor the frequency changes of each node. The final file is the improved packet delivery ratio, and it consumes 4 bytes of data. Thus the identification and removal of selfish nodes are done in the routing path.Figure 2
The projected internet service provider’s packet format.


## 4. Performance Analysis

### 4.1. Experimentation

The projected Internet Services Provider’s model is simulated using the NS 2.34, Network Simulator tool. The simulation parameter includes 100 sensor nodes employed in the area with 1060 meters × 930 meters square’ region for about 80 milliseconds of simulation time. All the sensor nodes were organized in a haphazard manner within the network. These nodes exhibit the same transmission range of around 250 meters. CBR (Constant Bit Rate) delivers a constant speed to the transmission of packets in the network, thus contributing to limiting the rate of traffic occurrence. DSR (Dynamic source routing) protocol offers an effective communication pathway for the transmission of the packets in the clustered phase and it also identifies the selfish nodes in the routing pathway. Table1 gives the parameters used for the initialization of the NS.Table 1
Experimental parameter setup.
Number of nodes used100 No.Area dimensions1060 m × 930 mMac address usedIP-802.11 gRadio coverage range250 mThe time limit used for simulation30 msSource traffic usedCBRThe size of the packets150 bytesAgility modelRandom way pointProcedureDynamic source routing protocol


#### 4.1.1. Simulation Results

#### 4.1.2. Simulation Outcome

Figure3 depicts the projected Internet Service Providers method enabling the traffic-free packet transmission among cluster nodes in sensor network; it chooses an efficient routing path compared to the existing Universal Dynamic Clustering Scheme approach [11] and the Leaky Bucket Counter approach [12]. Projected Internet Service Providers method with the progressively stable routing algorithm is used for the stabilization of the node energy during the routing process and detects the selfish node during transmission time, so it increases packet delivery rate and minimizes delay.Figure 3
Projected Internet service provider’s simulation result.


### 4.2. Performance Analysis

To analyze the performance of the network, the simulation was carried out using the parameter X graph in the network simulator 2.34.


#### 4.2.1. End-to-End Delay

From Figure4 the end-to-end delay is evaluated by using the time slot used for communication between the sender and the cluster head node, with progressive stable routing support to remove the selfish attack. In the proposed Internet Service Providers method the end-to-end delay is reduced comparatively.(11)end to end delay=end time–start time.Figure 4
Graphical result for the nodes vs. the end-to-end delay.


#### 4.2.2. Communication Overhead

Figure5 confirms that the communication overhead is minimized as the cluster head node organizes the data packet with an efficient network connection. The data packets are efficiently acknowledged by the cluster head. In the proposed Internet Service Providers scheme the communication overhead is reduced comparatively compared to the existing methods like Leaky Bucket Counter protocol, NARP, LORP, Universal Dynamic Clustering, EPCSA, etc.(12)communication overhead=number of packet lossesreceived∗100.Figure 5
Graphical result for the pause time vs. the communication overhead.


#### 4.2.3. The Delivery Ratio of the Packets

Figure6 depicts the packet delivery ratio which is measured by the amount of data packets received from the amount of data packets sent. Generally, the transmission rate was set as 100, and the trustworthy node connection was recognized to achieve an efficient data packet organization by the cluster head and the base station node. Thus the work presented showed an increased packet delivery ratio compared to all other existing approaches.(13)packet delivery ratio=number of packets receivedsent∗100.Figure 6
The graphical result for the nodes vs. the packet delivery ratio.


#### 4.2.4. The Lifetime of the Network

Figure7 depicts that the lifetime of the network is determined by the performance of the entire network, the amount of energy, and the time required for the transmission. Stable energy nodes are used for the routing process; also, the selfishness nodes were identified and removed. In the proposed ISP’s method, the network lifetime was found to be increased more than in the other existing approaches like LBC, RCDA, TDTC, LORP, UDCS, etc.(14)network lifetime=length of energy usageoverall energy.Figure 7
The graphical result for the nodes vs. the network lifetime.


#### 4.2.5. Consumption of Energy

Figure8 depicts the energy consumption, which is the amount of energy spent for the transmission of data from the starting node to the ending node. In the projected model the analysis of the frequency in the nodes and frequency updates were done by using the progressively stable routing algorithm. The energy consumption is minimized more than that of the other existing protocols.(15)energy consumption=initial energyfinal energy.Figure 8
The graphical result for the number of nodes vs. the energy consumption.


#### 4.2.6. Packet Drop Rate

Figure9 represents that the loss of the data packets was reduced; it eliminates the communication link within the sensor nodes of the cluster. It also helps in the removal of the selfish node which was made available in the routing pathway. In the proposed ISPS model, the drop rates of the packet are reduced compared to the other existing methods.(16)packet drop rate=number of packetsdroppedsent∗100.Figure 9
The graphical result for the nodes vs. the packet drop rate.


## 4.1. Experimentation

The projected Internet Services Provider’s model is simulated using the NS 2.34, Network Simulator tool. The simulation parameter includes 100 sensor nodes employed in the area with 1060 meters × 930 meters square’ region for about 80 milliseconds of simulation time. All the sensor nodes were organized in a haphazard manner within the network. These nodes exhibit the same transmission range of around 250 meters. CBR (Constant Bit Rate) delivers a constant speed to the transmission of packets in the network, thus contributing to limiting the rate of traffic occurrence. DSR (Dynamic source routing) protocol offers an effective communication pathway for the transmission of the packets in the clustered phase and it also identifies the selfish nodes in the routing pathway. Table1 gives the parameters used for the initialization of the NS.Table 1
Experimental parameter setup.
Number of nodes used100 No.Area dimensions1060 m × 930 mMac address usedIP-802.11 gRadio coverage range250 mThe time limit used for simulation30 msSource traffic usedCBRThe size of the packets150 bytesAgility modelRandom way pointProcedureDynamic source routing protocol


### 4.1.1. Simulation Results

### 4.1.2. Simulation Outcome

Figure3 depicts the projected Internet Service Providers method enabling the traffic-free packet transmission among cluster nodes in sensor network; it chooses an efficient routing path compared to the existing Universal Dynamic Clustering Scheme approach [11] and the Leaky Bucket Counter approach [12]. Projected Internet Service Providers method with the progressively stable routing algorithm is used for the stabilization of the node energy during the routing process and detects the selfish node during transmission time, so it increases packet delivery rate and minimizes delay.Figure 3
Projected Internet service provider’s simulation result.


## 4.1.1. Simulation Results

## 4.1.2. Simulation Outcome

Figure3 depicts the projected Internet Service Providers method enabling the traffic-free packet transmission among cluster nodes in sensor network; it chooses an efficient routing path compared to the existing Universal Dynamic Clustering Scheme approach [11] and the Leaky Bucket Counter approach [12]. Projected Internet Service Providers method with the progressively stable routing algorithm is used for the stabilization of the node energy during the routing process and detects the selfish node during transmission time, so it increases packet delivery rate and minimizes delay.Figure 3
Projected Internet service provider’s simulation result.


## 4.2. Performance Analysis

To analyze the performance of the network, the simulation was carried out using the parameter X graph in the network simulator 2.34.


### 4.2.1. End-to-End Delay

From Figure4 the end-to-end delay is evaluated by using the time slot used for communication between the sender and the cluster head node, with progressive stable routing support to remove the selfish attack. In the proposed Internet Service Providers method the end-to-end delay is reduced comparatively.(11)end to end delay=end time–start time.Figure 4
Graphical result for the nodes vs. the end-to-end delay.


### 4.2.2. Communication Overhead

Figure5 confirms that the communication overhead is minimized as the cluster head node organizes the data packet with an efficient network connection. The data packets are efficiently acknowledged by the cluster head. In the proposed Internet Service Providers scheme the communication overhead is reduced comparatively compared to the existing methods like Leaky Bucket Counter protocol, NARP, LORP, Universal Dynamic Clustering, EPCSA, etc.(12)communication overhead=number of packet lossesreceived∗100.Figure 5
Graphical result for the pause time vs. the communication overhead.


### 4.2.3. The Delivery Ratio of the Packets

Figure6 depicts the packet delivery ratio which is measured by the amount of data packets received from the amount of data packets sent. Generally, the transmission rate was set as 100, and the trustworthy node connection was recognized to achieve an efficient data packet organization by the cluster head and the base station node. Thus the work presented showed an increased packet delivery ratio compared to all other existing approaches.(13)packet delivery ratio=number of packets receivedsent∗100.Figure 6
The graphical result for the nodes vs. the packet delivery ratio.


### 4.2.4. The Lifetime of the Network

Figure7 depicts that the lifetime of the network is determined by the performance of the entire network, the amount of energy, and the time required for the transmission. Stable energy nodes are used for the routing process; also, the selfishness nodes were identified and removed. In the proposed ISP’s method, the network lifetime was found to be increased more than in the other existing approaches like LBC, RCDA, TDTC, LORP, UDCS, etc.(14)network lifetime=length of energy usageoverall energy.Figure 7
The graphical result for the nodes vs. the network lifetime.


### 4.2.5. Consumption of Energy

Figure8 depicts the energy consumption, which is the amount of energy spent for the transmission of data from the starting node to the ending node. In the projected model the analysis of the frequency in the nodes and frequency updates were done by using the progressively stable routing algorithm. The energy consumption is minimized more than that of the other existing protocols.(15)energy consumption=initial energyfinal energy.Figure 8
The graphical result for the number of nodes vs. the energy consumption.


### 4.2.6. Packet Drop Rate

Figure9 represents that the loss of the data packets was reduced; it eliminates the communication link within the sensor nodes of the cluster. It also helps in the removal of the selfish node which was made available in the routing pathway. In the proposed ISPS model, the drop rates of the packet are reduced compared to the other existing methods.(16)packet drop rate=number of packetsdroppedsent∗100.Figure 9
The graphical result for the nodes vs. the packet drop rate.


## 4.2.1. End-to-End Delay

From Figure4 the end-to-end delay is evaluated by using the time slot used for communication between the sender and the cluster head node, with progressive stable routing support to remove the selfish attack. In the proposed Internet Service Providers method the end-to-end delay is reduced comparatively.(11)end to end delay=end time–start time.Figure 4
Graphical result for the nodes vs. the end-to-end delay.


## 4.2.2. Communication Overhead

Figure5 confirms that the communication overhead is minimized as the cluster head node organizes the data packet with an efficient network connection. The data packets are efficiently acknowledged by the cluster head. In the proposed Internet Service Providers scheme the communication overhead is reduced comparatively compared to the existing methods like Leaky Bucket Counter protocol, NARP, LORP, Universal Dynamic Clustering, EPCSA, etc.(12)communication overhead=number of packet lossesreceived∗100.Figure 5
Graphical result for the pause time vs. the communication overhead.


## 4.2.3. The Delivery Ratio of the Packets

Figure6 depicts the packet delivery ratio which is measured by the amount of data packets received from the amount of data packets sent. Generally, the transmission rate was set as 100, and the trustworthy node connection was recognized to achieve an efficient data packet organization by the cluster head and the base station node. Thus the work presented showed an increased packet delivery ratio compared to all other existing approaches.(13)packet delivery ratio=number of packets receivedsent∗100.Figure 6
The graphical result for the nodes vs. the packet delivery ratio.


## 4.2.4. The Lifetime of the Network

Figure7 depicts that the lifetime of the network is determined by the performance of the entire network, the amount of energy, and the time required for the transmission. Stable energy nodes are used for the routing process; also, the selfishness nodes were identified and removed. In the proposed ISP’s method, the network lifetime was found to be increased more than in the other existing approaches like LBC, RCDA, TDTC, LORP, UDCS, etc.(14)network lifetime=length of energy usageoverall energy.Figure 7
The graphical result for the nodes vs. the network lifetime.


## 4.2.5. Consumption of Energy

Figure8 depicts the energy consumption, which is the amount of energy spent for the transmission of data from the starting node to the ending node. In the projected model the analysis of the frequency in the nodes and frequency updates were done by using the progressively stable routing algorithm. The energy consumption is minimized more than that of the other existing protocols.(15)energy consumption=initial energyfinal energy.Figure 8
The graphical result for the number of nodes vs. the energy consumption.


## 4.2.6. Packet Drop Rate

Figure9 represents that the loss of the data packets was reduced; it eliminates the communication link within the sensor nodes of the cluster. It also helps in the removal of the selfish node which was made available in the routing pathway. In the proposed ISPS model, the drop rates of the packet are reduced compared to the other existing methods.(16)packet drop rate=number of packetsdroppedsent∗100.Figure 9
The graphical result for the nodes vs. the packet drop rate.


## 5. Conclusion

All sensor nodes need to perform multitask at the same time that causes the depletion of energy in the network so that the link quality is not sufficient. The selfish nodes in the network misuse the essential information and only forward the important information to the next neighbor node in the cluster. And so the packet drop occurs. This proposed ISPS method establishes the routing path way as the traffic-free relay nodes in the cluster are not the best and have selfish behavior. This selfish node distributes all the information to the unwanted or out-of-coverage nodes, and so more energy is used. Thus, they are identified and removed from the entire network environment. Progressively stable routing algorithm promotes the frequency analysis updates during the transmission, it is easy for it to find the selfish node, and it also improves the packet delivery ratio and reduces the end-to-end delay process. Further in the future, the focus of boundary coverage monitoring for the analysis of various metrics in the sensor network can be carried out.



---

*Source: 9359135-2022-02-18.xml*