353 research outputs found
EDOCR: ENERGY DENSITY ON-DEMAND CLUSTER ROUTING IN WIRELESS SENSOR NETWORKS
Energy management is one of the critical parameters in Wireless Sensor Networks. In this paper we attempt
for a solution to balance the energy usage for maximizing the network lifetime, increase the packet delivery
ratio and throughput. Our proposed algorithm is based on Energy Density of the clusters in Wireless
Sensor Networks. The cluster head is selected using two step method and on-demand routing approach to
calculate the balanced energy shortest path from source to sink. This unique approach maintains the
balanced energy utilization among all nodes by selecting the different cluster heads dynamically. Our
simulation results have compared with one of the plain routing scheme (EBRP) and cluster based routing
(TSCHS), which shows the significant improvements in minimizing the delay and energy utilization and
maximizing the network lifetime and throughput with respect to these works
QoS BASED ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORK
A Wireless Sensor Networks (WSN) is composed of a large number of low-powered
sensor nodes that are randomly deployed to collect environmental data. In a WSN,
because of energy scarceness, energy efficient gathering of sensed information is one
of the most critical issues. Thus, most of the WSN routing protocols found in the
literature have considered energy awareness as a key design issue. Factors like
throughput, latency and delay are not considered as critical issues in these protocols.
However, emerging WSN applications that involve multimedia and imagining sensors
require end-to-end delay within acceptable limits. Hence, in addition to energy
efficiency, the parameters (delay, packet loss ratio, throughput and coverage) have
now become issues of primary concern. Such performance metrics are usually
referred to as the Quality of Service (QoS) in communication systems. Therefore, to
have efficient use of a sensor node’s energy, and the ability to transmit the imaging
and multimedia data in a timely manner, requires both a QoS based and energy
efficient routing protocol. In this research work, a QoS based energy efficient routing
protocol for WSN is proposed. To achieve QoS based energy efficient routing, three
protocols are proposed, namely the QoS based Energy Efficient Clustering (QoSEC)
for a WSN, the QoS based Energy Efficient Sleep/Wake Scheduling (QoSES) for a
WSN, and the QoS based Energy Efficient Mobile Sink (QoSEM) based Routing for a
Clustered WSN.
Firstly, in the QoSEC, to achieve energy efficiency and to prolong
network/coverage lifetime, some nodes with additional energy resources, termed as
super-nodes, in addition to normal capability nodes, are deployed. Multi-hierarchy
clustering is done by having super-nodes (acting as a local sink) at the top tier, cluster
head (normal node) at the middle tier, and cluster member (normal node) at the lowest
tier in the hierarchy. Clustering within normal sensor nodes is done by optimizing the
network/coverage lifetime through a cluster-head-selection algorithm and a
sleep/wake scheduling algorithm. QoSEC resolves the hot spot problem and prolongs
network/coverage lifetime.
Secondly, the QoSES addressed the delay-minimization problem in sleep/wake
scheduling for event-driven sensor networks for delay-sensitive applications. For this
purpose, QoSES assigns different sleep/wake intervals (longer wake interval) to
potential overloaded nodes, according to their varied traffic load requirement defined
a) by node position in the network, b) by node topological importance, and c) by
handling burst traffic in the proximity of the event occurrence node. Using these
heuristics, QoSES minimizes the congestion at nodes having heavy traffic loads and
ultimately reduces end-to-end delay while maximizing the throughput.
Lastly, the QoSEM addresses hot spot problem, delay minimization, and QoS
assurance. To address hot-spot problem, mobile sink is used, that move in the network
to gather data by virtue of which nodes near to the mobile sink changes with each
movement, consequently hot spot problem is minimized. To achieve delay
minimization, static sink is used in addition to the mobile sink. Delay sensitive data is
forwarded to the static sink, while the delay tolerant data is sent through the mobile
sink. For QoS assurance, incoming traffic is divided into different traffic classes and
each traffic class is assigned different priority based on their QoS requirement
(bandwidth, delay) determine by its message type and content. Furthermore, to
minimize delay in mobile sink data gathering, the mobile sink is moved throughout
the network based on the priority messages at the nodes. Using these heuristics,
QoSEM incur less end-to-end delay, is energy efficient, as well as being able to
ensure QoS.
Simulations are carried out to evaluate the performance of the proposed protocols
of QoSEC, QoSES and QoSEM, by comparing their performance with the established
contemporary protocols. Simulation results have demonstrated that when compared
with contemporary protocols, each of the proposed protocol significantly prolong the
network and coverage lifetime, as well as improve the other QoS routing parameters,
such as delay, packet loss ratio, and throughput
CDAR : contour detection aggregation and routing in sensor networks
Wireless sensor networks offer the advantages of low cost, flexible measurement of phenomenon in a wide variety of applications, and easy deployment. Since sensor nodes are typically battery powered, energy efficiency is an important objective in designing sensor network algorithms. These algorithms are often application-specific, owing to the need to carefully optimize energy usage, and since deployments usually support a single or very few applications.
This thesis concerns applications in which the sensors monitor a continuous scalar field, such as temperature, and addresses the problem of determining the location of a contour line in this scalar field, in response to a query, and communicating this information to a designated sink node. An energy-efficient solution to this problem is proposed and evaluated. This solution includes new contour detection and query propagation algorithms, in-network-processing algorithms, and routing algorithms. Only a small fraction of network nodes may be adjacent to the desired contour line, and the contour detection and query propagation algorithms attempt to minimize processing and communication by the other network nodes. The in-network processing algorithms reduce communication volume through suppression, compression and aggregation techniques. Finally, the routing algorithms attempt to route the contour information to the sink as efficiently as possible, while meshing with the other algorithms. Simulation results show that the proposed algorithms yield significant improvements in data and message volumes compared to baseline models, while maintaining the integrity of the contour representation
Unified Role Assignment Framework For Wireless Sensor Networks
Wireless sensor networks are made possible by the continuing improvements in embedded sensor, VLSI, and wireless radio technologies. Currently, one of the important challenges in sensor networks is the design of a systematic network management framework that allows localized and collaborative resource control uniformly across all application services such as sensing, monitoring, tracking, data aggregation, and routing.
The research in wireless sensor networks is currently oriented toward a cross-layer network abstraction that supports appropriate fine or course grained resource controls for energy efficiency. In that regard, we have designed a unified role-based service paradigm for wireless sensor networks. We pursue this by first developing a Role-based Hierarchical Self-Organization (RBSHO) protocol that organizes a connected dominating set (CDS) of nodes called dominators. This is done by hierarchically selecting nodes that possess cumulatively high energy, connectivity, and sensing capabilities in their local neighborhood. The RBHSO protocol then assigns specific tasks such as sensing, coordination, and routing to appropriate dominators that end up playing a certain role in the network.
Roles, though abstract and implicit, expose role-specific resource controls by way of role assignment and scheduling. Based on this concept, we have designed a Unified Role-Assignment Framework (URAF) to model application services as roles played by local in-network sensor nodes with sensor capabilities used as rules for role identification. The URAF abstracts domain specific role attributes by three models: the role energy model, the role execution time model, and the role service utility model. The framework then generalizes resource management for services by providing abstractions for controlling the composition of a service in terms of roles, its assignment, reassignment, and scheduling. To the best of our knowledge, a generic role-based framework that provides a simple and unified network management solution for wireless sensor networks has not been proposed previously
QoS BASED ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORK
A Wireless Sensor Networks (WSN) is composed of a large number of low-powered
sensor nodes that are randomly deployed to collect environmental data. In a WSN,
because of energy scarceness, energy efficient gathering of sensed information is one
of the most critical issues. Thus, most of the WSN routing protocols found in the
literature have considered energy awareness as a key design issue. Factors like
throughput, latency and delay are not considered as critical issues in these protocols.
However, emerging WSN applications that involve multimedia and imagining sensors
require end-to-end delay within acceptable limits. Hence, in addition to energy
efficiency, the parameters (delay, packet loss ratio, throughput and coverage) have
now become issues of primary concern. Such performance metrics are usually
referred to as the Quality of Service (QoS) in communication systems. Therefore, to
have efficient use of a sensor node’s energy, and the ability to transmit the imaging
and multimedia data in a timely manner, requires both a QoS based and energy
efficient routing protocol. In this research work, a QoS based energy efficient routing
protocol for WSN is proposed. To achieve QoS based energy efficient routing, three
protocols are proposed, namely the QoS based Energy Efficient Clustering (QoSEC)
for a WSN, the QoS based Energy Efficient Sleep/Wake Scheduling (QoSES) for a
WSN, and the QoS based Energy Efficient Mobile Sink (QoSEM) based Routing for a
Clustered WSN.
Firstly, in the QoSEC, to achieve energy efficiency and to prolong
network/coverage lifetime, some nodes with additional energy resources, termed as
super-nodes, in addition to normal capability nodes, are deployed. Multi-hierarchy
clustering is done by having super-nodes (acting as a local sink) at the top tier, cluster
head (normal node) at the middle tier, and cluster member (normal node) at the lowest
tier in the hierarchy. Clustering within normal sensor nodes is done by optimizing the
network/coverage lifetime through a cluster-head-selection algorithm and a
sleep/wake scheduling algorithm. QoSEC resolves the hot spot problem and prolongs
network/coverage lifetime.
Secondly, the QoSES addressed the delay-minimization problem in sleep/wake
scheduling for event-driven sensor networks for delay-sensitive applications. For this
purpose, QoSES assigns different sleep/wake intervals (longer wake interval) to
potential overloaded nodes, according to their varied traffic load requirement defined
a) by node position in the network, b) by node topological importance, and c) by
handling burst traffic in the proximity of the event occurrence node. Using these
heuristics, QoSES minimizes the congestion at nodes having heavy traffic loads and
ultimately reduces end-to-end delay while maximizing the throughput.
Lastly, the QoSEM addresses hot spot problem, delay minimization, and QoS
assurance. To address hot-spot problem, mobile sink is used, that move in the network
to gather data by virtue of which nodes near to the mobile sink changes with each
movement, consequently hot spot problem is minimized. To achieve delay
minimization, static sink is used in addition to the mobile sink. Delay sensitive data is
forwarded to the static sink, while the delay tolerant data is sent through the mobile
sink. For QoS assurance, incoming traffic is divided into different traffic classes and
each traffic class is assigned different priority based on their QoS requirement
(bandwidth, delay) determine by its message type and content. Furthermore, to
minimize delay in mobile sink data gathering, the mobile sink is moved throughout
the network based on the priority messages at the nodes. Using these heuristics,
QoSEM incur less end-to-end delay, is energy efficient, as well as being able to
ensure QoS.
Simulations are carried out to evaluate the performance of the proposed protocols
of QoSEC, QoSES and QoSEM, by comparing their performance with the established
contemporary protocols. Simulation results have demonstrated that when compared
with contemporary protocols, each of the proposed protocol significantly prolong the
network and coverage lifetime, as well as improve the other QoS routing parameters,
such as delay, packet loss ratio, and throughput
EDOCR: ENERGY DENSITY ON-DEMAND CLUSTER ROUTING IN WIRELESS SENSOR NETWORKS
ABSTRACT Energy management is one of the critical parameters in Wireless Senso
- …