The document discusses the evaluation of reliability in wireless sensor networks. It analyzes the effect of reporting rate and packet size on reliability parameters like packet delivery ratio and packet loss ratio. The key findings from simulation graphs are: (1) packet delivery ratio decreases and packet loss ratio increases with increasing reporting rate due to more congestion, (2) initially packet delivery ratio increases with packet size but starts decreasing after a threshold as larger packets lead to more information loss. The paper concludes that packet size and reporting rate impact network reliability and increasing delivery ratio while minimizing energy and congestion can enhance reliability.
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
REAL-TIME ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORKS: A SURVEYcscpconf
Wireless sensor networks can be termed as a new generation of distributed embedded systems
that has a capability of meeting broad range of real-time applications. Examples include
radiation monitoring, fire monitoring, border surveillance, and medical care to name but a few.
Wireless sensor networks that are deployed in time/mission-critical applications with highly
dynamic environments have to interact with the physical phenomenon under stringent timing
constraints and severe resource limitations. For such real-time wireless sensor networks,
designing and developing a real-time routing protocol that meets the required real-time
guarantee of data packets communication is a stimulating field of study that raised many
challenges and research issues. In this paper, we present a comprehensive survey of real-time
routing protocols in WSN, by discussing each protocol with its key features. Finally, we concluded this paper with open research issues and challenges of real-time routing in WSN.
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.
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
REAL-TIME ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORKS: A SURVEYcscpconf
Wireless sensor networks can be termed as a new generation of distributed embedded systems
that has a capability of meeting broad range of real-time applications. Examples include
radiation monitoring, fire monitoring, border surveillance, and medical care to name but a few.
Wireless sensor networks that are deployed in time/mission-critical applications with highly
dynamic environments have to interact with the physical phenomenon under stringent timing
constraints and severe resource limitations. For such real-time wireless sensor networks,
designing and developing a real-time routing protocol that meets the required real-time
guarantee of data packets communication is a stimulating field of study that raised many
challenges and research issues. In this paper, we present a comprehensive survey of real-time
routing protocols in WSN, by discussing each protocol with its key features. Finally, we concluded this paper with open research issues and challenges of real-time routing in WSN.
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.
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNIJCNCJournal
In this article it has presented leach extended hierarchical 3-level clustered heterogeneous and dynamics
algorithm. On suggested protocol (LEH3LA) with planning of selected auction cluster head, and
alternative cluster head node, problem of delay on processing, processing of selecting members, decrease
of expenses, and energy consumption, decrease of sending message, and receiving messages inside the
clusters, selecting of cluster heads in large sensor networks were solved. This algorithm uses hierarchical
heterogeneous network (3-levels), collective intelligence, and intra-cluster interaction for communications.
Also it will solve the problems of sending data in Multi-BS mobile networks, expanding inter-cluster
networks, overlap cluster, genesis orphan nodes, boundary change dynamically clusters, using backbone
networks, cloud sensor. Using sleep/wake scheduling algorithm or TDMA-schedule alternative cluster head
node provides redundancy, and fault tolerance. Local processing in cluster head nodes, and alternative
cluster head, intra-cluster and inter-cluster communications such as Multi-HOP cause increase on
processing speed, and sending data intra-cluster and inter-cluster. Decrease of overhead network, and
increase the load balancing among cluster heads. Using encapsulation of data method, by cluster head
nodes, energy consumption decrease during sending data. Also by improving quality of service (QoS) in
CBRP, LEACH, 802.15.4, decrease of energy consumption in sensors, cluster heads and alternative cluster
head nodes, cause increase on lift time of sensor networks.
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.
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.
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor NetworkIJMER
A wireless sensor network is a collection of nodes organized into a cooperative network.
Each node consists of processing capability, may contain multiple types of memory, have a RF
transceiver, have a power source, and accommodate various sensors and actuators. The nodes
communicate wirelessly and often self-organize after being deployed in an ad hoc fashion.
Routing protocols for wireless sensor networks are responsible for maintaining the routes in the
network and have to ensure reliable multi-hop communication .The performance of the network is
greatly influenced by the routing techniques. Routing is to find out the path to route the sensed data to
the base station. In this paper the features of WSNs are introduced and routing protocols are reviewed
for Wireless Sensor Network.
This presentation is all about the wireless sensor networks, how they collect data using aggregation, and how they evaluate or calculate the parameters
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.
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 Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
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
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.
PROPOSED A HETEROGENEOUS CLUSTERING ALGORITHM TO IMPROVE QOS IN WSNIJCNCJournal
In this article it has presented leach extended hierarchical 3-level clustered heterogeneous and dynamics
algorithm. On suggested protocol (LEH3LA) with planning of selected auction cluster head, and
alternative cluster head node, problem of delay on processing, processing of selecting members, decrease
of expenses, and energy consumption, decrease of sending message, and receiving messages inside the
clusters, selecting of cluster heads in large sensor networks were solved. This algorithm uses hierarchical
heterogeneous network (3-levels), collective intelligence, and intra-cluster interaction for communications.
Also it will solve the problems of sending data in Multi-BS mobile networks, expanding inter-cluster
networks, overlap cluster, genesis orphan nodes, boundary change dynamically clusters, using backbone
networks, cloud sensor. Using sleep/wake scheduling algorithm or TDMA-schedule alternative cluster head
node provides redundancy, and fault tolerance. Local processing in cluster head nodes, and alternative
cluster head, intra-cluster and inter-cluster communications such as Multi-HOP cause increase on
processing speed, and sending data intra-cluster and inter-cluster. Decrease of overhead network, and
increase the load balancing among cluster heads. Using encapsulation of data method, by cluster head
nodes, energy consumption decrease during sending data. Also by improving quality of service (QoS) in
CBRP, LEACH, 802.15.4, decrease of energy consumption in sensors, cluster heads and alternative cluster
head nodes, cause increase on lift time of sensor networks.
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.
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.
Analysis of Cluster Based Anycast Routing Protocol for Wireless Sensor NetworkIJMER
A wireless sensor network is a collection of nodes organized into a cooperative network.
Each node consists of processing capability, may contain multiple types of memory, have a RF
transceiver, have a power source, and accommodate various sensors and actuators. The nodes
communicate wirelessly and often self-organize after being deployed in an ad hoc fashion.
Routing protocols for wireless sensor networks are responsible for maintaining the routes in the
network and have to ensure reliable multi-hop communication .The performance of the network is
greatly influenced by the routing techniques. Routing is to find out the path to route the sensed data to
the base station. In this paper the features of WSNs are introduced and routing protocols are reviewed
for Wireless Sensor Network.
This presentation is all about the wireless sensor networks, how they collect data using aggregation, and how they evaluate or calculate the parameters
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.
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 Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
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
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.
Data aggregation in important issue in WSN’s. Because with the help of data aggregation; we are
reduce energy consumption in the network. In the Ad-hoc sensor network have the most challenging task
is to maintain a life time of the node. due to efficient data aggregation increase the life of the network. In
this paper, we are going to provide the information about the type of the network and which data
aggregation algorithm is best. In big scale sensor network, energy economical, data collection and query
distribution in most important.
Keywords — data aggregation; wireless sensor network
Various Techniques Used in Wireless Sensor Networks for Data TransferIJAEMSJORNAL
Nowadays the wireless sensor networking is the common way for data transfer. So, it is a big task to upload and download data securely without any data loss. as we know in the wireless sensor network there are several nodes which are used to transfer the data. To perform this task there are various data transport protocols available. In this paper, we analyze the various protocol which is used for data transfer in WSN. We also discuss the various challenges which are faced during the data transfer in WSN.
Energy Proficient and Security Protocol for WSN: A Reviewtheijes
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.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Theoretical work submitted to the Journal should be original in its motivation or modeling structure. Empirical analysis should be based on a theoretical framework and should be capable of replication. It is expected that all materials required for replication (including computer programs and data sets) should be available upon request to the authors.
The International Journal of Engineering & Science would take much care in making your article published without much delay with your kind cooperation
A fuzzy congestion controller to detect and balance congestion in wsnijwmn
A Wireless Sensor Network (WSN) is collection of wireless sensors with limited memory, processing and energy supply. Based on application, sensors distribute in a wide geographically area in order to collect information and transmit the collected data packets toward a base station also called Sink. Due to the relatively high node density and source-to-sink communication pattern, congestion is a critical issue in WSN. Congestion not only causes packet loss, but also leads to excessive energy consumption as well as delay. To address this problem, in this paper we propose a new fuzzy logic based mechanism to detect and control congestion in each grid in WSN. In the proposed approach, sink select one node in each grid as Monitor Node. In addition, sink defines congestion candidate grids. Each Monitor Node in congestion candidate grids continually monitors the network and fetches the fuzzy controller inputs in order to determine level of congestion in each grid. Based on the congestion level, packets forward through the grid or relay nodes. Simulation results show that our approach has higher packet delivery ratio and lower packet loss than existing approaches.
TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...cscpconf
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...IJERA Editor
Network Coding is most promising aspect of WSN. This Network Coding method is combined with multipath routing protocol to form NCMR protocol.(network coding based multipath routing protocol).This protocol is used to obtain energy efficient wireless sensor network.. These protocol leads to decrease the number of constrain routes & the total time of transmission. This protocol is applied on unicast and multicast network separately. And comparison is done with traditional multipath routing protocol for same unicast and multicast network. Simulation result shows energy consumption of NCMR multicast is lower than NCMR unicast and also than TMR unicast as well as multicast. This work is proved by the simulation analysis results. The used multipath model is based on braided multipath routing, and the network coding method is random linear network coding (practical network coding). In braided network multiple paths to the sink nodes are created for each source node, and the packets encoded at source nodes are transmitted through the braided multipath network model. Then, intermediate nodes re-encode these received packets and transfer these new packets to next cluster. Finally, the multiple sink nodes decode the packets received from different paths and recover the original data. Results of the analysis show that multicast NCMR provides more reliability. We compare multicast NCMR routing protocol with NCMR unicast & also with traditional multipath routing protocol for unicast and multicast networks, in terms of the packet loss, energy consumption, successful delivery ratio & end to end delay when a packet is transmitted Some special simulations are carried out specially for NCMR multicast i.e. effect of number of nodes on energy consumption, packet loss & end to end delay.
CONSENSUS BASED DATA AGGREGATION FOR ENERGY CONSERVATION IN WIRELESS SENSOR N...ijdpsjournal
Our planet is abundant with raw data and to monitor the available data properly, processing of the enormous raw data is very vital. One of the key things in development of mankind and the nature is to acquire as much data as possible and to react appropriately in accordance with the studied data. It’s nothing but diagnosis of the physical world by studying the data acquired from them in order to take proper measures that can help in treating them better. Large volume of data incurs high energy consumption for its transmission and thus results in decrease of overall network lifetime.
Wireless Sensor Network (WSN) is a collection of multiple sensor nodes that all together forms a network for transmitting data acquired by each sensor node to sink known as Base Station (BS). In hierarchical routing acquired data are sent via relay agents like Cluster Heads (CH). The Cluster Heads must be customised with computations and formulations, which will help in aggregating the gathered data, in order to reduce energy consumption while transmitting the data further in the network while maintaining the data integrity to withhold the significance of every single value in a data set.
IMPROVING THE PERFORMACE OF DATA AGGREGATION IN WIRELESS SENSOR NETWORKEditor IJMTER
In this paper data aggregation using multipath routing is proposed. In existing system, under hybrid scheme, it each sensor nodes generates information by sensing its physical environment and transmit to sink by multi hop communication. In network aggregation computation intermediate forwarding nodes can substantially increase the network life time but amount of data contained in single packet and make the system vulnerability to packet loss. Instead of retransmission it takes the additional time. Ad hoc On Demand Distance Vector routing protocol is used to improving the performance of data aggregation due to avoiding these problems.
Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...paperpublications3
Abstract: Data gathering in wireless sensor network (WSN) is a crucial field of study and it can be optimized various algorithms like clustering, aggregation, and cryptographic technique in order to reliably transfer data between sensor and sink. But these techniques do not provide an optimized data gathering wireless sensor network because of the fact that they do not leverage the advantages of various techniques. Our problem definition is to create a reliable data gathering wireless sensor network which ensures good energy efficiency and lower delay as compared to existing techniques.
Keywords: Aggregation, Clustering, Data Gathering, Cryptography, Data Compression, Run Length Encoding.
Title: Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency and Delay
Author: Neelam Ashok Meshram
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
IRJET-Structure less Efficient Data Aggregation and Data Integrity in Sensor ...IRJET Journal
Kavita Sunchu, Dhainje Prakash " Structure less Efficient Data Aggregation and Data Integrity in Sensor Network ", International Research Journal of Engineering and Technology (IRJET), Volume2,issue-01 April 2015.e-ISSN:2395-0056, p-ISSN:2395-0072. www.irjet.net .published by Fast Track Publications
Abstract
Recently, several data aggregation schemes based on privacy homomorphism encryption have been proposed and investigated on wireless sensor networks. These data aggregation techniques provide higher security compared with traditional aggregation since cluster heads (aggregator) can directly aggregate the cipher texts without decryption; consequently, transmission overhead. Data aggregation protocol can reduce the communication cost, so the life time of sensor network is extended. The structure based has the overhead in dynamic scenarios for any event based application. The goal of our work is to design techniques and protocol that is structure free and ensure data integrity and aggregation with low transmission overhead and transmission cost. Experiment results demonstrate that the transmission overhead is still reduced even if on sensing data. Further, the design has been generalized and adopted in wireless sensor networks.
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of MIMO communication in such type of network is enhancing the packet transmission capabilities. There are different techniques for cooperative transmission and broadcasting packet in MIMO equipped Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a new scheduling algorithm based on investigating the different broadcasting algorithm. The new broadcasting algorithm improves the packet transmission rate of the network based on energy performance of the network and minimizes the BER for different transmission mode which is illustrated in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result for the packet transmission rate are collected and shown in the tabular form. Also simulate the network for generating a comparative statement for each mobile node. And performance analysis is also done for the model network. The main focus is to minimize BER and improve information efficiency of the network.