In the traditional clustering routing protocol of wireless sensor network, LEACH protocol (Low Energy
Adaptive Clustering Hierarchy) is considered to have many outstanding advantages in the implementation
of the hierarchy according to low energy adaptive cluster to collect and distribute the data to the base
station. The main objective of LEACH is: To prolong life time of the network, reduce the energy
consumption by each node, using the data concentration to reduce bulletins in the network. However, in the
case of large network, the distance from the nodes to the base station is very different. Therefore, the
energy consumption when becoming the host node is very different but LEACH is not based on the
remaining energy to choose the host node, which is based on the number of times to become the host node
in the previous rounds. This makes the nodes far away from the base station lose power sooner.
In this paper, we give a new routing protocol based on the LEACH protocol in order to improve operating
time of sensor network by considering energy issues and distance in selecting the cluster-head (CH), at that
time the nodes with high energy and near the base station (BS) will have a greater probability of becoming
the cluster-head than the those in far and with lower energy.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEYijasuc
Recent developments in processor, memory and radio technology have enabled wireless sensor networks
which are deployed to collect useful information from an area of interest. The sensed data must be
gathered and transmitted to a base station where it is further processed for end-user queries. Since the
network consists of low-cost nodes with limited battery power, power efficient methods must be employed
for data gathering and aggregation in order to achieve long network lifetimes. In an environment where in
a round of communication each of the sensor nodes has data to send to a base station, it is important to
minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With
the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power
consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be
achieved in terms of network lifetime. Several application specific sensor network data gathering protocols
have been proposed in research literatures. However, most of the proposed algorithms have been some
attention to the related network lifetime and saving energy are two critical issues for wireless sensor
networks. In this paper we have explored general network lifetime in wireless sensor networks and made an
extensive study to categorize available data gathering techniques and analyze possible network lifetime on
them.
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEYijasuc
Recent developments in processor, memory and radio technology have enabled wireless sensor networks
which are deployed to collect useful information from an area of interest. The sensed data must be
gathered and transmitted to a base station where it is further processed for end-user queries. Since the
network consists of low-cost nodes with limited battery power, power efficient methods must be employed
for data gathering and aggregation in order to achieve long network lifetimes. In an environment where in
a round of communication each of the sensor nodes has data to send to a base station, it is important to
minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With
the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power
consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be
achieved in terms of network lifetime. Several application specific sensor network data gathering protocols
have been proposed in research literatures. However, most of the proposed algorithms have been some
attention to the related network lifetime and saving energy are two critical issues for wireless sensor
networks. In this paper we have explored general network lifetime in wireless sensor networks and made an
extensive study to categorize available data gathering techniques and analyze possible network lifetime on
them.
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
Power saving mechanism for hybrid routing protocol using scheduling techniqueeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s
lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period
Maximizing Network Lifetime by Using Smart Cluster Head Selectioniosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
SLGC: A New Cluster Routing Algorithm in Wireless Sensor Network for Decrease...IJCSEA Journal
Decrease energy consumption and maximizing network lifetime are important parameters in designing and protocols for wireless sensor network (WSN).Clustering is one of the efficient methods in energy consumption by Cluster-Head in WSN. Besides, CH can process and aggregate data sent by cluster members, thus reducing network traffic for sending data to sink. In this paper presents a new cluster routing algorithm by dividing network into grids. In each grid computes the center-gravity and threshold of energy for selecting the node that has the best condition base on these parameters in grid for selecting Cluster-Head in current round, also SLGC selecting Cluster-Heads for next rounds thereby this CHs reduce the volume of controlling messages for next rounds and inform nodes for sending data into CH of respective round. This algorithm prolong network lifetime and decrease energy consumption by selecting CH in grid and sending data of grid to sink by this CH. Result of simulation shows that SLGC algorithm in comparison with the previous clustering algorithm has maximizing network lifetime and decrease energy consumption in network.
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
Energy aware clustering protocol (eacp)IJCNCJournal
Energy saving to prolong the network life is an important design issue while developing a new routing
protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the
network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a
homogeneous network architecture, in which all sensors have the same capabilities in terms of battery
power, communication, sensing, storage, and processing. Recently, there has been an interest in
heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new
energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is
introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal
nodes are elected with the help of a probability scheme based on residual and average energy of the
normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a
round. Advanced nodes use a separate probability based scheme for cluster head election and they will
further act as a gateway for normal cluster heads and transmit their data load to base station when they
are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during
cluster formation phase to save network energy. The performance of EACP is compared with SEP and
simulation result shows the better result for stability period, network life and energy saving than SEP.
Energy Efficient Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
Correlating objective factors with videoIJCNCJournal
To succeed in providing services, the quality of services should meet users’ satisfaction. This is a motivation to study the relationship between the service quality and the real perceived quality of users, which is commonly referred to as the quality of experience (QoE). However, most of existing QoE studies that focus on video-on-demand or IPTV services analyze only the influence of network behaviors to video quality. This paper focuses on P2P video streaming services, which are becoming a significant portion of Internet traffic, and pays attention to the change of users’ perception with the adjustment of objective
factors as well as network behaviors. We propose to use mean opinion score and peak signal to noise ratio
methods as QoE evaluations to consider the effect of the chunk loss ratio, the group-of-picture size, and the
chunk size. The experimental results provide a convincing reference to build the complete relationship
between objective factors and QoE. We believe that this assessment will contribute to study a new service
quality evaluation mechanism based on users’ satisfaction in the future.
Privacy, especially in a cellphone, is an important thing and should be protected. Steganography is a
method used to protect a sensitive information. The issue tried to be discussed in this study is the issue on
inserting technique in a text through a simple method of White Space Steganography on android. The
inserted message has been compressed through a double compression method by using LZW and Huffman
so that the size of message to be inserted can be minimized while the capacity of the inserted message can
be minimized. The compression shows that the compression ratio much depends on the type of text input to
the text to be sent; the more the repetition or duplication found on the message, the smaller the
compression ratio will be. The compression process using Android based smartphone is relatively fast with
the average duration of 0.045 seconds, either for the insertion or extraction.
During route discovery of mobile ad hoc network, broadcasting of route request and route reply packets
are the essential operations for finding the path between two ends. In such situations, intermediate node
which may or may not belongs will participate in route discovery process, update routing table and
rebroadcast the route discovery packets again to its neighboring nodes. Finally optimal path is found with
minimum hops. This simply upsurges overhead and deteriorates the performance of routing. The proposed
Petal Ant Routing (PAR) algorithm offers a low overhead by optimizing FANT and BANT transmissions in
route discover process. The algorithm is an improved version of SARA and has features extracted from
petal routing. The algorithm is simulated on NS2, compared with ACO frame work called SARA and
classical routing protocols such as AODV and AOMDV. The simulation results shows that PAR further
reduces overhead by eliminating redundant FANT transmission compared to other routing algorithm.
A MASS BALANCING THEOREM FOR THE ECONOMICAL NETWORK FLOW MAXIMISATIONIJCNCJournal
A mass balancing theorem (MBT) was recently introduced, concerning the role of 'unbalanced nodes' in the optimization of network flow. The MBT discovers and proves a flow-balancing property, which can be exploited in the design of network flow algorithms. Subsequently a number of such applications of the MBT have been explored for various types of flow-networks. These have included, in particular, single and
multiple commodity networks with additional equipment of separators, which are present in various real world scenarios including the oil and gas industry. In this paper, the mass balancing theorem is revisited,and further developed to consider new network examples with embedded cycles. In doing so, algorithms based on the mass balancing method are extended to remove any undesirably saturated edges in the
network, consequently reducing economic costs for flow-maximization in such networks.
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
Power saving mechanism for hybrid routing protocol using scheduling techniqueeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s
lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period
Maximizing Network Lifetime by Using Smart Cluster Head Selectioniosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
SLGC: A New Cluster Routing Algorithm in Wireless Sensor Network for Decrease...IJCSEA Journal
Decrease energy consumption and maximizing network lifetime are important parameters in designing and protocols for wireless sensor network (WSN).Clustering is one of the efficient methods in energy consumption by Cluster-Head in WSN. Besides, CH can process and aggregate data sent by cluster members, thus reducing network traffic for sending data to sink. In this paper presents a new cluster routing algorithm by dividing network into grids. In each grid computes the center-gravity and threshold of energy for selecting the node that has the best condition base on these parameters in grid for selecting Cluster-Head in current round, also SLGC selecting Cluster-Heads for next rounds thereby this CHs reduce the volume of controlling messages for next rounds and inform nodes for sending data into CH of respective round. This algorithm prolong network lifetime and decrease energy consumption by selecting CH in grid and sending data of grid to sink by this CH. Result of simulation shows that SLGC algorithm in comparison with the previous clustering algorithm has maximizing network lifetime and decrease energy consumption in network.
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
Energy aware clustering protocol (eacp)IJCNCJournal
Energy saving to prolong the network life is an important design issue while developing a new routing
protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the
network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a
homogeneous network architecture, in which all sensors have the same capabilities in terms of battery
power, communication, sensing, storage, and processing. Recently, there has been an interest in
heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new
energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is
introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal
nodes are elected with the help of a probability scheme based on residual and average energy of the
normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a
round. Advanced nodes use a separate probability based scheme for cluster head election and they will
further act as a gateway for normal cluster heads and transmit their data load to base station when they
are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during
cluster formation phase to save network energy. The performance of EACP is compared with SEP and
simulation result shows the better result for stability period, network life and energy saving than SEP.
Energy Efficient Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
Correlating objective factors with videoIJCNCJournal
To succeed in providing services, the quality of services should meet users’ satisfaction. This is a motivation to study the relationship between the service quality and the real perceived quality of users, which is commonly referred to as the quality of experience (QoE). However, most of existing QoE studies that focus on video-on-demand or IPTV services analyze only the influence of network behaviors to video quality. This paper focuses on P2P video streaming services, which are becoming a significant portion of Internet traffic, and pays attention to the change of users’ perception with the adjustment of objective
factors as well as network behaviors. We propose to use mean opinion score and peak signal to noise ratio
methods as QoE evaluations to consider the effect of the chunk loss ratio, the group-of-picture size, and the
chunk size. The experimental results provide a convincing reference to build the complete relationship
between objective factors and QoE. We believe that this assessment will contribute to study a new service
quality evaluation mechanism based on users’ satisfaction in the future.
Privacy, especially in a cellphone, is an important thing and should be protected. Steganography is a
method used to protect a sensitive information. The issue tried to be discussed in this study is the issue on
inserting technique in a text through a simple method of White Space Steganography on android. The
inserted message has been compressed through a double compression method by using LZW and Huffman
so that the size of message to be inserted can be minimized while the capacity of the inserted message can
be minimized. The compression shows that the compression ratio much depends on the type of text input to
the text to be sent; the more the repetition or duplication found on the message, the smaller the
compression ratio will be. The compression process using Android based smartphone is relatively fast with
the average duration of 0.045 seconds, either for the insertion or extraction.
During route discovery of mobile ad hoc network, broadcasting of route request and route reply packets
are the essential operations for finding the path between two ends. In such situations, intermediate node
which may or may not belongs will participate in route discovery process, update routing table and
rebroadcast the route discovery packets again to its neighboring nodes. Finally optimal path is found with
minimum hops. This simply upsurges overhead and deteriorates the performance of routing. The proposed
Petal Ant Routing (PAR) algorithm offers a low overhead by optimizing FANT and BANT transmissions in
route discover process. The algorithm is an improved version of SARA and has features extracted from
petal routing. The algorithm is simulated on NS2, compared with ACO frame work called SARA and
classical routing protocols such as AODV and AOMDV. The simulation results shows that PAR further
reduces overhead by eliminating redundant FANT transmission compared to other routing algorithm.
A MASS BALANCING THEOREM FOR THE ECONOMICAL NETWORK FLOW MAXIMISATIONIJCNCJournal
A mass balancing theorem (MBT) was recently introduced, concerning the role of 'unbalanced nodes' in the optimization of network flow. The MBT discovers and proves a flow-balancing property, which can be exploited in the design of network flow algorithms. Subsequently a number of such applications of the MBT have been explored for various types of flow-networks. These have included, in particular, single and
multiple commodity networks with additional equipment of separators, which are present in various real world scenarios including the oil and gas industry. In this paper, the mass balancing theorem is revisited,and further developed to consider new network examples with embedded cycles. In doing so, algorithms based on the mass balancing method are extended to remove any undesirably saturated edges in the
network, consequently reducing economic costs for flow-maximization in such networks.
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
MODELING AND DESIGNING RESOURCE EFFICIENT DISTRIBUTED MANET MANAGEMENT SYSTEM...IJCNCJournal
Traditional network management systems use spoofing of resources to collect statistical data such as resource usage and performance. This data is exchanged with other resources through management protocols. The amount of data can be extremely high and the bandwidth for overhead management functions increases significantly. Also, the data storage requirements in each network resource for
management functions increases and become inefficient as it increases the power usage for processing. In
this paper, we propose a distributed network management system where each network resource maintains a
set of Management Information Base (MIB) elements and stores resource activities in their abstraction in
terms of counters, flag and threshold values. The abstract data is exchanged between different management
agents residing in different resources on a need-to-know basis and each agent logically executes management functions locally to develop understanding of the behavior of all network resources to ensure that user protocols can function smoothly. Our proposed architecture can be implemented in any network, but is highly important to be considered in power and bandwidth constrained networks such as Mobile Ad Hoc Networks (MANET). In this research, we use cross layer models to demonstrate simplified way of efficiently managing the overall performance of individual network resources (nodes) and the network itself which is critical for not only monitoring the traffic, but also dynamically controlling the end-to-end Quality of Service (QoS) for multi-service applications.
PERFORMANCE EVALUATION OF MOBILE WIMAX IEEE 802.16E FOR HARD HANDOVERIJCNCJournal
Seamless handover in wireless networks is to guarantee both service continuity and service quality. In
WiMAX, providing scalability and quality of service for multimedia services during handover is a main
challenge because of high latency and packet loss. In this paper, we created four scenarios using Qualnet
5.2 Network Simulator to analyze the hard handover functionality of WiMAX under different conditions.
The scenarios such as Flag with 5 and 10 sec UCD and DCD interval values, Random mobility scenario
and DEM scenario using 6 WiMAX Cells have been considered. This study is performed over the real
urban area of JNU where we have used JNU map for scenarios 1, 2 and 3 but for scenario 4, the JNU
terrain data has been used. Further, each BS of 6 WiMAX cell is connected to four nodes. All nodes of each
scenario are fixed except Node 1. Node 1 is moving and performing the handover between the different BSs
while sending and receiving real time traffics. Flag mobility model is used in Scenario 1, 2 and 4 to model
the movement of the Node 1 while we use random mobility model in sceanrio3. 5 seconds time interval is
used for Scenarios 1, 3, and 4 while 10 seconds time interval is used for scenario 2 to study the effect of
management messages load on handover. Further, the statistical measures of handover performance of
WiMAX in terms of number of handover performed, throughput, end-to-end delay, jitter, and packets
dropped are observed and evaluated.
The article looks into the current state of the art of dynamic routing protocols with respect to their
possibilities to react to changes in the Quality of Service when selecting the best route towards a
destination network. New options that could leverage information about the ever changing QoS parameters
for data communication are analysed and a Cisco Performance Routing solution is described more in
detail. The practical part of this work focuses on a design and implementation of a test bed that provides a
scalable laboratory architecture to manipulate QoS parameters of different data communications flowing
through it. The test bed is used in various use cases that were used to evaluate Cisco Performance Routing
optimization capabilities in different scenarios.
One of the most attractive field for research for researchers and authors so the Wireless adhoc networks.
So, this paper will describe the background and basic features of Open Short Path First (OSPF) routing
protocol due to multi-access networks. Explaining and practice on the OSPF configuration commands.
Describe, modify and calculate the metric (Cost) used by OSPF due to adhoc networks. Illustrating the
Election parameters made by DR/BDR (Designated and Back Designated) Routers used in multi-access
wireless networks. This paper will use OSPF routing protocol because of its average administrative
distance with all routing protocols.
GPS SYSTEMS LITERATURE: INACCURACY FACTORS AND EFFECTIVE SOLUTIONS IJCNCJournal
Today, Global Positioning System (GPS) is widely used in almost every aspect of our daily life. Commonly,
users utilize the technology to track the position of a vehicle or an object of interest. They also use it to
safely navigate to the destination of their choice. As a result, there are countless number of GPS based
tracking application that has been developed. But, a main recurring issue that exists among these
applications are the inaccuracy of the tracking faced by users and this issue has become a rising concern.
Most existing research have examined the effects that the inaccuracy of GPS have on users while others
identified suitable methods to improve the accuracy of GPS based on one or two factors. The objective of
this survey paper is to identify the common factors that affects the accuracy of GPS and identify an effective
method which could mitigate or overcome most of those factors. As part of our research, we conducted a
thorough examination of the existing factors for GPS inaccuracies. According to an initial survey that we
have collected, most of the respondents has faced some form of GPS inaccuracy. Among the common issues
faced are inaccurate object tracking and disconnection of GPS signal while using an application. As such,
most of the respondents agree that it is necessary to improve the accuracy of GPS. This leads to another
objective of this paper, which is to examine and evaluate existing methods as well as to identify the most
effective method that could improve the accuracy of GPS.
Cross layer design for power control and linkIJCNCJournal
Frequent changes in network topology due to mobility and limited battery power of the mobile devices are the key challenges in the adhoc networks. The depletion of power source may cause early unavailability of nodes and thus links in the network. The mobility of nodes causes frequent routes breaks and adversely affects the required performance of the applications. We propose a cross layer design for the dynamic power control protocol and link prediction (DPCPLP) that provides a combined solution for power conservation as well as link availability. This combines the effect of optimum transmit power and received signal strength based link availability estimation with AODV routing protocol using cross layer approach.
This method proposes to use optimum transmit power for transmitting the packets to a neighboring node to
increase the battery life of adhoc nodes and received signal strength based link prediction to increase the
availability of the links. In this paper, the transmit power and received signal strength of the packets are
cross-layer interaction parameters to provide the combined solution for power conservation and reliable
route formation with increased availability of links and thus the routes amongst sources and destinations. Further, this increases network and nodes’ lifetime and capacity. It improves throughput and packet delivery ratio by spatial reuse, prior prediction of link breaks and initiating the route repair. It also reduces
end-to-end delay and power consumption by use of optimum transmit power. Through simulations, we have
shown that our proposed protocol shows better performance.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
MODELING, IMPLEMENTATION AND PERFORMANCE ANALYSIS OF MOBILITY LOAD BALANCING ...IJCNCJournal
We propose in this paper a simulation implementation of Self-Organizing Networks (SON) optimization
related to mobility load balancing (MLB) for LTE systems using ns-3 [1]. The implementation is achieved
toward two MLB algorithms dynamically adjusting handover (HO) parameters based on the Reference
Signal Received Power (RSRP) measurements. Such adjustments are done with respect to loads of both an
overloaded cell and its cells’ neighbours having enough available resources enabling to achieve load
balancing. Numerical investigations through selected key performance indicators (KPIs) of the proposed
MLB algorithms when compared with another HO algorithm (already implemented in ns-3) based on A3
event [2] highlight the significant MLB gains provided in terms global network throughput, packet loss rate
and the number of successful HO without incurring significant overhead.
A genetic algorithm for constructing broadcast trees with cost and delay cons...IJCNCJournal
We refer to the problem of constructing broadcast trees with cost and delay constraints in the networks as a delay-constrained minimum spanning tree problem in directed networks. Hence it is necessary determining a spanning tree of minimal cost to connect the source node to all nodes subject to delay constraints on broadcast routing. In this paper, we proposed a genetic algorithm for solving broadcast routing by finding the low-cost broadcast tree with minimum cost and delay constraints. In this research we present a genetic algorithm to find the broadcast routing tree of a given network in terms of its links. The algorithm uses the connection matrix of the given network to find the spanning trees and considers the weights of the links to obtain the minimum spanning tree. Our proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The scalability and the performance of the algorithm with increasing number of network nodes are also encouraging.
Impact of network quality deterioration on user’s perceived operability and l...IJCNCJournal
The remote desktop environment (Virtual Desktop Infrastructure) is attracting interest as a way to
strengthen security and support mobile access ortelework. To realize the remote desktop environments, a remote desktop protocol is required to transfer information via a network about the user’s operations made on the keyboard and mouse on a terminal to the remote server. The growing popularity of remote desktop environments makes it important to determine the factors that govern the user’s perceived operability with a remote desktop protocol. It is also necessary important to find out the conditions for a wide- area live migration of virtual machines, to use resources efficiently in the remote desktop environments.
This paper examines the impact of network quality deterioration (long network delay, high packet loss,
small downlink bandwidth) on a user’s perceived operability in remote desktop environments, assuming
RDP, PCoIP and ICA as remote desktop protocol. Next, this paper studies the impact of network quality on
the performance of a live-migration of virtual machines in remote desktop environments.
DIA-TORUS:A NOVEL TOPOLOGY FOR NETWORK ON CHIP DESIGNIJCNCJournal
The shortcomings of conventional bus architectures are in terms of scalability and the ever increasing
demand of more bandwidth. And also the feature size of sub-micron domain is decreasing making it
difficult for bus architectures to fulfill the requirements of modern System on Chip (SoC) systems. Network
on chip (NoC) architectures presents a solution to the earlier mentioned shortcomings by employing a
packet based network for inter IP communications. A pivotal feature of NoC systems is the topology in
which the system is arranged. Several parameters which are topology dependent like hop count, path
diversity, degree and other various parameters affect the system performance. We propose a novel
topology forNoC architecture which has been thoroughly compared with the existing topologies on the
basis of different network parameters.
HANDOVER OPTIMIZATION BASED ON MEDIA INDEPENDENT HANDOVER IN NEW NETWORKS NGWN IJCNCJournal
One of the challenging issues in Next Generation Wireless Network (NGWN) is achieving seamless Vertical
Handover (VHO) while roaming between different technologies such as Wireless Fidelity (Wi- Fi),
Worldwide Interoperability for Microwave Access (WiMAX), Universal Mobile Telecommunications
System (UMTS) and Long Term Evolution (LTE). F or that the telecommunication operators will be
required to develop a strategy for interoperability of these different types of existing network to give the
best connection anywhere anytime for the Mobile Users (MUs).
To full these requirements we propose a new VHO approach that based on loose coupling internetworking
in conjunction with Mobile IPv4 ( MIPv4) under Media Independent Handover (MIH). Our objective is
develop a strategy for interoperability of different technologies and optimized the VHO decision. Our
proposed approach provides more exhaustive, high accurate and better performance compared with the
approaches proposed in the literature.
Extending network lifetime of wireless sensorIJCNCJournal
One critical issue in designing and managing a wireless sensor network is how to save the energy consumption
of the sensors in order to maximize network lifetime under the constraint of full coverage of the monitored
targets. In this paper, we adopt the common approach of creating disjoint sensor covers to prolong network
lifetime. The typical goal used in the literature is to maximize the number of covers without consideration of
the energy levels of the sensors. We argue that the network lifetime can be extended by maximizing the total
bottleneck energy of the created covers. We formally define the problem of maximizing the total bottleneck
energy of the covers, present for the first time an integer programming formulation of the problem, and develop
two algorithms to solve large problem instances. Extensive experimental tests show that the use of the goal of
maximizing the total bottleneck energy of the covers creates covers with substantially longer network lifetime
than the lifetime of the covers created with the goal of maximizing solely the number of covers.
A MIDDLEWARE FOR THE INTERNET OF THINGSIJCNCJournal
The Internet of Things (IoT) connects everyday objects including a vast array of sensors, actuators, and smart devices, referred to as “things” to the Internet, in an intelligent and pervasive fashion. This connectivity gives rise to the possibility of using the tracking capabilities of things to impinge on the location privacy of users. Most of the existing management and location privacy protection solutions do not consider the low-cost and low-power requirements of things; or, they do not account for the heterogeneity, scalability, or autonomy of communications supported in the IoT. Moreover, these traditional solutions do not consider the case where a user wishes to control the granularity of the disclosed information based on
the context of their use (e.g. based on the time or the current location of the user). To fill this gap, a middleware, referred to as the Internet of Things Management Platform (IoT-MP) is proposed in this paper.
Optimizing the Performance of I-mod Leach-PD Protocol in Wireless Sensor Netw...ijsrd.com
Wireless Sensor Networks (WSNs) is a networks of thousands of inexpensive miniature devices capable of computation, communication and sensing. WSN is being been attracting increasing interest for supporting a new generation of ubiquitous computing systems with great potential for many applications such as surveillance, environmental monitoring, health care monitoring or home automation. In the near future, wireless sensor network is expected to consists of thousand of inexpensive nodes, each having sensing capability with limited computational and communication power which enables to deploy large scale sensor networks. Large scale WSN is usually implemented as a cluster network. Clustering sensors into groups, so that sensors communicate information only to cluster-heads and then the cluster-heads communicate the aggregated information to the base station, saves energy and thus prolongs network lifetime. LEACH (Low Energy Adaptive Clustering Hierarchy) protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, how to adjust threshold based on the residual energy, and the measurement of energy required for transmission, based on the distance of cluster head from the base station, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of residual energy and required energy, and the time length of each round are deduced, thereby modifying the threshold value calculation. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.
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.
Simulation Based Analysis of Cluster-Based Protocol in Wireless Sensor Networkjosephjonse
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density and in network aggregation has been proposed in recent years. The energy consumption is the main apprehension in the wireless sensor network. There are many protocols in wireless sensor network to diminish the energy consumption and to put in to the network lifetime. Among a range of types of techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment and analyze their performance graphically.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the
performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to
use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use
routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of
this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering
Network environment, it is divided into two virtual layers (using distance between sensor nodes and base
station) and then regarding to sensors position in each of two layers, residual energy of sensor and
distance from base station is used in clustering. In this article, we compare proposed algorithm with wellknown LEACH and ELEACH algorithms in homogenous environment (with equal energy for all sensors)
and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base
station. Results show that our proposed algorithm delivers improved performance.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the
performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to
use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use
routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of
this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering
Network environment, it is divided into two virtual layers (using distance between sensor nodes and base
station) and then regarding to sensors position in each of two layers, residual energy of sensor and
distance from base station is used in clustering. In this article, we compare proposed algorithm with wellknown LEACH and ELEACH algorithms in homogenous environment (with equal energy for all sensors)
and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base
station. Results show that our proposed algorithm delivers improved performance.
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.
THRESHOLD SENSITIVE HETEROGENOUS ROUTING PROTOCOL FOR BETTER ENERGY UTILIZATI...ijassn
Advancements in WSN have led to the wide applicability of sensor network in various fields. WSNs basic classification is Reactive and Proactive network. Reactive networks responds to the very immediate changes in its environment in required parameters of interest, as opposed to the Proactive network, due to continuous sensing nature of WSN. To make it more efficient and improved in terms of Energy in network’s lifetime, we need to reduce the energy expense in the network model, which is one of the most significant issues in wireless sensor networks (WSNs) [1, 2]. In this paper, we proposed an efficient version of TSEP Protocol, which prolongs the networks lifetime by efficient utilization of sensor energy, as we have simulated. We evaluated the performance of our protocol and compared the results with the TSEP. And
from the results of simulation, it can be concluded easily that our proposed efficient routing protocol performs better in terms of network lifetime and stability period.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
In wireless sensor networks, sensor nodes play the most prominent role. These sensor nodes are mainly un-chargeable, so it
raises an issue regarding lifetime of the network. Mainly sensor nodes collect data and transmit it to the Base Station. So, most of the
energy is consumed in the communication process between sensor nodes and the Base Station. In this paper, we present an
improvement on LEACH protocol to enhance the network lifetime. Our goal is to reduce the transmissions between cluster heads and
the sink node. We will choose optimum number of Master Cluster Heads from variation cluster heads present in the network. The
simulation results show that our proposed algorithm enhances the network lifetime as compare to the LEACH protocol.
An enhanced energy-efficient routing protocol for wireless sensor networkIJECEIAES
Recent few years, Wireless Sensor Network (WSN) has been an increasingly important technology that has been applied in almost all domains, even in complex environments where human activity is impossible. In WSN, various factors are impacted energy consumption, such as communication protocols, packet data transmission, and limited battery. So, the lifespan of the WSNs is limited. In this context, energy efficiency is the factor most attracted by many researchers. In this paper, we proposed a new improved LEACH routing protocol. This proposed protocol based on the current energy to select cluster-heads, and it uses a root cluster-head with more current energy and low distance to the sink to gather all data, then sends it to the sink. The simulation results in MATLAB confirmed that the proposed algorithm performed better than the conventional LEACH protocol, and increased the network lifetime in WSN.
The comparison between routing protocols based on lifetime of wireless sensor...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Magnify Network Lifetime in WSN by Reducing Data Aggregation Distance of Weak...ijwmn
Energy efficient protocols have always played a vital role in conservation of energy in Wireless Sensor
Network. One of the major introduced protocols is LEACH a cluster based protocol. To improve its
performance, an algorithm named as Maximizing the Network Lifetime of Clustered-based WSN Using
Probability of Residual Energy is introduced. This protocol improved the Cluster Head selection process of
LEACH by using the concept of residual energy. In the proposed paper, further improvement is done by
enhancing the data transmission process. This process heightens the lifetime of the nodes having very less
energy left by reducing their data transmission distance. Implemented results in MATLAB shows increase
in the stability and lifetime of the network..
Sensor Energy Optimization Using Fuzzy Logic in Wireless Sensor NetworkingVIT-AP University
Wireless sensor networks is challenging in that it requires an enormous breadth of knowledge from an enormous variety of disciplines. A lot of study has been done to minimize the energy used in routing and number of protocols has been developed. These protocols can be classified as - Hierarchical, data centric, location based and Network flow protocols. In this paper, we are particularly focusing on hierarchical protocols. In such types of protocols, the energy efficient clusters are formed with a hierarchy of cluster heads. Each cluster has its representative cluster head which is responsible for collecting and aggregating the data from its respective cluster and then transmitting this data to the Base Station either directly or through the hierarchy of other cluster heads. Fuzzy logic has been successfully applied in various areas including communication and has shown promising results. However, the potentials of fuzzy logic in wireless sensor networks still need to be explored. Optimization of wireless sensor networks involve various tradeoffs, for example, lower transmission power vs. longer transmission duration, multi-hop vs. direct communication, computation vs. communication etc. Fuzzy logic is well suited for application having conflicting requirements. Moreover, in WSN, as the energy metrics vary widely with the type of sensor node implementation platform, using fuzzy logic has the advantage of being easily adaptable to such changes.
Similar to ENERGY CONSUMPTION IMPROVEMENT OF TRADITIONAL CLUSTERING METHOD IN 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.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
To Graph or Not to Graph Knowledge Graph Architectures and LLMs
ENERGY CONSUMPTION IMPROVEMENT OF TRADITIONAL CLUSTERING METHOD IN WIRELESS SENSOR NETWORK
1. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.5, September 2016
DOI: 10.5121/ijcnc.2016.8504 41
ENERGY CONSUMPTION IMPROVEMENT OF
TRADITIONAL CLUSTERING METHOD IN
WIRELESS SENSOR NETWORK
Tran Cong Hung1
and Ly Quoc Hung2
1
Posts and Telecommunications Institute of Technology
2
Ho Chi Minh Technical and Economic College
ABSTRACT
In the traditional clustering routing protocol of wireless sensor network, LEACH protocol (Low Energy
Adaptive Clustering Hierarchy) is considered to have many outstanding advantages in the implementation
of the hierarchy according to low energy adaptive cluster to collect and distribute the data to the base
station. The main objective of LEACH is: To prolong life time of the network, reduce the energy
consumption by each node, using the data concentration to reduce bulletins in the network. However, in the
case of large network, the distance from the nodes to the base station is very different. Therefore, the
energy consumption when becoming the host node is very different but LEACH is not based on the
remaining energy to choose the host node, which is based on the number of times to become the host node
in the previous rounds. This makes the nodes far away from the base station lose power sooner.
In this paper, we give a new routing protocol based on the LEACH protocol in order to improve operating
time of sensor network by considering energy issues and distance in selecting the cluster-head (CH), at that
time the nodes with high energy and near the base station (BS) will have a greater probability of becoming
the cluster-head than the those in far and with lower energy.
KEYWORDS
LEACH, Life-time, Energy efficient, WSN, Matlab.
1. INTRODUCTION
Wireless sensor networks are used in many fields such as: National Defense, civil, health,
transport, environment and agriculture [1]. Disadvantages of the wireless sensor network are
limited energy, short time of energy supply source (usually battery) for each sensor, limited duty
cycle of each sensor, multiple and changing constantly number of sensor nodes, (when out of the
energy, sensor nodes will be removed from the network , when interrupt radio channel caused by
the obstacle appearing in transmission) makes the structure of the network change [2], [3].
Limiting sensor network energy is due to small available energy in the sensor network, sensors
could hardly load supplement energy (wide dispersion sensors should be hard to recover, some
sensor network located in the dangerous or toxic environments) While it must use energy to
gather news from the surrounding environment and each sensor also needs energy to process,
synthesize and transfer the information constantly to the central node of the network, especially in
volatility of the surrounding environment [4], [5].
2. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.5, September 2016
42
With the special characteristics of the sensor network, especially energy-saving issues and regular
structure change, the recent researches are done at many different levels, from the level of the
element (ability of the sensor node) to level of system (communication efficient and type of
connection) and application level. The most notably issue in the system level is the research
focused on network class in order to design the routing protocols to save energy, extend life of
network [6], [7].
This paper is divided into five parts, part I of introduction, part II presents the related work, part
III improvement of traditional clustering protocol, part IV of simulation results and assessment,
part V of conclusion.
2. RELATED WORK
LEACH is the Low Energy Adaptive Clustering Hierarchy, based on the sort algorithm, of which
the nodes can be randomly distributed, and formed clusters (Self configuring cluster formation).
The host node is able to control the cluster nodes in the cluster to send data to a certain cycle. In
the host node, the data will be collected and processed in many different levels, depending on the
application, before sending to the base station [8].
Figure 1. LEACH protocol.
The common characteristics of the wireless sensor network application are that data of the node
sent, usually, has correlations with each other, end users do not need to request all data (the same
data-Redundant), or just the information that has been processed, described events that appear in
the environment of the sensor node. LEACH routing protocol is very fit to applications with such
characteristics. In LEACH Protocol, due to sensor data sent from the adjacent nodes with a huge
Base
station
Cluster
head
3. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.5, September 2016
43
correlation, all data from the nodes within the cluster will be processed locally at the host node
before sending to the base stations, reduce the excess amount of information circulating on the
network in order to save energy of the node [6].
∈
−=
othewise0
Gnif
)
1
mod*(*1)(
P
rP
P
nT (1)
(1) Formula of thresholds to determine the cluster-head in LEACH.
(2)
where: P = Percentage of wish to become the host node of the
network
r is the current round.
G is the set of nodes not become the host node in (1/P)
previous round.
One of the basic characteristics of LEACH is self-organized network nodes into cluster, in
which one node will act as the cluster-head (CH). All of the nodes not the host node will have to
transmit its data to the host node, the host node will get data from the members of the cluster,
perform local data processing, and then transmit to the base station. Therefore, the host node
will consume more energy than the common nodes. The sensor node's energy is limited, if the
host node is selected fixedly during the life-time of the network, the host node will run out of
energy very quickly [9].
Figure 2. Operation of LEACH.
When the hose node dies, all nodes in the cluster will not be able to exchange information.
Therefore, LEACH makes randomly rotation of the host node role in all network nodes to avoid
energy consumption on a fixed number of nodes [10, 11] Sensors and communications
processes in LEACH protocols are designed appropriately to minimize the energy consumption
for the nodes other than the host node. When the host node knows all the member nodes in the
cluster, it will send a TDMA newsletter to inform each node exactly when to perform the task of
sensors and data transfer to the host node. This mechanism allows the normal nodes to exist in
the Sleep State in most of the time, only when it's time to perform the task of the sensors and
sending data, the node is active. Moreover, using TDMA newsletter for the transmission of data
also helps avoid collision in the cluster [12].
Setup Steady state Frame Round
Time
4. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.5, September 2016
44
3. IMPROVEMENT OF TRADITIONAL CLUSTERING PROTOCOL (LEACH)
In order to improving the life-time of the network in the protocol based on clustering algorithm,
selecting the cluster-head, coefficient of considering most is selecting the cluster-head based on
energy of the nodes. New improved protocol is developed protocol based on the LEACH
algorithm in which electing the cluster-head is based on the remaining energy of the node.
The new protocol is improved based on the remaining energy of the node to determine the
improvement threshold T (n) Improvement applied the following formula:
energyInitial
energyRemaining
tImprovemen)(
E
)
1
mod*(*1
E
P
rP
P
T n ×
−
=
(2)
(2) Formula of threshold (T(n) improvement) to determine the cluster-head.
where:
ERemaining energy : Remaining energy of the nodes
EInitial energy: is the initial energy of the nodes
Selecting the cluster-head based on energy will be more effective, the nodes with high energy
level will have a greater probability of becoming the cluster-head than those with low energy
level, thereby balancing the energy consumption in the whole network.
3.1. Description of Protocol
Similar to LEACH Protocol [13], the Protocol proposes to divide activities of the whole network
into the cycles, each cycle consists of two basic phases: Clustering phase and data transfer phase.
In clustering phase, selecting CH is done based on two factors that are the remaining energy of
the nodes and the distance from the node to the BS. At the beginning of each cycle, the sensor
nodes will generate a random number in the range (0, 1), then this range is compared to the
threshold T (n). Before calculating the threshold T (n) we define:
(3)
(3) The formula determines the distance from the node to the BS.
where: d (i) is the distance from node i to BS.
n is the total number of nodes in the sensor network, (Xi, Yi)
are the coordinates of the i node in the network.
(XBS, YBS) is the coordinates of the BS.
E (i) is the remaining energy of the nodes in the current cycle.
At that time the improved threshold T(n) Improvement will be calculated according to the expression:
5. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.5, September 2016
45
∈
×
−=
Gn
E
P
rP
P
T
i
n
0
d
)
1
mod*(*1 (i)
)(
tImprovemen)( (4)
(4) Formula to determine the improved threshold T(n) Improvement.
where: G is the set of nodes in the cluster head not become the
cluster head in the previous cycle.
p is the percentage of wish to become the cluster head on the
total number of nodes, typically p in the range of 0.05-0.1.
r is the current cycle.
d (i) and E (i) is defined above. If the random value of the
nodes is smaller than value of T (n) threshold, that node will
become the cluster head in the current cycle.
The use of the remaining energy parameters of the nodes will increase the probability of
becoming the cluster head with high energy level, at the same time distance from the cluster head
to nodes will make the node near the base station have a greater probability to become the cluster
head than those far from the base station.
After selecting CH, CH will send its location information to BS, and it will promote the INVITE
messages to the surrounding nodes, this message has the same signal intensity. The common
nodes after receiving the INVITE message if participating in the cluster will send back the
ACCEPT message. If the nodes get many INVITE messages, they will be based on the signal
strength of the INVITE nodes to decide to join the cluster head with the greater INVITE message
signal strength (near the cluster head). If the cluster head does not receive the ACCEPT message,
it will send INVITE messages again, if still don't get the message ACCEPT it will send data
directly to the BS without creating TDMA table.
After the clustering process is the process of data transfer. The process of data transfer includes 2
main steps: Process of transmitting data from the normal nodes to CH and process of transmitting
data from CH to BS. In the process of transmitting data from the nodes to the CH, CH will create
table of TDMA specified data transmission time frame for the nodes in the cluster, it will then
promote this TDMA table to nodes in its cluster. The nodes in the cluster based on this table will
know time to send the data to the CH, in the remaining time the nodes will be in sleep state to
save energy, the method using TDMA allows the nodes to transmit data to the cluster head and
helps avoid collision with other nodes.
3.2. Simulation
In this section, simulation of traditional clustering protocol and new improved protocol use the
same energy model and parameter below.
6. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.5, September 2016
46
Figure 3. Energy model used in the simulation.
Table 1. Data contains the parameters to simulate.
Description Value
Network size 100 m * 500 m
Number of sensor nodes used (n) 100
Percentage of wish to become the cluster-head of total
nodes of network (p)
0.05
Location of BS (Xbs, Ybs) (50m, 250m)
Number of bits transmitted (k) 5000
Initial energy of nodes (E0) 0.5
Coefficient of energy consumption of the transmission and
receipt circuit (Eelec)
50nJ/bit
Emp 0.0013 pJ/bit/m4
Efs 10pJ/bit/m2
Energy factor of Amplifying Circuit (Etx, Erx) 50nJ/bit
d0
Based on the energy model used in Figure 3 we have:
where:
k is the number of bits transmitted.
Eelec is the energy consumption on the bits to run the transmitting circuit
or receive the data
Emp or Efs depends on the energy model used or d0 threshold.
Transmitting
circuit
Tx Amplifying Circuit
ETx(d)
Eelec * k Emp * k * d2
k data bits
Receiving circuit
Eelec* k
ERx
d
k data bits
7. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.5, September 2016
47
To get the k data bits of the energy consumption of the ERX is:
elecEkE *RX =
4. SIMULATION RESULTS AND ASSESSMENT
To assess the energy efficiency of new improved protocol with LEACH protocol the author based
on of the following criteria: [5].
New improvement protocol elects cluster head on the basis of initial energy, residual energy and
distance of the nodes from base station. Cluster heads further act as routers to base station and
aggregation of the collected data of its members are also performed by them. New improvement
protocol operation is divided into rounds and each round further consists of two phases: setup and
steady-state. In setup phase New improvement protocol does the cluster heads election, cluster
formation and determine the communication schedules for its members. When cluster formation
is completed in setup phase. New improvement protocol switches to steady state phase. In this
phase it completes the data sensing, data transmission to cluster heads and aggregation of the
collected data of its members . Stabilization time is defined as the period of time from the start of
the operation to the time to stop working of the first node.
The network's life-time is counted from the beginning until the whole nodes stop operating,
assessment of efficiency of the routing protocol.
The data sent from the cluster head to BS: the amount of data successfully transmitted from the
cluster head to the BS, the amount of data shows the effectiveness of the Protocol in the data
transmission to the base station.
− With E0 = 0.25j, over 10 times the experimental run we had tables:
Table 2. Survey of the stabilization time of the network.
Number of times performed
Time of stability
LEACH Improved Protocol
1 1014 1086
2 1011 1090
3 1034 1095
4 1046 1088
5 1022 1085
6 1037 1080
7 1043 1098
8 1012 1076
9 1026 1089
8. International Journal of Computer Networks & Communications (IJCNC) Vol.8,
10
Fig. 4. Comparison of stability
− With E0 = 0.5j, over 10 times the experimental run we had tables:
Table 3 Survey of life
Number of times performed
1
2
3
4
5
6
7
8
9
10
International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.5, September
1039 1092
Comparison of stability life-time of the two protocols (E0 = 0.25).
With E0 = 0.5j, over 10 times the experimental run we had tables:
Table 3 Survey of life-time of the network.
Number of times performed
Lifetime of the network
LEACH Improved Protocol
1700 2100
1781 2203
1765 2188
1803 2098
1708 1943
1769 2076
1722 1983
1790 2119
1804 2101
1791 2089
September 2016
48
Protocol
9. International Journal of Computer Networks & Communications (IJCNC) Vol.8,
Fig. 5. Comparison of stability
5. CONCLUSION:
Through simulation results we can assess as follows:
With the initial energy of 0.5 J, LEACH protocol has improved the time stability of the network
increasing 20%, lifetime of network with increase of 33%.
The use of energy efficient sensor nodes, improving the
network is the most important issue in which optimum energy is considered as the most effective
method in extending operation
routing protocol to enhance the
developed from the traditional clustering protocol (LEACH) by considering energy issues and
distance in selecting the cluster-
have a greater probability to become the cluster head than those at a further distance and with
lower energy. Simulation results show that improved LEACH Protocol increases the operating
time of the whole network from 33% to 51% in comparison with the traditional cl
protocol (LEACH).
However, this Protocol is applied only if the base station is located in the region of the sensor. If
the base station is far from the sensor it will make the distance from the node to the base station
larger, then the threshold used in the small improved LEACH protocol will make the nodes hard
to become the cluster-head or small number of cluster heads will lead to to energy imbalance in
the transmission of data to the base station.
In the future, I will improve this Protocol
Dijkstra algorithm to find the shortest path from:
The nodes to the cluster
International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.5, September
Fig. 5. Comparison of stability life-time of the two protocols (E0 = 0.5).
simulation results we can assess as follows:
With the initial energy of 0.5 J, LEACH protocol has improved the time stability of the network
increasing 20%, lifetime of network with increase of 33%.
The use of energy efficient sensor nodes, improving the operating time of the wireless sensor
network is the most important issue in which optimum energy is considered as the most effective
time of the network. In this paper, we have improved a new
routing protocol to enhance the operating time of the sensor network. This Protocol was
developed from the traditional clustering protocol (LEACH) by considering energy issues and
-head, at that time the nodes with high energy and near BS will
ater probability to become the cluster head than those at a further distance and with
lower energy. Simulation results show that improved LEACH Protocol increases the operating
time of the whole network from 33% to 51% in comparison with the traditional cl
However, this Protocol is applied only if the base station is located in the region of the sensor. If
the base station is far from the sensor it will make the distance from the node to the base station
used in the small improved LEACH protocol will make the nodes hard
head or small number of cluster heads will lead to to energy imbalance in
the transmission of data to the base station.
In the future, I will improve this Protocol to achieve the energy efficiency and lifetime using
Dijkstra algorithm to find the shortest path from:
The nodes to the cluster-head.
September 2016
49
time of the two protocols (E0 = 0.5).
With the initial energy of 0.5 J, LEACH protocol has improved the time stability of the network
operating time of the wireless sensor
network is the most important issue in which optimum energy is considered as the most effective
, we have improved a new
operating time of the sensor network. This Protocol was
developed from the traditional clustering protocol (LEACH) by considering energy issues and
head, at that time the nodes with high energy and near BS will
ater probability to become the cluster head than those at a further distance and with
lower energy. Simulation results show that improved LEACH Protocol increases the operating
time of the whole network from 33% to 51% in comparison with the traditional clustering
However, this Protocol is applied only if the base station is located in the region of the sensor. If
the base station is far from the sensor it will make the distance from the node to the base station
used in the small improved LEACH protocol will make the nodes hard
head or small number of cluster heads will lead to to energy imbalance in
to achieve the energy efficiency and lifetime using
10. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.5, September 2016
50
The cluster-head to the base station.
In addition, another issue that should be of concern is the possibility of moving the nodes:
Meanwhile, updating location information of the cluster head and sensor nodes as well as
transmitting that information on the network can cause a significant energy consumption of the
nodes. The information needs to be processed about the speed of movement and change of
network configuration in terms of limited energy.
REFERENCES
[1] Trịnh Lương Miên (2014), "Tổng quan về mạng cảm biến không dây", Tạp chí tự động hóa ngày nay,
Số 157
[2] TS. Lê Nhật Thăng, and TS. Nguyễn Quý Sỹ (2007), "Các kỹ thuật phân nhóm trong các mạng cảm
biến vô tuyến", Tạp chí Bưu chính viễn thông, Số 301
[3] K. Sohraby, and D. Minoli and T Znati (2007), "Wireless Sensor Network Technology, Protocol and
Application" (John Wiley & Sons Ltd, 2007)
[4] Charka Panditharathne and Soumya Jyoti Sen (2009), "Energy Efficient Communication Protocols for
Wireless Sensor Networks"
[5] T. N. Qureshi, N. Javaid, A. H. Khan, A. Iqbal, E. Akhtar, and M. Ishfaq (2013), "Balanced Energy
Efficient Network Integrated Super Heterogenous Protocol for Wireless Sensor Networks"
[6] W. B. Heinzelman, and A. P. Chandrakasan and H. Balakrishnan (2002), "An application-specific
protocol architecture for wireless microsensor networks", IEEE Transactions on Wireless
Communications", Vol 1, pp. 660-700
[7] Callaway, and Edgar H (2004), "Wireless Sensor Networks—Architectures and Protocols" (CRC
Press Company, 2004)
[8] W. Xinhua, and W. Sheng (2010), "Performance Comparison of LEACH and LEACH-C Protocols by
NS2", Ninth International Symposium on Distributed Computing and Applications to Business"
[9] W R Heinzelman, and A P Chandrakasan and H Balakrishnan (2000), "Energy efficient
communication protocol for wireless microsensor networks"
[10] Alakesh Braman, and Umapathi G. R (2014), "A Comparative Study on Advances in LEACH
Routing Protocol for Wireless Sensor Networks: A survey.", Volume 3
[11] Jennifer Yick, Biswanath Mukhejee, and Dicpak Ghosal (2008), " Wireless sensor network survey",
Computer Networks 52, pp. 2292 2330
[12] Wendi RabinerHeinzelman, AnanthaChandrakasan, and HariBalakrishnan (2005), "Energy-Efficient
Communication Protocol for Wireless Micro-sensor Networks", pp. 79 - 194
[13] HolgerKarl, and AndreasWillig (2005), "Protocols and Architectures for wireless Sensor Networks"
(John Wiley & Sons, 2005)
AUTHORS
Tran Cong Hung was born in Vietnam in 1961. He received the B.E in electronic and
Telecommunication engineering with first class honors from HOCHIMINH University
of technology in Vietnam, 1987. He received the B.E in informatics and computer
engineering from HOCHIMINH University of technology in Vietnam, 1995. He
received the master of engineering degree in telecommunications engineering course
from postgraduate department Hanoi University of technology in Vietnam, 1998. He
received Ph.D at Hanoi University of technology in Vietnam, 2004. His main research areas are the B-
ISDN performance parameters and measuring methods, QoS in high speed networks, MPLS. He is,
currently, Associate Professor PhD. of Faculty of Information Technology II, Posts and Telecoms Institute
of Technology in HOCHIMINH, Vietnam.
11. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.5, September 2016
51
Ly Quoc Hung was born in Vietnam in 1976. He received the B.E in informatics and
computer engineering from HO CHI MINH Open University, Vietnam, 2001. He is
working as lecturer in HO CHI MINH City Technical and Economic College, Vietnam.