Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Survey on energy efficient dynamic sink optimum routing for wireless sensor network and communication technologies

View through CrossRef
Summary Wireless sensor network (WSN) is frequently being used for increasing the data collection and monitoring critical parameters. Major challenge in WSN design is achieving the better energy efficiency and latency considering the dynamic sink location. Lots of research has been done for improving the performance of WSN systems in wide range of applications. Prime goal of this paper is to evaluate the performance of WSN routing under the grid‐based dynamic sink locations. Later the performance of various existing critical protocols is compared to route data over centralized server. Various applications of WSNs are tabulated along with the sensor utilization. The paper contributed in three passes. Initial contribution of this research is to identify the issues and limitations of present WSN communication technologies. The paper contributed to present a case study to discover the implications of dynamic sink routing for building protocol to extend network's lifetime. The effectiveness of several clustering‐based WSN routing algorithms is first compared in this paper. After that, the protocol with the longest network life is put to the test under a grid‐based dynamic sink routing scenario. The significance of clustering‐based protocols for improving lifetime of the network is evaluated as case study. The clustering‐based energy efficient protocol like low energy adaptive clustering hierarchy (LEACH) and its different variants, PEGASIS, SEP, DEC, their variants, and so on, are compared in this paper. Various performance metrics like network delays, throughput, latency, energy consumption and network lifetime are defined for studying routing protocols. Significance of dynamic sink locations performance is evaluated for Enhanced Distributed Energy Efficient Clustering (EDEEC) protocol. Overall paper covers and reviewed many critical design aspects for WSN networks.
Title: Survey on energy efficient dynamic sink optimum routing for wireless sensor network and communication technologies
Description:
Summary Wireless sensor network (WSN) is frequently being used for increasing the data collection and monitoring critical parameters.
Major challenge in WSN design is achieving the better energy efficiency and latency considering the dynamic sink location.
Lots of research has been done for improving the performance of WSN systems in wide range of applications.
Prime goal of this paper is to evaluate the performance of WSN routing under the grid‐based dynamic sink locations.
Later the performance of various existing critical protocols is compared to route data over centralized server.
Various applications of WSNs are tabulated along with the sensor utilization.
The paper contributed in three passes.
Initial contribution of this research is to identify the issues and limitations of present WSN communication technologies.
The paper contributed to present a case study to discover the implications of dynamic sink routing for building protocol to extend network's lifetime.
The effectiveness of several clustering‐based WSN routing algorithms is first compared in this paper.
After that, the protocol with the longest network life is put to the test under a grid‐based dynamic sink routing scenario.
The significance of clustering‐based protocols for improving lifetime of the network is evaluated as case study.
The clustering‐based energy efficient protocol like low energy adaptive clustering hierarchy (LEACH) and its different variants, PEGASIS, SEP, DEC, their variants, and so on, are compared in this paper.
Various performance metrics like network delays, throughput, latency, energy consumption and network lifetime are defined for studying routing protocols.
Significance of dynamic sink locations performance is evaluated for Enhanced Distributed Energy Efficient Clustering (EDEEC) protocol.
Overall paper covers and reviewed many critical design aspects for WSN networks.

Related Results

ACM SIGCOMM computer communication review
ACM SIGCOMM computer communication review
At some point in the future, how far out we do not exactly know, wireless access to the Internet will outstrip all other forms of access bringing the freedom of mobility to the way...
Routing Security in Wireless Sensor Networks
Routing Security in Wireless Sensor Networks
Since routing is a fundamental operation in all types of networks, ensuring routing security is a necessary requirement to guarantee the success of routing operation. Securing rout...
Dynamic stochastic modeling for inertial sensors
Dynamic stochastic modeling for inertial sensors
Es ampliamente conocido que los modelos de error para sensores inerciales tienen dos componentes: El primero es un componente determinista que normalmente es calibrado por el fabri...
Analisa Perbandingan Kinerja Protokol Routing Rip Dan Ospf Menggunakan IPv4
Analisa Perbandingan Kinerja Protokol Routing Rip Dan Ospf Menggunakan IPv4
Abstrak - Penelitian bertujuan untuk dapat membandingkan kinerja protokol routing RIP dan OSPF menggunakan IPv4 bertujuan untuk dapat melakukan perbaingan dua metode touting yaitu ...
Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3
Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3
Router is the network equipment for route the packet from one network segment to another in a bigscale network. Router can route packet because there is a routing table in router c...
Spiral Mobility Based on Optimized Clustering for Optimal Data Extraction in WSNs
Spiral Mobility Based on Optimized Clustering for Optimal Data Extraction in WSNs
Wireless Sensor Networks (WSNs) have led to tremendous growth in the development of sensor technology and offer numerous applications, such as wildlife monitoring, environment, hea...
PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF)
PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF)
ABSTRAK Routing merupakan proses mengirim data dari satu network ke network lain. Dengan dynamic routing maka mekanisme routing dilakukan secara dinamis dengan menentukan jarak ter...

Back to Top