This paper considers a heterogeneous network of energy constrained sensors deployed over a region. Each
Normal sensor node in a network is systematically gathering and transmitting sensed data to the clusterhead,
and then cluster head sending data to a base station (via intermediate cluster- heads). This paper
focuses on reducing the energy consumption and hence improving lifetime of wireless sensor Networks.
Clustering sensor node is an effective topology for the energy constrained networks. So energy saving
algorithm has been developed in which clusters are formed considering a subset of high energy nodes as a
cluster-head and another subset of powerful nodes is ask to go to sleep. When Cluster heads deplete their
energy another subset of nodes becomes active and acts as a cluster head. Proposed approach is
implemented in MATLAB, Simulation results shows that it can prolong the network lifetime than LEACH
protocol, and achieves better performance than the existing clustering algorithms such as LEACH.
Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitiv...paperpublications3
Abstract: In WSN, sensor nodes have limited energy budget therefore this paper mainly focus on power saving by using the docition paradigm. Docition is a new teacher-student paradigm proposed to improve cognitive radio. Although it improves the infrastruc¬ture based networks it has a weakness in case of ad-hoc mobile net¬works. The energy constraints and the total mobility of the net¬work complicate the selection of the appropriate teacher for a student. By selecting the wrong teacher, there is a high probabil¬ity that the taught information may be faulty, and thus the student radio diverges from the best state. This causes a high amount of energy loss, though the most important concern in ad-hoc networks is energy limitation. In this paper, we propose a dynamic docition for teacher selection based on the auto-correla¬tion degree of the teacher’s candidate environment and the cross-correlation degree between the teacher candidate and the student environments. We validate our approach in the context of coexist¬ence between WSN and WiFi. The WSN detects, models and exploits the unused time slots in the electromagnetic spectrum, left by WiFi, using dynamic docition. The simulation results show that the use of dynamic docition outperforms the existing docition in mobile networks. The improvements are shown through the low link overhead percentage (20% less overhead) and the low packet loss ratio (30% improvement).
Keywords: Docitive; Online Prediction Problem; WSN; pareto model; IEEE802.11 b/g;cognitive radio.
Title: Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitive WSN
Author: Dr. Charbel Nicolas
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Net...IJASCSE
Energy efficiency is the most important issue in all facets of wireless sensor networks (WSNs) operations because of the limited and non-replenish able energy supply. The data aggregation mechanism is one of the possible solutions to prolong the lifetime of sensor nodes and on the other hand it also helps in eliminating the data redundancy and improving the accuracy of information gathering, is essential for WSNs. In this paper we propose a Clustering based lifetime maximizing aggregation tree (CLMAT) in which we create aggregation tree which aim to reduce energy consumption.
Virtual backbone trees for most minimalIJCNCJournal
Virtual backbone trees have been used for efficient communication between sink node and any other node
in the deployed area. But all the proposed virtual backbone trees are not fully energy efficient and EVBTs
have few flaws associated with them. In this paper two such virtual backbones are proposed. The motive
behind the first algorithm, Most Minimal Energy Virtual Backbone Tree (MMEVBT), is to minimise the
energy consumption when packets are transmitted between sink and a target sensor node. The energy
consumption is most minimal and optimal and it is shown why it always has minimal energy consumption
during any transfer of packet between every node with the sink node. For every node, route path with most
minimal energy consumption is identified and a new tree node is elected only when a better minimal energy
consumption route is identified for a node to communicate with the sink and vice versa. By moving sink
periodically it is ensured the battery of the nodes near sink is not completely drained out. Another
backbone construction algorithm is proposed which maximises the network lifetime by increasing the
lifetime of all tree nodes. Simulations are done in NS2 to practically test the algorithms and the results are
discussed in detail.
Wireless Ad Hoc Networks comprise a fast developing research area with a vast spectrum of
applications. Wireless sensor network systems enable the reliable monitoring of a variety of environments
for both civil and military applications. The Energy efficiency continues to be a key factor in limiting the
deployability of ad-hoc networks. Deploying an energy efficient system exploiting the maximum lifetime
of the network has remained a great challenge since years. The time period from the instant at which the
network starts functioning to the time instant at which the first network node runs out of energy, i.e. the
network lifetime is largely dependent on the system energy efficiency. In this paper, we look at energy
efficient protocols, which can have significant impact on the lifetime of these networks. The cluster heads
get drain out maximum energy in the wireless ad hoc networks. We propose an algorithm that deals with
minimizing the rate of dissipation of energy of cluster heads. The algorithm LEAD deals with energy
efficient round scheduling of cluster head allocation of nodes and then followed by allocation of nodes to
the cluster heads maximizing network lifetime using ANDA [1, 2]. We compare our results with the
previous works.
This paper considers a heterogeneous network of energy constrained sensors deployed over a region. Each
Normal sensor node in a network is systematically gathering and transmitting sensed data to the clusterhead,
and then cluster head sending data to a base station (via intermediate cluster- heads). This paper
focuses on reducing the energy consumption and hence improving lifetime of wireless sensor Networks.
Clustering sensor node is an effective topology for the energy constrained networks. So energy saving
algorithm has been developed in which clusters are formed considering a subset of high energy nodes as a
cluster-head and another subset of powerful nodes is ask to go to sleep. When Cluster heads deplete their
energy another subset of nodes becomes active and acts as a cluster head. Proposed approach is
implemented in MATLAB, Simulation results shows that it can prolong the network lifetime than LEACH
protocol, and achieves better performance than the existing clustering algorithms such as LEACH.
Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitiv...paperpublications3
Abstract: In WSN, sensor nodes have limited energy budget therefore this paper mainly focus on power saving by using the docition paradigm. Docition is a new teacher-student paradigm proposed to improve cognitive radio. Although it improves the infrastruc¬ture based networks it has a weakness in case of ad-hoc mobile net¬works. The energy constraints and the total mobility of the net¬work complicate the selection of the appropriate teacher for a student. By selecting the wrong teacher, there is a high probabil¬ity that the taught information may be faulty, and thus the student radio diverges from the best state. This causes a high amount of energy loss, though the most important concern in ad-hoc networks is energy limitation. In this paper, we propose a dynamic docition for teacher selection based on the auto-correla¬tion degree of the teacher’s candidate environment and the cross-correlation degree between the teacher candidate and the student environments. We validate our approach in the context of coexist¬ence between WSN and WiFi. The WSN detects, models and exploits the unused time slots in the electromagnetic spectrum, left by WiFi, using dynamic docition. The simulation results show that the use of dynamic docition outperforms the existing docition in mobile networks. The improvements are shown through the low link overhead percentage (20% less overhead) and the low packet loss ratio (30% improvement).
Keywords: Docitive; Online Prediction Problem; WSN; pareto model; IEEE802.11 b/g;cognitive radio.
Title: Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitive WSN
Author: Dr. Charbel Nicolas
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Net...IJASCSE
Energy efficiency is the most important issue in all facets of wireless sensor networks (WSNs) operations because of the limited and non-replenish able energy supply. The data aggregation mechanism is one of the possible solutions to prolong the lifetime of sensor nodes and on the other hand it also helps in eliminating the data redundancy and improving the accuracy of information gathering, is essential for WSNs. In this paper we propose a Clustering based lifetime maximizing aggregation tree (CLMAT) in which we create aggregation tree which aim to reduce energy consumption.
Virtual backbone trees for most minimalIJCNCJournal
Virtual backbone trees have been used for efficient communication between sink node and any other node
in the deployed area. But all the proposed virtual backbone trees are not fully energy efficient and EVBTs
have few flaws associated with them. In this paper two such virtual backbones are proposed. The motive
behind the first algorithm, Most Minimal Energy Virtual Backbone Tree (MMEVBT), is to minimise the
energy consumption when packets are transmitted between sink and a target sensor node. The energy
consumption is most minimal and optimal and it is shown why it always has minimal energy consumption
during any transfer of packet between every node with the sink node. For every node, route path with most
minimal energy consumption is identified and a new tree node is elected only when a better minimal energy
consumption route is identified for a node to communicate with the sink and vice versa. By moving sink
periodically it is ensured the battery of the nodes near sink is not completely drained out. Another
backbone construction algorithm is proposed which maximises the network lifetime by increasing the
lifetime of all tree nodes. Simulations are done in NS2 to practically test the algorithms and the results are
discussed in detail.
Wireless Ad Hoc Networks comprise a fast developing research area with a vast spectrum of
applications. Wireless sensor network systems enable the reliable monitoring of a variety of environments
for both civil and military applications. The Energy efficiency continues to be a key factor in limiting the
deployability of ad-hoc networks. Deploying an energy efficient system exploiting the maximum lifetime
of the network has remained a great challenge since years. The time period from the instant at which the
network starts functioning to the time instant at which the first network node runs out of energy, i.e. the
network lifetime is largely dependent on the system energy efficiency. In this paper, we look at energy
efficient protocols, which can have significant impact on the lifetime of these networks. The cluster heads
get drain out maximum energy in the wireless ad hoc networks. We propose an algorithm that deals with
minimizing the rate of dissipation of energy of cluster heads. The algorithm LEAD deals with energy
efficient round scheduling of cluster head allocation of nodes and then followed by allocation of nodes to
the cluster heads maximizing network lifetime using ANDA [1, 2]. We compare our results with the
previous works.
ENERGY EFFICIENT ROUTING ALGORITHM FOR MAXIMIZING THE MINIMUM LIFETIME OF WIR...ijasuc
In wireless sensor network, devices or nodes are generally battery powered devices. These nodes have
limited amount of initial energy that are consumed at different rates, depending on the power level. The
lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper
different type of energy efficient routing algorithms are discussed and approach of these algorithms is to
maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for
algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow
path for data transmission and gives the optimum results. Advantages, limitations as well as comparative
study of these algorithms are also discussed in this paper.
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
QUAD TREE BASED STATIC MULTI HOP LEACH ENERGY EFFICIENT ROUTING PROTOCOL: A N...IJCNCJournal
This research work propounds a simple graph theory semblance Divide and Conquer Quad tree based Multi-hop Static Leach (DCQMS-Leach) energy efficient routing protocol for wireless sensor networks. The pivotal theme of this research work is to demonstrate how divide and conquer plays a pivotal role in a multi-hop static leach energy efficient routing protocol. This research work motivates, enforces, reckons the DCQMS-Leach energy efficient routing protocol in wireless sensor networks using Mat lab simulator.This research work also computes the performance concepts of DCQMS-Leach routing protocol using various performance metrics such as Packet Drop Rate (PDR), Throughput, and End to End Delay (EED) by comparing and contrasting alive nodes with number of nodes, number of each packets sent to the cluster heads with rounds, number of cluster heads with rounds, number of packets forwarded to the base station with rounds and finally dead nodes with number of rounds. In order to curtail energy consumption this research work proffers a routing methodology such as DCQMS-Leach in energy efficient wireless,sensor routing protocol. The recommended DCQMS-Leach overcomes the in adequacies of all other different leach protocols suggested by the previous researchers.
The Energy hole problem is a major problem of
data collection in wireless sensor networks. The sensors near the
static sink serve as relays for remote sensors, which reduce their
energy rapidly, causing energy holes in the sensor field. This
project has proposed a customizable mobile sink based adaptive
protected energy efficient clustering protocol (MSAPEEP) for
improvement of the problem of energy holes along with that we
also characterize and made comparison with the previous
existing protocols. A MSAPEEP uses the adaptive protected
method (APM) to discover the best possible number of cluster
heads (CHs) to get better life span and constancy time of the
network. The effectiveness of MSAPEEP is compared with
previous protocols; specifically, low energy adaptive clustering
hierarchy (LEACH) and mobile sink enhanced energy efficient
PEGASIS based routing protocol using network simulator(NS2).
Examples of simulation result show that MSAPEEP is more
reliable and removes the potential of energy hole and enhances
the stability and life span of the wireless sensor network(WSN).
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
Energy Efficient Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
The Underwater Sensor Network (UWSN) is main interesting area due to its most valuable
applications like: disaster preventions, distributed tactical surveillance, undersea exploration, seismic
monitoring, environmental monitoring and many more. The design of energy efficient routing protocol
however is a challenging issue because in underwater environment the batteries of the sensor nodes
cannot be recharged easily. Majority of the researchers have adapted the terrestrial WSN methodologies
to overcome this problem but in underwater environment the terrestrial WSN approach is not feasible due
to the acoustic signaling and water current. This research paper focuses the key limitation of the current
energy efficient routing protocols. The simulation results with comparative analysis for energy efficient
routing protocols are also presented in this research article; which helps the researchers to find the further
research gap in the field of energy efficient routing protocols.
EFFECT OF DUTY CYCLE ON ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORKSIJCNC
Most studies define a common duty cycle value throughout the wireless sensor networks (WSNs) to
achieve synchronization among the nodes. On the other hand, a few studies proposed adaptation of the
duty cycle according to uniform traffic conditions to decrease the energy consumption and latency. In
this paper, the lifetime of the nodes based on overall energy consumption are estimated and the effect of
duty cycle on expected energy consumption is studied. The proposed scheme is compared with a standard
scheme and is shown to perform significantly better for sufficient node density.
FTTCP: Fault Tolerant Two-level Clustering Protocol for WSNIDES Editor
In this paper, we propose an agreement-based fault
detection and recovery protocol for cluster head (CH) in
wireless sensor networks (WSNs) of two level cluster
hierarchy. The aim of protocol is to accurately detect CH
failure to avoid unnecessary energy consumption caused by a
mistaken detection process. For this, it allows each cluster
member to detect its CH failure independently. Cluster
members employ distributed agreement protocol to reach an
agreement on failure of the CH among multiple cluster
members. The detection process runs concurrently with
normal network operation by periodically performing a
distributed detection process at each cluster member To
reduce energy consumption, it makes use of heartbeat
messages sent periodically by a CH for fault detection.
Simulation results show, our protocol provides high detection
accuracy because of agreement protocol.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
ENERGY EFFICIENT GRID AND TREE BASED ROUTING PROTOCOLijwmn
In Wireless Sensor Network, a large number of sensor nodes are deployed and they mainly consume energy
in transmitting data over long distances. Sensor nodes are battery powered and their energy is restricted.
Since the location of the sink is remote, considerable energy would be consumed if each node directly
transmits data to the base station. Aggregating data at the intermediate nodes and transmitting using multihops
aids in reducing energy consumption to a great extent. This paper proposes a hybrid protocol
“Energy efficient Grid and Tree based routing protocol” (EGT) in which the sensing area is divided into
grids. The nodes in the grid relay data to the cell leader which aggregates the data and transmits to the
sink using the constructed hop tree. Simulation results show that EGT performs better than LEACH.
July 2012
You will hear about a device developed at LLNL that creates a new mechanism for energy harvesting. Harvesting electrical energy from chemical molecules enables a host of application areas.
ENERGY EFFICIENT ROUTING ALGORITHM FOR MAXIMIZING THE MINIMUM LIFETIME OF WIR...ijasuc
In wireless sensor network, devices or nodes are generally battery powered devices. These nodes have
limited amount of initial energy that are consumed at different rates, depending on the power level. The
lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper
different type of energy efficient routing algorithms are discussed and approach of these algorithms is to
maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for
algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow
path for data transmission and gives the optimum results. Advantages, limitations as well as comparative
study of these algorithms are also discussed in this paper.
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
QUAD TREE BASED STATIC MULTI HOP LEACH ENERGY EFFICIENT ROUTING PROTOCOL: A N...IJCNCJournal
This research work propounds a simple graph theory semblance Divide and Conquer Quad tree based Multi-hop Static Leach (DCQMS-Leach) energy efficient routing protocol for wireless sensor networks. The pivotal theme of this research work is to demonstrate how divide and conquer plays a pivotal role in a multi-hop static leach energy efficient routing protocol. This research work motivates, enforces, reckons the DCQMS-Leach energy efficient routing protocol in wireless sensor networks using Mat lab simulator.This research work also computes the performance concepts of DCQMS-Leach routing protocol using various performance metrics such as Packet Drop Rate (PDR), Throughput, and End to End Delay (EED) by comparing and contrasting alive nodes with number of nodes, number of each packets sent to the cluster heads with rounds, number of cluster heads with rounds, number of packets forwarded to the base station with rounds and finally dead nodes with number of rounds. In order to curtail energy consumption this research work proffers a routing methodology such as DCQMS-Leach in energy efficient wireless,sensor routing protocol. The recommended DCQMS-Leach overcomes the in adequacies of all other different leach protocols suggested by the previous researchers.
The Energy hole problem is a major problem of
data collection in wireless sensor networks. The sensors near the
static sink serve as relays for remote sensors, which reduce their
energy rapidly, causing energy holes in the sensor field. This
project has proposed a customizable mobile sink based adaptive
protected energy efficient clustering protocol (MSAPEEP) for
improvement of the problem of energy holes along with that we
also characterize and made comparison with the previous
existing protocols. A MSAPEEP uses the adaptive protected
method (APM) to discover the best possible number of cluster
heads (CHs) to get better life span and constancy time of the
network. The effectiveness of MSAPEEP is compared with
previous protocols; specifically, low energy adaptive clustering
hierarchy (LEACH) and mobile sink enhanced energy efficient
PEGASIS based routing protocol using network simulator(NS2).
Examples of simulation result show that MSAPEEP is more
reliable and removes the potential of energy hole and enhances
the stability and life span of the wireless sensor network(WSN).
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
Energy Efficient Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
The Underwater Sensor Network (UWSN) is main interesting area due to its most valuable
applications like: disaster preventions, distributed tactical surveillance, undersea exploration, seismic
monitoring, environmental monitoring and many more. The design of energy efficient routing protocol
however is a challenging issue because in underwater environment the batteries of the sensor nodes
cannot be recharged easily. Majority of the researchers have adapted the terrestrial WSN methodologies
to overcome this problem but in underwater environment the terrestrial WSN approach is not feasible due
to the acoustic signaling and water current. This research paper focuses the key limitation of the current
energy efficient routing protocols. The simulation results with comparative analysis for energy efficient
routing protocols are also presented in this research article; which helps the researchers to find the further
research gap in the field of energy efficient routing protocols.
EFFECT OF DUTY CYCLE ON ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORKSIJCNC
Most studies define a common duty cycle value throughout the wireless sensor networks (WSNs) to
achieve synchronization among the nodes. On the other hand, a few studies proposed adaptation of the
duty cycle according to uniform traffic conditions to decrease the energy consumption and latency. In
this paper, the lifetime of the nodes based on overall energy consumption are estimated and the effect of
duty cycle on expected energy consumption is studied. The proposed scheme is compared with a standard
scheme and is shown to perform significantly better for sufficient node density.
FTTCP: Fault Tolerant Two-level Clustering Protocol for WSNIDES Editor
In this paper, we propose an agreement-based fault
detection and recovery protocol for cluster head (CH) in
wireless sensor networks (WSNs) of two level cluster
hierarchy. The aim of protocol is to accurately detect CH
failure to avoid unnecessary energy consumption caused by a
mistaken detection process. For this, it allows each cluster
member to detect its CH failure independently. Cluster
members employ distributed agreement protocol to reach an
agreement on failure of the CH among multiple cluster
members. The detection process runs concurrently with
normal network operation by periodically performing a
distributed detection process at each cluster member To
reduce energy consumption, it makes use of heartbeat
messages sent periodically by a CH for fault detection.
Simulation results show, our protocol provides high detection
accuracy because of agreement protocol.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
ENERGY EFFICIENT GRID AND TREE BASED ROUTING PROTOCOLijwmn
In Wireless Sensor Network, a large number of sensor nodes are deployed and they mainly consume energy
in transmitting data over long distances. Sensor nodes are battery powered and their energy is restricted.
Since the location of the sink is remote, considerable energy would be consumed if each node directly
transmits data to the base station. Aggregating data at the intermediate nodes and transmitting using multihops
aids in reducing energy consumption to a great extent. This paper proposes a hybrid protocol
“Energy efficient Grid and Tree based routing protocol” (EGT) in which the sensing area is divided into
grids. The nodes in the grid relay data to the cell leader which aggregates the data and transmits to the
sink using the constructed hop tree. Simulation results show that EGT performs better than LEACH.
July 2012
You will hear about a device developed at LLNL that creates a new mechanism for energy harvesting. Harvesting electrical energy from chemical molecules enables a host of application areas.
PERFORMANCE EVALUATION OF SOCIAL NETWORK ANALYSIS ALGORITHMS USING DISTRIBUTE...Journal For Research
Analysis on Social Networking sites such as Facebook, Flickr and Twitter has long been a trending topic of fascination for data analysts, researchers and enthusiasts in the recent years to maximize the value of knowledge acquired from processing and analysis of the data. Apache Spark is an Open-source data-parallel computation engine that offers faster solutions compared to traditional Map-Reduce engines such as Apache Hadoop. This paper discusses the performance evaluation of Apache Spark for analyzing social network data. The performance of analysis varies significantly based on the algorithms being implemented. This is the reason to what makes this analysis worthwhile of evaluation with respect to their versatility and diverse nature in the dynamic field of Social Network Analysis. We compare performance of Apache Spark by evaluating the performance using various algorithms (PageRank, Connected Components, Counting Triangle, K-Means and Cosine Similarity) making efficient use of the Spark cluster.
DESIGN & ANALYSIS OF RF ENERGY HARVESTING SYSTEM FOR CHARGING LOW POWER DEVICESJournal For Research
Finite electrical battery life is encouraging the companies and researchers to come up with new ideas and technologies to drive wireless mobile devices for an infinite or enhance period of time. Common resource constrained wireless devices when they run out of battery they should be recharged. For that purpose main supply & charger are needed to charge drained mobile phone batteries or any portable devices. Practically it is not possible to carry charger wherever we go and also to expect availability of power supply everywhere. To avoid such disadvantages some sort of solution should be given and that can be wireless charging of mobile phones.[4] If the mobile can receive RF power signals from the mobile towers, why can’t we extract the power from the received signals? This can be done by the method or technology called RF energy harvesting. RF energy harvesting holds a promise able future for generating a small amount of electrical power to drive partial circuits in wirelessly communicating electronics devices. RF power harvesting is one of the diverse fields where still research continues. The energy of RF waves used by devices can be harvested and used to operate in more effective and efficient way.
Cognitive Small Cell Networks:Energy Efficiency and Trade-Offssabbir ahmed
Because of growing environmental awareness and the high price of energy, it is crucial to design energy efficient wireless systems for both macrocells and small cells.
In future heterogeneous networks, cognitive capabilities will become essential not only for the energy efficient operation of the small cell tier, but also to overcome coexistence issues in multi-tier networks.
Motivation of this work is:
The deployment of energy efficient and spectral efficient heterogeneous networks.
Formulate the trade-off between energy consumption and throughput/capacity as a set of optimization problems.
The Presentation Video
https://www.youtube.com/watch?v=5GiiIppb2o4&feature=youtu.be
*Contents
1-Challenges in Wireless Communication
2-Multipath andFading
3-MIMO and Diversity
4-Receive Diversity /Maximum ratio combining (MRC)
5-MIMO Evolution
6- Coordinated Multi point (CoMP)
7-Level of Cooperation and Architecture
8-CoMP System Model
A WSN primary outline issue for a sensor system is protection of the vitality accessible at every sensor node. We propose to convey different, versatile base stations to delay the lifetime of the sensor system. We split the lifetime of the sensor system into equivalent stretches of time known as rounds. Base stations are migrated toward the begin of a round. Our strategy utilizes a whole number straight program to focus new areas for the base stations and in view of steering convention to guarantee vitality proficient directing amid every round. We propose four assessment measurements and look at our answer utilizing these measurements. Taking into account the reproduction results we demonstrate that utilizing various, versatile base stations as per the arrangement given by our plans would altogether expand the lifetime of the sensor system.
Analysis and reactive measures on the blackhole attackJyotiVERMA176
In this , we will analyses the effects of black-hole attacks on SW-WSN.
Active attack such as black-hole attack in which the node shows that it has the best smallest path
tp desired node in the given Networks even if it lacks it,hence all the data packets follows that
fake path through it hence make black-hole node to forward or drop the packet during the data
transmission.
MPC-EAR : Maximal Power Conserved And Energy Aware Routing in Ad hoc Networksijsrd.com
Power preservation in wireless ad hoc networks is a decisive factor as energy resources are inadequate at the electronic devices in use. Power-aware routing strategies are fundamentally route selection strategies built on accessible ad hoc routing protocols. This paper proposed a new Maximal Power Conserved And Energy Aware Routing (MPC-EAR ) topology for mobile ad hoc networks that enhances the network life span. Simulation results prove that the projected protocol has a higher performance other minimal energy usage, energy level aware and energy conserving routing protocols such as MTPR, MMECR and CMMECR.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
in the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Design Optimization of Energy and Delay Efficient Wireless Sensor Network wit...IOSR Journals
Abstract: In WSN sensors are randomly deployed in the sensor field which brings the coverage problem and limited energy resources. Hence energy and coverage problem are very scarce resources for such sensor systems and has to be managed wisely in order to extend the life of the sensors and maximizing coverage for the duration of a particular mission. In past a lot of cluster based algorithm and techniques were used. In this paper we propose combination of PSO based algorithm and cluster based Least Spanning Tree algorithm, which are very effective alone for WSN, and we also obtain life of sensor node and data transmission by LST based PSO algorithm. These techniques effectively overcome the problems of low energy and coverage of sensor range. Keywords: Energy efficient clustering, Least Spanning Tree algorithm, PSO algorithm, Wireless Sensor Networks.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
A survey on Energy Efficient ProtocolsLEACH, Fuzzy-based approach and Neural ...IJEEE
Wireless Sensor Networks (WSN) plays a very important role in transmitting the data from source to destination but energy consumption is one of the major challenges in these networks. WSN consists of hundreds to thousands of nodes which consume energy while transmitting the information and with a span of time whole energy get consumed and network life time gets reduced. Clustering and Cluster head (CH) selection are important parameters used to enhance the lifetime of the WSN. Clustering use two methods: rotating CH periodically in every round to distribute the energy consumption among nodes and the node with more residual energy becomes CH.This research paper is focused on the performance of the techniques used to enhance the energy efficiency in Wireless Sensor Networks (WSNs). Low- Energy Adaptive Clustering Hierarchy (LEACH), Fuzzy- Based and Neural Network are some of the important techniques used. MATLAB simulation tool is considered in this paper.
Prolong Lifetime Analysis and Efficient Utilization of Energy in Heterogeneou...IJTET Journal
Abstract - The clustering-based protocols are believed to be the best for heterogeneous wireless sensor networks (WSNs). The evaluation is based on two new clustering-based protocols, which are called single-hop energy-efficient clustering protocol (S-EECP) and multi-hop energy-efficient clustering protocol (M-EECP) [1]. In S-EECP, the cluster heads (CHs) are elected by a weighted probability [2] based on the ratio between average energy of the network and residual energy of each node. The nodes having more initial energy and residual energy will have more chances to be elected as CHs than nodes with low energy. In M-EECP, the election of CHs is same as S-EECP, but the elected CHs communicate the data packets to the base station via multi-hop communication approach. To analyze the network lifetime three types of sensor nodes equipped with different battery energy are assumed. By analyzing these parameters, M-EECP achieves load balance among the CHs better than the existing clustering protocols and gives prolong network lifetime. Here the simulation is based on ns-2 simulator.
Wireless sensor networks have recently come into prominence because they hold the
potential to revolutionize many segments. The Wireless Sensor Network (WSN) is made up of a
collection of sensor nodes, which were small energy constrained devices. Routing technique is one of
the research area in wireless sensor network. So by designing an efficient routing protocol for
reducing energy consumption is the important factor. In this paper, a brief introduction to routing
challenges in WSN have been mentioned. This paper also provides the basic classification of routing
protocols in WSNs along with the most energy efficient protocol named LEACH along with its
advantages and disadvantages. This paper also focus on some of the improved version of LEACH
protocol.
Similar to Energy Harvesting-aware Design for Wireless Nanonetworks (20)
Comparing the Archival Rate of Arabic, English, Danish, and Korean Language W...Michele Weigle
Based on work published in ACM Transactions on Information Systems (TOIS), 36(1), July 2017 by Lulwah Alkwai, Michael L. Nelson, and Michele C. Weigle
Presented at ACM SIGIR 2019 on July 24, 2019 by Michele C. Weigle
WS-DL’s Work towards Enabling Personal Use of Web ArchivesMichele Weigle
Talk given at Library of Congress by Michele C. Weigle (@weiglemc)
December 18, 2018
Web Science and Digital Libraries (WS-DL) Research Group (@WebSciDL)
Old Dominion University
Norfolk, VA
Keynote talk presented at Web Archiving and Digital Libraries (WADL) 2018
June 6, 2018 - Fort Worth, TX
Michele C. Weigle (@weiglemc)
Web Science and Digital Libraries (WS-DL) Research Group (@WebSciDL)
Old Dominion University
Norfolk, VA
My academic story as told through the Internet Archive's Wayback Machine.
Slides from my keynote presentation at the Southeast Women in Computing Conference, November 16, 2013
Full talk slides at http://www.slideshare.net/mweigle/telling-stories-with-web-archives
A Retasking Framework For Wireless Sensor NetworksMichele Weigle
Presented by Yang He
Military Communications Conference (MILCOM)
October 6-8, 2014
Baltimore, MD
Michael Ruffing, Yang He, Jason Hallstrom, Mat Kelly, Stephan Olariu and Michele C. Weigle, "A Retasking Framework For Wireless Sensor Networks," In Proceedings of the Military Communications Conference (MILCOM). Baltimore, MD, October 2014.
Strategies for Sensor Data Aggregation in Support of Emergency ResponseMichele Weigle
Presented by Xianping Wang
Military Communications Conference (MILCOM)
October 6-8, 2014
Baltimore, MD
Xianping Wang, Aaron Walden, Michele C. Weigle and Stephan Olariu, "Strategies for Sensor Data Aggregation in Support of Emergency Response," In Proceedings of the Military Communications Conference (MILCOM). Baltimore, MD, October 2014.
Presented by Michele C. Weigle, June 4, 2015
Columbia University Web Archiving Collaboration: New Tools and Models
Work by Yasmin AlNoamany, Michele C. Weigle, and Michael L. Nelson
What's Grad School All About?
Capital Region Celebration of Women in Computing (CAPWIC), Harrisonburg, VA
February 27, 2015
Presented by Michele Weigle
Archive What I See Now - 2014 NEH ODH OverviewMichele Weigle
"Archive What I See Now": Bringing Institutional Web Archiving Tools to the Individual Researcher
Slides from 2014 NEH ODH Project Directors' Meeting
September 15, 2014
Michele C. Weigle, Michael L. Nelson, Liza Potts
"Archive What I See Now" - NEH ODH overviewMichele Weigle
"Archive What I See Now": Bringing Institutional Web Archiving Tools to the Individual Researcher
Slides from shutdown-cancelled NEH ODH Project Directors' Meeting (originally scheduled for Oct 4, 2013)
Michele C. Weigle and Michael L. Nelson
TDMA Slot Reservation in Cluster-Based VANETsMichele Weigle
Mohammad Almalag's PhD Defense Slides
Department of Computer Science
Old Dominion University
April 3, 2013
Note: You may need to download the file to see all of the animations.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024Neo4j
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
Energy Harvesting-aware Design for Wireless Nanonetworks
1. Shahram Mohrehkesh
PhD Dissertation
Advisor: Dr. Michele C. Weigle
May 2015
Department of Computer Science
Old Dominion University
Energy Harvesting-aware Design for
Wireless Nanonetworks
1
2. • Introduction
• Nanonode, Nanonetworks, …
• Applications of nanonetworks
• Communication channels
• Energy harvesting in nanonetworks
• Optimizing energy consumption
• Energy harvesting-aware MAC protocol
• Future of nanonetworks
Outline
2
4. • “Mechanical device that performs a useful function
using components of nanometer-scale and defined
molecular structure.” (Eric Drexler, 1991)
Nanoscale Machine
4
• Functions
Computing
Data storing
Sensing
Actuation
Communication
6. Nanonetworks
• Interconnections of nanonodes
• To execute more complex tasks in a distributed fashion
• To overcome individual limitations (e.g., in size, energy,
computation)
6
7. Applications - Adv. Health Monitoring
7
Nanosensors can be used
for:
• Monitoring glucose, sodium,
cholesterol
• Detection of viruses
• Localization of cancerous cellsInterface with
External Networks
Nanonodes
Nanosensors to
measure glucose
8. “Can you imagine if you lost a sock? You could send out a search and
sock No. 3117 would respond that it’s under the couch in the living
room.” (Vint Cerf, 2013)
Applications - Internet of Things
8
Simpler to
integrate
nanonode
with every
thing
9. 9
Nanoantenna
• Made from
– Carbon Nanotube (CNT)
– Graphene Nanoribbon (GNR)
• 1 μm-long nano-antenna resonates in the
Terahertz Band (0.1-10 THz)
• Femtosecond-long pulse emitters and detectors
1-50 nm
CNT
G. W. Hanson, “Fundamental transmitting properties of carbon nanotube antennas,” IEEE
Transactions on Antennas and Propagation, vol. 53, no. 11, pp. 3426–3435, Nov. 2005.
J. M. Jornet and I. F. Akyildiz, “Graphene-based Plasmonic Nano-antennas for Terahertz Band
Communication in Nanonetworks,” IEEE JSAC, Dec. 2013.
10. 10
Path Loss in THz
Path Loss [dB] (10% water vapor molecules)
Almost no
propagation
above a few
meters
Almost 10
THz wide
transmission
window for
distances
much below
one meter
Several
windows tens
of GHz wide
each at around
one meter
Molecular absorption is the main cause of the path loss
J. M. Jornet and I. F. Akyildiz, “Channel Modeling and Capacity Analysis of EM Wireless Nanonetworks in
the Terahertz Band,” IEEE Tran. on Wireless Comm., 2011.
11. 11
Time Spread On-Off Keying (TS-OOK)
“1” “1” “1” “1”“0” “0” “0”
TS TP
… …
A logical “0” is transmitted as
silence
• Ideally no energy is consumed for
transmission
A logical “1” is transmitted as
a pulse
• Pulse length, Tp = 100 femtoseconds
Molecular absorption noise would affect only pulses
J .M. Jornet and I. F. Akyildiz, “Information Capacity of Pulse-based Wireless Nanosensor Networks,” in
Proc. of the 8th Annual IEEE SECON, June 2011.
12. PHY layer- models exist, ongoing research on impl.
Frequency Band (Atakan
2010, Jornet 2010)
Channel Models
(Akkas2012, Jornet 2010, Jornet
2011)
Information
Modulation (Jornet 2011)
Data link layer- early research
Upper layers (>=3)- early research
MAC
Protocols
(Jornet 2012)
Throughput
Evaluation
(Wang 2013)
Potential applications
(industry, medical, …)
(Akyildiz 2010)
Cross Layer
Issues:
- Energy
Harvesting
(Jornet 2012)
- Security &
Privacy
(Dressler 2012)
Energy-aware
Application
Requirements
(Balasubramaniam2013)
13. 13
Research Objectives
1. Model for energy harvesting and consumption
2. Design optimum packet
1. Packet size, code weight, repetition
2. Multi-objective optimization problem
3. Optimal energy consumption policy to
maximize the energy utilization
4. Energy harvesting-aware MAC protocol for
nanonodes
14. • Introduction
– Nanonode, Nanonetworks, …
– Applications of nanonetworks
– Communication channels
• Energy harvesting in nanonetworks
– Optimizing energy consumption
– Energy harvesting-aware MAC protocol
• Future of nanonetworks
Outline
14
15. 15
Energy Harvesting Sources
• Energy arrivals are stochastic
In Nanonetworks:
1. Energy storage is nonlinear.
2. Energy storage is small.
3. Consumption rate is much faster
than harvesting rate.
Mohrehkesh, Weigle, and Das, “Energy Harvesting in Nanonetworks”, book chapter to appear in "Modeling,
Methodologies and Tools for Molecular and Nano-scale Communications”
16. 16
Two Major Challenges in NanoCommunication
• Optimum energy consumption
– Stochastic properties of energy harvesting
– Limited and non-linear energy storage
• Data link layer
– Access to the channel
– Energy status
17. 17
How much energy consumption?
• Time is slotted into unit length
• A set of energy consumption actions is defined
• Several policies
– Aggressive: consume as much as possible
– Conservative: consume a minimum amount , i.e., one
transmission, one reception
– Consume-Harvest (C-H)
– Mean
– Random
Agg Cons C-H Mean Rand
Chance of Being in Out of Energy State H L L M M
Chance of Being in Full Energy State L H H M M
Energy Utilization H L M M M
High, Low, Medium
18. 18
How much energy consumption?
• Solution can be stored as a look-up table
• Heuristic methods are required
– Slow Beginning Fast Ending (SBFE): Combine aggressive and
conservative
– Adaptive: Proportional to the amount of available energy
Markov Decision Process (MDP)- Diagram does not show all states and transitions
Mohrehkesh and Weigle, “Optimizing Communication Energy Consumption in Perpetual Wireless
Nanosensor Networks”, in IEEE GLOBECOM 2013
19. • 𝐸𝐸 = log(
𝐸𝑛𝑒𝑟𝑔𝑦 𝑈𝑡𝑖𝑙
𝑝 𝑒∗𝑝 𝑓
)
19
Energy Efficiency (EE) for Various Policies
Mohrehkesh and Weigle, “Optimizing Energy Consumption in Terahertz Band Nanonetworks” In IEEE JSAC,
Molecular, Biological, and Multi-Scale Communications Series , 2014.
Aggressive
Conservative
Consume-Harvest
Mean
Random
Optimal
SBFE
Adaptive
21. 21
Let's build communication
• We have...
– Characteristics of THz communication
– A simple pulse based modulation (TS-OOK)
– Energy harvesting and consumption model and
policy
• We don't have ...
– Medium Access Control
• Maximize the utilization of harvested energy
• Coordination between nanonodes, i.e., Energy harvesting-
aware
• Scalable, light-weight, and distributed
23. 23
RIH-MAC: Receiver Initiated Harvesting-aware
• Receiver-initiated ...
– Facilitate the development of the energy harvesting-
aware solution
Mohrehkesh and Weigle, “RIH-MAC: Receiver-Initiated Harvesting-aware MAC for NanoNetworks”, in
ACM NANOCOM 2014
R
T
R
DATA
DATA
R
T
R
R
T
R
R
T
RReceiver
Transmitter
R
T
R
24. 24
Centralized RIH-MAC
• Nanocontroller transmits RTR
• What is the probability of
participation p for a nanonode ?
• Assume that a nanonode
– Has energy with probability of q
– Has a DATA packet to transmit
with probability r
• The expected number of concurrent DATA
packets, X, by n nanonodes: 𝐸 𝑋 = 𝑝𝑞𝑟𝑛
• For E[X] =1 => 𝑝 =
1
𝑞𝑟𝑛
Nano-Controller
27. 27
Edge Coloring Algorithm
• Most edge coloring solutions are centralized
• Distributed coloring with (1 + ε) Δ colors
– 0 <ε<1, Δ: degree of graph
– High probability (>99%) of successful coloring
– Coloring process occurs in rounds
– Start with an initial palette of colors for each link
D. A. Grable and A. Panconesi. Nearly optimal distributed edge colouring in O(log log n) rounds. In
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 278- 285,
Philadelphia, PA, USA, 1997.
28. 28
Number of Rounds to Color Edges
• Duration of one round = 2(Δ + 1) slots, with no RTR failure
• Depending on energy harvesting rate, takes several
nanoseconds to several seconds
29. 29
Distributed RIH-MAC
• Direction of communication is indicated based on the
node ID
• After coloring, no collision in
communication for a nanonode
with its neighbors
Cycle
30. 30
Energy Consumption Scheduling
• Receiver-Initiated protocol works perfectly for
the not energy constrained scenario
• In energy constrained scenario ...
– Many RTR packets would be sent with no DATA
packet
– Transmitters may listen for RTR packets but receive
no RTR packets
31. 31
Coordinated Energy Consumption Schedule
(CECS)
• Nanonodes have an
optimal action set for the
amount of energy
consumption (number of
transmissions and
receptions) for various
level of energy
• Rotation after each cycle
• Prediction of CECS of
neighbors
Policy Pattern (5
neighbor)
1 2 3 4 5
0 0 0 0 0 0
1 1 0 0 0 0
2 0 0 1 0 1
3 1 0 1 0 1
4 0 1 1 1 1
>=5 1 1 1 1 1
2 0 0 1 0 1
32. 32
CECS Example- Reception by Node B
Policy Pattern
A C E
0 0 0 0
1 1 0 0
2 1 1 0
>= 3 1 1 1
Policy Pattern
A C E
0 0 0 0
1 1 0 0
2 1 1 0
>= 3 1 1 1
Policy Pattern
A C E
0 0 0 0
1 0 1 0
2 1 1 0
>= 3 1 1 1
Policy Pattern
A C E
0 0 0 0
1 0 1 0
2 1 1 0
>= 3 1 1 1
Successful prediction
Unsuccessful prediction
33. 33
Simulation Setup
Energy Storage Capacity 100 pJ
Energy per pulse (transmission) 1 fJ
Energy per pulse (reception) 0.1 fJ
RTR packet size 25 B
DATA packet size 250 B
Pulse duration 100 fs
Number of Nanonodes 100
• Nano-sim module of NS-3
G. Piro, L. A. Grieco, G. Boggia, and P. Camarda. “Nano-sim: simulating electromagnetic-based
nanonetworks in the network simulator 3”. In Proc. Of Workshop on NS- 3, Cannes, France, Mar. 2013.
34. 34
RTR Success Percentage
Exponential energy model
Mohrehkesh, Weigle, and Das “DRIH-MAC: A Distributed Receiver-Initiated Harvesting-aware MAC for
NanoNetworks”, to appear in IEEE Trans. on Molecular, Biological, and Multi-scale Communications.
37. 37
Contributions
• A model to design the optimal packet
– (IEEE Globecom 2013)
• Optimum energy consumption policy
– (IEEE JSAC 2014)
• Receiver-initiated and energy harvesting-aware
MAC protocol
– (ACM Nanocom 2014, IEEE Trans. on MBMC 2015)
• Models for energy harvesting and consumption
– (Book Chapter, IEEE Comm. Magazine 2015)
38. 38
Future of Nanonetworks
• Near Term
– Improve heuristic policies of
energy consumption
– Evaluation of RIH-MAC in other
application, e.g., Internet of Things
• Long Term
– Challenges in various layers as well
as Cross layer issues
– New applications:
• Nano-robots
• Medical applications, e.g., drug
delivery system
• Wireless Network-on-Chip (WNoC)