4,222 research outputs found
Performance Analysis of Hierarchical Routing Protocols in Wireless Sensor Networks
This work focusses on analyzing the optimization strategies of routing
protocols with respect to energy utilization of sensor nodes in Wireless Sensor
Network (WSNs). Different routing mechanisms have been proposed to address
energy optimization problem in sensor nodes. Clustering mechanism is one of the
popular WSNs routing mechanisms. In this paper, we first address energy
limitation constraints with respect to maximizing network life time using
linear programming formulation technique. To check the efficiency of different
clustering scheme against modeled constraints, we select four cluster based
routing protocols; Low Energy Adaptive Clustering Hierarchy (LEACH), Threshold
Sensitive Energy Efficient sensor Network (TEEN), Stable Election Protocol
(SEP), and Distributed Energy Efficient Clustering (DEEC). To validate our
mathematical framework, we perform analytical simulations in MATLAB by choosing
number of alive nodes, number of dead nodes, number of packets and number of
CHs, as performance metrics.Comment: NGWMN with 7th IEEE International Conference on Broadband and
Wireless Computing, Communication and Applications (BWCCA 2012), Victoria,
Canada, 201
Overlapping Multi-hop Clustering for Wireless Sensor Networks
Clustering is a standard approach for achieving efficient and scalable
performance in wireless sensor networks. Traditionally, clustering algorithms
aim at generating a number of disjoint clusters that satisfy some criteria. In
this paper, we formulate a novel clustering problem that aims at generating
overlapping multi-hop clusters. Overlapping clusters are useful in many sensor
network applications, including inter-cluster routing, node localization, and
time synchronization protocols. We also propose a randomized, distributed
multi-hop clustering algorithm (KOCA) for solving the overlapping clustering
problem. KOCA aims at generating connected overlapping clusters that cover the
entire sensor network with a specific average overlapping degree. Through
analysis and simulation experiments we show how to select the different values
of the parameters to achieve the clustering process objectives. Moreover, the
results show that KOCA produces approximately equal-sized clusters, which
allows distributing the load evenly over different clusters. In addition, KOCA
is scalable; the clustering formation terminates in a constant time regardless
of the network size
A Theoretical Review of Topological Organization for Wireless Sensor Network
The recent decades have seen the growth in the fields of wireless communication technologies, which has made it possible to produce components with a rational cost of a few cubic millimeters of volume, called sensors. The collaboration of many of these wireless sensors with a basic base station gives birth to a network of wireless sensors. The latter faces numerous problems related to application requirements and the inadequate abilities of sensor nodes, particularly in terms of energy. In order to integrate the different models describing the characteristics of the nodes of a WSN, this paper presents the topological organization strategies to structure its communication. For large networks, partitioning into sub-networks (clusters) is a technique used to reduce consumption, improve network stability and facilitate scalability
A Survey on Wireless Sensor Network Security
Wireless sensor networks (WSNs) have recently attracted a lot of interest in
the research community due their wide range of applications. Due to distributed
nature of these networks and their deployment in remote areas, these networks
are vulnerable to numerous security threats that can adversely affect their
proper functioning. This problem is more critical if the network is deployed
for some mission-critical applications such as in a tactical battlefield.
Random failure of nodes is also very likely in real-life deployment scenarios.
Due to resource constraints in the sensor nodes, traditional security
mechanisms with large overhead of computation and communication are infeasible
in WSNs. Security in sensor networks is, therefore, a particularly challenging
task. This paper discusses the current state of the art in security mechanisms
for WSNs. Various types of attacks are discussed and their countermeasures
presented. A brief discussion on the future direction of research in WSN
security is also included.Comment: 24 pages, 4 figures, 2 table
Fuzzy-TOPSIS based Cluster Head selection in mobile sensor networks
One of the critical parameters of Wireless Sensor Networks (WSNs) is node lifetime. There are various methods to increase WSN node lifetime, the clustering technique is being one of them. In clustering, selection of a desired percentage of Cluster Heads (CHs) is performed among the sensor nodes (SNs). Selected CHs are responsible for collecting data from their member nodes, aggregating the data and finally sending it to the sink. In this paper, we propose a Fuzzy-TOPSIS technique, based on multi criteria decision making, to choose CH efficiently and effectively to maximize the WSN lifetime. We will consider several criteria including: residual energy; node energy consumption rate; number of neighbor nodes; average distance between neighboring nodes; and distance from the sink. A threshold based intra-cluster and inter-cluster multi-hop communication mechanism is used to decrease energy consumption. We have also analyzed the impact of node density and different types of mobility strategies in order to investigate impact over WSN lifetime. In order to maximize the load distribution in the WSN, a predictable mobility with octagonal trajectory is proposed. This results in improvement of overall network lifetime and latency. Results shows that the proposed scheme improves the network lifetime by 60%, conserve energy by 80%, a significant reduction of frequent Cluster Head (CH) per round selection by 25% is achieved as compared to the conventional Fuzzy and LEACH protocols
- …