3,738 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
M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol for WSNs
In this research work, we advise gateway based energy-efficient routing
protocol (M-GEAR) for Wireless Sensor Networks (WSNs). We divide the sensor
nodes into four logical regions on the basis of their location in the sensing
field. We install Base Station (BS) out of the sensing area and a gateway node
at the centre of the sensing area. If the distance of a sensor node from BS or
gateway is less than predefined distance threshold, the node uses direct
communication. We divide the rest of nodes into two equal regions whose
distance is beyond the threshold distance. We select cluster heads (CHs)in each
region which are independent of the other region. These CHs are selected on the
basis of a probability. We compare performance of our protocol with LEACH (Low
Energy Adaptive Clustering Hierarchy). Performance analysis and compared
statistic results show that our proposed protocol perform well in terms of
energy consumption and network lifetime.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
An Energy Driven Architecture for Wireless Sensor Networks
Most wireless sensor networks operate with very limited energy sources-their
batteries, and hence their usefulness in real life applications is severely
constrained. The challenging issues are how to optimize the use of their energy
or to harvest their own energy in order to lengthen their lives for wider
classes of application. Tackling these important issues requires a robust
architecture that takes into account the energy consumption level of functional
constituents and their interdependency. Without such architecture, it would be
difficult to formulate and optimize the overall energy consumption of a
wireless sensor network. Unlike most current researches that focus on a single
energy constituent of WSNs independent from and regardless of other
constituents, this paper presents an Energy Driven Architecture (EDA) as a new
architecture and indicates a novel approach for minimising the total energy
consumption of a WS
Coverage Protocols for Wireless Sensor Networks: Review and Future Directions
The coverage problem in wireless sensor networks (WSNs) can be generally
defined as a measure of how effectively a network field is monitored by its
sensor nodes. This problem has attracted a lot of interest over the years and
as a result, many coverage protocols were proposed. In this survey, we first
propose a taxonomy for classifying coverage protocols in WSNs. Then, we
classify the coverage protocols into three categories (i.e. coverage aware
deployment protocols, sleep scheduling protocols for flat networks, and
cluster-based sleep scheduling protocols) based on the network stage where the
coverage is optimized. For each category, relevant protocols are thoroughly
reviewed and classified based on the adopted coverage techniques. Finally, we
discuss open issues (and recommend future directions to resolve them)
associated with the design of realistic coverage protocols. Issues such as
realistic sensing models, realistic energy consumption models, realistic
connectivity models and sensor localization are covered
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
AM-DisCNT: Angular Multi-hop DIStance based Circular Network Transmission Protocol for WSNs
The nodes in wireless sensor networks (WSNs) contain limited energy
resources, which are needed to transmit data to base station (BS). Routing
protocols are designed to reduce the energy consumption. Clustering algorithms
are best in this aspect. Such clustering algorithms increase the stability and
lifetime of the network. However, every routing protocol is not suitable for
heterogeneous environments. AM-DisCNT is proposed and evaluated as a new energy
efficient protocol for wireless sensor networks. AM-DisCNT uses circular
deployment for even consumption of energy in entire wireless sensor network.
Cluster-head selection is on the basis of energy. Highest energy node becomes
CH for that round. Energy is again compared in the next round to check the
highest energy node of that round. The simulation results show that AM-DisCNT
performs better than the existing heterogeneous protocols on the basis of
network lifetime, throughput and stability of the system.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
Energy Efficient Mobile Sink Based Routing Model For Maximizing Lifetime of Wireless Sensor Network
Recently, wide adoption of wireless sensor networks (WSNs) has been seen for provision real-time and non-real-time application services. Provisioning these application service requires energy efficient routing design for WSN. Clustering technique is an efficient mechanism that plays a major role in minimizing energy dissipation of WSN. However, the existing model are designed considering minimizing energy consumption of sensor device considering homogenous. However, it incurs energy overhead among cluster head. Further, maximizing coverage time is not considered by exiting clustering approach considering heterogeneous network affecting lifetime performance. For overcoming issues of routing data packets in WSN, mobile sink has been used. Here, the sensor device will transmit packet in multihop fashion to the rendezvous and the mobile sink will move towards rendezvous points (RPs) to collect data, as opposed to all nodes. However, the exiting model designed so far incurs packet delay (latency) and energy (storage) overhead among sensor device. For overcoming research challenges, this work present energy efficient mobile sink based routing model for maximizing lifetime of wireless sensor network. Experiment are conducted to evaluate the performance of proposed model shows significant performance in terms of communication, routing overhead and lifetime of sensor network
Resource Management in Heterogeneous Wireless Sensor Networks
We propose a first approach in the direction of a general framework for resource management in wireless sensor networks (WSN). The basic components of the approach are a model for WSNs and a task model. Based on these models, a first version of an algorithm for assigning tasks to a WSN is presented. The models and the algorithm are designed in such a way that an extension to more complex models is possible. Furthermore, the developed approach to solve the RM problem allows an easy adaptation, to fit more complex models. In this way, a flexible approach is achieved, which may form the base for many RM approaches.\ud
The possibilities and limitations of the presented approach are tested on randomly generated instances. The aim of these tests is to show that the chosen models and algorithm form a proper starting point to design RM tools
- …