As Wireless Sensor Networks are penetrating into the industrial domain, many research opportunities are emerging. One such essential and challenging application is that of node localization. A feed-forward neural network based methodology is adopted in this paper. The Received Signal Strength Indicator (RSSI) values of the anchor node beacons are used. The number of anchor nodes and their configurations has an impact on the accuracy of the localization system, which is also addressed in this paper. Five different training algorithms are evaluated to find the training algorithm that gives the best result. The multi-layer Perceptron (MLP) neural network model was trained using Matlab. In order to evaluate the performance of the proposed method in real time, the model obtained was then implemented on the Arduino microcontroller. With four anchor nodes, an average 2D localization error of 0.2953 m has been achieved with a 12-12-2 neural network structure. The proposed method can also be implemented on any other embedded microcontroller system.
Mobile Network Coverage Determination at 900MHz for Abuja Rural Areas using A...ijtsrd
Ā
This study proposes Artificial Neural Network ANN based field strength prediction models for the rural areas of Abuja, the federal capital territory of Nigeria. The ANN based models were created on bases of the Generalized Regression Neural network GRNN and the Multi Layer Perceptron Neural Network MLP NN . These networks were created, trained and tested for field strength prediction using received power data recorded at 900MHz from multiple Base Transceiver Stations BTSs distributed across the rural areas. Results indicate that the GRNN and MLP NN based models with Root Mean Squared Error RMSE values of 4.78dBm and 5.56dBm respectively, offer significant improvement over the empirical Hata Okumura counterpart, which overestimates the signal strength by an RMSE value of 20.17dBm. Deme C. Abraham ""Mobile Network Coverage Determination at 900MHz for Abuja Rural Areas using Artificial Neural Networks"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-2 , February 2020,
URL: https://www.ijtsrd.com/papers/ijtsrd30228.pdf
Paper Url : https://www.ijtsrd.com/computer-science/artificial-intelligence/30228/mobile-network-coverage-determination-at-900mhz-for-abuja-rural-areas-using-artificial-neural-networks/deme-c-abraham
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...ijsrd.com
Ā
In Wireless Sensor Network (WSNs), gather the data by using mobile sinks has become popular. Reduce the number of messages which is used for sink location broadcasting, efficient energy data forwarding, become accustomed to unknown earthly changes are achieved by a protocol which is projected by a SinkTrail. The forecast of mobile sinksĆĀ¢Ć¢āĀ¬Ć¢āĀ¢ location are done by using logical coordinate system. When sensor nodes donĆĀ¢Ć¢āĀ¬Ć¢āĀ¢t have any data to send, at that time they switch to sleep mode to save the energy and to increase the network lifetime. And due to this reason there is a chance of the involvement of nodes that are in sleeping state between the path sources to the mobile sink which is selected by the SinkTrail protocol. Before become the fully functional and process the information, these sleeping nodes can drop the some information. Due to this reason, it is vital to wake-up the sleeping nodes on the path earlier than the sender can start transferring of sensed data. In this paper, on-demand wake-up scheduling algorithm is projected which is used to activates sleeping node on the path before data delivery. Here, in this work the multi-hop communication in WSN also considers. By incorporating wake-up scheduling algorithm to perk up the dependability and improve the performance of on-demand data forwarding extends the SinkTrail solution in our work. This projected algorithm improves the quality of service of the network by dishonesty of data or reducing the loss due to sleeping nodes. The efficiency and the effectiveness projected solution are proved by the evaluation results.
Optimum Sensor Node Localization in Wireless Sensor Networkspaperpublications3
Ā
Abstract: Scientists, engineers, and researchers use wireless sensor networks (WSN) for a wide array of applications. Many of these applications rely on knowledge of the precise position of each node. An optimum localization algorithm can be used for determining the position of nodes in a wireless sensor network. This paper provides an overview of different approach of node localization discovery in wireless sensor networks. The overview of the schemes proposed by different scholars for the improvement of localization in wireless sensor networks is also presented. Experiments were performed in a testbed area containing anchor and blind nodes deployed in it to characterize the pathloss exponent and to determine the localization error of the algorithm. Details regarding the implementation of new algorithm are also discussed in this paper.
NONLINEAR MODELING AND ANALYSIS OF WSN NODE LOCALIZATION METHODijwmn
Ā
In this paper, node localization algorithms in wireless sensor networks are researched, the traditional
algorithms are studied, and some meaningful results are obtained. For the localization algorithm and route
planning of WSN exists a big localization error in wireless communication. WSN communication system is
researched. According to the anchor nodes and unknown nodes, a new localization algorithm and route
planning method of WSN are proposed in this paper. At the same time, a new genetic algorithm of route
planning of WSN is proposed. The performance of the node density and localization error is simulated and
analyzed. The simulation results show that the performance of proposed WSN localization algorithm and
route planning method are better than the traditional algorithms.
Mobile Network Coverage Determination at 900MHz for Abuja Rural Areas using A...ijtsrd
Ā
This study proposes Artificial Neural Network ANN based field strength prediction models for the rural areas of Abuja, the federal capital territory of Nigeria. The ANN based models were created on bases of the Generalized Regression Neural network GRNN and the Multi Layer Perceptron Neural Network MLP NN . These networks were created, trained and tested for field strength prediction using received power data recorded at 900MHz from multiple Base Transceiver Stations BTSs distributed across the rural areas. Results indicate that the GRNN and MLP NN based models with Root Mean Squared Error RMSE values of 4.78dBm and 5.56dBm respectively, offer significant improvement over the empirical Hata Okumura counterpart, which overestimates the signal strength by an RMSE value of 20.17dBm. Deme C. Abraham ""Mobile Network Coverage Determination at 900MHz for Abuja Rural Areas using Artificial Neural Networks"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-2 , February 2020,
URL: https://www.ijtsrd.com/papers/ijtsrd30228.pdf
Paper Url : https://www.ijtsrd.com/computer-science/artificial-intelligence/30228/mobile-network-coverage-determination-at-900mhz-for-abuja-rural-areas-using-artificial-neural-networks/deme-c-abraham
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...ijsrd.com
Ā
In Wireless Sensor Network (WSNs), gather the data by using mobile sinks has become popular. Reduce the number of messages which is used for sink location broadcasting, efficient energy data forwarding, become accustomed to unknown earthly changes are achieved by a protocol which is projected by a SinkTrail. The forecast of mobile sinksĆĀ¢Ć¢āĀ¬Ć¢āĀ¢ location are done by using logical coordinate system. When sensor nodes donĆĀ¢Ć¢āĀ¬Ć¢āĀ¢t have any data to send, at that time they switch to sleep mode to save the energy and to increase the network lifetime. And due to this reason there is a chance of the involvement of nodes that are in sleeping state between the path sources to the mobile sink which is selected by the SinkTrail protocol. Before become the fully functional and process the information, these sleeping nodes can drop the some information. Due to this reason, it is vital to wake-up the sleeping nodes on the path earlier than the sender can start transferring of sensed data. In this paper, on-demand wake-up scheduling algorithm is projected which is used to activates sleeping node on the path before data delivery. Here, in this work the multi-hop communication in WSN also considers. By incorporating wake-up scheduling algorithm to perk up the dependability and improve the performance of on-demand data forwarding extends the SinkTrail solution in our work. This projected algorithm improves the quality of service of the network by dishonesty of data or reducing the loss due to sleeping nodes. The efficiency and the effectiveness projected solution are proved by the evaluation results.
Optimum Sensor Node Localization in Wireless Sensor Networkspaperpublications3
Ā
Abstract: Scientists, engineers, and researchers use wireless sensor networks (WSN) for a wide array of applications. Many of these applications rely on knowledge of the precise position of each node. An optimum localization algorithm can be used for determining the position of nodes in a wireless sensor network. This paper provides an overview of different approach of node localization discovery in wireless sensor networks. The overview of the schemes proposed by different scholars for the improvement of localization in wireless sensor networks is also presented. Experiments were performed in a testbed area containing anchor and blind nodes deployed in it to characterize the pathloss exponent and to determine the localization error of the algorithm. Details regarding the implementation of new algorithm are also discussed in this paper.
NONLINEAR MODELING AND ANALYSIS OF WSN NODE LOCALIZATION METHODijwmn
Ā
In this paper, node localization algorithms in wireless sensor networks are researched, the traditional
algorithms are studied, and some meaningful results are obtained. For the localization algorithm and route
planning of WSN exists a big localization error in wireless communication. WSN communication system is
researched. According to the anchor nodes and unknown nodes, a new localization algorithm and route
planning method of WSN are proposed in this paper. At the same time, a new genetic algorithm of route
planning of WSN is proposed. The performance of the node density and localization error is simulated and
analyzed. The simulation results show that the performance of proposed WSN localization algorithm and
route planning method are better than the traditional algorithms.
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
Ā
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
CODE AWARE DYNAMIC SOURCE ROUTING FOR DISTRIBUTED SENSOR NETWORKIJNSA Journal
Ā
Sensor network facilitates monitoring and controlling of physical environments. These wireless networks consist of dense collection of sensors capable of collection and dissemination of data. They have application in variety of fields such as military purposes, environment monitoring etc. Typical deployment of sensor network assumes central processing station or a gateway to which all other nodes route their data using dynamic source routing (DSR). This causes congestion at central station and thus reduces the efficiency of the network. In this work we will propose a better dynamic source routing technique using network coding to reduce total number of transmission in sensor networks resulting in better efficiency.
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
Ā
In this paper, we explored the possibility of using Genetic Algorithm (GA) being used in Wireless Sensor Networks in general with
specific emphasize on Fault tolerance. In Wireless sensor networks, usually sensor and sink nodes are separated by long communication
distance and hence to optimize the energy, we are using clustering approach. Here we are employing improved K-means clustering algorithm to
form the cluster and GA to find optimal use of sensor nodes and recover from fault as quickly as possible so that target detection wonāt be
disrupted. This technique is simulated using Matlab software to check energy consumption and lifetime of the network. Based on the
simulation results, we concluded that this model shows significant improvement in energy consumption rate and network lifetime than other
method such as Traditional clustering or Simulated Annealing
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
Ā
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
Reflectivity Parameter Extraction from RADAR Images Using Back Propagation Al...IJECEIAES
Ā
Pattern recognition has been acknowledged as one of the promising research areas and it has drawn the awareness among many researchers since its existence at the beginning of the nineties. Multilayer Neural networks are used in pattern Recognition and classification based on the features derived from the input patterns. The Reflectivity information extracted from the Doppler Weather Radar (DWR) image helps in identifying the convective cloud type which has a strong relation to the precipitation rate. The reflectivity information is rooted in the DWR image with the help of colors and color bar is provided to distinguish among different reflectivity information. Artificial Neural network predicts the color based on the maximum likelihood estimation problem. This paper presents a best possible backpropagation algorithm for color identification in DWR images by comparing various backpropagation algorithms such as LevenbergMarquardt, Conjugate gradient, and Resilient back propagation etc.,. Pattern recognition using Neural networks presents better results compared to standard distance measures. It is observed that Levenberg-Marquardt backpropagation algorithm yields a regression value of 99% approximately and accuracy of 98%.
An implementation of recovery algorithm for fault nodes in a wireless sensor ...eSAT Publishing House
Ā
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Limit energy is a severe bottleneck of wireless sensor networks (WSNs), and limits network lifetime of WSNs. To extend network lifetime, buffer zone has been proposed. Sensors send their data packets to buffer zone. The sensors in buffer zone buffer the data packets. And then the sink visits the buffer zone to collect the data ackets. This leads to that the loads of the sensors in buffer zone are too high and the sensors die quickly. To further extend network lifetime, an algorithm based on dynamic buffer zone has been proposed in this paper. The algorithm divides the whole network area into some areas, and lets all areas act as the buffer zone in turn. And the reasonable times each zone acts as the buffer zone are computed with linear programming. The simulation results have shown that our proposed algorithm notably extends network lifetime.
An Efficient top- k Query Processing in Distributed Wireless Sensor NetworksIJMER
Ā
Wireless Sensor Networks (WSNs) are usually defined as large-scale, ad-hoc, multi-hop and
wireless unpartitioned networks of homogeneous, small, static nodes deployed in an area of interest.
Applications of sensor networks include monitoring volcano activity, building structures or natural
habitat monitoring. In this paper, we present the problem of processing probabilistic top-k queries in a
distributed wireless sensor networks. The basic problem in top-k query processing is that, a single method
cannot be used as a solution to the problem of top-k query processing because there are many types of
top-k query processing. The method has to be based on the situation, the classification and the type of
database and the query model. Here we develop three algorithms, namely, sufficient set-based (SSB),
necessary set-based (NSB), and boundary-based (BB), for inter- cluster query processing with bounded
rounds of communications. Moreover, in responding to dynamic changes of data distribution in the
overall network, we develop an adaptive algorithm that dynamically switches among the three proposed
algorithms to minimize the transmission cost.
Neural Network Algorithm for Radar Signal RecognitionIJERA Editor
Ā
Nowadays, the traditional recognition method could not match the development of radar signals. In this paper, based on fractal theory and Neural Network, a new radar signal recognition algorithm is presented. The relevant point is extracted as the input of neutral network, and then it will recognize and classify the signals. Simulation results show that, this algorithm has a distinguish effect on classification under the condition of low SNR.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
These days considering expansion of networks, dissemination of information has become one of significant cases for researchers. In social networks in addition to social structures and people effectiveness on each other, Profit increase of sales, publishing a news or rumor, spread or diffusion of an idea can be mentioned. In social societies, people affect each other and with an individualās membership, his friends
may join that group as well. In publishing a piece of news, independent of its nature there are different ways to expand it. Since information isnāt always suitable and positive, this article is trying to introduce the immunization mechanism against this information. The meaning of immunization is a kind of Slow Publishing of such information in network. Therefor it has been tried in this article to slow down the
publishing of information or even stop them. With comparison of presented methods for immunization and also presenting rate delay parameter, the immunization of methods were evaluated and we identified the most effective immunization method. Among existing methods for immunization and recommended methods, recommended methods also have an effective role in preventing spread of malicious rumor.
Sensor nodes are highly mobile, which makes the application running on them face network related problems like node failure, link failure, network level disconnection, scarcity of resources etc. Node failure and Network fault are need to be monitored continuously by supervising the network status especially for critical applications like Health Monitoring System. We propose Node Monitoring protocol (NMP) to monitor the node good conditions using agents and ensure that node gets promised quality of service. These Nodes senses environment and communicates important data to the sink or base station. To establish the correct event time, these nodes need to be synchronized with global clock. Therefore, time synchronization is very important parameter. We have built a simulating environment for Validating Node Monitoring Protocol (NMP) to assess the reliability of Health Monitoring systems. Formal Specification and Description Language tool (SDL) has been used to validate the NMP at design time in order to increase the confidence and efficiency of the system.
Using spectral radius ratio for node degreeIJCNCJournal
Ā
In this paper, we show that the spectral radius ratio for node degree could be used to analyze the variation of node degree during the evolution of complex networks. We focus on three commonly studied models of complex networks: random networks, scale-free networks and small-world networks. The spectral radius ratio for node degree is defined as the ratio of the principal (largest) eigenvalue of the adjacency matrix of a network graph to that of the average node degree. During the evolution of each of the above three categories of networks (using the appropriate evolution model for each category), we observe the spectral radius ratio for node degree to exhibit high-very high positive correlation (0.75 or above) to that of the
coefficient of variation of node degree (ratio of the standard deviation of node degree and average node degree). We show that the spectral radius ratio for node degree could be used as the basis to tune the operating parameters of the evolution models for each of the three categories of complex networks as well as analyze the impact of specific operating parameters for each model.
PERFORMANCE ANALYSIS OF THE LINK-ADAPTIVE COOPERATIVE AMPLIFY-AND-FORWARD REL...IJCNCJournal
Ā
This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that
employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK)
digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the
analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategies
such as regular Maximal Ratio Combining (MRC), Selection Diversity Combining (SDC), Opportunistic
Relay Selection with Maximal Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with
Selection Diversity Combining (ORS-SDC). We advocate a simple yet unified numerical approach based on
the marginal moment generating function (MGF) of the total received SNR to compute the average symbol
error rate (ASER), mean achievable spectral efficiency, and outage probability performance metrics.
HIDING A MESSAGE IN MP3 USING LSB WITH 1, 2, 3 AND 4 BITSIJCNCJournal
Ā
Steganography is the art of hiding information in ways that prevent the detection of hidden messages. This
paper presentsa new method which randomly selects position in MP3 file to hide a text secret messageby
using Least Significant Bit (LSB) technique. The text secret message isused in start and ends locations a
unique signature or key.The methodology focuses to embed one bit, two bits, three bitsor four bits from
secret message into MP3 file by using LSB techniques. The evaluation and performancemethods are based
on robustness (BER and correlation), Imperceptibility (PSNR) and hiding capacity (Ratio between Sizes of
text message and MP3 Cover) indicators.The experimental results show the new method is more security.
Moreover the contribution of this paper is the provision of a robustness-based classification of LSB
steganography models depending on their occurrence in the embedding position.
In this paper, an application-based QoS evaluation approach for heterogeneous networks is proposed.It is possible to expand the network capacity and coverage in a dynamic fashion by applying heterogeneous wireless network architecture. However, the Quality of Service (QoS) evaluation of this type of network architecture is very challenging due to the presence of different communication technologies. Different communication technologies have different characteristics and the applications that utilize them have unique QoS requirements. Although, the communication technologies have different performance measurement parameters, the applications using these radio access networks have the same QoS requirements. As a result, it would be easier to evaluate the QoS of the access networks and the overall network configuration based on the performance of applications running on them. Using such applicationbased QoS evaluation approach, the heterogeneous nature of the underlying networks and the diversity of their traffic can be adequately taken into account. Through simulation studies, we show that the application performance based assessment approach facilitates better QoS management and monitoring of heterogeneous network configurations.
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
Ā
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
CODE AWARE DYNAMIC SOURCE ROUTING FOR DISTRIBUTED SENSOR NETWORKIJNSA Journal
Ā
Sensor network facilitates monitoring and controlling of physical environments. These wireless networks consist of dense collection of sensors capable of collection and dissemination of data. They have application in variety of fields such as military purposes, environment monitoring etc. Typical deployment of sensor network assumes central processing station or a gateway to which all other nodes route their data using dynamic source routing (DSR). This causes congestion at central station and thus reduces the efficiency of the network. In this work we will propose a better dynamic source routing technique using network coding to reduce total number of transmission in sensor networks resulting in better efficiency.
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
Ā
In this paper, we explored the possibility of using Genetic Algorithm (GA) being used in Wireless Sensor Networks in general with
specific emphasize on Fault tolerance. In Wireless sensor networks, usually sensor and sink nodes are separated by long communication
distance and hence to optimize the energy, we are using clustering approach. Here we are employing improved K-means clustering algorithm to
form the cluster and GA to find optimal use of sensor nodes and recover from fault as quickly as possible so that target detection wonāt be
disrupted. This technique is simulated using Matlab software to check energy consumption and lifetime of the network. Based on the
simulation results, we concluded that this model shows significant improvement in energy consumption rate and network lifetime than other
method such as Traditional clustering or Simulated Annealing
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
Ā
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
Reflectivity Parameter Extraction from RADAR Images Using Back Propagation Al...IJECEIAES
Ā
Pattern recognition has been acknowledged as one of the promising research areas and it has drawn the awareness among many researchers since its existence at the beginning of the nineties. Multilayer Neural networks are used in pattern Recognition and classification based on the features derived from the input patterns. The Reflectivity information extracted from the Doppler Weather Radar (DWR) image helps in identifying the convective cloud type which has a strong relation to the precipitation rate. The reflectivity information is rooted in the DWR image with the help of colors and color bar is provided to distinguish among different reflectivity information. Artificial Neural network predicts the color based on the maximum likelihood estimation problem. This paper presents a best possible backpropagation algorithm for color identification in DWR images by comparing various backpropagation algorithms such as LevenbergMarquardt, Conjugate gradient, and Resilient back propagation etc.,. Pattern recognition using Neural networks presents better results compared to standard distance measures. It is observed that Levenberg-Marquardt backpropagation algorithm yields a regression value of 99% approximately and accuracy of 98%.
An implementation of recovery algorithm for fault nodes in a wireless sensor ...eSAT Publishing House
Ā
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Limit energy is a severe bottleneck of wireless sensor networks (WSNs), and limits network lifetime of WSNs. To extend network lifetime, buffer zone has been proposed. Sensors send their data packets to buffer zone. The sensors in buffer zone buffer the data packets. And then the sink visits the buffer zone to collect the data ackets. This leads to that the loads of the sensors in buffer zone are too high and the sensors die quickly. To further extend network lifetime, an algorithm based on dynamic buffer zone has been proposed in this paper. The algorithm divides the whole network area into some areas, and lets all areas act as the buffer zone in turn. And the reasonable times each zone acts as the buffer zone are computed with linear programming. The simulation results have shown that our proposed algorithm notably extends network lifetime.
An Efficient top- k Query Processing in Distributed Wireless Sensor NetworksIJMER
Ā
Wireless Sensor Networks (WSNs) are usually defined as large-scale, ad-hoc, multi-hop and
wireless unpartitioned networks of homogeneous, small, static nodes deployed in an area of interest.
Applications of sensor networks include monitoring volcano activity, building structures or natural
habitat monitoring. In this paper, we present the problem of processing probabilistic top-k queries in a
distributed wireless sensor networks. The basic problem in top-k query processing is that, a single method
cannot be used as a solution to the problem of top-k query processing because there are many types of
top-k query processing. The method has to be based on the situation, the classification and the type of
database and the query model. Here we develop three algorithms, namely, sufficient set-based (SSB),
necessary set-based (NSB), and boundary-based (BB), for inter- cluster query processing with bounded
rounds of communications. Moreover, in responding to dynamic changes of data distribution in the
overall network, we develop an adaptive algorithm that dynamically switches among the three proposed
algorithms to minimize the transmission cost.
Neural Network Algorithm for Radar Signal RecognitionIJERA Editor
Ā
Nowadays, the traditional recognition method could not match the development of radar signals. In this paper, based on fractal theory and Neural Network, a new radar signal recognition algorithm is presented. The relevant point is extracted as the input of neutral network, and then it will recognize and classify the signals. Simulation results show that, this algorithm has a distinguish effect on classification under the condition of low SNR.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
These days considering expansion of networks, dissemination of information has become one of significant cases for researchers. In social networks in addition to social structures and people effectiveness on each other, Profit increase of sales, publishing a news or rumor, spread or diffusion of an idea can be mentioned. In social societies, people affect each other and with an individualās membership, his friends
may join that group as well. In publishing a piece of news, independent of its nature there are different ways to expand it. Since information isnāt always suitable and positive, this article is trying to introduce the immunization mechanism against this information. The meaning of immunization is a kind of Slow Publishing of such information in network. Therefor it has been tried in this article to slow down the
publishing of information or even stop them. With comparison of presented methods for immunization and also presenting rate delay parameter, the immunization of methods were evaluated and we identified the most effective immunization method. Among existing methods for immunization and recommended methods, recommended methods also have an effective role in preventing spread of malicious rumor.
Sensor nodes are highly mobile, which makes the application running on them face network related problems like node failure, link failure, network level disconnection, scarcity of resources etc. Node failure and Network fault are need to be monitored continuously by supervising the network status especially for critical applications like Health Monitoring System. We propose Node Monitoring protocol (NMP) to monitor the node good conditions using agents and ensure that node gets promised quality of service. These Nodes senses environment and communicates important data to the sink or base station. To establish the correct event time, these nodes need to be synchronized with global clock. Therefore, time synchronization is very important parameter. We have built a simulating environment for Validating Node Monitoring Protocol (NMP) to assess the reliability of Health Monitoring systems. Formal Specification and Description Language tool (SDL) has been used to validate the NMP at design time in order to increase the confidence and efficiency of the system.
Using spectral radius ratio for node degreeIJCNCJournal
Ā
In this paper, we show that the spectral radius ratio for node degree could be used to analyze the variation of node degree during the evolution of complex networks. We focus on three commonly studied models of complex networks: random networks, scale-free networks and small-world networks. The spectral radius ratio for node degree is defined as the ratio of the principal (largest) eigenvalue of the adjacency matrix of a network graph to that of the average node degree. During the evolution of each of the above three categories of networks (using the appropriate evolution model for each category), we observe the spectral radius ratio for node degree to exhibit high-very high positive correlation (0.75 or above) to that of the
coefficient of variation of node degree (ratio of the standard deviation of node degree and average node degree). We show that the spectral radius ratio for node degree could be used as the basis to tune the operating parameters of the evolution models for each of the three categories of complex networks as well as analyze the impact of specific operating parameters for each model.
PERFORMANCE ANALYSIS OF THE LINK-ADAPTIVE COOPERATIVE AMPLIFY-AND-FORWARD REL...IJCNCJournal
Ā
This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that
employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK)
digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the
analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategies
such as regular Maximal Ratio Combining (MRC), Selection Diversity Combining (SDC), Opportunistic
Relay Selection with Maximal Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with
Selection Diversity Combining (ORS-SDC). We advocate a simple yet unified numerical approach based on
the marginal moment generating function (MGF) of the total received SNR to compute the average symbol
error rate (ASER), mean achievable spectral efficiency, and outage probability performance metrics.
HIDING A MESSAGE IN MP3 USING LSB WITH 1, 2, 3 AND 4 BITSIJCNCJournal
Ā
Steganography is the art of hiding information in ways that prevent the detection of hidden messages. This
paper presentsa new method which randomly selects position in MP3 file to hide a text secret messageby
using Least Significant Bit (LSB) technique. The text secret message isused in start and ends locations a
unique signature or key.The methodology focuses to embed one bit, two bits, three bitsor four bits from
secret message into MP3 file by using LSB techniques. The evaluation and performancemethods are based
on robustness (BER and correlation), Imperceptibility (PSNR) and hiding capacity (Ratio between Sizes of
text message and MP3 Cover) indicators.The experimental results show the new method is more security.
Moreover the contribution of this paper is the provision of a robustness-based classification of LSB
steganography models depending on their occurrence in the embedding position.
In this paper, an application-based QoS evaluation approach for heterogeneous networks is proposed.It is possible to expand the network capacity and coverage in a dynamic fashion by applying heterogeneous wireless network architecture. However, the Quality of Service (QoS) evaluation of this type of network architecture is very challenging due to the presence of different communication technologies. Different communication technologies have different characteristics and the applications that utilize them have unique QoS requirements. Although, the communication technologies have different performance measurement parameters, the applications using these radio access networks have the same QoS requirements. As a result, it would be easier to evaluate the QoS of the access networks and the overall network configuration based on the performance of applications running on them. Using such applicationbased QoS evaluation approach, the heterogeneous nature of the underlying networks and the diversity of their traffic can be adequately taken into account. Through simulation studies, we show that the application performance based assessment approach facilitates better QoS management and monitoring of heterogeneous network configurations.
PERFORMANCE EVALUATION OF WIRELESS SENSOR NETWORK UNDER HELLO FLOOD ATTACKIJCNCJournal
Ā
Wireless sensor network (WSN) is highly used in many fields. The network consists of tiny lightweight
sensor nodes and is largely used to scan or detect or monitor environments. Since these sensor nodes are
tiny and lightweight, they put some limitations on resources such as usage of power, processing given task,
radio frequency range. These limitations allow network vulnerable to many different types of attacks such
as hello flood attack, black hole, Sybil attack, sinkhole, and many more. Among these attacks, hello flood is
one of the most important attacks. In this paper,we have analyzed the performance of hello flood attack and
compared the network performance as number of attackers increases. Network performance is evaluated
by modifying the ad-hoc on demand distance vector (AODV) routing protocol by using NS2 simulator. It
has been tested under different scenarios like no attacker, single attacker, and multiple attackers to know
how the network performance changes. The simulation results show that as the number of attackers
increases the performance in terms of throughput and delay changes.
ENHANCEMENT OF TRANSMISSION RANGE ASSIGNMENT FOR CLUSTERED WIRELESS SENSOR NE...IJCNCJournal
Ā
Transmitter range assignment in clustered wireless networks is the bottleneck of the balance between
energy conservation and the connectivity to deliver data to the sink or gateway node. The aim of this
research is to optimize the energy consumption through reducing the transmission ranges of the nodes,
while maintaining high probability to have end-to-end connectivity to the networkās data sink. We modified
the approach given in [1] to achieve more than 25% power saving through reducing cluster head (CH)
transmission range of the backbone nodes in a multihop wireless sensor network with ensuring at least
95% end-to-end connectivity probability.
A predictive framework for cyber security analytics using attack graphsIJCNCJournal
Ā
Security metrics serve as a powerful tool for organizations to understand the effectiveness of protecting computer networks. However majority of these measurement techniques donāt adequately help corporations to make informed risk management decisions. In this paper we present a stochastic security framework for obtaining quantitative measures of security by taking into account the dynamic attributes associated with vulnerabilities that can change over time. Our model is novel as existing research in attack graph analysis do not consider the temporal aspects associated with the vulnerabilities, such as the availability of exploits and patches which can affect the overall network security based on how the vulnerabilities are interconnected and leveraged to compromise the system. In order to have a more realistic representation of how the security state of the network would vary over time, a nonhomogeneous model is developed which incorporates a time dependent covariate, namely the vulnerability age. The daily transition-probability matrices are estimated using Frei's Vulnerability Lifecycle model. We also leverage the trusted CVSS metric domain to analyze how the total exploitability and impact measures evolve over a time period for a given network.
APPROXIMATING NASH EQUILIBRIUM UNIQUENESS OF POWER CONTROL IN PRACTICAL WSNSIJCNCJournal
Ā
Transmission power has a major impact on link and communication reliability and network lifetime in Wireless Sensor Networks. We study power control in a multi-hop Wireless Sensor Network where nodes' communication interfere with each other. Our objective is to determine each node's transmission power level that will reduce the communication interference and keep energy consumption to a minimum. We propose a potential game approach to obtain the unique equilibrium of the network transmission power allocation. The unique equilibrium is located in a continuous domain. However, radio transceivers accept only discrete values for transmission power level setting. We study the viability and performance of mapping the continuous solution from the potential game to the discrete domain required by the radio. We demonstrate the success of our approach through TOSSIM simulation when nodes use the Collection Tree Protocol for routing the data. Also, we show results of our method from the Indriya testbed. We compare it with the case where the motes use Collection Tree Protocol with the maximum transmission power.
PERFORMANCE ANALYSIS OF MULTI-PATH TCP NETWORKIJCNCJournal
Ā
MPTCP is proposed by IETF working group, it allows a single TCP stream to be split across multiple
paths. It has obvious benefits in performance and reliability. MPTCP has implemented in Linux-based
distributions that can be compiled and installed to be used for both real and experimental scenarios. In this
article, we provide performance analyses for MPTCP with a laptop connected to WiFi access point and 3G
cellular network at the same time. We prove experimentally that MPTCP outperforms regular TCP for
WiFi or 3G interfaces. We also compare four types of congestion control algorithms for MPTCP that are
also implemented in the Linux Kernel. Results show that Alias Linked Increase Congestion Control
algorithm outperforms the others in the normal traffic load while Balanced Linked Adaptation algorithm
outperforms the rest when the paths are shared with heavy traffic, which is not supported by MPTCP.
PERFORMANCE ASSESSMENT OF CHAOTIC SEQUENCE DERIVED FROM BIFURCATION DEPENDENT...IJCNCJournal
Ā
In CDMA system, m-sequence and Gold codes are often utilized for spreading-despreading and
scrambling-descrambling operations. In a previous work, a design framework was created for generating
large family of codes from logistic map, which have comparable autocorrelation and cross correlation to
m-sequence and Gold codes. The purpose of this work is to evaluate the performance of these chaotic
codes in a CDMA environment. In the bit error rate (BER) simulation, matched filter, decorrelator and
MMSE receiver have been utilized. The received signal was modelled for synchronous CDMA uplink for
simulation simplicity purpose. Additive White Gaussian Noise channel model was assumed for the
simulation.
ENERGY SAVINGS IN APPLICATIONS FOR WIRELESS SENSOR NETWORKS TIME CRITICAL REQ...IJCNCJournal
Ā
Along with handling and poor storage capacity, each sensor in wireless sensor network (WSN) is equipped
with a limited power source and very difficult to be replaced in most application environments. Improving
the energy savings in applications for wireless sensor networks is necessary. In this paper, we mainly focus
on energy consumption savings in applications for wireless sensor networks time critical requirements. Our
Paper accompanying analysis of advanced technologies for energy saving techniques for the optimization
of energy efficiency together with the data transmission is optimal. Moreover, we propose improvements to
increase energy savings in applications for wireless sensor networks require time critical (LEACH
improvements). Simulation results show that our proposed protocol significantly better than LEACH about
the formation of clusters in each round, the average power, the number of nodes alive and average total
received data in base stations.
ADAPTIVE HANDOVER HYSTERESIS AND CALL ADMISSION CONTROL FOR MOBILE RELAY NODESIJCNCJournal
Ā
The aim of equipping a wireless network with a mobile relay node is to support broadband wireless communications for vehicular users and their devices. The high mobility of vehicular users, possibly at a very high velocity in the area in which two cells overlap, could cause the network to suffer from a reduced handover success rate and, hence, increased radio link failure. The combined impact of these problems is service interruptions to vehicular users. Thus, the handover schemes are crucial in solving these problems. In this work, we first present the adaptive handover hysteresis scheme for the wireless network with mobile relay nodes in the high-speed train scenario. Specifically, our proposed adaptive hysteresis scheme is based on the velocity of the train. Second, the handover call dropping probability is reduced by introducing a modified call admission control scheme to support radio resource reservation for handover calls that prioritizes handover calls of mobile relay over the other calls. The proposed solution in which adaptive parameter is combined with call admission control is evaluated by system level simulation. Our simulation results illustrate an increased handover success rate and reduced radio link failures.
A NOVEL METHOD TO TEST DEPENDABLE COMPOSED SERVICE COMPONENTSIJCNCJournal
Ā
Assessing Web service systems performance and their dependability are crucial for the development of
todayās applications. Testing the performance and Fault Tolerance Mechanisms (FTMs) of composed
service components is hard to be measured at design time due to service instability is often caused by the
nature of the network conditions. Using a real internet environment for testing systems is difficult to set up
and control. We have introduced a fault injection toolkit that emulates a WAN within a LAN environment
between composed service components and offers full control over the emulated environment in addition to
the capability to inject network-related faults and application specific faults. The toolkit also generates
background workloads on the system under test so as to produce more realistic results. We describe an
experiment that has been performed to examine the impact of fault tolerance protocols deployed at a
service client by using our toolkit system.
Maximizing network interruption in wirelessIJCNCJournal
Ā
With the colossal growth of wireless sensor networks (WSNs) in different applications starting from home
automation to military affairs, the pressure on ensuring security in such a network is paramount.
Considering the security challenges, it is really a hard-hitting effort to develop a secured WSN system.
Moreover, as the information technology is getting popular, the intruders are also planning new ideas to
break the system security, to harm the network and to make the system quality down with the target of
taking the control of the network to corrupt it or to get benefits from it anyway. The intruders corrupt the
system only when the security breaking cost (SBC) is lower compared with the benefits they attained or the
harm it can make to others. In this paper, the authors define the term āmaximizing network interruption
problemā and propose a technique, called the grid point approximation algorithm, to estimate the SBC of a
multi-hop WSN so that it can be made tougher for an intruder to break the system security. It is assumed
that the intruder has the complete picture of the entire network. The technique is designed from the
intruderās point of view for completely jamming all the sensor nodes in the network through placing
jammers or malicious nodes strategically and at the same time keeping the number of jammer nodes to
minimum or near minimum. To the best of the authorsā knowledge, there is no work proposed so far of the
same kind. Experimental results with the changes of the different network parameters show that the
proposed algorithm is able to provide excellent performances to achieve the targets.
Advancements in Complementary Metal Oxide Semiconductor (CMOS) technology have enabled Wireless Sensor Networks (WSN) to gather, process and transport multimedia (MM) data as well and not just limited to handling ordinary scalar data anymore. This new generation of WSN type is called Wireless Multimedia Sensor Networks (WMSNs). Better and yet relatively cheaper sensors ā sensors that are able to sense both scalar data and multimedia data with more advanced functionalities such as being able to handle rather intense computations easily - have sprung up. In this paper, the applications, architectures, challenges and issues faced in the design of WMSNs are explored. Security and privacy issues, over all requirements, proposed and implemented solutions so far, some of the successful achievements and other related works in the field are also highlighted. Open research areas are pointed out and a few solution suggestions to the still persistent problems are made, which, to the best of my knowledge, so far havenāt been explored yet.
Peer-to-Peer streaming technology has become one of the major Internet applications as it offers the opportunity of broadcasting high quality video content to a large number of peers with low costs. It is widely accepted that with the efficient utilization of peers and server's upload capacities, peers can enjoy watching a high bit rate video with minimal end-to-end delay. In this paper, we present a practical scheduling algorithm that works in the challenging condition where no spare capacity is available, i.e., it maximally utilizes the resources and broadcasts the maximum streaming rate. Each peer contacts with only a small number of neighbours in the overlay network and autonomously subscribes to sub-streams according to a budget-model in such a way that the number of peers forwarding exactly one sub-stream will be maximized. The hop-count delay is also taken into account to construct a short depth trees. Finally, we show through simulation that peers dynamically converge to an efficient overlay structure with a short hop-count delay. Moreover, the proposed scheme gives nice features in the homogeneous case and overcomes SplitStream in all simulated scenarios.
On the approximation of the sum of lognormals by a log skew normal distributionIJCNCJournal
Ā
Several methods have been proposed to approximate the sum of lognormal RVs. However the accuracy of each method relies highly on the region of the resulting distribution being examined, and the individual lognormal parameters, i.e., mean and variance. There is no such method which can provide the needed accuracy for all cases. This paper propose a universal yet very simple approximation method for the sum of Lognormals based on log skew normal approximation. The main contribution on this work is to propose an analytical method for log skew normal parameters estimation. The proposed method provides highly accurate approximation to the sum of lognormal distributions over the whole range of dB spreads for any correlation coefficient. Simulation results show that our method outperforms all previously proposed methods and provides an accuracy within 0.01 dB for all cases.
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...IJEEE
Ā
Data transmission occurs from transmitting node to sink node, which communicate each other via large number of intermediate nodes or directly to an external base station. A network consists of numbers of nodes with one as a source and one or more as a destination node.
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkIJMTST Journal
Ā
Optimal sensor deployment is necessary condition in homogeneous and heterogeneous wireless sensor
network. Effective deployment of sensor nodes is a major point of concern as performance and lifetime of any
WSN. Proposed sensor deployment in WSN explore every sensor node sends its data to the nearest sink node
of the WSN. In addition to that system proposes a hexagonal cell based sensor deployment which leads to
optimal sensor deployment for both homogeneous and heterogeneous sensor deployment. Wireless sensor
networks are receiving significant concentration due to their potential applications ranging from surveillance
to tracking domains. In limited communication range, a WSN is divided into several disconnected sub-graphs
under certain conditions. We deploy sensor nodes at random locations so that it improves performance of the
network.This paper aims to study, discuss and analyze various node deployment strategies and coverage
problems for Homogeneous and Heterogeneous WSN.
Ca mwsn clustering algorithm for mobile wireless senor network [graphhoc
Ā
This paper proposes a centralized algorithm for cluster-head-selection in a mobile wireless sensor network.
Before execution of algorithm in each round, Base station runs centralized localization algorithm whereby
sensors update their locations to base station and accordingly Base station performs dynamic clustering.
Afterwards Base station runs CA-MWSN for cluster-head-selection. The proposed algorithm uses three
fuzzy inputs Residual energy, Expected Residual Energy and Mobility to find Chance of nodes to be elected
as Cluster-head. The node with highest Chance is declared as a Cluster-head for that particular cluster.
Dynamic clustering provides uniform and significant distribution of energy in a non-uniform distribution of
sensors. CA-MWSN guarantees completion of the round.
CA-MWSN: CLUSTERING ALGORITHM FOR MOBILE WIRELESS SENOR NETWORKFransiskeran
Ā
This paper proposes a centralized algorithm for cluster-head-selection in a mobile wireless sensor network.
Before execution of algorithm in each round, Base station runs centralized localization algorithm whereby
sensors update their locations to base station and accordingly Base station performs dynamic clustering.
Afterwards Base station runs CA-MWSN for cluster-head-selection. The proposed algorithm uses three
fuzzy inputs Residual energy, Expected Residual Energy and Mobility to find Chance of nodes to be elected
as Cluster-head. The node with highest Chance is declared as a Cluster-head for that particular cluster.
Dynamic clustering provides uniform and significant distribution of energy in a non-uniform distribution of
sensors. CA-MWSN guarantees completion of the round.
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Ā
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
Adaptive Monitoring and Localization of Faulty Node in a Wireless Sensor Netw...Onyebuchi nosiri
Ā
Abstract
This work seeks to solve the problem that is being experienced in most existing remote monitoring systems by coming up with an enhanced monitoring system called Wireless Sensor Network. A Personal Area Network was evolved to increase the coverage area by spatially distributing Sensor nodes to capture and transmit physical parameters like temperature and Carbon monoxide in an indoor local cooking environment. Faulty node detection and localization was also realized, this was achieved by coming up with an algorithm that logically considers the receive signal strength value of -100 dbm as threshold, Result of data transmitted were viewed via a C-Sharp interface for Adaptive monitoring. The result from the Visual Basic plot shows that the Sensor nodes were able to capture temperature range of between 250C to 510C while the result of the CO emission shows an interval of 0.01g/m3 to 30.0 g/m3. A comparison between data transmitted at source and data received at the destination (sink) was carried out, a ranking test was used to validate the data received, a 0.9325 correlation value was obtained which shows a high level of integrity of 93.25% .
Reliable and Efficient Data Acquisition in Wireless Sensor NetworkIJMTST Journal
Ā
The sensors in the WSN sense the surrounding, collects the data and transfers the data to the sink node. It
has been observed that the sensor nodes are deactivated or damaged when exposed to certain radiations or
due to energy problems. This damage leads to the temporary isolation of the nodes from the network which
results in the formation of the holes. These holes are dynamic in nature and can grow and shrink depending
upon the factors causing the damage to the sensor nodes. So a solution has been presented in the base paper
where the dual mode i.e. Radio frequency and the Acoustic mode are considered so that the data can be
transferred easily. Based on this a survey has been done where several factors are studied so that the
performance of the system can be increased.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
MAINTAINING UNIFORM DENSITY AND MINIMIZING THE CHANCE OF ERROR IN A LARGE SCA...IJNSA Journal
Ā
In a real application area, the WSN is not a homogeneous network where the nodes are maintained in respective coordinate position relatively same to each other. But rather homogeneous it should be heterogeneous, where the relative positional difference for different nodes are different. In this paper a better scheme is being proposed which will take care of the life time and density of a WSN. Sun et. al. proposed uniform density in WSN by assuming the network as a homogeneous network ,but in this paper without taking a homogeneous network the same problem is being solved by using the Gaussian probability density function. And also the chance of error in receiving the message from the WSN to the base station is minimized by using priori probability algorithm.
Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...ijtsrd
Ā
We propose clusters based cooperatives based verbal architecture coop on the cellular ad hoc wireless sensor network Mawsn with the environment fading Rayleigh. The main ability and contributions of this paper are as follows. First, the proposed cage uses a cluster as a underlying system to help stable transmission services. 2D, the proposed enclosure uses a cluster based verbal cooperative exchange to effectively guide the package delivery ratio with multi hop power saving transmission. 0.33, we do not forget reasonable methods mainly based on cellular ad hoc nodes with sensing features and constant sensor nodes in the sensor field along with conventional research for the introduction of constant network sensors. Fourth, we have theoretical analysis with blackouts opportunities for proposed cooperative transmissions. Overall performance evaluation is run through simulation and evaluation. Sweeti Kumari | Dr. Ranjan Kumar Singh "Wireless Sensor Network Based Clustering Architecture for Cooperative Communication" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd43670.pdf Paper URL: https://www.ijtsrd.comengineering/electronics-and-communication-engineering/43670/wireless-sensor-network-based-clustering-architecture-for-cooperative-communication/sweeti-kumari
Ameliorate the performance using soft computing approaches in wireless networksIJECEIAES
Ā
Wireless sensor networks are an innovative and rapidly advanced network occupying the broad spectrum of wireless networks. It works on the principle of āuse with less expense, effort and with more comfort.ā In these networks, routing provides efficient and effective data transmission between different sources to access points using the clustering technique. This work addresses the low-energy adaptive clustering hierarchy (LEACH) protocolās main backdrop of choosing head nodes based on a random value. In this, the soft computing methods are used, namely the fuzzy approach, to overcome this barrier in LEACH. Our approachās primary goal is to extend the network lifetime with efficient energy consumption and by choosing the appropriate head node in each cluster based on the fuzzy parameters. The proposed clustering algorithm focused on two fuzzy inference structures, namely Mamdani and Sugeno fuzzy logic models in two scenarios, respectively. We compared our approach with four existing works, the conventional LEACH, LEACH using the fuzzy method, multicriteria cluster head delegation, and fuzzy-based energy efficient clustering approach (FEECA) in wireless sensor network. The proposed scenario based fuzzy LEACH protocol approaches are better than the four existing methods regarding stability, network survivability, and energy consumption.
Effective range free localization scheme for wireless sensor networkijmnct
Ā
Location aware sensors can be used in many areas such as military and civilian applications. Wireless
Sensor Networks help to identify the accurate location of the event. In this paper a cost effective schema for
localization has been proposed. It uses two beacon nodes to identify the location of unknown nodes. It
also uses flooding and estimating method to accurately identify the location of other nodes. Available area
is divided into zones and beacons are provided for each zone. Beacon nodes are placed in appropriate
locations normally two in a zone to provide location information. Using the two nodes location of unknown
nodes can be calculated accurately.
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.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
Ā
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
Ā
As AI technology is pushing into IT I was wondering myself, as an āinfrastructure container kubernetes guyā, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefitās both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Ā
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Ā
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overviewā
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
Ā
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Ā
Clients donāt know what they donāt know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clientsā needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
How world-class product teams are winning in the AI era by CEO and Founder, P...
Ā
Localization for wireless sensor
1. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.1, January 2016
DOI : 10.5121/ijcnc.2016.8105 61
LOCALIZATION FOR WIRELESS SENSOR
NETWORKS: A NEURAL NETWORK APPROACH
Shiu Kumar1,*
, Ronesh Sharma2
and Edwin R. Vans3
1,2,3
Department of Electronics Engineering, Fiji national University, Suva, Fiji
1,2
School of Engineering & Physics, University of the South Pacific, Suva, Fiji
ABSTRACT
As Wireless Sensor Networks are penetrating into the industrial domain, many research opportunities are
emerging. One such essential and challenging application is that of node localization. A feed-forward
neural network based methodology is adopted in this paper. The Received Signal Strength Indicator (RSSI)
values of the anchor node beacons are used. The number of anchor nodes and their configurations has an
impact on the accuracy of the localization system, which is also addressed in this paper. Five different
training algorithms are evaluated to find the training algorithm that gives the best result. The multi-layer
Perceptron (MLP) neural network model was trained using Matlab. In order to evaluate the performance
of the proposed method in real time, the model obtained was then implemented on the Arduino
microcontroller. With four anchor nodes, an average 2D localization error of 0.2953 m has been achieved
with a 12-12-2 neural network structure. The proposed method can also be implemented on any other
embedded microcontroller system.
KEYWORDS
Levenberg-Marquardt (LM) Algorithm, Localization, Neural Network, Received Signal Strength Indicator
(RSSI), Wireless Sensor Network (WSN).
1. INTRODUCTION
Wireless Sensor Networks (WSNs) has gained vast response from academia and industries with
new applications being developing in numerous fields. Some of the prospective applications
include environmental and vegetation monitoring, search and rescue operations [12], object
tracking such as tracking patients and doctors in hospitals, monitoring patients, military
applications [10] and other industrial applications. As a result of advancement in technologies,
sensor nodes that are small in size, are cheaper and consume less power having capabilities such
as sensing, data storage, computing and wireless communication have been developed.
An essential and challenging part of many WSN applications is localization (process of finding
the position of the nodes [8]) amongst the others such as architecture, deployment,
synchronization, calibration, quality of service and security. The sensor data has to be attached
with the measured data to make it significant for localization as this is essentially required in
monitoring and recording a wide-ranging information such as acoustic, thermal, visual, seismic or
any other type of measured observation. For example, a person monitoring a large vegetation
farm with a huge variety of vegetables would require the location or the part of the farm from
which the data is received as different vegetables have different specific requirements. To report
the origin of objects, node localization is necessary so that group querying of sensors, routing,
and questions about the network coverage [1] can be assisted or answered. Over the decade, a
number of solutions have been provided by researches for the problem of node localization (for
2. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.1, January 2016
62
example, [2]-[6], [9], [11], [13]-[16], [18]-[21], [23], [25]-[26], [33]-[34], [36]). In general,
mostly there is a trade-off between the accuracy of localization, the computational complexity,
and energy efficiency (for example, [24], [28-32]) of the techniques depending on their
application requirements.
A WSN usually comprises of a huge number of spatially distributed sensor nodes making it
difficult and impractical to record the sensor node locations when the nodes are being deployed.
There is also a possibility that the sensor node might later be moved from its original location to
some other location. Therefore, an algorithm that will autonomously determine the location of the
nodes is required. A novel neural network based node localization scheme is proposed in this
research work. The Received Signal Strength Indicator (RSSI) has been used for estimating the
coordinates or position of wireless sensor nodes in order to tackle the problem of determining the
location of the node. The following contributions are made:
ā¢ Is RSSI a suitable component to be used for node localization in WSNs? We employ the
use of RSSI value to determine the location of the sensor nodes and explain whether
RSSI is suitable to be used for localization purposes (Section 4). The need for additional
hardware will not arise as sensor nodes are freely equipped with RF modules for wireless
communication; therefore no extra hardware will be required. However, multipath fading
and noise will contaminate the RF signals, thus affecting the RSSI value by corrupting
the signal to noise ratio.
ā¢ The choice of the evaluation model is also of paramount importance. In this research, a
2D indoor environment is considered, that is the location is determined by the x and y
coordinates. A single anchor node will require steerable directional antennas, thus
accounting for a direct increase in cost and power consumption of the sensor node.
Therefore, two or more anchor nodes with different configurations (Section 3.2) have
been employed and the best configuration to be used for the anchor nodes is explained
(Section 4).
ā¢ We introduce a novel neural network based 2D indoor localization scheme. Global
Positioning System (GPS: [4], [19]) can be used for accurate localization. However, use
of GPS requires an external hardware to be attached to the sensor nodes leading to an
increase in cost and power consumption. Moreover, line-of-sight is required for GPS and
thus is not applicable for indoor environments. The method of indoor localization
proposed uses a feed-forward neural network (See Section 2). A number of neural
network structures trained using Levenberg-Marquardt (LM), Bayesian Regularization
(BR), Resilient Back-propagation (RP), Scaled Conjugate Gradient (SCG) and Gradient
Descent (GD), have been evaluated and the best neural network employed (refer to
Section 4).
1.1. PROBLEM DEFINITION
Consider the case when N number of sensor nodes is deployed in a sensor network with locations
L = {L1, L2, ..., LN}. Let Lxi, Lyi, Lzi, denote the x, y and z coordinates of the ith
sensor node
respectively. The problem of node localization involves determining these locations and by
letting Lzi = 0, problem of 2 dimension is obtained. Sensor nodes having knowledge of their
positions are known as anchors or beacons. All nodes in the network with unknown position
localize themselves with the aid of these anchor nodes. Therefore, mathematically the node
localization problem is stated as follows: for a given a multi-hop WSN, represented by a graph G
= (V, E) with A anchor nodes having positions {xa, ya} for all a É A, we want to determine the
position {xu, yu} for all nodes with unknown positions u É U.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.1, January 2016
63
2. THE PROPOSED NEURAL NETWORK METHOD
A practical method of learning discrete valued and real valued functions form given examples is
provided by artificial neural network (ANN, also referred to as neural network). Supervised
learning is used by ANN. The inputs and the outputs are provided to the ANN in order for it to
learn and form a suitable model. It is generally used to tackle the problem of classification and
regression. Usually, a multilayer neural network has three layers of interconnected āartificial
neuronsā; the input layer, hidden layer(s) and the output layer (see figure 1).
Figure 1. A general feed-forward neural network structure with 4 inputs and 3 outputs.
Feed-forward neural networks and feedback neural networks are the two groups of neural
network. In a feed-forward neural network, the outputs from one layer of neurons is fed to the
next layer and in this process no layers are skipped and there is no feedback to the system. The
three main types of neural networks used in localization [3] are MLP, Recurrent Neural Network
(RNN) and Radial Basic Function (RBF).
It must be noted that the RSSI values obtained are highly unstable and turn to vary under
environmental noise and mobility of sensor nodes. A neural network offers the advantage that
prior knowledge of the environment and noise distribution is not necessary. Moreover, higher
accuracies are achieved by neural networks compared to other techniques such as the Kalman
filter [3]. The trade-off between the accuracy and memory requirements of the MLP neural
network is the best when compared with other types of neural networks, thus it has been chosen
to be used in this research.
Matlab has been used for the implementation of the MLP neural network (a feed-forward ANN)
with three layers. The best solution chosen (refer to Section 4) is shown in figure 2 comprising of
three inputs, twelve nodes in the first and second (hidden) layers, and two nodes in the output
layer. RSSI values acquired from the 3 anchor nodes are fed as the input to the system, while the
output generates the estimate of the x and y coordinates of the mobile node.
Figure 2. The proposed MPL neural network with 3 inputs and 2 outputs.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.1, January 2016
64
The nodes in the first and second layer use the hyperbolic tangent sigmoid (ātansigā) activation
function, while the third layer uses a linear (āpurelinā) activation function. Bayesian
Regularization (BR) algorithm was used for training of the network since optimal results were
obtained using this training algorithm (refer Section 4). The network training time of the BR
algorithm was high; however it was still employed as only offline training was required. The
structure of the matrix containing the RSSI values and the output coordinates is as follows:
ļ£ŗ
ļ£ŗ
ļ£ŗ
ļ£ŗ
ļ£ŗ
ļ£»
ļ£¹
ļ£Æ
ļ£Æ
ļ£Æ
ļ£Æ
ļ£Æ
ļ£°
ļ£®
=
mmmnmjm
iiiniji
nj
YXRRR
YXRRR
YXRRR
data
L
MMMOMM
L
L
1
1
111111
(1)
Where Rij signifies the RSSI values of the signal obtained from the jth
anchor, at the ith
reference
point while Xi and Yi signify the x and y coordinates of the ith
reference point. For this research,
the total number of reference points (m) is 94 and the number of anchors (n) used is three. The
neural network obtained is represented by the equation as follows:
( ) kkjjii bWbWbWR
y
x
332211 )tanh(tanh +ā¢+ā¢+ā¢=ļ£ŗ
ļ£»
ļ£¹
ļ£Æ
ļ£°
ļ£®
(2)
Where R is the input row vector of length 3, which consists of the RSSI values acquired from the
3 anchor nodes, Wmn is the weight vector of nth
node at the mth
layer, and bmn is the bias vector of
nth
node at mth
layer. Equation 3 was incorporated on a mobile node equipped with an Arduino
microcontroller for node localization. However, this method can also be used to implement neural
network on other programming platforms.
3. DATA COLLECTION
3.1. MEASURING THE RSSI VALUES
For experimental purposes, the wireless sensor node comprising of Arduino UNO in conjunction
with the XBee series 2 module that is compliant with the IEEE 802.15.4 standard called ZigBee
have been used for the mobile node. The anchor nodes only comprise of the XBee series 2
modules on its own. For the wireless communication between the nodes, the standard ZigBee
communication is employed with an air data rate of 256 kbps operating at the ISM (Industrial,
Scientific & Medical) 2.4 GHz frequency band. The XBee has a receiver sensitivity of -96 dBm
and a communication range of 40m for indoor/urban environment.
For RSSI computation, XBee Series 2 modules special IEEE 802.15.4-2003 hardware support
such as has been utilized. The XBee modules have an RSSI pin, which outputs a PWM signal to
represent the RSSI value. This pin value can be read by the microcontroller and converted
appropriately to reflect the RSSI value. However, for this research the mobile node with XBee in
API mode and the anchor nodes in the AT mode was used. In API mode, packets are constructed
to command the XBee explicitly, as opposed to just sending the data serially in the AT or the
āTransparent Modeā. The DB command which returns the RSSI value of the latest packet
received was used.
The mobile node sends a signal to the anchor nodes requesting to send localization beacon, while
the anchor nodes respond by sending a beacon to the mobile node. A single instance of
measurement consists of one RSSI value for each anchor node signal received on the mobile node
5. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.1, January 2016
65
(see figure 3). The RSSI measurements between the mobile and the anchor nodes are measured
and recorded for further analysis using the Docklight (version 1.9) software running on Windows
7, which reads the serial data from the node and writes it to a file.
Mobile NodeAnchor Node
Beacon Request
Localization Beacon
Figure 3. Message flow between mobile and anchor nodes for RSSI measurements.
3.2. Experimental Setup
Training and testing of a neural network requires a set of data [15], [26]. The dataset in this
research is prepared by collecting the RSSI measurements for each mobile node coordinates, ri =
[xi, yi] denoting the position of the ith
reference point. For indoor localization, the structure of the
room or experimental environment is an important factor [27]. Measurements were carried out in
a research laboratory containing furnitureās and equipmentās such as tables, chairs and computers.
The structure of the measured training data is 9 x 11 measurement points (black points) as shown
in figure 4. The distance between the grid points is 0.45 m. Measurements from the training
positions and from unknown positions were used for testing. The unknown positions were chosen
between the training measurement points as indicated in green in figure 4.
Anchor 1
Anchor 2
Anchor 3
Anchor 4
Anchor 5
Unkonwn
Positions
Figure 4. Experimental setup layout.
The anchor node configurations used for this research to determine the best anchor node
configuration are 2 anchors (consisting of: (a) anchor 2 & 4. (b) anchor 1 & 4), 3 anchors
(consisting of: (a) anchor 1, 2 & 4. (b) anchor 1, 3 & 5), 4 anchors (consisting of anchor 1, 2, 4 &
5) and 5 anchors.
6. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.1, January 2016
66
4. RESULTS AND DISCUSSION
A neural network requires supervised learning and for this research five different training
algorithms namely LM, BR, RP, SCG and GD have been used for training the neural network. A
number of tests were conducted using various activation functions with varying number of layers
and nodes. A network with three layers having a 12-12-2 structure gave optimal results. It
employed 12 nodes in the first and second layer (which are the hidden layers) and 2 nodes in the
output layer. Hyperbolic tangent sigmoid activation function has been used for the hidden layers
while a pure line function has been used in the output layer. This structure was used with different
number of inputs that is with different number of anchors to evaluate the performance of different
anchor node configurations that follows.
An experiment was carried out to determine the best training algorithm to be used for training the
neural network and was performed using 4 anchors. The data structure used for training is
mentioned in Section 2 and consists of 2350 data sets of which 80 percent was used for training
and validation while 20 percent was used for testing. The network was then further tested for its
performance using 105 data sets obtained from 7 unknown positions (see figure 4). The
performance of the network is evaluated based on the error in the distance between the estimated
and exact distance. Equation 3 is used for calculating the average error.
ā=
ā+ā=
n
i
iiii yyxx
n
e
1
2
o
2
o )()(
1 (3)
Where n is the total number of test sets, (xoi,yoi) is the exact position and (xi,yi) is the estimated
position of the mobile node at the ith
test data set. Figure 5 shows the average localization error
obtained in this phase. The time taken to train the network using various training algorithms is
shown in figure 6.
Figure 5. Localization error of different methods with 4 anchors.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.1, January 2016
67
Figure 6. Time taken to train the neural network for different training algorithms with 4 anchors.
The maximum error, percentage of error less than 0.8m, average error for the test set of known
positions and average error for test set of unknown positions together with the time taken to train
the neural network for each method has been utilized to evaluate the performance. It can be noted
that the percentage of time the error is less than 0.8 m is quite low for RP, SCG and GD training
algorithms while they also have higher maximum error compared to that of LM and BR training
algorithms. The training time for BR and GD training algorithms is noticeably high compared to
other methods. However, for this research, offline training of the neural network is performed and
the neural network is than implemented on the mobile node. Therefore, the LM method and BR
method were chosen to be used for training the neural network for evaluation of other mentioned
anchor node configurations.
Figure 7 shows the localization errors of the neural network for the different anchor node
configurations, where the BR and LM training algorithms have been used to train the neural
network. It can be noted that increasing the number of anchor nodes increases the localization
accuracy. The lowest average error of all the configurations evaluated was obtained with five
anchor nodes. The maximum error for neural network obtained using LM training algorithm is
almost same when three, four or five anchors are used. For the two different configurations with
three anchors evaluated, the second configuration with anchors one, three and five produced a
slightly better result compared to that of when anchors one, two and four are used.
Figure 7. Localization error using LM and BR training algorithms for different anchor configurations.
TrainingTime(s)
8. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.1, January 2016
68
From the results obtained it can be concluded that RSSI values can be used for localization where
accuracy of less than a few meters is required. However, for applications requiring precise
localization accuracy for indoor localization, additional sensors such as ultrasonic sensors [36]
can be employed.
4.1. COMPARISON WITH OTHER RELATED LITERATURE
Various localization algorithms have been reported over the years with the goal of achieving
higher localization accuracy at a low computational and hardware cost. Several concepts such as
lateration, angulation, trilateration [25], multilateration and triangulation are used in localization.
The various localization schemes can be categorised in one of the following groups: GPS based
or GPS free, anchor based or anchor free, range based [7] or range free [2], [5]-[6], [23], fine
grained or coarse grained, and stationary or mobile sensor nodes [22]. Several range based
algorithms that have been proposed by a number of researchers include Time-Of-Arrival (TOA),
Time Difference of Arrival (TDOA) [34], Angle Of Arrival (AOA) [9], [11] and Received Signal
Strength Indicator (RSSI) [35]. As mentioned in Section 1, GPS localization schemes require
external hardware, are costly and consume lot of energy, which is not suitable for WSNs. Use of
directional antennas [21] have also been explored for the problem of node localization, with one
or more nodes being used to measure the angle of arrival of the signal. The angle obtained is then
used to compute the position of the node whose position is unknown. However, it must be noted
that directional antennas are costly and require larger amount of power that leads to a WSN
localization system which is not energy efficient.
The authors in [17] proposed a 2D and 3D localization algorithm using weighted centroid (WCL)
technique. The number of anchors involved in this method is controlled by use of an optimized
threshold. A range free WCL for 3D WSN using Mamdani & Sugano Fuzzy Inference System
(FIS) is presented in [20]. The method involves computing the edge weights from the RSSI
values by making use of the Mamdani & Sugano inference system where 121 anchor node were
employed. The high-resolution range-independent localization (HiRLoc) [16] and modified
HiRLoc [33] scheme used omni directional antennas. The average localization error, number of
anchor nodes used and the implementation environment for some of the localization algorithms
are given in table 1.
Table 1. Comparison of different localization algorithms.
Localization Algorithm
Average
Localization
Error (m)
Number of
anchor nodes
Implementation
Environment
2D-WCL [17] > 3.000 100 Simulation
Mamdani and Sugano FIS [20] 3.0000 121 Simulation
HiRLoc Scheme [16] 3.6000 Simulation
Modified HiRLoc Scheme [33] 3.5100 Simulation
Sequence-Based Localization [14] 5.0000 10 Simulation
Neural Network (3D) [18] 0.4855 4 Simulation
Proposed Method
0.6887 3
Real time0.2953 4
0.3435 5
9. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.1, January 2016
69
In [18], a neural network approach for 3D localization of nodes using 4 anchor nodes is
presented. Average localization error of 0.4855 m for 2D movement was reported. For 95% of the
mobile nodes, a localization error of less than 0.8 m was achieved. A 10-10-3 neural network
structure having four inputs was employed. The first layer used a hyperbolic tangent sigmoid
activation function; the second layer used a log sigmoid activation function while the output used
a liner activation function. However, for this research an average localization error of 0.2953 m
was obtained using neural network with 4 anchor nodes, which is comparably lower than that of
[18]. On the other hand, the authors in [18] presented their result based on simulation whereas in
this research the actual implementation and testing has been carried out in real time environment.
5. CONCLUSIONS
An efficient 2D localization algorithm for WSN has been proposed by utilizing ANN. Different
anchor node configurations have been evaluated that can be used by researchers in selecting the
number of anchor nodes to use depending on their application environment. The input to the
proposed method is the RSSI values of the signal received from the anchor nodes. As all sensor
nodes are equipped with RF modules for wireless communication, no external hardware is
required. The proposed method is thus energy efficient and uses only a two way message to
obtain the inputs for the localization. However, it is recommended that the RSSI value of the
localization beacon request signals received by the anchor nodes also be utilized that can result in
a further reduction of the localization error.
For obtaining the best neural network for localization, the BR training algorithm is evaluated to
give the best result. However, the training time for this algorithm is quite high compare to other
methods such as LM, RP and SCG. Therefore, it is recommended to use the BR method when
offline training is performed as in this case. For applications requiring online training, the LM
method is recommended.
ACKNOWLEDGEMENTS
This research work was fully supported by the College Research Committee of Fiji National
University.
REFERENCES
[1] Pal, "Localization algorithms in wireless sensor networks: current approaches and future challenges,"
Network Protocols and Algorithms, vol. 2, pp. 45-74, 2010.
[2] A. S. VelimiroviĀ“c, G. L. DjordjeviĀ“c, M. M. VelimiroviĀ“c, and M. D. JovanoviĀ“c, "A Fuzzy Set-
Based Approach to Range-Free Localization in Wireless Sensor Networks," Facta Universitatis (NiĖS
)Ser.: Elec. Energ., vol. 23, pp. 227-244, August.
[3] A. Shareef, Y. Zhu, and M. Musavi, "Localization using neural networks in wireless sensor
networks," in 1st international conference on MOBILe Wireless MiddleWARE, Operating Systems,
and Applications (MOBILWARE '08), 2008.
[4] B. Cheng, R. Du, B. Yang, W. Yu, C. Chen, and X. Guan, "An Accurate GPS-Based Localization in
Wireless Sensor Networks: A GM-WLS Method " in 40th International Conference on Parallel
Processing Workshops (ICPPW), Taipei City 2011, pp. 33-41.
[5] D. Niculescu and B. Nath, "DV Based Positioning in Ad hoc Networks," Journal of
Telecommunication Systems, vol. 1, 2003.
[6] E. Guerrero, H. G. Xiong, and Q. Gao, "A distributed range-free localization algorithm for wireless
sensor networks based on a mobile robot," Advanced Technologies for Communications (ATC '09),
pp. 93-98, 2009.
10. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.1, January 2016
70
[7] F. Arrichiello, G. Antonelli, A. P. Aguiar, and A. Pascoal, "An Observability Metric for Underwater
Vehicle Localization Using Range Measurements," Sensors, vol. 13, pp. 16191-16215, November
2013.
[8] G. Mao, B. Fidan, and B. D. O. Anderson, "Wireless sensor network localization techniques,"
Computer Networks, vol. 51, pp. 2529-2553, 2007.
[9] G. Stefano and A. Petricola, "A distributed AOA based localization algorithm for wireless sensor
networks," Journal of Computers, vol. 3, 2008.
[10] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: a survey,"
Computer Networks, vol. 38, pp. 393ā422, 2002.
[11] J.-R. Jiang, C.-M. Lin, F.-Y. Lin, and S.-T. Huang, "ALRD: AoA Localization with RSSI Differences
of Directional Antennas for Wireless Sensor Networks," International Journal of Distributed Sensor
Networks, vol. 2013, p. 10, 2013.
[12] J. Wang, Z. Cheng, L. Jing, and T. Yoshida, "Design of a 3D localization method for searching
survivors after an earthquake based on WSN," in The 3rd International Conference on Awareness
Science and Technology (iCAST), 2011, pp. 221-226.
[13] J. Xing, D. Wang, and Y. Liu, "Distributed Range-Free Localization Algorithm for 3D Wireless
Sensor Networks under Irregular Radio Propagation Model," Applied Informatics and
Communication, Communications in Computer and Information Science, vol. 224, pp. 299-306,
August 2011.
[14] K. Yedavalli and B. Krishnamachari, "Sequence-Based Localization in Wireless Sensor Networks,"
IEEE Transactions on Mobile Computing, vol. 7, January 2008.
[15] L. Gogolak, S. Pletl, and D. Kukolj, "Indoor Fingerprint Localization in WSN Environment Based on
Neural Network," in 9th International Symposium on Intelligent Systems and Informatics- SISY2011,
IEEE, 2011, pp. 293-296.
[16] L. Lazos and R. Poovendran, "HiRLoc: high-resolution robust localization for wireless sensor
networks " IEEE Journal on Selected Areas in Communications, vol. 24, pp. 233-246, Feb. 2006.
[17] L. Xu, K. Wang, Y. Jiang, F. Yang, Y. Du, and Q. Li, "A study on 2D and 3D weighted centroid
localization algorithm in Wireless Sensor Networks," in 3rd International Conference on Advanced
Computer Control (ICACC), Harbin 2011, pp. 155-159.
[18] M. Abdelhadi, M. Anan, and M. Ayyash, "Efficient Artificial Intelligent-based Localization
Algorithm for Wireless Sensor Networks," Journal of Selected Areas in Telecommunications (JSAT),
vol. 3, pp. 10-18, May 2013.
[19] M.-H. Le, V.-D. Hoang, A. Vavilin, and K.-H. Jo, "Vehicle Localization Using Omnidirectional
Camera with GPS Supporting in Wide Urban Area," in Computer Vision - ACCV 2012 Workshops,
2013, pp. 230-241.
[20] M. Nanda, A. Kumar, and S. Kumar, "Localization of 3D WSN using Mamdani Sugano fuzzy
weighted centriod approaches," in IEEE Students' Conference on Electrical, Electronics and
Computer Science (SCEECS), Bhopal 2012.
[21] M. Nilsson, "Localization using directional antennas and recursive estimation " in 5th Workshop on
Positioning, Navigation and Communication (WPNC 2008), Hannover, 2008, pp. 213-217.
[22] N. A. Alrajeh, M. Bashir, and B. Shams, "Localization Techniques in Wireless Sensor Networks,"
International Journal of Distributed Sensor Networks, vol. 2013, p. 9, 2013.
[23] N. Bulusu, J. Heidemann, and D. Estrin. (2000, October) GPS-less Low Cost Outdoor Localization
for Very Small Devices. IEEE Personal Communications Magazine. 28-34.
[24] N Meghanathan, Sugam Sharma, and G W Skelton. On Energy Efficient Data Dissemination In
Wireless Sensor Networks Using Mobile Sinks. International Journal of Theoretical and Applied
Information Technology, 2010.
[25] O. S. Oguejiofor, A. N. Aniedu, H. C. Ejiofor, and A. U. Okolibe, "Trilateration Based localization
Algorithm for Wireless Sensor Network," International Journal of Science and Modern Engineering
(IJISME), vol. 1, pp. 21-27, September 2013.
[26] S. H. Fang and T. N. Lin, "Indoor Location System Based on Discriminant-Adaptive Neural Network
in IEEE 802.11 Environments," IEEE Transactions on Neural Networks, vol. 19, pp. 1973-1978,
2008.
[27] S. Pletl, P. GƔl, D. Kukolj, and L. GogolƔk, "Optimizing Coverage in Mobile Wireless Sensor
Networks," in 8th International Symposium on Intelligent Systems and Informatics -SISY 2010,
Subotica, 2010, pp. 371 ā 376.
11. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.1, January 2016
71
[28] Sugam Sharma, S B Goyal, and M Rani.Energy Efficient Data Dissemination with ATIM Window
and Dynamic Sink in Wireless Sensor Networks. International Conference on Advances in Recent
Technologies in Communication and Computing. IEEE , 2009 . (Acceptance rate 42.1%)
[29] Sugam Sharma, and M Rani.Three-layer Architecture Model for Energy Conservation in Wireless
Sensor Networks. International Conference on Ultra Modern Telecommunications, St.-Petersburg,
Russia. IEEE, 2009.(Acceptance Rate: 39%) [Publication is supported by Computer Science research
division, University Malaysia Pahang, Malaysia]
[30] Sugam Sharma, and H Cohly. On Enhancing the Energy Conservation by ATIM window in Wireless
Sensor Networks. International Workshop on Advances in Peer-to-Peer Technology. IEEE, 2009.
[This research is partially supported by DHS Homeland Security Career Development Grants]
[31] Sugam Sharma, S B Goyal, and S Qamar. Four Layer Architecture Model for Energy Conservation in
Wireless Sensor Networks. 4th International Conference on Embedded and Multimedia Computing.
IEEE, 2009.
[32] Sugam Sharma, N Meghanathan. Sink Mobility Models For Sensor Energy Conservation: Exploiting
Sink Mobility For Energy Conservation Of Sensors In Homogeneous Wireless Sensor Network, 2011.
(http://www.amazon.com/Mobility-Models-Sensor-Energy-Conservation/dp/384651246X)
[33] T. Dubey and O. P. Sahu, "Directional Antenna Assisted Scheme to Reduce Localization Error in
Wireless Sensor Networks," International Journal of Information & Network Security (IJINS), vol. 2,
pp. 183-189, 2013.
[34] T. Tang, Q. Guo, and B. Peng, "Sorted TDOA optimization based localization algorithm for wireless
sensor network," Computer Engineering and Applications, vol. 44, 2008.
[35] W. Zhuang, G. Song, J. Tan, and A. Song, "Localization for hybrid sensor networks in unknown
environments using received signal strength indicator," in International Conference on Information
and Automation (ICIA 2008), 2008, pp. 567-572.
[36] Y. Charlon, N. Fourty, and E. Campo, "A Telemetry System Embedded in Clothes for Indoor
Localization and Elderly Health Monitoring," Sensors, vol. 13, pp. 11728-11749, September 2013.
AUTHORS
Shiu Kumar received Bachelor of Engineering Technology and Postgraduate Diploma in
Electrical and Electronics Engineering from the University of the South Pacific (USP) in
year 2009 and 2012 respectively. He received his Masters in Electronics Engineering from
Mokpo National University, South Korea. Currently he is pursuing his PhD in Machine
Learning (Signal Processing) from USP. His research interests include Automation and
Control, Wireless Sensor Networks, Embedded Microprocessor Applications, Artificial
Intelligence and Signal Processing. He is a member of IEEE, IAENG and IACSIT.
Ronesh Sharma received the BTech degree from the University of the South Pacific
(USP), Suva, Fiji, in 2007 and MEng degree from Mokpo National University, South
Korea. He is now pursuing his PhD degree in Engineering at University of the South
Pacific, Suva, Fiji. His research interests include Bioinformatics, protein secondary, fold
and structural class prediction problems, protein subcellular localization prediction
problems, intrinsically disordered protein related problems, data mining, and pattern
recognition. He is a member of IEEE.
Edwin Vans was born in Ba, Fiji, on October 26, 1987. He received his Bachelor of
Engineering Technology degree, Postgraduate Diploma in electrical and electronics
engineering and MSc in engineering degree from the University of the South Pacific, Fiji
in 2009, 2011 and 2015 respectively. He is currently a Lecturer in electronics engineering
at School of Electrical and Electronic Engineering in Fiji National University. He is a
current member of IEEE and IEEE Robotics and Automation Society. His research
interests are in machine learning, intelligent robotics, and computer vision.