This document summarizes a research paper that proposes using network coding to improve the efficiency of dynamic source routing in wireless sensor networks. The paper describes how typical sensor networks rely on a central processing station that causes congestion. It then discusses network coding and how it allows intermediate nodes to encode packets before forwarding. The paper proposes a scheme where some sensor nodes act as aggregators that apply network coding on received packets from neighboring sensors if the data is significantly different. Simulation results show this approach reduces total transmissions for networks with up to 75 nodes, improving efficiency, but performance degrades for larger networks potentially due to increased collisions.
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 NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
A Comparison of Routing Protocol for WSNs: Redundancy Based Approach A Compar...ijeei-iaes
Wireless Sensor Networks (WSNs) with their dynamic applications gained a tremendous attention of researchers. Constant monitoring of critical situations attracted researchers to utilize WSNs at vast platforms. The main focus in WSNs is to enhance network localization as much as one could, for efficient and optimal utilization of resources. Different approaches based upon redundancy are proposed for optimum functionality. Localization is always related with redundancy of sensor nodes deployed at remote areas for constant and fault tolerant monitoring. In this work, we propose a comparison of classic flooding and the gossip protocol for homogenous networks which enhances stability and throughput quiet significantly.
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.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
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.
SR-Code: Smart Relay Network Coding for Data Collection for Wireless Sensor N...IJERA Editor
Reliability in data collection for wireless sensor networks is one of the major problems in IoT applications. Sensor nodes are usually placed in harsh conditions where data communication is at risk of losing packets. Retransmissions are considered costly in terms of delay and power consumptions, especially that wireless sensor nodes are battery operated. In this context we introduce SR-Code, a novel network coding algorithm that achieves reliability in harsh conditions. SR-Code utilizes the XOR operator to code overheard packets. The targeted network topology is a 2-tier network where data loss can occur in all tiers. SR-Code utilizes bit addresses where each node is identified by a single bit in an address bit vector. Identifying packets and computing the cardinality of coded messages can be easily done using address bit vectors. SR-Code realizes redundancy as a function of overheard packet. SR-Code achieved a reliability factor of 75% when the number of packets lost was 100% of the original (un-coded) packet sent.
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 NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
A Comparison of Routing Protocol for WSNs: Redundancy Based Approach A Compar...ijeei-iaes
Wireless Sensor Networks (WSNs) with their dynamic applications gained a tremendous attention of researchers. Constant monitoring of critical situations attracted researchers to utilize WSNs at vast platforms. The main focus in WSNs is to enhance network localization as much as one could, for efficient and optimal utilization of resources. Different approaches based upon redundancy are proposed for optimum functionality. Localization is always related with redundancy of sensor nodes deployed at remote areas for constant and fault tolerant monitoring. In this work, we propose a comparison of classic flooding and the gossip protocol for homogenous networks which enhances stability and throughput quiet significantly.
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.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
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.
SR-Code: Smart Relay Network Coding for Data Collection for Wireless Sensor N...IJERA Editor
Reliability in data collection for wireless sensor networks is one of the major problems in IoT applications. Sensor nodes are usually placed in harsh conditions where data communication is at risk of losing packets. Retransmissions are considered costly in terms of delay and power consumptions, especially that wireless sensor nodes are battery operated. In this context we introduce SR-Code, a novel network coding algorithm that achieves reliability in harsh conditions. SR-Code utilizes the XOR operator to code overheard packets. The targeted network topology is a 2-tier network where data loss can occur in all tiers. SR-Code utilizes bit addresses where each node is identified by a single bit in an address bit vector. Identifying packets and computing the cardinality of coded messages can be easily done using address bit vectors. SR-Code realizes redundancy as a function of overheard packet. SR-Code achieved a reliability factor of 75% when the number of packets lost was 100% of the original (un-coded) packet sent.
An Efficient Data Transmission for Cluster based Wireless Sensor Networks usi...IJTET Journal
In this paper Identity based digital Signature and Identity based online offline algorithm for the cluster based wireless sensor networks is used. Identity based digital signature computes the digital signature signing process. Identity based online offline algorithm reduces the complexity of computational overhead in cluster head. This project reduces the overhead of the cluster head for efficient transmission. The method for efficient data transmission using Identity based digital signature is also implemented for minimizing end-to-end delay using network simulator. The graphics analysis toolbox and awk scripts is used to process the data from trace files.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
Abstract : In Wireless sensor network sensor nodes have a limited battery life and their efficient utilization is
a very much importent task. Their are many ways are proposed for efficient utilization of energy.For efficient
energy utilization many topologies,protocals are proposed by the help of which we can maximize the battery
life. In this paper we propesed a methode in which a correlation is made between all the sensor nodes including
ME(mobile element). A Vector Quantization methode are used for distance calculation between all the sensor
nodes and mobile element. After finding the corrélation we used the DSR & AODV routing Protocol. The
performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of
packet drop ratio and energy consumption. The simulation result shows that the proposed protocol with AODV
routing gives a batter result compared with same protocol with DSR routing.
Keywords: ME, DVT, DSR, AODV, Wireless Sensor Network, Efficient Energy Utilization
Concealed Data Aggregation with Dynamic Intrusion Detection System to Remove ...csandit
Data Aggregation is a vital aspect in WSNs (Wireless Sensor Networks) and this is because it
reduces the quantity of data to be transmitted over the complex network. In earlier studies
authors used homomorphic encryption properties for concealing statement during aggregation
such that encrypted data can be aggregated algebraically without decrypting them. These
schemes are not applicable for multi applications which lead to proposal of Concealed Data
Aggregation for Multi Applications (CDAMA). It is designed for multi applications, as it
provides secure counting ability. In wireless sensor networks SN are unarmed and are
susceptible to attacks. Considering the defence aspect of wireless environment we have used
DYDOG (Dynamic Intrusion Detection Protocol Model) and a customized key generation
procedure that uses Digital Signatures and also Two Fish Algorithms along with CDAMA for
augmentation of security and throughput. To prove our proposed scheme’s robustness and
effectiveness, we conducted the simulations, inclusive analysis and comparisons at the ending.
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.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
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.
Energy Efficient Routing Strategies for Large Scale Wireless Sensor in Hetero...ijtsrd
The efficiency of a wireless sensor network depends on its life time. By conserving the energy of each sensor for increase in the network life time. The basic operations of a wireless sensor network are sensing 1 the data to the energy sink term is for next transmitting node. The communication or routing 2 process operation be allowed in any operations for all nodes 3 . We propose to select a specific collection of nodes for communication with considering the importance of wireless sensor where security 4 and power usage 5 is taken as top priority. O. Sampath | . P. Suryanarayana Babu "Energy Efficient Routing Strategies for Large Scale Wireless Sensor in Heterogeneous Networks" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-2 , February 2019, URL: https://www.ijtsrd.com/papers/ijtsrd20281.pdf
Paper URL: https://www.ijtsrd.com/computer-science/computer-network/20281/energy-efficient-routing-strategies-for-large-scale-wireless-sensor-in-heterogeneous-networks/o-sampath
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Journals
Abstract The key theory of our redundancy management is to achieve the tradeoff between energy consumption vs. the gain in timeliness, security, and reliability to increase the system useful lifetime. A Innovative probability model to analyze the best redundancy level in terms of source redundancy, path redundancy and as well as the best intrusion detection settings in terms of the number of voters and the intrusion invocation break under which the lifetime of a HWSN [Heterogeneous Wireless Sensor Network] is maximized. In redundancy management “badmouthing” is the major problem in managing the redundancy. This badmouthing is malicious node which will never drop the packet even after knowing that the packet has been sent already. In this paper we propose a new scheme to overcome the problem of badmouthing by weighted based voting, this protocol will weight (Success Rate) all the nodes in the network to find the non-malicious node in the network which having more packet drop. In “weighted voting” main function is to find trust/reputation of neighbor nodes, as well as to tackle the “what paths to use” problem in multipath routing decision making for intrusion tolerance in WSNs. Keywords: Bad mouthing, Wireless Sensor Network, Weighted Based Voting, HWSN.
Intrusion detection in heterogeneous network by multipath routing based toler...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
A Traffic-Aware Key Management Architecture for Reducing Energy Consumption i...IDES Editor
In Wireless Sensor Networks (WSNs), most
of the existing key management schemes, establish shared
keys for all pairs of neighbor sensor nodes without
considering the communication between these nodes.
When the number of sensor nodes in WSNs is increased
then each sensor node is to be loaded with bulky amount
of keys. In WSNs a sensor node may communicate with a
small set of neighbor sensor nodes. Based on this fact, in
this paper, an energy efficient Traffic-Aware Key
Management (TKM) scheme is developed for WSNs,
which only establishes shared keys for active sensors
which participate in direct communication. The proposed
scheme offers an efficient Re-keying mechanism to
broadcast keys without the need for retransmission or
acknowledgements. Numerical results show that proposed
key management scheme achieves high connectivity. In
the simulation experiments, the proposed key
management scheme is applied for different routing
protocols. The performance evaluation shows that
proposed scheme gives stronger resilence, low energy
consumption and lesser end to end delay.
Review and Performance Comparison of Distributed Wireless Reprogramming Proto...IOSR Journals
Abstract:A Reprogramming service should be efficient, reliable and secured in Wireless sensor network.
Wireless reprogramming for wireless sensor network emphasize over the process of changing or improving the
functionality of simulation or existing code. For challenging and on demand security purpose, secure and
distributed routing protocols such as SDRP and ISDRP were developed. This paper reviews and compares the
propagation delay for two reprogramming protocols, SDRP and ISDRP, which based on hierarchy of energies
in network. Both are based on identity-based cryptography. But in the improved protocol the keys are
distributed to the network as per the sorting and communication capabilities to improve the broadcast or
communication nature of the network. Moreover, ISDRP demonstrates the security concepts, which deals over
the key encryption properties using heap sort algorithm and the confidentiality parameter is enhanced by
changing the private key values after certain interval of time for cluster head in respect to different public keys.
The ISDRP shows high efficiency rate clearly with the throughput and propagation results by implementation in
practice over SRDP.
Keywords: identity-based cryptography,ISDRP, heapsort algorithm, Reprogramming, SDRP, Wireless sensor
network.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
The development of the wireless sensor networks (WSNs) in various applications like Defense, Health,
Environment monitoring, Industry etc. always attract many researchers in this field. WSN is the network
which consists of collection of tiny devices called sensor nodes. Sensor node typically combines wireless
radio transmitter-receiver and limited energy, restricted computational processing capacity and
communication band width. These sensor node sense some physical phenomenon using different
transduces. The current improvement in sensor technology has made possible WSNs that have wide and
varied applications. While selecting the right sensor for application a number of characteristics are
important. This paper provides the basics of WSNs including the node characteristics. It also throws light
on the different routing protocols.
An Energy-Efficient Min-Max Optimization with RSA Security in Wireless Sensor...IJMTST Journal
A Novel Energy-efficient Min-max Optimization (NEMO) is proposed to improve the data delivery
performance and provide security in WSN. The NEMO scheme is applied in the virtual grid environment to
periodically collect the data from source node to the mobile sink through the cell headers. Here the movement
of sink is in controlled fashion and collects the data from the border line cell headers. For efficient data
delivery Fruit Fly Optimization (FFO) algorithm is applied here to find the best path by using the fitness value
calculated between the nodes based on the distance. The optimal path is chosen by first calculating the
minimum hop count paths and then finds the maximum of total fitness value along those paths. In that way
best path is selected by considering the shortest path which improves the data delivery performance and
also it minimizes the energy consumption. The proposed scheme enables the sensor nodes to maintain the
optimal path towards the latest location of mobile sink by using the FFO algorithm which leads to maximize
the network lifetime in wireless sensor networks. RSA digital signature is used to provide the security
between the intermediate nodes during the data delivery. The source node generates the keys and broadcast
it to all other nodes in the network. Source node signs the data using its private key and the intermediate
nodes verifies the data using the source’s public key which is already broadcasted by the source node. If the
data is valid then it forwards to the next intermediate nodes and till the sink node gets the data, forwarding
takes place. Else the data packets are dropped and inform that node as misbehaving node and the source
chooses the next best path without having that misbehaving node in the path..
The International Journal of Engineering and Science (IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
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.
An Efficient Data Transmission for Cluster based Wireless Sensor Networks usi...IJTET Journal
In this paper Identity based digital Signature and Identity based online offline algorithm for the cluster based wireless sensor networks is used. Identity based digital signature computes the digital signature signing process. Identity based online offline algorithm reduces the complexity of computational overhead in cluster head. This project reduces the overhead of the cluster head for efficient transmission. The method for efficient data transmission using Identity based digital signature is also implemented for minimizing end-to-end delay using network simulator. The graphics analysis toolbox and awk scripts is used to process the data from trace files.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
Abstract : In Wireless sensor network sensor nodes have a limited battery life and their efficient utilization is
a very much importent task. Their are many ways are proposed for efficient utilization of energy.For efficient
energy utilization many topologies,protocals are proposed by the help of which we can maximize the battery
life. In this paper we propesed a methode in which a correlation is made between all the sensor nodes including
ME(mobile element). A Vector Quantization methode are used for distance calculation between all the sensor
nodes and mobile element. After finding the corrélation we used the DSR & AODV routing Protocol. The
performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of
packet drop ratio and energy consumption. The simulation result shows that the proposed protocol with AODV
routing gives a batter result compared with same protocol with DSR routing.
Keywords: ME, DVT, DSR, AODV, Wireless Sensor Network, Efficient Energy Utilization
Concealed Data Aggregation with Dynamic Intrusion Detection System to Remove ...csandit
Data Aggregation is a vital aspect in WSNs (Wireless Sensor Networks) and this is because it
reduces the quantity of data to be transmitted over the complex network. In earlier studies
authors used homomorphic encryption properties for concealing statement during aggregation
such that encrypted data can be aggregated algebraically without decrypting them. These
schemes are not applicable for multi applications which lead to proposal of Concealed Data
Aggregation for Multi Applications (CDAMA). It is designed for multi applications, as it
provides secure counting ability. In wireless sensor networks SN are unarmed and are
susceptible to attacks. Considering the defence aspect of wireless environment we have used
DYDOG (Dynamic Intrusion Detection Protocol Model) and a customized key generation
procedure that uses Digital Signatures and also Two Fish Algorithms along with CDAMA for
augmentation of security and throughput. To prove our proposed scheme’s robustness and
effectiveness, we conducted the simulations, inclusive analysis and comparisons at the ending.
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.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
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.
Energy Efficient Routing Strategies for Large Scale Wireless Sensor in Hetero...ijtsrd
The efficiency of a wireless sensor network depends on its life time. By conserving the energy of each sensor for increase in the network life time. The basic operations of a wireless sensor network are sensing 1 the data to the energy sink term is for next transmitting node. The communication or routing 2 process operation be allowed in any operations for all nodes 3 . We propose to select a specific collection of nodes for communication with considering the importance of wireless sensor where security 4 and power usage 5 is taken as top priority. O. Sampath | . P. Suryanarayana Babu "Energy Efficient Routing Strategies for Large Scale Wireless Sensor in Heterogeneous Networks" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-2 , February 2019, URL: https://www.ijtsrd.com/papers/ijtsrd20281.pdf
Paper URL: https://www.ijtsrd.com/computer-science/computer-network/20281/energy-efficient-routing-strategies-for-large-scale-wireless-sensor-in-heterogeneous-networks/o-sampath
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Journals
Abstract The key theory of our redundancy management is to achieve the tradeoff between energy consumption vs. the gain in timeliness, security, and reliability to increase the system useful lifetime. A Innovative probability model to analyze the best redundancy level in terms of source redundancy, path redundancy and as well as the best intrusion detection settings in terms of the number of voters and the intrusion invocation break under which the lifetime of a HWSN [Heterogeneous Wireless Sensor Network] is maximized. In redundancy management “badmouthing” is the major problem in managing the redundancy. This badmouthing is malicious node which will never drop the packet even after knowing that the packet has been sent already. In this paper we propose a new scheme to overcome the problem of badmouthing by weighted based voting, this protocol will weight (Success Rate) all the nodes in the network to find the non-malicious node in the network which having more packet drop. In “weighted voting” main function is to find trust/reputation of neighbor nodes, as well as to tackle the “what paths to use” problem in multipath routing decision making for intrusion tolerance in WSNs. Keywords: Bad mouthing, Wireless Sensor Network, Weighted Based Voting, HWSN.
Intrusion detection in heterogeneous network by multipath routing based toler...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
A Traffic-Aware Key Management Architecture for Reducing Energy Consumption i...IDES Editor
In Wireless Sensor Networks (WSNs), most
of the existing key management schemes, establish shared
keys for all pairs of neighbor sensor nodes without
considering the communication between these nodes.
When the number of sensor nodes in WSNs is increased
then each sensor node is to be loaded with bulky amount
of keys. In WSNs a sensor node may communicate with a
small set of neighbor sensor nodes. Based on this fact, in
this paper, an energy efficient Traffic-Aware Key
Management (TKM) scheme is developed for WSNs,
which only establishes shared keys for active sensors
which participate in direct communication. The proposed
scheme offers an efficient Re-keying mechanism to
broadcast keys without the need for retransmission or
acknowledgements. Numerical results show that proposed
key management scheme achieves high connectivity. In
the simulation experiments, the proposed key
management scheme is applied for different routing
protocols. The performance evaluation shows that
proposed scheme gives stronger resilence, low energy
consumption and lesser end to end delay.
Review and Performance Comparison of Distributed Wireless Reprogramming Proto...IOSR Journals
Abstract:A Reprogramming service should be efficient, reliable and secured in Wireless sensor network.
Wireless reprogramming for wireless sensor network emphasize over the process of changing or improving the
functionality of simulation or existing code. For challenging and on demand security purpose, secure and
distributed routing protocols such as SDRP and ISDRP were developed. This paper reviews and compares the
propagation delay for two reprogramming protocols, SDRP and ISDRP, which based on hierarchy of energies
in network. Both are based on identity-based cryptography. But in the improved protocol the keys are
distributed to the network as per the sorting and communication capabilities to improve the broadcast or
communication nature of the network. Moreover, ISDRP demonstrates the security concepts, which deals over
the key encryption properties using heap sort algorithm and the confidentiality parameter is enhanced by
changing the private key values after certain interval of time for cluster head in respect to different public keys.
The ISDRP shows high efficiency rate clearly with the throughput and propagation results by implementation in
practice over SRDP.
Keywords: identity-based cryptography,ISDRP, heapsort algorithm, Reprogramming, SDRP, Wireless sensor
network.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
The development of the wireless sensor networks (WSNs) in various applications like Defense, Health,
Environment monitoring, Industry etc. always attract many researchers in this field. WSN is the network
which consists of collection of tiny devices called sensor nodes. Sensor node typically combines wireless
radio transmitter-receiver and limited energy, restricted computational processing capacity and
communication band width. These sensor node sense some physical phenomenon using different
transduces. The current improvement in sensor technology has made possible WSNs that have wide and
varied applications. While selecting the right sensor for application a number of characteristics are
important. This paper provides the basics of WSNs including the node characteristics. It also throws light
on the different routing protocols.
An Energy-Efficient Min-Max Optimization with RSA Security in Wireless Sensor...IJMTST Journal
A Novel Energy-efficient Min-max Optimization (NEMO) is proposed to improve the data delivery
performance and provide security in WSN. The NEMO scheme is applied in the virtual grid environment to
periodically collect the data from source node to the mobile sink through the cell headers. Here the movement
of sink is in controlled fashion and collects the data from the border line cell headers. For efficient data
delivery Fruit Fly Optimization (FFO) algorithm is applied here to find the best path by using the fitness value
calculated between the nodes based on the distance. The optimal path is chosen by first calculating the
minimum hop count paths and then finds the maximum of total fitness value along those paths. In that way
best path is selected by considering the shortest path which improves the data delivery performance and
also it minimizes the energy consumption. The proposed scheme enables the sensor nodes to maintain the
optimal path towards the latest location of mobile sink by using the FFO algorithm which leads to maximize
the network lifetime in wireless sensor networks. RSA digital signature is used to provide the security
between the intermediate nodes during the data delivery. The source node generates the keys and broadcast
it to all other nodes in the network. Source node signs the data using its private key and the intermediate
nodes verifies the data using the source’s public key which is already broadcasted by the source node. If the
data is valid then it forwards to the next intermediate nodes and till the sink node gets the data, forwarding
takes place. Else the data packets are dropped and inform that node as misbehaving node and the source
chooses the next best path without having that misbehaving node in the path..
The International Journal of Engineering and Science (IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
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.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
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.
EFFECTIVE AND SECURE DATA COMMUNICATION IN WSNs CONSIDERING TRANSFER MODULE O...IJEEE
A Bio-inspired clustering algorithm based on BFO has been proposed and investigation on energy efficient clustering algorithms related to WSNs has been done in this paper. The contribution of this paper related to use of Bacteria foraging algorithm firstly for WSNs for enhancing network lifetime of sensor nodes.
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.
CONCEALED DATA AGGREGATION WITH DYNAMIC INTRUSION DETECTION SYSTEM TO REMOVE ...cscpconf
Data Aggregation is a vital aspect in WSNs (Wireless Sensor Networks) and this is because it
reduces the quantity of data to be transmitted over the complex network. In earlier studies
authors used homomorphic encryption properties for concealing statement during aggregation
such that encrypted data can be aggregated algebraically without decrypting them. These
schemes are not applicable for multi applications which lead to proposal of Concealed Data
Aggregation for Multi Applications (CDAMA). It is designed for multi applications, as it
provides secure counting ability. In wireless sensor networks SN are unarmed and are
susceptible to attacks. Considering the defence aspect of wireless environment we have used
DYDOG (Dynamic Intrusion Detection Protocol Model) and a customized key generation
procedure that uses Digital Signatures and also Two Fish Algorithms along with CDAMA for
augmentation of security and throughput. To prove our proposed scheme’s robustness and
effectiveness, we conducted the simulations, inclusive analysis and comparisons at the ending.
Grid-Based Multipath with Congestion Avoidance Routing Protocolijtsrd
This Paper gives information about Grid base multipath wireless sensor network. We give a brief introduction about wireless sensor network, how sensor works in this network. How the Routing is done and if there is congestion detected in sensors networks and then how it can be solved. Routing protocols are also classified in several types like Proactive, Reactive, and Hybrid in also given here the details of that. Also here we describe various routing techniques like Traditional and Current techniques. In flooding based techniques, sensor broadcast the information and the destination sensor receives that information. In gossiping techniques, sensor sends information to neighbor sensor and so on. In this paper we also see that if any sensor id dies due to lack of power or any other problems then another path will be routed. Routing protocols are having 3 types Flat routing, Hierarchical routing and Location based routing. In Flat routing SPIN,DD, Rumor routing, etc protocols are used. In hierarchical routing LEACH, PEGASIS, TEEN protocols are used. Now a day LEACH and PEGASIS are widely used in cluster base Wireless Sensor Network. In leach protocol reduced the path using cluster head formulation in this method randomly any sensor make the cluster head n send messages in the network. In pegasis protocol use chaining concept and find the best path from base station to the destination station. PEGASIS and LEACH provide best routing techniques in wireless sensor network but they also have some disadvantages. We also differentiate flat and hierarchical routing techniques in which case which one gives best performances. Here we introduce the readers to Location based routing protocols GEAR and how it route the path is also briefly described here. Dr. Atul M Gosai | Lakshdeep M Raval"Grid-Based Multipath with Congestion Avoidance Routing Protocol" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-3 , April 2017, URL: http://www.ijtsrd.com/papers/ijtsrd72.pdf http://www.ijtsrd.com/computer-science/computer-network/72/grid-based-multipath-with-congestion-avoidance-routing-protocol/dr-atul-m-gosai
Performance Analysis of Fault Detection in Round Trip Delay and Path Wireless...Editor IJMTER
In recent years, wsns detect to the fault sensor node based on round trip delay using path
in wireless sensor networks. Portable sensor node is low cost in Wsns . Measured in the round trip
delay time and number of sensor node. Existing method is used to large value of sensor node,
identification of sensor node time and distance . it is used to linear selection path, disadvantages are
data loss, more number of path, complexity. in this proposed method using distributed autonomous
sensor software implementation in NS2.it is detected fault sensor node and malfunction ,in this
analysis time and path using discrete Rtp. real time applicability in received signal strength ,separate
wavelength for end of the node avoid the data loss and complexity. Hardware implementation using
ZigBee and Microcontroller .Equal to the hardware and software implementation. It is overcomes to
the data loss. comparing the threshold and Rtd time. Finally, the algorithm is tested under different
number of faulty sensors in the same area. Our Simulation results demonstrate that the time
consumed to find out the faulty nodes in our proposed algorithm is relatively less with a large
number of faulty sensors existing in the network.
Secure and Efficient DiDrip Protocol for Improving Performance of WSNsINFOGAIN PUBLICATION
Wireless Sensor Networks consists of a set of resource constrained devices called nodes that communicate wirelessly with each other. Wireless Sensor Networks have become a key application in number of technologies. It also measures the unit of vulnerability to security threats. Several Protocols are projected to make them secure. Some of the protocols within the sensor network specialize in securing data. These protocols are named as data discovery and dissemination protocols. The data discovery and dissemination protocol for wireless sensor networks are utilized for distributing management commands and altering configuration parameters to the sensor nodes. All existing data discovery and dissemination protocols primarily suffer from two drawbacks. Basically, they are support centralized approach (only single station can distribute data item).This approach is not suitable for multiple owner-multiple users. Second, the protocols are not designed with security in mind. This Paper proposes the first distributed knowledge discovery and dissemination protocol called DiDrip which is safer than the existing one. The protocol permits multiple owners to authorize many network users with altogether totally different priorities to at an equivalent time and directly flow into data items to sensor nodes.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
1. International Journal of Network Security & Its Applications (IJNSA), Vol.5, No.2, March 2013
CODE AWARE DYNAMIC SOURCE ROUTING FOR
DISTRIBUTED SENSOR NETWORK
M Abdul Rahiman1, Nishanth Jain2, Arun K. Dubey3 and G Manoj Kumar4
1
Director, AICTE, Ministry of HRD,Govt of India, New Delhi, INDIA
rehman_paika@yahoo.com
2
Cosultant,e-Gov, AICTE, Ministry of HRD, New Delhi, INDIA
3
Asst Professor, CSE, Bharati Vidyapeeth College of Engineering, New Delhi
4
Associate Professor, CSE, LBS Inst of Tech for Women, Trivandrum, Kerala
ABSTRACT
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.
KEYWORDS
Network Coding, Wireless Sensor Network, Dynamic Source Routing.
1. INTRODUCTION
Wireless sensor networks (WSNs) are one of the most popular networks used in computer
science. It consists of some autonomous sensors used to monitor various natural activities. These
natural activities may be pressure, temperature, sound vibration etc.. Sensor nodes collect data
from natural activities and pass it to central processing station or gateway called sink [1]. Lots of
researches have been made in various areas to enhance the overall throughput of WSNs.
Development of WSNs actuated by some important applications like military surveillance’s,
medical sciences, natural disaster control, etc. The topology of WSNs consists of multiple sources
and single sink. This causes some common problems like congestion at sink, limited resources,
etc. Because of limited resources inefficient DSR is also a major problem for WSNs.
2. DYNAMIC SOURCE ROUTING
Dynamic Source Routing protocol (DSR) is designed for specifically used in multi hop wireless
Ad hoc Network. It allows the network to be completely self organizing and self configuring. The
protocol consists of two mechanism route discovery and route maintenance. The use of source
routing allows packet routing to be trivially loop free. It eliminates the need for up to date routing
information in the intermediate nodes in which the packets are routed. The protocol operates
DOI : 10.5121/ijnsa.2013.5209 117
2. International Journal of Network Security & Its Applications (IJNSA), Vol.5, No.2, March 2013
entirely on demand. This also allows routing packet overhead of DSR to scale automatically to
only that needed to react to changes in the routers themselves in use.
3. NETWORK CODING
Network coding is the technique which is extensively used in wired networks, ad-hoc networks,
and distributed sensor networks, etc. Network coding is quite different from traditional
communication. Network coding achieves vast performance gains by permitting intermediate
nodes to carry out algebraic operations on the incoming data [10]. Network coding allows the
packets to encode and further forward it. The destination sink decodes the packets. Encoding is
simply XOR of data packets which will be called as encoded packet. XOR is simply exclusive-or
of the packets can easily be obtained by XOR truth table. Suppose node Px and Py are two
packets. Such that Px=10110 and Py=01101.Packet encoding=Px XOR Py=10110 XOR 01101=
11011=Pz. Packet decoding=Px XOR Pz=10110 XOR 11011=01101=Py and Py XOR Pz=01101
XOR 11011=10110=Px. Where Pz is encoded packet. Decoding is XOR of data packets (except
the missing one) and the encoded packet as a result the missing packet gets identified [2], [9],
[10].
Consider a sensor network in Figure 1a, having five nodes. Node S1, S2, S3 and S4 has some
packet data to share with each and every node. Assume all links have a time unit capacity. In
current approach, each node broadcasts their data and was listened by their neighboring node
according to Figure. Now there is a bottleneck on node N and have 4 data packets for
transmission. Node N broadcasts all 4 data packets one by one. Each node listen these broadcasts
and collects their data packet. This approach requires 8 broadcasts in all.
Now consider network coding approach illustrated with the help of same example. Each node
broadcasts their data which is collected by neighboring node. Now each sensor node S1, S2, S3
and S4 has 3 data packets received by their neighboring node as shown in Fig 1a. In Figure 1b
and Figure 1c Node N has 4 data packets to transmit. Using network encoding approach node N
encodes the data packets and broadcast it. Now all sensor nodes S1, S2, S3 and S4 listens this
encoded packet and decode these packets by using network decoding shown in Figure 1d. Now
this approach requires 5 broadcasts which are 37 % less than previously discussed approach. This
also reduces the bottleneck, congestion at sink and total transmission on the network and in the
process provides gain in bandwidth, efficiency and power resources of the nodes [14].
4. DEPLOYMENT STRATEGY FOR WSNS
Efficient deployment strategy is necessary to detect event occur in WSNs and obtain the real time
data. For example for a large dense forest there no need deploy WSNs in mountain region. This
can be done by deploying sub sensor networks in a distributed manner. Density of sensors
depends on the occurrence of events. The positions of sensors are predetermined and position of
sensor nodes identified by GPS systems. Each transmission contains a source ID and Sink ID and
transmission is directed to sink node [4], [7]. Proposed topology can be viewed as subsequent part
of large sensor network where each node taking part in data transmission using current
communication approaches.
5. RELATED WORK
In this section we explore the history of network coding and wireless dynamic source routing
(DSR). Ahlswede et al. [1] showed that with network coding, as symbol size approaches infinity,
118
3. International Journal of Network Security & Its Applications (IJNSA), Vol.5, No.2, March 2013
a source can multicast information at a rate approaching the smallest minimum cut between the
source and any receiver. Practical deployment of network coding is thoroughly described in [5],
[7], [8].Various network coding techniques like linear and random network coding are classified
in [9]. [6] Provides a systematic method to quantify the benefits of using network coding in the
presence of multiple concurrent unicast sessions. A robust network coding aware data aggregation
approach which will result in better performance of the network by reducing the number of
transmitted messages in the network is discussed in [4]. It also gives protection from link failure
to many-to-many network flows from multiple sensor nodes to sink nodes. Benefits of network
coding over wireless networks are described in [14]. Various efficient dynamic source routing
(DSR) techniques are explained in [3], [12], [13]. Also large WSNs topologies are described in
[4]. This gives us motivation to implement better dynamic source routing (DSR) for large WSNs
using network coding.
6. PROPOSED SCHEME
In this section we will discuss system model, proposed approach and algorithm for proposed
scheme.
6.1. System Model
In this work we have considered sensor nodes are deployed in a systematic manner to achieve
efficient network coding. These node senses data from the environment and transmits to sink
node. However these nodes are further classified into three categories. Sensor nodes, who senses
data and transmit, some relay nodes who simply forward the data packet to sink node and
aggregate node identifies the opportunity of network coding and performs it. The function ƒ is
used by the aggregate node to decide whether to apply network coding or not [4]. This topology is
recursive. Consider Figure 2 Node 1, 2,3,4,7 and 10 are initial nodes. These nodes are simply a
sink and relay nodes and it can be called as initial level L0 and it is contains 6 nodes. Now
topology is constructed recursively with Level L1, Level L2, Level L3......Level Lp. Level L1 has
total 12 nodes. 4 of them are aggregate nodes and 8 of them are sensor nodes. Hence we can say
Level L1 contains (r+q) nodes where r is number of sensor nodes and q is number of aggregate
nodes. Now Level L2 can be obtained by 2(r+q) nodes. This recursive method continues to obtain
a large sensor network and makes our topology scalable [4].
119
4. International Journal of Network Security & Its Applications (IJNSA), Vol.5, No.2, March 2013
To get better performance and efficient network coding we have to made sum assumptions.
• Node deployment is 2D.
• Each sensor node has unique id and sink node maintains the id these sensor nodes.
• All transmission contains Source-ID and Sink-ID.
• Nodes must approximately at equal distance.
• Let p and q are the two received data by an aggregate node and ƒ is a binomial function
which computes significant difference between the two data values and returns yes or no.
If p and q are differ not more than γ then the value of the function ƒ is false else it returns
true. The absolute value of the difference is denoted by d = p ~ q. ƒ :{ 0 if d < γ, 1 else}
6.2. Proposed Work
This research work would primarily concentrate on the design and development of sensor
networks and its overall throughput. Focus of the application on the better dynamic source routing
(DSR) technique using network coding to reduce total number of transmission in sensor networks
resulting in better efficiency. Specified sensor network topology is used as shown in Fig 2 to
achieve better results in wireless dynamic source routing (DSR) networks.
1
1 6
7
6
7
15
4 6
8
19
1
1
8
14 3
5 2
20
1 9
0
1
1 3
1 1
S 2
i
R
n
Ae
k
gl
S
a
gN
e
y
Wireless Link ro
n
ed
s
N
ge
Figure 2: Sensor Network Topology
o
a
r
td
Node placement is in two dimensional as shown in Fig 2. Now node {1} is sink node. Nodes {5,
ee
6, 8, and 9} are aggregate nodes. Nodes {2, 3, 4, 7, and 10} are relay nodes. Nodes {11, 12, 13,
N
14, 15, 16, 17 and 18} are sensor nodes. o
N
d
o
e
For Example suppose sensor node 12 and 13 have dsome information to flood. Now node 12
forwards (Broadcasts) it’s information to relay node 10 and aggregate node 9 and sensor node 13
e
forwards its information to aggregate node 9. Relay node simply forwards its information to sink
120
5. International Journal of Network Security & Its Applications (IJNSA), Vol.5, No.2, March 2013
node. Aggregate node 9 has two packets to forward. It encodes the packets using (XOR)
technique and further forwards it to sink. Now sink has two packets. One is data packet
transmitted by node 12 via relay node 10 and encoded packet transmitted by aggregate node 9. It
simply decode the packet by again XORing both the packets and collect the data packet
transmitted by sensor node 13. Here we can clearly see that sink node achieve the packets in 6
broadcasts instead of 8 which is currently done by wireless dynamic source routing (DSR).
Before hopping to algorithm 1 would like to put emphasis upon the point that we are not
providing the answer to the question: "When to encode data?”. For the purpose of this work we
have used random variable to decide upon when to encode, with equal probabilities.
6.3. Algorithm
To enable encoding and decoding of packets we have used two types of packets namely
normal_packet and code_packet. Where size of normal_packet is fixed and size of code_packet is
will be size of normal_packet plus size of header. Let at an aggregator node we need to encode
pkt1 and pkt2. This is done as following: pkt1 is XORed with pkt2 and is encapsulated under new
header and is then forwarded depending upon the new header. We have also included a bit in each
packet namely codeOn bit which is set if packet is code_packet and unset if it is normal_packet
(though it is redundant as type of packet can be identified by size) in our case. Decoding is
performed by first removing the additional header and then again XORing the packet with other
appropriate packets.
When aggregate node receives data from the sensor nodes function ƒ finds the difference between
the data. If difference is less than some predefined γ and is not significant then there is no need of
encoding and one of the data selected at random, is forwarded to sink node. If the difference is
greater than γ then aggregate node encode (XORs) data and forward to sink node. Each aggregate
node caches the previously received data from the sensor nodes. If data difference between
previously received data and currently received data is significant then encoding done and data
transmitted to sink node. Otherwise no encoding done and the data is transmitted normally.
Algorithm: Aggregate Heuristic(packet pkt1, packet pkt2)
//pkt1i& pkt2i is ith packet sent by leaf node 1 and leaf node 2 respectively.
{
Apply function f on data(pkt1i), data(pkt2i) and if it returns 0 then
{
If data(pkt1i),data(pkt1i-1) not equals to 0
then
{
Perform network coding on pkt1i and pkt1i-1 // pkt1i-1 is cached copy
Transmit data obtained by encoding in previous step
}
ElseIf data(pkt2i),data(pkt2i-1) not equals 0
{
Perform network coding on pkt2i and pkt2i-1
121
6. International Journal of Network Security & Its Applications (IJNSA), Vol.5, No.2, March 2013
Transmit data obtained by encoding in previous step
}
Else
{
Select either of the packet and transmit
}
}
Else
{
Perform network coding on pkt1 and pkt2
Transmit data obtained by encoding in previous step
}
//End of Algorithm
Function data(packet pkt)
{
Return data encapsulated in packet "pkt"
}
7. SIMULATION RESULTS
Given algorithm is implemented in ns-2.34. Traffic is generated using a CBR traffic generator at
leaf nodes. We have simulated the discussed algorithm on topologies of 20, 44 and 92 nodes. AS
mentioned earlier, function ƒ is simulated with the help of random variable. Caching is only
implemented at aggregate node with cache buffer size of two, one for each leaf node. Results of
simulations are given in Figure 3 for both types of network that is to say network without coding
and network with coding. Each simulation is run four times and so each bar of Figure 3 represents
average of four simulation runs. This is done to mitigate the effect of random variable and
simulation parameters.
Table 1:Coding Gain
No. of nodes Coding gain
20 1.46
44 1.36
92 0.84
One could easily see that for smaller network size (20, 44) total numbers of transmissions per unit
time have reduced. But for the network of 92 nodes it has actually increased. This could possibly
be because for large networks, numbers of collisions in network, without coding are more as
compared to one with network coding.
122
7. International Journal of Network Security & Its Applications (IJNSA), Vol.5, No.2, March 2013
Figure 3: Simulation result
Line graph for coding gain shown in Table 1. Now from concluded result of coding gain one can
clearly see that coding gain is more than 1 for 0-75 sensor nodes. Hence we can say network
efficiency gives better performance for this range for nodes. After that coding gain degrades to
less than 1. This could possibly be because for large networks, numbers of collisions in network,
with coding are more as compared to one without network coding.
3. CONCLUSIONS & FUTURE WORK
In this paper we have implemented the idea that the function ƒ is used by the aggregate node to
decide whether to apply network coding or not. We have found out that as the size of sensor
network increases, approach with network coding allows better bandwidth utilization. Though we
have not quantified, one could easily argue, as number of transmissions required to send one
packet from leaf node to sink nodes decreases it also provides significant energy savings at sensor
nodes. Although the topology suggested is scalable and robust due to multiple paths from leaf to
sink nodes, the cost effectiveness of this topology still remains an open question. It is also
challenging to come up with a good ƒ, as it depends a lot upon the application and environment.
REFERENCES
[1] Ian F. Akyildiz, Weilian Su, Yogesh Sankara subramaniam and Erda lCayirci, (2002) “ A Survey on
Sensor Networks”, Georgia Institute of Technology.
[2] Rudolf Ahlswede, NingCai, Shuo-Yen Robert Li, Raymond W. Yeung,(2000), “Network Information
Flow”, IEEE Transactions on Information Theory, Vol. 46, No. 4.
[3] Young-ri Choi , Mohamed G. Gouda ,Disciplined Flood Protocols in Sensor Networks, UTCS
Technical Report TR-05-03 ,The University of Texas at Austin.
[4] R. R. Rout , S.K. Ghosh , S. Chakrabarti,2009, Fourth International Conference on Industrial and
Information Systems, ICIIS 2009, 28 - 31 December 2009, Sri Lanka, “Network Coding-aware Data
Aggregation for a Distributed Wireless Sensor Network”, Indian Institute of Technology, Kharagpur.
[5] P. A. Chou, Y. Wu, and K. Jain, (2003), “Practical network coding”, Proc. Allerton Conf. Commun.,
[6] SudiptaSengupta, ShravanRayanchu, and Suman Banerjee, “ Network Coding-Aware Routing in
Wireless Networks”.
[7] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, (2006), Proc. ACM SIGCOMM,
Sep. 2006, pp. 243–254 , XORs in the air: Practical wireless network coding.
[8] Qunfeng Dong , Jianming Wu ,Wenjun Hu, Jon Crowcroft, “Practical Network Coding in Wireless
Networks” ,University of Wisconsin & Cambridge.
[9] Raymond W. Yeung, Shuo-Yen Robert Li, NingCai, Zhen Zhang, Network Coding Theory.
123
8. International Journal of Network Security & Its Applications (IJNSA), Vol.5, No.2, March 2013
[10] K V Rashmi, Nihar B Shah and P Vijay Kumar, (2010), “Network Coding”, IISc.
[12] AnanthKini, Vilas Veeraraghavan, Steven Weber, (2004), “Fast and efficient randomized dynamic
source routing (DSR) on lattice sensor networks”, Department of Electrical and Computer
Engineering, Drexel University.
[13] Ting Zhu, ZiguoZhong, Tian He, and Zhi-Li Zhang, Exploring Link Correlation for Efficient
Dynamic source routing (DSR) in Wireless Sensor Networks, University of Minnesota.
[14] Christina Fragouli, J¨orgWidmer, Jean-Yves Le Boudec, “On the Benefits of Network Coding for
Wireless Applications”.
Author
Dr. Abdul Rahiman M is currently working as Director in All India Council for
Technical Education (AICTE), Ministry of HRD, Government of India. He also served
as Director, Vocational Higher Secondary Education (VHSE), Government of Kerala.
He worked as Professor in the Department of Computer Science & Engineering in LBS
Institute of Technology for Women, Trivandrum, Kerala State, India. He did his
M.Tech degree in Computer Science from Kerala University in Computer Science with
specialization in Digital Image Computing and also undergone MBA degree in Systems and Post
Graduate Diploma in Human Resource Management from Kerala University. He has his PhD from
Karpagam University, Coimbatore in the area of pattern recognition. He has many publications in various
International Journals and International conference proceedings. He is a Life Member of Indian Society
for Technical Education (ISTE) and Computer Society of India (CSI)and also Member of International
Association of Computer Science & Information Technology (IACSIT). He is a member of Board of
Governors in Daman Diu Higher Education and also associated with many professional bodies.
He chaired many International Conferences and editorial board member of many International Journals.
124