Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Simulation Issues in Wireless Sensor Networks: A SurveyM H
This paper presents a survey of simulation tools and systems for wireless sensor networks. Wireless sensor network modelling and simulation methodologies are presented for each system alongside judgments concerning their relative ease of use and accuracy. Finally, we propose a mixed-mode simulation methodology that integrates a simulated environment with real wireless sensor network testbed hardware in order to improve both the accuracy and scalability of results when evaluating different prototype designs and systems.
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...ijwmn
Target localization and tracking problems in WSNs have received considerable attention recently, driven
by the requirement to achieve high localization accuracy, with the minimum cost possible. In WSN based
tracking applications, it is critical to know the current location of any sensor node with the minimum
energy consumed. This paper focuses on the energy consumption issue in terms of communication
between nodes whenever the localization information is transmitted to a sink node. Tracking through
WSNs can be categorized into centralized and decentralized systems. Decentralized systems offer low
power consumption when deployed to track a small number of mobile targets compared to the centralized
tracking systems. However, in several applications, it is essential to position a large number of mobile
targets. In such applications, decentralized systems offer high power consumption, since the location of
each mobile target is required to be transmitted to a sink node, and this increases the power consumption
for the whole WSN. In this paper, we propose a power efficient decentralized approach for tracking a
large number of mobile targets while offering reasonable localization accuracy through ZigBee network
Wireless Sensor Networks are highly distributed self-organized systems. WSN have been deployed in various fields. Now a day, Topology issues have received more and more attentions in Wireless Sensor Networks (WSN). While WSN applications are normally optimized by the given underlying network topology, another trend is to optimize WSN by means of topology control. In this area, a number of approaches have been invested, like network connectivity based topology control, cooperating schemes, topology directed routing, sensor coverage based topology control. Most of the schemes have proven to be able to provide a better network monitoring and communication performance with prolonged system lifetime. In this survey paper, I provide a full view of the studies in this area.
This presentation is all about the wireless sensor networks, how they collect data using aggregation, and how they evaluate or calculate the parameters
Scheduling different types of packets, such as
real-time and non-real-time data packets, at sensor nodes with
resource constraints in Wireless Sensor Networks (WSN) is of
vital importance to reduce sensors’ energy consumptions and endto-end
data transmission delays. Most of the existing packetscheduling
mechanisms of WSN use First Come First Served
(FCFS), non pre-emptive priority and pre-emptive priority
scheduling algorithms. These algorithms incur a high processing
overhead and long end-to-end data transmission delay due to the
FCFS concept, starvation of high priority real-time data packets
due to the transmission of a large data packet in non pre-emptive
priority scheduling, starvation of non-real-time data packets due
to the probable continuous arrival of real-time data in preemptive
priority scheduling, and improper allocation of data
packets to queues in multilevel queue scheduling algorithms.
Moreover, these algorithms are not dynamic to the changing
requirements of WSN applications since their scheduling policies
are predetermined.
In the Advanced Multilevel Priority packet scheduling
scheme, each node except those at the last level has three levels of
priority queues. According to the priority of the packet and
availability of the queue, node will schedule the packet for
transmission. Due to separated queue availability, packet
transmission delay is reduced. Due to reduction in packet
transmission delay, node can goes into sleep mode as soon as
possible. And Expired packets are deleted at the particular node
at itself before reaching the base station, so that processing
burden on the node is reduced. Thus, energy of the node is saved.
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Simulation Issues in Wireless Sensor Networks: A SurveyM H
This paper presents a survey of simulation tools and systems for wireless sensor networks. Wireless sensor network modelling and simulation methodologies are presented for each system alongside judgments concerning their relative ease of use and accuracy. Finally, we propose a mixed-mode simulation methodology that integrates a simulated environment with real wireless sensor network testbed hardware in order to improve both the accuracy and scalability of results when evaluating different prototype designs and systems.
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...ijwmn
Target localization and tracking problems in WSNs have received considerable attention recently, driven
by the requirement to achieve high localization accuracy, with the minimum cost possible. In WSN based
tracking applications, it is critical to know the current location of any sensor node with the minimum
energy consumed. This paper focuses on the energy consumption issue in terms of communication
between nodes whenever the localization information is transmitted to a sink node. Tracking through
WSNs can be categorized into centralized and decentralized systems. Decentralized systems offer low
power consumption when deployed to track a small number of mobile targets compared to the centralized
tracking systems. However, in several applications, it is essential to position a large number of mobile
targets. In such applications, decentralized systems offer high power consumption, since the location of
each mobile target is required to be transmitted to a sink node, and this increases the power consumption
for the whole WSN. In this paper, we propose a power efficient decentralized approach for tracking a
large number of mobile targets while offering reasonable localization accuracy through ZigBee network
Wireless Sensor Networks are highly distributed self-organized systems. WSN have been deployed in various fields. Now a day, Topology issues have received more and more attentions in Wireless Sensor Networks (WSN). While WSN applications are normally optimized by the given underlying network topology, another trend is to optimize WSN by means of topology control. In this area, a number of approaches have been invested, like network connectivity based topology control, cooperating schemes, topology directed routing, sensor coverage based topology control. Most of the schemes have proven to be able to provide a better network monitoring and communication performance with prolonged system lifetime. In this survey paper, I provide a full view of the studies in this area.
This presentation is all about the wireless sensor networks, how they collect data using aggregation, and how they evaluate or calculate the parameters
Scheduling different types of packets, such as
real-time and non-real-time data packets, at sensor nodes with
resource constraints in Wireless Sensor Networks (WSN) is of
vital importance to reduce sensors’ energy consumptions and endto-end
data transmission delays. Most of the existing packetscheduling
mechanisms of WSN use First Come First Served
(FCFS), non pre-emptive priority and pre-emptive priority
scheduling algorithms. These algorithms incur a high processing
overhead and long end-to-end data transmission delay due to the
FCFS concept, starvation of high priority real-time data packets
due to the transmission of a large data packet in non pre-emptive
priority scheduling, starvation of non-real-time data packets due
to the probable continuous arrival of real-time data in preemptive
priority scheduling, and improper allocation of data
packets to queues in multilevel queue scheduling algorithms.
Moreover, these algorithms are not dynamic to the changing
requirements of WSN applications since their scheduling policies
are predetermined.
In the Advanced Multilevel Priority packet scheduling
scheme, each node except those at the last level has three levels of
priority queues. According to the priority of the packet and
availability of the queue, node will schedule the packet for
transmission. Due to separated queue availability, packet
transmission delay is reduced. Due to reduction in packet
transmission delay, node can goes into sleep mode as soon as
possible. And Expired packets are deleted at the particular node
at itself before reaching the base station, so that processing
burden on the node is reduced. Thus, energy of the node is saved.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
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.
Energy efficient node deployment for target coverage in wireless sensor networkGaurang Rathod
Network lifetime plays an integral role in setting up an efficient wireless sensor network. Coverage in a network needs to guarantee that the region is monitored with the required degree of reliability. Locations of sensor nodes constitute the basic input for the algorithms that examine coverage of the network. Coverage problems can be broadly classified as area coverage problem and target coverage problem. Area coverage focuses on monitoring the entire region of interest, whereas target coverage concerns monitoring only certain specific points in a given region. Target coverage can be categorized as simple coverage, k-coverage and Q-coverage.
Lower coverage level (simple coverage) is enough for environmental or habitat monitoring or applications like home security. Higher degree of coverage (k-coverage) will be required for some applications like target tracking to track the targets accurately, or if sensors work in a hostile environment such as battle fields or chemically polluted areas. More reliable results are produced for higher degree of coverage which requires multiple sensor nodes to monitor the region/targets. An example of Q-coverage is video surveillance systems deployed for monitoring hostile territorial area where some sensitive targets like a nuclear plant may need more sensors cooperate to ensure source redundancy for precise data. Sensor nodes deterministically deployed by using artificial bee colony algorithm, so as to achieve the required target coverage level and maximize the network lifetime.
A Generic Open Source Framework for Auto Generation of Data Manipulation Comm...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Information extraction from sensor networks using the Watershed transform alg...M H
Wireless sensor networks are an effective tool to provide fine resolution monitoring of the physical environment. Sensors generate continuous streams of data, which leads to several computational challenges. As sensor nodes become increasingly active devices, with more processing and communication resources, various methods of distributed data processing and sharing become feasible. The challenge is to extract information from the gathered sensory data with a specified level of accuracy in a timely and power-efficient approach. This paper presents a new solution to distributed information extraction that makes use of the morphological Watershed algorithm. The Watershed algorithm dynamically groups sensor nodes into homogeneous network segments with respect to their topological relationships and their sensing-states. This setting allows network programmers to manipulate groups of spatially distributed data streams instead of individual nodes. This is achieved by using network segments as programming abstractions on which various query processes can be executed. Aiming at this purpose, we present a reformulation of the global Watershed algorithm. The modified Watershed algorithm is fully asynchronous, where sensor nodes can autonomously process their local data in parallel and in collaboration with neighbouring nodes. Experimental evaluation shows that the presented solution is able to considerably reduce query resolution cost without scarifying the quality of the returned results. When compared to similar purpose schemes, such as “Logical Neighborhood”, the proposed approach reduces the total query resolution overhead by up to 57.5%, reduces the number of nodes involved in query resolution by up to 59%, and reduces the setup convergence time by up to 65.1%.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
Routing in Wireless Sensor Networks: Improved Energy Efficiency and Coverage ...CSCJournals
This paper proposes a new method for collecting distributed data in Wireless Sensor Networks (WSNs) that can improve the energy efficiency and network coverage; especially in remote areas. In multi-hop communication, sink nodes are responsible for collecting and forwarding data to base stations. The nodes that are located near a sink node usually deplete their battery faster than other nodes because they are responsible for aggregating the data from other sensor nodes. Several studies have proved the advantages of using mobile sink nodes to reduce energy consumption. Nonetheless, the need for compatible and efficient routing algorithms cannot be understated. Accordingly, a hybrid routing algorithm based on the Dijkstra�s and Rendezvous algorithms is proposed. To improve the energy efficiency and coverage, Energy Efficient Hybrid Unmanned Vehicle Based Routing Algorithm (E2HUV) is proposed to create a routing path for Unmanned Aerial Vehicles (UAVs) that can be used as mobile sinks in WSNs. Performance results show that the E2HUV algorithm offers better efficiency as compared to currently existing algorithms.
ON THE PERFORMANCE OF INTRUSION DETECTION SYSTEMS WITH HIDDEN MULTILAYER NEUR...IJCNCJournal
Deep learning applications, especially multilayer neural network models, result in network intrusion detection with high accuracy. This study proposes a model that combines a multilayer neural network with Dense Sparse Dense (DSD) multi-stage training to simultaneously improve the criteria related to the performance of intrusion detection systems on a comprehensive dataset UNSW-NB15. We conduct experiments on many neural network models such as Recurrent Neural Network (RNN), Long-Short Term Memory (LSTM), Gated Recurrent Unit (GRU), etc. to evaluate the combined efficiency with each model through many criteria such as accuracy, detection rate, false alarm rate, precision, and F1-Score.
Energy Consumption Reduction in Wireless Sensor Network Based on ClusteringIJCNCJournal
ABSTRACT
One of the important issues in the routing protocol design in Wireless Sensor Networks (WSNs) is minimizing energy consumption and maximizing network lift time. Nowadays networks and information systems are one of the main parts of modern life that without them, people cannot live. On the hand, the impairment of these networks leads to great and incalculable costs. In this paper, a new method based on clustering has presented that problem of energy consumption is solved. The proposed algorithm is that energy-based clustering can create clusters of the same energy level and distribute energy efficiency across the WNS nodes. This proposed clustering protocol classify network nodes based on energy and neighbourhood criteria and attempts to better balance energy in clusters and ultimately increase network lifetime and maintain network coverage. Results are shown that the proposed algorithm is on average 40% better than LEACH algorithm and 14% better than IBLEACH algorithm.
KEYWORDS
Wireless Sensor Network, Clustering, LEACH Algorithm, IBLEACH Algorithm
Abstract Link : http://aircconline.com/abstract/ijcnc/v11n2/11219cnc03.html
Full Details : http://aircconline.com/ijcnc/V11N2/11219cnc03.pdf
AN EFFICIENT INTRUSION DETECTION SYSTEM WITH CUSTOM FEATURES USING FPA-GRADIE...IJCNCJournal
An efficient Intrusion Detection System has to be given high priority while connecting systems with a network to prevent the system before an attack happens. It is a big challenge to the network security group to prevent the system from a variable types of new attacks as technology is growing in parallel. In this paper, an efficient model to detect Intrusion is proposed to predict attacks with high accuracy and less false-negative rate by deriving custom features UNSW-CF by using the benchmark intrusion dataset UNSW-NB15. To reduce the learning complexity, Custom Features are derived and then Significant Features are constructed by applying meta-heuristic FPA (Flower Pollination algorithm) and MRMR (Minimal Redundancy and Maximum Redundancy) which reduces learning time and also increases prediction accuracy. ENC (ElasicNet Classifier), KRRC (Kernel Ridge Regression Classifier), IGBC (Improved Gradient Boosting Classifier) is employed to classify the attacks in the datasets UNSW-CF, UNSW and recorded that UNSW-CF with derived custom features using IGBC integrated with FPA provided high accuracy of 97.38% and a low error rate of 2.16%. Also, the sensitivity and specificity rate for IGB attains a high rate of 97.32% and 97.50% respectively.
AN ENERGY EFFICIENT DISTRIBUTED PROTOCOL FOR ENSURING COVERAGE AND CONNECTIVI...ijasuc
As wireless sensor networks (WSNs) continue to attract more and more researchers attention, new ideas for
applications are continually being developed, many of which involve consistent coverage with good
network connectivity of a given area of interest. For the successful operation of the wireless Sensor
Network, the active sensor nodes must maintain both coverage and also connectivity. These are two closely
related essential prerequisites and they are also very important measurements of quality of service (QoS)
for wireless sensor networks. This paper presents the design and analysis of novel protocols that can
dynamically configure a sensor network to result in guaranteed degrees of coverage and connectivity. This
protocol is simulated using NS2 simulated and compared against a distributed probabilistic coveragepreserving configuration protocol (DPCCP) with SPAN [1] protocol in the literature and show that it
activates lesser number of sensor nodes, consumes much lesser energy and maximises the network lifetime
significantly.
On the development of methodology for planning and cost modeling of a wide ar...IJCNCJournal
The most important stages in designing a
computer
network
in a
wider geographical area include:
definition of requirements, topological description
,
identification and calculation of relevant parameters
(
i
.
e
.
traffic matrix
)
, determining the shortest path between nodes, quantification of the effect of various
levels
of technical and technological development of urban areas involved, the cost of technology
,
and the
cost of services. The
se
parameters differ for WAN networks in different regions
–
their calculation depends
directly
on
the data “
i
n the field
”
: number of inhabitants, distance between populated areas,
network
traffic
density
,
as well as
available
bandwidth
. The
main
reason for identification and evaluation of these
parameters
is
to develop a model that could
meet the
constraints
im
posed by poten
tial beneficiaries.
In this
paper
,
we develop a methodology for planning and cost
-
modeling of a wide area network
and
validate it
in
a case study,
under the
supposition
that
behavioral interactions of individuals and groups play a significant
role and have
to be taken into consideration
by employing either simple or composite indicators of
socioeconomic status
.
A novel scheme to improve the spectrum sensing performanceIJCNCJournal
Due to limited availability of spectrum for license
d users only, the need for secondary access by unli
censed
users is increasing. Cognitive radio turns out to b
e helping this situation because all that is needed
is a
technique that could efficiently detect the empty s
paces and provide them to the secondary devices wit
hout
causing any interference to the primary (licensed)
users. Spectrum sensing is the foremost function of
the
cognitive radio which senses the environment for wh
ite spaces. Energy detection is one of the various
spectrum sensing techniques that are under research
. Earlier it was shown that energy detection works
better under AWGN channel as compared to Rayleigh c
hannel, however the conventional spectrum sensing
techniques have a high probability of false alarm a
nd also show a better probability of detection for
higher
values of SNR. There is a need for a new technique
that shows a reduced probability of false alarm as
well
as an increase in the probability of detection for
lower values of SNR. In the present work the conven
tional
energy detection technique has been enhanced to get
better results.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
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.
Energy efficient node deployment for target coverage in wireless sensor networkGaurang Rathod
Network lifetime plays an integral role in setting up an efficient wireless sensor network. Coverage in a network needs to guarantee that the region is monitored with the required degree of reliability. Locations of sensor nodes constitute the basic input for the algorithms that examine coverage of the network. Coverage problems can be broadly classified as area coverage problem and target coverage problem. Area coverage focuses on monitoring the entire region of interest, whereas target coverage concerns monitoring only certain specific points in a given region. Target coverage can be categorized as simple coverage, k-coverage and Q-coverage.
Lower coverage level (simple coverage) is enough for environmental or habitat monitoring or applications like home security. Higher degree of coverage (k-coverage) will be required for some applications like target tracking to track the targets accurately, or if sensors work in a hostile environment such as battle fields or chemically polluted areas. More reliable results are produced for higher degree of coverage which requires multiple sensor nodes to monitor the region/targets. An example of Q-coverage is video surveillance systems deployed for monitoring hostile territorial area where some sensitive targets like a nuclear plant may need more sensors cooperate to ensure source redundancy for precise data. Sensor nodes deterministically deployed by using artificial bee colony algorithm, so as to achieve the required target coverage level and maximize the network lifetime.
A Generic Open Source Framework for Auto Generation of Data Manipulation Comm...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Information extraction from sensor networks using the Watershed transform alg...M H
Wireless sensor networks are an effective tool to provide fine resolution monitoring of the physical environment. Sensors generate continuous streams of data, which leads to several computational challenges. As sensor nodes become increasingly active devices, with more processing and communication resources, various methods of distributed data processing and sharing become feasible. The challenge is to extract information from the gathered sensory data with a specified level of accuracy in a timely and power-efficient approach. This paper presents a new solution to distributed information extraction that makes use of the morphological Watershed algorithm. The Watershed algorithm dynamically groups sensor nodes into homogeneous network segments with respect to their topological relationships and their sensing-states. This setting allows network programmers to manipulate groups of spatially distributed data streams instead of individual nodes. This is achieved by using network segments as programming abstractions on which various query processes can be executed. Aiming at this purpose, we present a reformulation of the global Watershed algorithm. The modified Watershed algorithm is fully asynchronous, where sensor nodes can autonomously process their local data in parallel and in collaboration with neighbouring nodes. Experimental evaluation shows that the presented solution is able to considerably reduce query resolution cost without scarifying the quality of the returned results. When compared to similar purpose schemes, such as “Logical Neighborhood”, the proposed approach reduces the total query resolution overhead by up to 57.5%, reduces the number of nodes involved in query resolution by up to 59%, and reduces the setup convergence time by up to 65.1%.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
Routing in Wireless Sensor Networks: Improved Energy Efficiency and Coverage ...CSCJournals
This paper proposes a new method for collecting distributed data in Wireless Sensor Networks (WSNs) that can improve the energy efficiency and network coverage; especially in remote areas. In multi-hop communication, sink nodes are responsible for collecting and forwarding data to base stations. The nodes that are located near a sink node usually deplete their battery faster than other nodes because they are responsible for aggregating the data from other sensor nodes. Several studies have proved the advantages of using mobile sink nodes to reduce energy consumption. Nonetheless, the need for compatible and efficient routing algorithms cannot be understated. Accordingly, a hybrid routing algorithm based on the Dijkstra�s and Rendezvous algorithms is proposed. To improve the energy efficiency and coverage, Energy Efficient Hybrid Unmanned Vehicle Based Routing Algorithm (E2HUV) is proposed to create a routing path for Unmanned Aerial Vehicles (UAVs) that can be used as mobile sinks in WSNs. Performance results show that the E2HUV algorithm offers better efficiency as compared to currently existing algorithms.
ON THE PERFORMANCE OF INTRUSION DETECTION SYSTEMS WITH HIDDEN MULTILAYER NEUR...IJCNCJournal
Deep learning applications, especially multilayer neural network models, result in network intrusion detection with high accuracy. This study proposes a model that combines a multilayer neural network with Dense Sparse Dense (DSD) multi-stage training to simultaneously improve the criteria related to the performance of intrusion detection systems on a comprehensive dataset UNSW-NB15. We conduct experiments on many neural network models such as Recurrent Neural Network (RNN), Long-Short Term Memory (LSTM), Gated Recurrent Unit (GRU), etc. to evaluate the combined efficiency with each model through many criteria such as accuracy, detection rate, false alarm rate, precision, and F1-Score.
Energy Consumption Reduction in Wireless Sensor Network Based on ClusteringIJCNCJournal
ABSTRACT
One of the important issues in the routing protocol design in Wireless Sensor Networks (WSNs) is minimizing energy consumption and maximizing network lift time. Nowadays networks and information systems are one of the main parts of modern life that without them, people cannot live. On the hand, the impairment of these networks leads to great and incalculable costs. In this paper, a new method based on clustering has presented that problem of energy consumption is solved. The proposed algorithm is that energy-based clustering can create clusters of the same energy level and distribute energy efficiency across the WNS nodes. This proposed clustering protocol classify network nodes based on energy and neighbourhood criteria and attempts to better balance energy in clusters and ultimately increase network lifetime and maintain network coverage. Results are shown that the proposed algorithm is on average 40% better than LEACH algorithm and 14% better than IBLEACH algorithm.
KEYWORDS
Wireless Sensor Network, Clustering, LEACH Algorithm, IBLEACH Algorithm
Abstract Link : http://aircconline.com/abstract/ijcnc/v11n2/11219cnc03.html
Full Details : http://aircconline.com/ijcnc/V11N2/11219cnc03.pdf
AN EFFICIENT INTRUSION DETECTION SYSTEM WITH CUSTOM FEATURES USING FPA-GRADIE...IJCNCJournal
An efficient Intrusion Detection System has to be given high priority while connecting systems with a network to prevent the system before an attack happens. It is a big challenge to the network security group to prevent the system from a variable types of new attacks as technology is growing in parallel. In this paper, an efficient model to detect Intrusion is proposed to predict attacks with high accuracy and less false-negative rate by deriving custom features UNSW-CF by using the benchmark intrusion dataset UNSW-NB15. To reduce the learning complexity, Custom Features are derived and then Significant Features are constructed by applying meta-heuristic FPA (Flower Pollination algorithm) and MRMR (Minimal Redundancy and Maximum Redundancy) which reduces learning time and also increases prediction accuracy. ENC (ElasicNet Classifier), KRRC (Kernel Ridge Regression Classifier), IGBC (Improved Gradient Boosting Classifier) is employed to classify the attacks in the datasets UNSW-CF, UNSW and recorded that UNSW-CF with derived custom features using IGBC integrated with FPA provided high accuracy of 97.38% and a low error rate of 2.16%. Also, the sensitivity and specificity rate for IGB attains a high rate of 97.32% and 97.50% respectively.
AN ENERGY EFFICIENT DISTRIBUTED PROTOCOL FOR ENSURING COVERAGE AND CONNECTIVI...ijasuc
As wireless sensor networks (WSNs) continue to attract more and more researchers attention, new ideas for
applications are continually being developed, many of which involve consistent coverage with good
network connectivity of a given area of interest. For the successful operation of the wireless Sensor
Network, the active sensor nodes must maintain both coverage and also connectivity. These are two closely
related essential prerequisites and they are also very important measurements of quality of service (QoS)
for wireless sensor networks. This paper presents the design and analysis of novel protocols that can
dynamically configure a sensor network to result in guaranteed degrees of coverage and connectivity. This
protocol is simulated using NS2 simulated and compared against a distributed probabilistic coveragepreserving configuration protocol (DPCCP) with SPAN [1] protocol in the literature and show that it
activates lesser number of sensor nodes, consumes much lesser energy and maximises the network lifetime
significantly.
On the development of methodology for planning and cost modeling of a wide ar...IJCNCJournal
The most important stages in designing a
computer
network
in a
wider geographical area include:
definition of requirements, topological description
,
identification and calculation of relevant parameters
(
i
.
e
.
traffic matrix
)
, determining the shortest path between nodes, quantification of the effect of various
levels
of technical and technological development of urban areas involved, the cost of technology
,
and the
cost of services. The
se
parameters differ for WAN networks in different regions
–
their calculation depends
directly
on
the data “
i
n the field
”
: number of inhabitants, distance between populated areas,
network
traffic
density
,
as well as
available
bandwidth
. The
main
reason for identification and evaluation of these
parameters
is
to develop a model that could
meet the
constraints
im
posed by poten
tial beneficiaries.
In this
paper
,
we develop a methodology for planning and cost
-
modeling of a wide area network
and
validate it
in
a case study,
under the
supposition
that
behavioral interactions of individuals and groups play a significant
role and have
to be taken into consideration
by employing either simple or composite indicators of
socioeconomic status
.
A novel scheme to improve the spectrum sensing performanceIJCNCJournal
Due to limited availability of spectrum for license
d users only, the need for secondary access by unli
censed
users is increasing. Cognitive radio turns out to b
e helping this situation because all that is needed
is a
technique that could efficiently detect the empty s
paces and provide them to the secondary devices wit
hout
causing any interference to the primary (licensed)
users. Spectrum sensing is the foremost function of
the
cognitive radio which senses the environment for wh
ite spaces. Energy detection is one of the various
spectrum sensing techniques that are under research
. Earlier it was shown that energy detection works
better under AWGN channel as compared to Rayleigh c
hannel, however the conventional spectrum sensing
techniques have a high probability of false alarm a
nd also show a better probability of detection for
higher
values of SNR. There is a need for a new technique
that shows a reduced probability of false alarm as
well
as an increase in the probability of detection for
lower values of SNR. In the present work the conven
tional
energy detection technique has been enhanced to get
better results.
Further results on the joint time delay and frequency estimation without eige...IJCNCJournal
Joint Time Delay and Frequency Estimation (JTDFE) problem of complex sinusoidal signals received at
two separated sensors is an attractive problem that has been considered for several engineering
applications. In this paper, a high resolution null (noise) subspace method without eigenvalue
decomposition is proposed. The direct data Matrix is replaced by an upper triangular matrix obtained from
Rank-Revealing LU (RRLU) factorization. The RRLU provides accurate information about the rank and the
numerical null space which make it a valuable tool in numerical linear algebra.The proposed novel method
decreases the computational complexity of JTDFE approximately to the half compared with RRQR
methods. The proposed method generates estimates of the unknown parameters which are based on the
observation and/or covariance matrices. This leads to a significant improvement in the computational load.
Computer simulations are included in this paper to demonstrate the proposed method.
A review study of handover performance in mobile ipIJCNCJournal
The Mobile Internet Protocol (Mobile IP) is an extension to the Internet Protocol proposed by the Internet
Engineering Task Force (IETF) that addresses the mobility issues. In order to support un-interrupted
services and seamless mobility of nodes across the networks (and/or sub-networks) with permanent IP
addresses, handover is performed in mobile IP enabled networks. Handover in mobile IP is source cause of
performance degradation as it results in increased latency and packet loss during handover. Other issues
like scalability issues, ordered packet delivery issues, control plane management issues etc are also
adversely affected by it. The paper provides a constructive survey by classifying, discussing and comparing
different handover techniques that have been proposed so far, for enhancing the performance during
handovers. Finally some general solutions that have been used to solve handover related problems are
briefly discussed.
A fuzzy logic controllerfora two link functional manipulatorIJCNCJournal
This paper presents a new approach for designing a Fuzzy Logic Controller "FLC"for a dynamically multivariable nonlinear coupling system. The conventional controller with constant gains for different operating points may not be sufficient to guarantee satisfactory performance for Robot manipulator. The Fuzzy Logic Controller utilizes the error and the change of error as fuzzy linguistic inputs to regulate the system performance. The proposed controller have been developed to simulate the dynamic behavior of A
Two-Link Functional Manipulator. The new controller uses only the available information of the input-output for controlling the position and velocity of the robot axes of the motion of the end effectors
LTE QOS DYNAMIC RESOURCE BLOCK ALLOCATION WITH POWER SOURCE LIMITATION AND QU...IJCNCJournal
3GPP has defined the long term evolution (LTE) for 3G radio access in order to maintain the future
competitiveness for 3G technology, the system provides the capability of supporting a mixture of services
with different quality of service (QoS) requirements. This paper proposes a new cross-layer scheduling
algorithm to satisfy better QoS parameters for real time applications. The proposed algorithm takes care of
allocating resource blocks (RBs) with different modulation and coding schemes (MCS) according to target
bit error rate (BER), user equipment supportable MCS, queue stability constraints and available transmit
power constraints. The proposed algorithm has been valued, compared with an earlier allocation algorithm
in terms of service rate and packet delay and showed better performance regards the real time
applications.
Different date block size using to evaluate the performance between different...IJCNCJournal
The different computer networks whether wired or wireless are becoming more popular with its high
security aspect. Different security algorithms and technique are using to avoid any aforementioned attacks.
One of these technique is a cryptography technique that makes the data as unreadable during the transfer
hence; there is no chance to reclaim the information. Presently, most of the users are using various media
types and internet to transfer the data but, it has the chance to retrieve the data by using these media types.
The perfect solution for this problem is to provide security on time-to-time basis; this stage is always
significant to the security related community discussions. This paper explains the comparison between the
run time of three different encryption algorithms which are DES, AES and Blowfish The compression
includes using different modes, data block size and different operation modes. As a result, Blowfish
algorithm followed by AES take less time for running compared to DES.
PAPR REDUCTION OF OFDM SIGNAL BY USING COMBINED HADAMARD AND MODIFIED MEU-LAW...IJCNCJournal
Orthogonal frequency division multiplexing (OFDM) is a technique which gives high quality of service (QOS) to the users by mitigating the fading signals as well as high data rates in multimedia services. However, the peak-to-average power ratio (PAPR) is a technical challenge that reduces the efficiency of RF power amplifiers. In this paper, we propose the combined Hadamard transform and modified meu-law companding transform method in order to lessen the effects of the peak-to-average power ratio of the
OFDM signal. Simulation results show that the proposed scheme reduces PAPR compared to other companding techniques as well as the Hadamard transform technique when used on its own.
Dcf learn and performance analysis of 802.11 b wireless networkIJCNCJournal
Though WLAN wireless network has been widely deployed as the main split-flow deployment of the
communication network, little study emphasizes its performance as WLAN protocols were only designed for
the public communicating conveniently with each other. Actually that too much wireless access points
assembling together will cause self-interference to the whole WLAN network. This paper investigates the
distributed coordination function (DCF) learn and the performance study of 802.11b networks. Firstly, our
study illustrates the performance of its MAC layer and its fairness issues related to DCF. Next we propose
the details which should be paid attention to in deploying network services. Then, performance analyses
are evaluated by simulation and real test for a dense wireless network. Our main goal is to give proposals
to network operators how to design a WLAN network more standardized and orderly.
Key management in information centric networkingIJCNCJournal
Information centric networking (ICN) has been in the spotlight of recent research. It is an emerging
communication paradigm that relays on the concept of publish and subscribe. It aims to revise the current
Internet with a new clean slate architecture where the design is completely different from today’s location
based model. To secure the forwarding plan in this network, it is vital to have a time based transient
forwarding identifiers by periodically changing the network link identifiers. This assumes shared keys to be
distributed prior the communications between an entity termed topology manager (TM) and each forwarder
in the network. Exchanging and sharing a secret key between two parties is one of most critical functions in
cryptography that needs to be more concerned when integrating cryptographic functions into the system. As
ICN is brand new Internet architecture, many existing cryptography protocols may need to be redesigned
to fit this new architecture. Therefore, this paper focuses on the security aspect of ICN and proposes an
initial design to deploy the integrated Diffie-Hellman-DSA key exchange protocol as a key distributions
mechanism.
Framework for wireless network security using quantum cryptographyIJCNCJournal
Data that is transient over an unsecured wireless network is always susceptible to being intercepted by
anyone within the range of the wireless signal. Hence providing secure communication to keep the user’s
information and devices safe when connected wirelessly has become one of the major concerns. Quantum cryptography provides a solution towards absolute communication security over the network by encoding
information as polarized photons, which can be sent through the air. This paper explores on the aspect of
application of quantum cryptography in wireless networks.
In this paper we present a methodology for integrating quantum cryptography and security of IEEE 802.11 wireless networks in terms of distribution of the encryption keys.
ETOR-Efficient Token based Opportunistic RoutingIJCNCJournal
This paper proposes an Efficient Token based Opportunistic Routing called ETOR, which is an
improvement to the token based coordination approach for opportunistic routing proposed by Economy[1].
In Economy, method used for finding the connected candidate order chooses neighbor as the next
candidate by considering ETX of that neighbor towards the source but it does not consider the link
probability between the relay candidate and neighbor to be selected. ETOR proposes variant methods for
finding the connected candidate order in token based opportunistic routing by considering both the ETX
of the neighbor towards source as well as ETX of the relay towards sending candidate which avoids weaker
links between its intermediate nodes thereby improving the throughput and reducing the AA Ratio. We also
propose a solution for reducing the number of hops traversed by the token, which in turn increases the
token generation speed. Simulation results show that the proposed ETOR approaches perform better than
Economy approach in terms of AA Ratio, number of hops traversed by the token and number of token
traversals.
DESIGN ISSUES ON SOFTWARE ASPECTS AND SIMULATION TOOLS FOR WIRELESS SENSOR NE...IJNSA Journal
In this paper, various existing simulation environments for general purpose and specific purpose WSNs are discussed. The features of number of different sensor network simulators and operating systems are compared. We have presented an overview of the most commonly used operating systems that can be used in different approaches to address the common problems of WSNs. For different simulation environments there are different layer, components and protocols implemented so that it is difficult to compare them. When same protocol is simulated using two different simulators still each protocol implementation differs, since their functionality is exactly not the same. Selection of simulator is purely based on the application, since each simulator has a varied range of performance depending on application.
Data Security and Data Dissemination of Distributed Data in Wireless Sensor N...IJERA Editor
A data dissemination protocol for wireless sensor networks has been engaged for modifying configuration fields and circulating management controls to the mote. Earlier, a data dissemination protocol faces the henceforth two consequences. First, they are works on sink based model; only the sink can circulate data item to other motes. Such model is not suitable for large user wireless sensor networks. Second, those protocols are not provide with any security and hence intruders will make problems to misuse the network. We provided the seDrip protocol. It allows the network mentors to authorize multiple network uses with various permissions to simultaneously and directly distributed data items to the mote. seDrip is implemented in an laboratory of network restricted resources mote to depict its large capability in practice.
Evaluating feasibility of using wireless sensor networks in a coffee crop thr...IJCNCJournal
A Wireless Sensor Networks is a network formed with sensors that have characteristics to sensor an area to
extract a specific metric, depending of the application.
We would like to analyse the feasibility to use sensors in a coffee crop.In this work we are evaluating routing protocolsusing real dimensions and characteristics of a coffee crop. We evaluate, through simulation, AODV, DSDV and AOMDV and two variants known in this work as AODVMOD and AOMDVMOD with 802.15.4 MAC Protocol
.For this comparison, we defined three performance metrics: Packet Delivery Ratio (PDR), End-to-End Delay
and Average Energy Consumption. Simulation results show that AOMDVMOD overall, outperforms others
routing protocols evaluated, showing that is possible to use WSN in a real coffee crop environment.
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNIJCNCJournal
In this article it has presented leach extended hierarchical 3-level clustered heterogeneous and dynamics
algorithm. On suggested protocol (LEH3LA) with planning of selected auction cluster head, and
alternative cluster head node, problem of delay on processing, processing of selecting members, decrease
of expenses, and energy consumption, decrease of sending message, and receiving messages inside the
clusters, selecting of cluster heads in large sensor networks were solved. This algorithm uses hierarchical
heterogeneous network (3-levels), collective intelligence, and intra-cluster interaction for communications.
Also it will solve the problems of sending data in Multi-BS mobile networks, expanding inter-cluster
networks, overlap cluster, genesis orphan nodes, boundary change dynamically clusters, using backbone
networks, cloud sensor. Using sleep/wake scheduling algorithm or TDMA-schedule alternative cluster head
node provides redundancy, and fault tolerance. Local processing in cluster head nodes, and alternative
cluster head, intra-cluster and inter-cluster communications such as Multi-HOP cause increase on
processing speed, and sending data intra-cluster and inter-cluster. Decrease of overhead network, and
increase the load balancing among cluster heads. Using encapsulation of data method, by cluster head
nodes, energy consumption decrease during sending data. Also by improving quality of service (QoS) in
CBRP, LEACH, 802.15.4, decrease of energy consumption in sensors, cluster heads and alternative cluster
head nodes, cause increase on lift time of sensor networks.
Towards internet of things iots integration of wireless sensor network to clo...IJCNCJournal
Cloud computing provides great benefits for applications hosted on the Web that also have special
computational and storage requirements. This paper proposes an extensible and flexible architecture for
integrating Wireless Sensor Networks with the Cloud. We have used REST based Web services as an
interoperable application layer that can be directly integrated into other application domains for remote
monitoring such as e-health care services, smart homes, or even vehicular area networks (VAN). For proof
of concept, we have implemented a REST based Web services on an IP based low power WSN test bed,
which enables data access from anywhere. The alert feature has also been implemented to notify users via
email or tweets for monitoring data when they exceed values and events of interest.
Performance Evaluation of Wireless Sensor Networks Communication Overhead and...ijtsrd
Powerful actors and resource constrained sensors are joined in wireless networks to form Wireless Sensor and Actor Networks WSANs . The lifespan of a sensor network may be effectively increased by clustering. The method of clustering involves breaking up sensor networks into smaller, more nimble groups of individuals with a cluster head. In hierarchically organised wireless sensor networks, clustering algorithms must choose the ideal number of clusters. In this study, we examine the effectiveness of cluster based wireless sensor networks for various wireless sensor network communication patterns WSNs . By utilising the self organizing map SOM based clustering approach, we concentrate on their performances in terms of Communication overhead and Energy consumption in WSN with varied velocities for the cluster based protocol. Mangukiya Hiteshkumar Bhupatbhai "Performance Evaluation of Wireless Sensor Networks' Communication Overhead and Energy Consumption using the Self-Organizing Map Method" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-6 | Issue-6 , October 2022, URL: https://www.ijtsrd.com/papers/ijtsrd51936.pdf Paper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/51936/performance-evaluation-of-wireless-sensor-networks-communication-overhead-and-energy-consumption-using-the-selforganizing-map-method/mangukiya-hiteshkumar-bhupatbhai
Sensors Scheduling in Wireless Sensor Networks: An Assessmentijtsrd
The wireless sensor networks WSN is a combination of a large number of low power, short lived, unreliable sensors. The main challenge of wireless sensor network is to obtain long system lifetime. Many node scheduling algorithms are used to solve this problem. This method can be divided into the following two major categories first is round based node scheduling and second is group based node scheduling. In this paper many node scheduling algorithm like one phase decomposition model, Tree Based distributed wake up scheduling and Clique based node scheduling Algorithm are analyzed. Manju Ghorse | Dr. Avinash Sharma "Sensors Scheduling in Wireless Sensor Networks: An Assessment" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-1 , December 2019, URL: https://www.ijtsrd.com/papers/ijtsrd29560.pdfPaper URL: https://www.ijtsrd.com/computer-science/computer-network/29560/sensors-scheduling-in-wireless-sensor-networks-an-assessment/manju-ghorse
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Wireless sensor network is emerging field because of its wide applications. It is a wireless network which subsist a group of small sensor nodes which communicate through radio interface. These sensor nodes are composed of sensing, computation, communication and power as four basic elements. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. But limited energy, communication capability, storage and bandwidth are the main resource constraints. The network should have self-organizing capabilities as the positions of individual nodes are not predetermined. The flexibility, fault tolerance, high sensing fidelity, low cost, and rapid deployment characteristics of sensor networks create many new and exciting application areas for remote sensing. Our survey is based on various aspects of routing protocols in wireless sensor networks.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
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.
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.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
By Design, not by Accident - Agile Venture Bolzano 2024
A New Programming Model to Simulate Wireless Sensor Networks : Finding The Best Routing Path
1. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
DOI : 10.5121/ijcnc.2013.5401 01
A New Programming Model to Simulate Wireless
Sensor Networks : Finding The Best Routing Path
Abrar Alajlan, Khaled Elleithy, and Varun Pande
Department of Computer Science and Engineering, University of Bridgeport, Bridgeport,
CT, USA
aalajlan@bridgeport.edu, elleithy@bridgeport.edu , vpande@bridgeport.edu
ABSTRACT
Sensor networks provide a number of extensive programming challenges for Wireless Sensor Networks
(WSNs) application programmers. Application developers have proposed various WSNs programming
models to avoid these challenges and make WSN programming much easier. In this paper we proposed a
new programming model to find the best routing path in WSNs and work on the coding of actual sensor
nodes to perform the desired tasks. Then we describe the initial design and the implementation of our
proposed model and compare the results when applied in different network topologies with multiple routing
algorithms. Finally, we present an evaluation of our model in terms of cost and accuracy.
KEYWORDS
Programming models, WSN, Node- dependent, eventual Consistancy, routing algorithm, cost-minimizing
algorithm, heuristic algorithm, routing path.
1. INTRODUCTION
Wireless sensor networks contain a large number of inexpensive sensor nodes deployed to
different environments and can be used to detect data and deliver it to sink nodes [1]. Each sensor
node is consist of a radio transceiver which has the ability to send or receive packets, a processor
to schedule and perform tasks, and power source to provide energy [2]. A sensor network consists
of different number of sensor nodes used to transmit and forward sensing data between sensing
nodes and the sink or base station. These sensors can be deployed in many applications for
example to conduct the environmental conditions such as temperature, humidity and pressures
with low power consumption [4]. The ability to place remote sensing nodes without having to run
wires and the cost related to it is a huge gain. And as the size of the circuitry of WSN is growing
smaller along with the cost, the chances of their field of applications are growing large [3]. Most
sensors are battery powered and hence conserving the energy of these sensors is very crucial.
Thus, a new model should be applied to manage the power consumption and deliver detected data
to the base station.
Several programming approaches have been proposed to assist WSN programming in high-level
languages. Two broad classes of WSN programming models have only been introduced recently:
local behavior abstraction and global behavior abstraction [5]. The local behavior abstractions can
be done at node-level where network programmers need to synchronize the work flow between
sensing nodes and maintaining routing code manually. In opposition, global behavior abstractions
or equivalently “Microprogramming abstraction”, as we shall discuss later, has emerged as one of
the most important aspects in sensor networks. The main objective behind macroprogramming
2. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
2
approach is the ability to treat the whole network as one single unit rather than working on each
node individually [6].
Since there are many programming models have been explored recently, we would focus on
coding the actual sensors to find the shortest routing path, best possible routing path and the
maximum routes in multiple wireless sensor networks topologies.
The paper is structured as follows. Section 2 identifies the requirements for sensor network
programming. Section 3 provides an overview the related work of macroprogramming model in
WSN and section 4 defines the proposed algorithm. Section 5 describes the simulation setup.
Section 6 provides the analysis of results. Section 7 discusses the results. Finally, section 8
conclusions.
2. REQUIREMENTS FOR SENSOR NETWORK PROGRAMMING
It is obvious that sensor networks can be used in different applications across multiple
environments. Moreover, it is very easy to modify the internal functionality of sensor networks to
perform different tasks and to support many sensor networks applications. However, there are
four significant requirements for sensor network programming as follow:
- Energy-efficiency
- Scalability
- Localization
- Time-Synchronization
Energy efficiency is one of the most important issues in deigning sensor networks. The overall
design of sensor networks should mainly emphasize on enhancing the performance in terms of
energy used and power consumed. The total lifetime of a battery-powered sensor networks is
limited by the battery's capacity and each sensor node is equipped with a limited computation
processor to perform its tasks [7]. Thus, programming model for sensor networks should deploy
some applications that attain a proper level of energy-efficiency and to deliver demanded results
[8].
Scalability is another important aspect in designing sensor networks applications. A scalable
sensor network is a network that able to deliver results with different number of nodes[9]. Since
we cannot predetermine the location of sensor nodes and we cannot assure the lifetime of sensor
node, programming model should help in such a way to design scalable applications that able to
deliver accurate results [9].
In some sensor network applications, nodes are scattered quite randomly in the tested area rather
than studying the location of each node. However, the location information of distributed nodes
needs to be known in order to exchange data between nodes and the sink. [10]
Localization of sensor network is one of the most important issues in programming sensor
networks[11]. Many localization techniques have been proposed recently, either by deploying
self-localized technique or by install a Global Positioning System (GPS) device in each node to
determine the exact location of sensor node. Moreover, the location of each sensor node can be
determined by calculating the distance between the selected sensor node and neighboring nodes
[12].
Time-synchronization is another essential requirement for programming sensor network. Clock
synchronization is a process used to ensure an accurate scheduling between nodes with no
3. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
3
collision [14]. As stated above WSNs have limited power; therefore, time- synchronization
technique reduces power consumption by passing some nodes off from time to time [15].
Clock synchronization in sensing nodes is generally required for some reasons. First, to support
the coordination and collaboration between sensor nodes. Second, to manage sleep and active
state in each node [16]. Third, to avoid collisions between sensor nodes as used in TDMA [13].
There are some other requirements that we have not introduced in this paper. However, the
concentration of this work is mainly on the four requirements stated above.
3. RELATED WORK
Several macro-programming abstractions have been introduced recently. In this section, we
provide a brief classification of macroprogramming model as shown in fig.1 and introduce our
work under one selected area. Macro-programming model or equivalently “networking
abstractions” considered to be high-level WSN programming model where the whole sensor
network is treated as a one unit[17]. This approach helps to emphasize on improving the
semantics of the network instead of studying the characteristics of the programming environments
[18]. Several macro-programming models have been proposed in the past which provide an idea
about the node itself and the networking platform. Nano-CF programming framework as in [18]
enables to execute multiple applications simultaneously at the same sensor networking platform.
There are two different major classes of network-level abstractions. One is Node-dependent
abstractions and the other is Node-independent abstractions. In node-dependent approach a group
of nodes can be treated at the same time in one single code. Our proposed work as we will
introduce later, falls into this category [19]. This approach designed to allow the user to define the
distributed system performance based on the nodes and their states[21].
3.1. Node Dependent Approach
Kairos is a node-dependent abstraction where the neighboring nodes are able to communicate by
using common requests at specific nodes [22].
4. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
4
This approach has a centralized programming environment which can be translated later by the
compiler to many executable effective nodal programs [23]. Kairos enhances the use of sensor
programming languages by providing three simple mechanisms. First, node abstraction, where the
programmer deploys network nodes explicitly and named each node with an integer identifier, yet
these integer identifiers do not reflect the structure of sensor node. Hence, there is no need to
specify the network structure when using Kairos [23]. Second, identification of one-hop
neighbors, where the programmers able to use what called (get neighbors function) to support
wireless communication between nodes. When get function called, a list of neighbor nodes
returned, so the calling node can select which node to communicate with. Third abstraction is
accessing data on a remote node means the capacity to access variables nodes from selected
node[20]. Thus, Kairos can be used with many well-known programming languages such as
python as in [23].
Another example of node-dependent abstraction is Regiment which is purely microprogramming
functional language that allows direct use of program state [24]. However, it uses what called
monads; it is described in more detail elsewhere in [25]. In Regiment, programmers deploy
groups of data stream or signals. These signals represent the findings of each individual node.
Regiment also provides the concept of region as in Abstract Regions [22]. Regions are used to
enhance the logical relationship between the nodes and data sharing between sensor nodes. The
compiler at Regiment converts the whole program into a form of simple readily program using
token machine technique where nodes achieve internal sensing and able to receive signals from
neighbor nodes [24].
In addition, Regiment applies multi-stage programming mechanism to support the use of different
programming languages that are not maintained by the given program [26]. Also, it approves the
use of generics to qualify the program to pass any data types as in C++. It supports three
polymorphic data types’ stream which represents the changes in nodes state, space which
represents the real space with a given value of specific type and event which represents the events
that have values and happen at a specific time. The concept behind streams and events is founded
in Functional Reactive Programming (FRP); see [27] for more details. Since Regiment is
completely functional language, the values of stream, event and space are treated as formal
parameters where they can be returned from function and passed as arguments [24].
3.2. Node-Independent Approach
In Contrast, node-independent approach or equivalently “Database approach” is another type of
high-level abstractions. This approach used to distributes nodes in a network using independent
technique [20]. For Example, TinyDB as in [27] is a query processing system which mainly
focuses on improving the energy consumption by controlling tested data. The network treated as
one database system where users are able to retrieve information by using SQL-Like queries.
This approach should obey what called homogeneous network where all nodes must have same
capabilities before testing to achieve the desire result. In TinyDB, data gathered from sensing
nodes is actually used as an input in sensor table and system user can access these entries by
using SQL-like queries [22].
Cougar is another example of node-independent abstractions. Cougar system is used to test a
query processing in sensor networks [29]. Each Cougar system is consist of three level,
5. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
5
Queryproxy, Frontend Component and Graphical user Interface. Frist, Query proxy is a tiny
database element that runs in sensor nodes to track and perform system queries. Second, Frontend
element is used to setup connections between sensor nodes in one network and another nodes in
different networks. Third, graphical user interface (GUI) is used to perform queries on sensor
networks [29]. Cougar helps to retrieve the data and system behavior. However, it is too difficult
to deal with complex applications like tracking system using this technique [28]. Cougar is
founded on routing tree which used to attain energy efficiency [22].
Although Node-independent abstraction delivers very simple user interface, it is still not suitable
for applications that require a lot of control flow. Thus, the main objective in node-independent
approach is to deliver abstraction in order to enhance the sensing type of WSN applications. On
the other hand, the main objective for node-dependent approach such as Kairos and regiment is to
deliver a wide range of WSN applications that need parallel computations. We summarize the
features of each programming abstraction of related work in Table1.
Table 1. Mapping WSN macro-programming abstractions with corresponding features
4. PROPOSED SOLUTION
The main objective of this work is to introduce a new programming model that is extremely
robust to sensor nodes failures.
Although there are several models focus on node-dependent abstractions, we would be working
on coding the actual sensor nodes to find the best routing path in different networks topologies.
Our proposed work will employ a model of eventual consistency, the sensing nodes are able to
deliver the most accurate result even if an internal node is not assured to be reliable.
Therefore, adopting eventual consistency mechanism in our programming model might lead us to
new outputs. Figure 2 illustrates the flow chart of our proposed model.
Key Feature Kairos Regiment Cougar TinyDB
Node-
Dependency
Node-
dependent
Node-
dependent
Node-
independent
Node-
independent
Programming
Model
Sequential Functional SQL-like
Queries
SQL-like
Queries
Data Access Sharing the
Data
Sharing the
Data
Database Database
Communication
Space
Neighborhood
based group
Logical
group
Whole
network
Whole network
6. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
6
Fig.2 A Flow Chart of Proposed model
The proposed work is summarized in the following steps:
1. Identify Node: Considering the node attributes, a test signal is sent throughout the network to
recognize the number of active, sleep and failed nodes. Failure in acknowledgement from any
of the nodes leads to the node being understood as compromised or a filed faulty node.
2. Using tri level logic: Using a sequence of if-else statements, we built a set of protocols to
check the consistency of the nodes by their optimal distance and try to identify their master
node. A positive affirmation from any of these logistics leads to the understanding of eventual
consistency in between the nodes(we already know the node location and activity from step
2)
3. Routing protocol: Considering the active and functional nodes in the network, we can start
routing protocol. The routing can be done by the implementation of the basic routing
algorithms like the Dijkstras balance and consideration of the Euclidian distance.
The proposed work can be considered as a programming model to find the best routing path in
WSNs. The steps above help one determine whether all the nodes in a network are active or
functional which allows us to develop a consistent model for the distribution of nodes. The
proposed work we have shown previously can be applied in various node architectures. Some of
which we have shown in the simulation results later in this paper.
5.SIMULATION SETUP
In this simulation, we are going to explain how the proposed programming model helps us to find
the best routing path from selected source to a selected destanition. Consider that we have
different number of nodes, which are placed randomely in a network. If one node failed, the
system still able to deliver the most accourate result. In this programming model, we can define
the number of input and output for each node and the location of source and the destination nodes.
Initially all nodes are in a sleep state and placed randomely on a screen. Then, we send a test
signal to all nodes to make sure that all the nodes are working. Once the nodes are distributed, the
option window allows to choose the various default set values or change the routing algorithms
based on the need. It allows one to choose the actual coding of network to find the shortest path,
the best possible routing path or find the maxiumu routes by running them on the same network
7. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
7
topology, as shown in Figure 3 and Figure 4. After all we are working on a new programming
model where the simulation allows choosing the best routing model based on the consistency of
the nodes distrubutions.
Figure 3: Options window to choose default set values for the proposed model
In Figure 4, all nodes are distributed randomly in a network in order to find the best possible
routing path. Though this is based on one of the routing algorithms from option menu. Almost
every WSNs is immune to have a few failed nodes or compromised nodes. Keeping such
inconsistencies in mind we try to develop a new model that enable users to select the best routing
path in any network just by considering node attributes and the consistency characteristics of
sensor networks.
Figure 4: The simulation of the proposed model shown the best possible path from source node to
destination node
6. Analysis of Results
We have applied the our model that proposed in the preceding section, and we have tested it to
find the best possible routing path. As stated earlier, our model let the user to select the routing
algorithm to find the shortest path, best possible path in the same network topology. In this
section, we sketch the details of our programming model by examining it in three different well-
known network topologies star network, fully connected network and mesh network.
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
7
topology, as shown in Figure 3 and Figure 4. After all we are working on a new programming
model where the simulation allows choosing the best routing model based on the consistency of
the nodes distrubutions.
Figure 3: Options window to choose default set values for the proposed model
In Figure 4, all nodes are distributed randomly in a network in order to find the best possible
routing path. Though this is based on one of the routing algorithms from option menu. Almost
every WSNs is immune to have a few failed nodes or compromised nodes. Keeping such
inconsistencies in mind we try to develop a new model that enable users to select the best routing
path in any network just by considering node attributes and the consistency characteristics of
sensor networks.
Figure 4: The simulation of the proposed model shown the best possible path from source node to
destination node
6. Analysis of Results
We have applied the our model that proposed in the preceding section, and we have tested it to
find the best possible routing path. As stated earlier, our model let the user to select the routing
algorithm to find the shortest path, best possible path in the same network topology. In this
section, we sketch the details of our programming model by examining it in three different well-
known network topologies star network, fully connected network and mesh network.
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
7
topology, as shown in Figure 3 and Figure 4. After all we are working on a new programming
model where the simulation allows choosing the best routing model based on the consistency of
the nodes distrubutions.
Figure 3: Options window to choose default set values for the proposed model
In Figure 4, all nodes are distributed randomly in a network in order to find the best possible
routing path. Though this is based on one of the routing algorithms from option menu. Almost
every WSNs is immune to have a few failed nodes or compromised nodes. Keeping such
inconsistencies in mind we try to develop a new model that enable users to select the best routing
path in any network just by considering node attributes and the consistency characteristics of
sensor networks.
Figure 4: The simulation of the proposed model shown the best possible path from source node to
destination node
6. Analysis of Results
We have applied the our model that proposed in the preceding section, and we have tested it to
find the best possible routing path. As stated earlier, our model let the user to select the routing
algorithm to find the shortest path, best possible path in the same network topology. In this
section, we sketch the details of our programming model by examining it in three different well-
known network topologies star network, fully connected network and mesh network.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
8
6.1 Heuristic only Algorithm
Heuristic algorithm is used to find the routing path fast and easily with no promise that the best
routing will be found. It is simply minimize the number of explored nodes by estimating the
remaining cost.
Figure 5, 6, and 7 show how the algorithm work with different network topology, star, fully-
connected and mesh networks respectively. The left side shows the mechanism of finding the
routing path in some sequential steps. The right side shows the routing path from source node to
destination node.
Figure 5: Applying heuristic algorithm to star network
Figure 6: Applying heuristic algorithm to fully-connected network
Figure 7: Applying heuristic algorithm to mesh network
9. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
9
As seen on the above graphs, the routing starts with exploring the cost of the nearest node and
estimates the cost for other nodes. Heuristic algorithm is used to find the routing path close to the
best one fast and easily. In some cases, the estimated cost is equal to the actual cost as shown on
table2. However, we cannot guarantee that this routing algorithm deliver the best routing path
until it is proven.
6.2 Costs- Minimization Algorithm
Cost minimizing algorithm is used to minimize cost without exploring more nodes. It is simply
find the best possible routing path in shortest time.
Figure8,9, and 10 show the cost minimizing algorithm with star, fully-connected and mesh
networks respectively. The left side of graph, shows how the model able to find the shortest
routing path without consuming too much energy. The right side shows the routing path from
source to destination.
Figure 8: Applying cost-minimizing algorithm to a star network
Figure 9: Applying cost-minimizing algorithm to fully-connected network
10. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
10
Figure10: Applying cost-minimizing algorithm to mesh network
From above graphs, cost-minimizing algorithm is used to reduce the average cost
required to find the best routing path. Basically, it is aim to reduce the number of routing
steps in order to find the best possible path.
6.3 Dijkstra only Algorithm
Dijkstra’s algorithm used to find the cheapest routing path between two nodes. It simply
does not perform cost estimation, but basically consider the actual current cost of the
path from source node to destination node.
Figures 11,12, and 13 show dijkstra’s algorithm with star, fully-connected and mesh
networks respectively. The left side of the graph calculated the number of steps to find
the cheapest path from source to destination nodes, and the right side show the final
routing path.
Figure11: Applying Dijkstra’s algorithm to star network
11. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
11
Figure12: Applying Dijkstra’s algorithm to fully-connected network
Figure13: Applying Dijkstra’s algorithm to mesh network
Dijkstra’s algorithm starts from source node as illustrated on above graphs and explore another
path in each repetition. Then the process will be repeated until it discovers the whole network and
calculate the sum of their costs in order to obtain the actual cost of the routing path.
7. Discussion of Results and Evaluation
The main objective of this paper is to provide a new programming model in WSNs to find the
best routing path. We adopt a model of eventual consistency; the system is able to deliver the
most accurate result even if an internal node is not assured to be reliable. Moreover, we consider
three different routing algorithms, first is heuristic algorithm which is simply minimize the
number of explored nodes by estimating the remaining cost. Second, is cost- minimizing
Algorithm which is basically minimizing the average time needed to discover the best possible
routing path without exploring more nodes. Third is Dijkstra’s algorithm which is used to find the
actual cost from source to destination nodes.
We tested our model on three different topology star, fully-connected and mesh networks for
better understanding. The proposed model can be applied in different networks topologies such as
random network as in Figure 4. However, since the random network has a random number of
nodes we cannot compare it with any other well-known topologies. Figure 14 and Table 2 show a
comparison between heuristic, cost-minimizing and Dijkstra algorithm in term of cost.
12. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
12
Figure14. How the exploration time is changing when changing algorithm
Table 2. Number of steps needed in different topology applied in different algorithm
The above table shows how the exploration time changes with different routing algorithm. With
star network, the best routing algorithm to use is heuristic algorithm because it has the fewest
steps to discover the routing path. In mesh network, time needed to find the best routing path with
cost-minimizing algorithm and dijkstra’s algorithm are same.
8. Conclusion
In this paper, we have reported the results of our programming model to find the routing path in
WSNs and investigated the performance of our model when applied in different routing
algorithms and multiple network topologies and further scope for improvement. The goal of the
research is to provide a new programming model that can be applied in different network
topologies to deliver the most accurate result. Research must carry on in all the capacities of
WSN programming model. Still there are some qualities and features are missing to let WSN
programming model reach its best level of performance. However, we believe that WSN
programming model is a huge step towards deploy more applications in WSNs domain.
REFERENCES
[1] Rong Yu, Zhi Sun, and Shunliang Mei, “Scalable Topology and Energy Management in Wireless Sensor
Networks“, presented at the Wireless Communication and Networking Conference (WCNC) 2007.IEEE
[2] Tubaishat, M. and Madria, S.K., " Sensor networks: an overview", Potentials, IEEE, On page(s): 20 – 23
Vol 22 (2), April-May 2003
0
5
10
15
Minimum
Exploration
Minimum Cost Actual Cost
Mesh Fully connected Star
Network
Topology
Minimum
Exploration
Minimum Cost Actual Cost
Star Network 5 8 11
Fully-connected
Network
8 2 3
Mesh Network 11 4 4
13. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
13
[3] Marriwala, N. and Rathee, P. ," An approach to increase the wireless sensor network lifetime", Information
and Communication Technologies (WICT), 2012 , IEEE, On page(s): 495 - 499 Oct. 30 2012-Nov. 2 2012
[4] R. Newton and M. Welsh. “Region streams: functional macroprogramming for sensor networks”. In
Proceedings of DMSN’04, pages 78–87, New York, NY, USA, 2004. ACM Press.
[5] Supasate, C. Nuttanart,P. and Chalermek,I. “Logic Macroprogramming for Wireless Sensor Networks”
International Journal of Distributed Sensor Networks, 2012.
[6] Bischoff, U. and Kortuem, G., “A State-based Programming Model and System for Wireless Sensor
Networks”, In: PerCom Workshops 2007 - Fifth Annual IEEE International Conference on Pervasive
Computing and Communications, On page(s) 19-23 March, 2007
[7] Alajlan, Abrar.,et al., “Topology Management In Wireless Sensor Networks: Multi-State Algorithms”,
International Journal of Wireless & Mobile Networks (IJWMN), On page(s) 17-26 Vol 4 (6), Dec 2012
[8] Vardhe, K., Chi Zhou; Reynolds, D., ” Energy Efficiency Analysis of Multistage Cooperation in Sensor
Networks” Global Telecommunications Conference (GLOBECOM 2010), IEEE, On page(s) 1-5 Dec, 2010
[9] Sousa,M.P., et al., “Scalability in an Adaptive Cooperative System for Wireless Sensor Networks”
International Conference on Ultra Modern Telecommunications & Workshops ( ICUMT 2009) IEEE, On
page(s) 1 – 6, Oct 12
[10] Warneke,B., et al., “Autonomous Sensing and Communication in A Cubic Millimeter “IEEE, On page(s)
44 – 51, Vol 34 (1) Jan 2001.
[11] Takizawa, Y., “Node Localization for Sensor Networks using Self-Organizing Maps”, Wireless Sensors
and Sensor Networks (WiSNet), IEEE, On page(s) 61 - 64 , Jan 2011.
[12] Pandey, S., et al., “Localization of Sensor Networks Considering Energy Accuracy Tradeoffs”
Collaborative Computing: Networking, Applications and Worksharing, International Conference, IEEE, On
page(s) 1 - 10, 2005.
[13] Qiang Liu., et al., “Time Synchronization Performance Analysis and Simulation of a kind of wireless
TDMA Network” International Frequency Control Symposium and Exposition, 2006 IEEE, On page(s) 299
– 303, June 2006.
[14] Yaguang K., Xifang Z., Huakui C., “ Intelligent Time Synchronization in Sensor Network”, Wireless,
Mobile and Multimedia Networks, 2006 IET International Conference,IEEE, On page(s) 1 - 4 , Nov. 2006.
[15] Lasassmeh, S.M., Conrad, J.M., “ Time Synchronization in Wireless Sensor Networks: A Survey”, IEEE
SoutheastCon 2010 (SoutheastCon), On page(s) 242 - 245 , March 2010.
[16] Liming He, Geng-Sheng Kuo .,” A Novel Time Synchronization Scheme in Wireless Sensor Networks”,
Vehicular Technology Conference, 2006. VTC 2006 - spring. IEEE 63rd, On page(s) 568 - 572, Vol: 2,
May 2006.
[17] Ryo Sugihara , Rajesh K. Gupta., “Programming Models for Sensor Networks: A Survey”, ACM
Transactions on Sensor Networks, vol. 4, no. 2, article no. 8, 2008.
[18] Gupta, V., et al., “Nano-CF: A coordination framework for macro-programming in Wireless Sensor
Networks”, Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2011 8th Annual IEEE
Communications Society, On page(s) 467 – 475, June 2011.
[19] Supasate C., Nuttanart P., Chalermek I., “ Logic Macroprogramming For Wireless Sensor Networks”,
International Journal of Distributed Sensor Networks, On page(s) 1-12, Vol. 2012, April 2012.
[20] R. Gummadi, O. Gnawali, and R. Govindan. Macroprogramming wireless sensor networks using Kairos. In
Intl. Conf. Distributed Computing in Sensor Systems (DCOSS), June 2005.
[21] Supasate C., Chalermek I., "An Analysis of Deductive-Query Processing Approaches for Logic
Macroprograms in Wireless Sensor Networks", Engineering Journal, Vol. 16, No. 4, July 2012.
[22] L. Mottola and G.P. Picco, "Programming wireless sensor networks: Fundamental concepts and state of
the art", ;presented at ACM Comput. Surv., 2011, On page(s) 19-19.
[23] R. Gummadi, N. Kothari, T. Millstein, and R. Govindan, “Declarative failure recovery for sensor
networks,” in Proc. Int. Conf. Aspect-oriented software development. ACM, Mar. 2007, pp. 173–184.
[24] Newton, R. and Welsh, M., “Region streams: Functional macro-programming for sensor networks”. In
Proceedings of the 1st International Workshop on Data Management for Sensor Networks. 2004.
[25] Moggi, E., “Computational lambda-calculus and Monads”, Logic in Computer Science, 1989. LICS '89,
Proceedings., IEEE, On page(s): 14 – 23, Jun 1989.
[26] Newton, R., Morrisett, G.; Welsh, M., “The Regiment Macroprogramming System”, Information
Processing in Sensor Networks, 2007, IEEE, On page(s): 489 - 498 , April 2007.
14. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
14
[27] S. Madden, et al., “TinyDB: an acquisitional query processing system for sensor networks”, ACM
Transactions on Database Systems, On page(s): 122-173, Vol: 30 (1), March 2005.
[28] James Horey, Eric Nelson, Arthur B. Maccabe., “Tables: A Spreadsheet-Inspired Programming Model for
Sensor Networks”, DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed
Computing in Sensor Systems, On page(s): 1-14, 2010.
[29] W. F. Fung, D. Sun, and J. Gehrke, “Cougar: the network is the database,” In SIGMOD Conference, pp.
621, 2002.
Authors
Mrs. Abrar Alajlan: is a Ph.D. student department of Computer Science and Engineering at the
University of Bridgeport, Bridgeport, CT. She earned a master's degree in MBA with a concentration in
Information Systems (IS) from Troy University, Troy, AL in 2011. She received a BS in Computer
Science from Umm Al-Qura University, Makkah, Saudi Arabia. Abrar's interests are in Wireless Sensor
Network (WSN), Network Security, Mobile Communication.
Dr. Khaled Elleithy: is the Associate Dean for Graduate Studies in the School of
Engineering at the University of Bridgeport. His research interests are in the areas of,
network security, mobile wireless communications formal approaches for design and
verification and Mobile collaborative learning. He has published more than two
hundreds research papers in international journals and conferences in his areas of
expertise.
Dr. Elleithy is the co-chair of International Joint Conferences on Computer, Information, and Systems
Sciences, and Engineering (CISSE).CISSE is the first Engineering/ Computing and Systems Research E-
Conference in the world to be completely conducted online in real-time via the internet and was
successfully running for four years. Dr. Elleithy is the editor or co-editor of 10 books published by
Springer for advances on Innovations and Advanced Techniques in Systems, Computing Sciences and
Software.
Dr. Elleithy received the B.Sc. degree in computer science and automatic control from Alexandria
University in 1983, the MS Degree in computer networks from the same university in 1986, and the MS
and Ph.D. degrees in computer science from The Center for Advanced Computer Studies in the
University of Louisiana at Lafayette in 1988 and 1990, respectively. He received the award of
"Distinguished Professor of the Year", University of Bridgeport, during the academic year 2006-2007.
Mr. Varun Pande is a Graduate Research Assistant currently attending the University of
Bridgeport as a PhD candidate in Computer Science and Engineering. He graduated from
the University of Bridgeport with a Master in computer Science in May of 2012. He had
worked as a CSR representative at TATA Power, during his Bachelor in computer
science and Information Technology. Currently and for the past two years he has been a
Graduate Assistant and taught Labs on Wireless Sensor Communication using MICA z
Motes. His research interests are Computer Vision, Image Processing, Parallel processing and Wireless
Sensor Networks. He hopes to share my experiences, research and knowledge with other graduates and
professionals to work in a collaborative research for a Better tomorrow!
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
14
[27] S. Madden, et al., “TinyDB: an acquisitional query processing system for sensor networks”, ACM
Transactions on Database Systems, On page(s): 122-173, Vol: 30 (1), March 2005.
[28] James Horey, Eric Nelson, Arthur B. Maccabe., “Tables: A Spreadsheet-Inspired Programming Model for
Sensor Networks”, DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed
Computing in Sensor Systems, On page(s): 1-14, 2010.
[29] W. F. Fung, D. Sun, and J. Gehrke, “Cougar: the network is the database,” In SIGMOD Conference, pp.
621, 2002.
Authors
Mrs. Abrar Alajlan: is a Ph.D. student department of Computer Science and Engineering at the
University of Bridgeport, Bridgeport, CT. She earned a master's degree in MBA with a concentration in
Information Systems (IS) from Troy University, Troy, AL in 2011. She received a BS in Computer
Science from Umm Al-Qura University, Makkah, Saudi Arabia. Abrar's interests are in Wireless Sensor
Network (WSN), Network Security, Mobile Communication.
Dr. Khaled Elleithy: is the Associate Dean for Graduate Studies in the School of
Engineering at the University of Bridgeport. His research interests are in the areas of,
network security, mobile wireless communications formal approaches for design and
verification and Mobile collaborative learning. He has published more than two
hundreds research papers in international journals and conferences in his areas of
expertise.
Dr. Elleithy is the co-chair of International Joint Conferences on Computer, Information, and Systems
Sciences, and Engineering (CISSE).CISSE is the first Engineering/ Computing and Systems Research E-
Conference in the world to be completely conducted online in real-time via the internet and was
successfully running for four years. Dr. Elleithy is the editor or co-editor of 10 books published by
Springer for advances on Innovations and Advanced Techniques in Systems, Computing Sciences and
Software.
Dr. Elleithy received the B.Sc. degree in computer science and automatic control from Alexandria
University in 1983, the MS Degree in computer networks from the same university in 1986, and the MS
and Ph.D. degrees in computer science from The Center for Advanced Computer Studies in the
University of Louisiana at Lafayette in 1988 and 1990, respectively. He received the award of
"Distinguished Professor of the Year", University of Bridgeport, during the academic year 2006-2007.
Mr. Varun Pande is a Graduate Research Assistant currently attending the University of
Bridgeport as a PhD candidate in Computer Science and Engineering. He graduated from
the University of Bridgeport with a Master in computer Science in May of 2012. He had
worked as a CSR representative at TATA Power, during his Bachelor in computer
science and Information Technology. Currently and for the past two years he has been a
Graduate Assistant and taught Labs on Wireless Sensor Communication using MICA z
Motes. His research interests are Computer Vision, Image Processing, Parallel processing and Wireless
Sensor Networks. He hopes to share my experiences, research and knowledge with other graduates and
professionals to work in a collaborative research for a Better tomorrow!
International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
14
[27] S. Madden, et al., “TinyDB: an acquisitional query processing system for sensor networks”, ACM
Transactions on Database Systems, On page(s): 122-173, Vol: 30 (1), March 2005.
[28] James Horey, Eric Nelson, Arthur B. Maccabe., “Tables: A Spreadsheet-Inspired Programming Model for
Sensor Networks”, DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed
Computing in Sensor Systems, On page(s): 1-14, 2010.
[29] W. F. Fung, D. Sun, and J. Gehrke, “Cougar: the network is the database,” In SIGMOD Conference, pp.
621, 2002.
Authors
Mrs. Abrar Alajlan: is a Ph.D. student department of Computer Science and Engineering at the
University of Bridgeport, Bridgeport, CT. She earned a master's degree in MBA with a concentration in
Information Systems (IS) from Troy University, Troy, AL in 2011. She received a BS in Computer
Science from Umm Al-Qura University, Makkah, Saudi Arabia. Abrar's interests are in Wireless Sensor
Network (WSN), Network Security, Mobile Communication.
Dr. Khaled Elleithy: is the Associate Dean for Graduate Studies in the School of
Engineering at the University of Bridgeport. His research interests are in the areas of,
network security, mobile wireless communications formal approaches for design and
verification and Mobile collaborative learning. He has published more than two
hundreds research papers in international journals and conferences in his areas of
expertise.
Dr. Elleithy is the co-chair of International Joint Conferences on Computer, Information, and Systems
Sciences, and Engineering (CISSE).CISSE is the first Engineering/ Computing and Systems Research E-
Conference in the world to be completely conducted online in real-time via the internet and was
successfully running for four years. Dr. Elleithy is the editor or co-editor of 10 books published by
Springer for advances on Innovations and Advanced Techniques in Systems, Computing Sciences and
Software.
Dr. Elleithy received the B.Sc. degree in computer science and automatic control from Alexandria
University in 1983, the MS Degree in computer networks from the same university in 1986, and the MS
and Ph.D. degrees in computer science from The Center for Advanced Computer Studies in the
University of Louisiana at Lafayette in 1988 and 1990, respectively. He received the award of
"Distinguished Professor of the Year", University of Bridgeport, during the academic year 2006-2007.
Mr. Varun Pande is a Graduate Research Assistant currently attending the University of
Bridgeport as a PhD candidate in Computer Science and Engineering. He graduated from
the University of Bridgeport with a Master in computer Science in May of 2012. He had
worked as a CSR representative at TATA Power, during his Bachelor in computer
science and Information Technology. Currently and for the past two years he has been a
Graduate Assistant and taught Labs on Wireless Sensor Communication using MICA z
Motes. His research interests are Computer Vision, Image Processing, Parallel processing and Wireless
Sensor Networks. He hopes to share my experiences, research and knowledge with other graduates and
professionals to work in a collaborative research for a Better tomorrow!