Study of the Performance of Multi-hop Routing Protocols in Wireless Sensor Networks
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 2
Abstract
Currently in the literature, there are quite a num-ber of multi-hop routing algorithms, some of which are subject to normalization. Routing protocols based on clustering provide an efficient method for extending the lifetime of a wireless sensor network. Except that much of the research focuses less on communication between the Cluster-Head (CH), the nodes and the base station, and gives even less importance to the influence of the type of communication on the Life of the network. The aim of this article is to make a comparative study between some routing algorithms. Since they are not based on analytical models, the exact evaluation of some aspects of these protocols is very difficult. This is the reason why we make simulations. To study their performance. Our simulation is done under NS2 (Network Simulator 2). It allowed to obtain a classification of the different routing algorithms studied according to one of the metrics such as the loss of message, and the lifetime of a network.
Authors and Affiliations
Nouredine Seddiki, Bassou Abedsalem
Developement of Bayesian Networks from Unified Modeling Language for Learner Modelling
First of all, and to clarify our purpose, it seems important to say that the work we are presenting here lie within the framework of learner modeling in an adaptive system understood as computational modeling of the lear...
Design of Intelligent Control System of Transformer Oil Temperature
In working process of power transformer, which directly affects the safe operation of transformer oil temperature as well as the stability of the network, so vital to transformer oil temperature detection and control. Ba...
A Comparative Study of various Secure Routing Protocols based on AODV
The paper surveyed and compared various secure routing protocols for the mobile ad hoc networks (MANETs). MANETs are vulnerable to various security threats because of its dynamic topology and selfconfigurable nature. Sec...
A Variant of Genetic Algorithm Based Categorical Data Clustering for Compact Clusters and an Experimental Study on Soybean Data for Local and Global Optimal Solutions
Almost all partitioning clustering algorithms getting stuck to the local optimal solutions. Using Genetic algorithms (GA) the results can be find globally optimal. This piece of work offers and investigates a new variant...
BHA-160: Constructional Design of Hash Function based on NP-hard Problem
Secure hash function is used to protect the integrity of the message transferred on the unsecured network. Changes on the bits of the sender’s message are recognized by the message digest produced by the hash function. H...