Wireless Sensor Network (WSN) consists of sensor nodes which interact with each other through physical parameters like sunlight, wind, vibration, humidity etc. Routing protocols provide an optimal data transmission route from sensor nodes to sink node to save energy of nodes. From Base Station (BS) Sensor node sends and receives data to or from wireless stations. Clustering mechanism is one of the popular routing mechanisms used in WSN for optimizing the problem in sensor nodes. There are two types of clustering schemes known as homogeneous schemes and heterogeneous schemes. In Homogeneous scheme initial energy is same for each node but in heterogeneous scheme initial energy is different for each node and also used to determine the efficiency of sensor networks. Enhanced Modified LEACH (EMODLEACH) is a reactive protocol which is implemented for homogeneous network model. We have implemented the concept of Efficient Cluster head Replacement scheme and Dual transmitting power level scheme of MODLEACH along with the concept of Efficient Intra Cluster transmission Scheme of TEEN in LEACH. We analyze the PEGASIS protocol and modified the exiting protocol called improved energy balanced routing protocol (IEBRP).This IEBRP is based on cluster formation, cluster routing and other aspects of LEACH protocol.
Minimize energy per packet (or per bit)
Maximize network lifetime
Routing considering available battery energy
Maximum Total Available Battery Capacity
Minimum Battery Cost Routing (MBCR)
Min– Max Battery Cost Routing (MMBCR)
Conditional Max – Min Battery Capacity Routing (CMMBCR)
Minimize variance in power levels
Minimum Total Transmission Power Routing (MTPR)
The cougar approach to in-network query processing in sensor networksDilini Muthumala
These slides presents the research paper: "The cougar approach to in-network query processing in sensor networks" by Yong Yao and Johannes Gehrke. This presentation was done in a research seminar at the University of Colombo, School of Computing by the uploader.
Wireless Sensor Network (WSN) consists of sensor nodes which interact with each other through physical parameters like sunlight, wind, vibration, humidity etc. Routing protocols provide an optimal data transmission route from sensor nodes to sink node to save energy of nodes. From Base Station (BS) Sensor node sends and receives data to or from wireless stations. Clustering mechanism is one of the popular routing mechanisms used in WSN for optimizing the problem in sensor nodes. There are two types of clustering schemes known as homogeneous schemes and heterogeneous schemes. In Homogeneous scheme initial energy is same for each node but in heterogeneous scheme initial energy is different for each node and also used to determine the efficiency of sensor networks. Enhanced Modified LEACH (EMODLEACH) is a reactive protocol which is implemented for homogeneous network model. We have implemented the concept of Efficient Cluster head Replacement scheme and Dual transmitting power level scheme of MODLEACH along with the concept of Efficient Intra Cluster transmission Scheme of TEEN in LEACH. We analyze the PEGASIS protocol and modified the exiting protocol called improved energy balanced routing protocol (IEBRP).This IEBRP is based on cluster formation, cluster routing and other aspects of LEACH protocol.
Minimize energy per packet (or per bit)
Maximize network lifetime
Routing considering available battery energy
Maximum Total Available Battery Capacity
Minimum Battery Cost Routing (MBCR)
Min– Max Battery Cost Routing (MMBCR)
Conditional Max – Min Battery Capacity Routing (CMMBCR)
Minimize variance in power levels
Minimum Total Transmission Power Routing (MTPR)
The cougar approach to in-network query processing in sensor networksDilini Muthumala
These slides presents the research paper: "The cougar approach to in-network query processing in sensor networks" by Yong Yao and Johannes Gehrke. This presentation was done in a research seminar at the University of Colombo, School of Computing by the uploader.
This slides about Wireless sensor network MAC protocol,
There are bunch of MAC protocol in research field.
It classify the MAC protocol and summarize the feature of typical sensor network MAC protcol
This slides about Wireless sensor network MAC protocol,
There are bunch of MAC protocol in research field.
It classify the MAC protocol and summarize the feature of typical sensor network MAC protcol
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
A gateway based energy efficient multi hop routing protocol for wireless sensor networks (WSNs) is
introduced. The main aim of our paper is to design a protocol which minimizes energy consumption.
Gateway nodes are deployed in sensing field.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
A NOVEL ENERGY EFFICIENCY PROTOCOL FOR WSN BASED ON OPTIMAL CHAIN ROUTINGKhushbooGupta145
Energy Efficiency in Wireless Sensor Network is one of the most significant aspects of routing in these networks. WSN consist of thousands of sensory nodes densely distributed over wide geographical network. As these nodes are deployed in remote areas where recharging is not possible, even if it is possible it will incur high cost. So there is a need of a protocol which facilitates less energy dissipation and thereby enhances the overall performance of the network. We surveyed several protocols such as LEACH, PEGASIS, ACT etc. and concluded that important performance measures are First Node Die (FND), Half Node Alive (HNA) and Last Node Alive (LNA). Values for above mentioned parameters vary for different protocols. In this paper we present a new protocol Energy Efficient Optimal Chain Protocol (EEOC) which outperforms all above mentioned protocols. We compared the results of all these protocols with EEOC and found that with respect to FND, HNA and LNA EEOC performs way better than others.
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.
Sensor Energy Optimization Using Fuzzy Logic in Wireless Sensor NetworkingVIT-AP University
Wireless sensor networks is challenging in that it requires an enormous breadth of knowledge from an enormous variety of disciplines. A lot of study has been done to minimize the energy used in routing and number of protocols has been developed. These protocols can be classified as - Hierarchical, data centric, location based and Network flow protocols. In this paper, we are particularly focusing on hierarchical protocols. In such types of protocols, the energy efficient clusters are formed with a hierarchy of cluster heads. Each cluster has its representative cluster head which is responsible for collecting and aggregating the data from its respective cluster and then transmitting this data to the Base Station either directly or through the hierarchy of other cluster heads. Fuzzy logic has been successfully applied in various areas including communication and has shown promising results. However, the potentials of fuzzy logic in wireless sensor networks still need to be explored. Optimization of wireless sensor networks involve various tradeoffs, for example, lower transmission power vs. longer transmission duration, multi-hop vs. direct communication, computation vs. communication etc. Fuzzy logic is well suited for application having conflicting requirements. Moreover, in WSN, as the energy metrics vary widely with the type of sensor node implementation platform, using fuzzy logic has the advantage of being easily adaptable to such changes.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
Advance in the WIRELESS SENSOR NETWORK (WISENET) technology is energy efficient routing protocols that promises a wide range of potential applications in both civilian and military areas. In the WISNET the sensor node have a limited transmission range and their processing and storage capabilities as well as their energy sources are limited. So the Equalized Cluster Head Election Routing Protocol (ECHERP) and PEGASIS with Double Cluster Head (PDCH) pursues energy conservation through balanced clustering for Energy Efficiency. In WSN, energy efficient routing protocol is important to increase the network lifetime. ECHERP and PDCH both protocol claims to be energy efficient.
A Survey on Routing Protocols in Wireless Sensor Network Using Mobile SinkIJEEE
Wireless sensor network (WSN) is collection of large number of sensor nodes which senses the physical conditions of environment and send the data to sink. WSN can be classified as static and mobile WSN. In static routing protocol, energy consumption is not uniformly distributed. To avoid this problem, wireless sensor network with mobile sink can be used, where mobile sink gathers data from other nodes using 1-hop communication. In this paper, we presented the various types of WSN. At last, we compared the various routing protocol of WSN with mobile sink based on parameter no. of sinks, mobility of CH and mobility pattern.
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.
Similar to Energy Efficient Data Gathering Protocol in WSN (20)
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
3. Introduction
WSN
nodes have the ability to sense and process data
wirelessly communicate with other nodes and a sink
node
have the ability to collect data from other nodes
gateway or a base station
[1] (Liu, et al, IEEE ICC 2007 proc.)
3
ENVIRONMENT
EVENTS
4. Introduction
Challenges & Constraints:
Power Consumption
Aggressive energy-scavenging policy required
Low Cost
Computation constraints
Communication: Low Data Rates <<10Kbps
Self-organization and Localization
Redundancy in deployment
Fault Tolerance
Scalability
…. and many more!!
4
5. R.C. Shah, J.M Rabaey, “Energy Aware Routing for Low
Energy Ad Hoc Sensor Networks”, IEEE WCNC’02, pp. 350-
355, March 2002
EAR: Energy Aware Routing Protocol
6. Destination initiated routing
Directional flooding to determine various
routes (based on location)
Collect energy metrics along the way
Every route has a probability of being chosen
Probability 1/energy cost
The choice of path is made locally at every
node for every packet
Energy Aware Routing
6
7. Energy Aware Routing:
Functioning
Each node is addressable through class-based
addressing, includes
Location
Type of the node
Three phases of the protocol
1. Setup phase or interest propagation
o Localized flooding to find all the routes from source to
destination and their energy costs
2. Data Communication phase or data propagation
o paths are chosen probabilistically for data transmission
3. Route maintenance
o Localized flooding to keep paths alive and update route
cost information
7
8. Setup Phase:
Controller
Sensor
Directional flooding
10 nJ
30 nJ
(0.75*10)
+ (0.25*30)
= 15 nJp1 = 0.75
p2 = 0.25
Local Rule
Energy Aware Routing † :
Functioning
8
† Slide borrowed from Rahul C. Shah, Jan Rabaey, Berkeley Wireless Research Center,
Dept. of EECS University of California, Berkeley
http://bwrc.eecs.berkeley.edu/publications/2002/presentations/WCNC2002/wcnc.ppt
9. The metric can also include:
Information about the data buffered for a neighbor
Regeneration rate of energy at a node
Correlation of data
initial
remaining
rxtx
E
E
EEC )(
Energy Aware Routing:
Energy Cost
9
11. Energy Aware Routing:
Simulation Results
Energy Usage Comparison
Diffusion Routing Energy Aware Routing
Peak energy usage was ~50 mJ for 1 hour simulation
11
12. Energy Aware Routing:
Advantage
Spread traffic over different paths; keep paths
alive without redundancy
Mitigates the problem of hot-spots in the
network
Has built in tolerance to nodes moving out of
range or dying
Continuously check different paths
Simulation result shows improvement of
21.5% energy saving
44% increase in network lifetime over Directed
Diffusion
12
13. Kuong-Ho Chen, Jyh-Ming Huang, Chieh-Chuan Hsiao,
“CHIRON: An energy-efficient chain-based hierarchical
routing protocol in wireless sensor networks”, IEEE
Wireless Telecommunications Symposium, 2009
CHIRON: An Energy-Efficient Chain-Based
Hierarchical Routing Protocol in WSN
14. CHIRON
Energy efficient hierarchical chain-based routing
protocol
Main idea:
Split the sensing field into a smaller areas
Create multiple shorter chains to reduce the
data transmission delay and redundant path
Therefore effectively conserve the node energy
and prolong the network lifetime
14
15. CHIRON:
Phases of operation
Operation of CHIRON protocol consists of four
phases:
1. Group Construction Phase.
2. Chain Formation Phase.
3. Leader Node Election Phase.
4. Data Collection and Transmission Phase.
15
16. CHIRON:
Phases I
1. Group Construction Phase:
Divide the sensing field into a
number of smaller areas
R: the transmission range of the
BS. (1 … n)
θ: the beam width of the directional
antenna of BS (1….m)
Gθ, R: Group id. By changing R and
θ, n*m groups can be defined
After the sensor nodes are
scattered, the BS gradually
sweeps the whole sensing area by
changing Tx power level, R, θ.
16
17. CHIRON:
Phases II
2. Chain Formation Phase:
The nodes within each group Gx,y will be linked
together to form a chain Cx,y
Chain formation process is same as that in PEGASIS
scheme
the node farthest away from the BS is initiated to
create the group chain
Greedily add nearest node of last chained node
to the chain
Repeat until all nodes are put together
17
18. CHIRON:
Phases III
3. Leader Node Election Phase:
Node with maximum residual
energy becomes leader
For first round, the node
farthest away from the BS is
assigned to be the group
chain leader
Thereafter, for each data
transmission round, the node
with the maximum residual
energy is elected.
Residual power information of
nodes can be piggybacked
with fused data
18
19. CHIRON:
Phases IV
4. Data collection &
Transmission Phase:
Nodes transmit along the
chain to chain leader
Then, starting from the
farthest group multi-hop
leader-by-leader aggregated
transmission is made to BS
Neighbouring leader is
elected as relaying node if it is
nearer to BS than any other
CL
19
22. Soyoung Hwang, Gwang-Ja Jin, Changsub Shin, Bongsoo
Kim, “Energy-Aware Data Gathering in Wireless Sensor
Networks”, 6th IEEE Consumer Communications and
Networking Conference, 2009
ETR: Energy Aware Tree Routing Protocol
23. ETR: Energy Aware Tree Routing Protocol
Tree structure used to route data
Multi-hop route
Three phases:
Route setup
Data Delivery
Path maintenance
23
24. ETR:
Phase I
Route Setup: In the first phase, a hierarchical
topology is created
Sink node is assigned Level 0
It broadcasts route setup message with its address
and level
On receiving route setup message a node sets its
level to {parent_level+1} and the sender as parent
The steps are repeated until all nodes are included
24
25. ETR:
Phase I
25
Route Setup: Node
selects another node
as its parent node if
it has lowest level
from received route
setup messages.
26. ETR:
Phase II
Data delivery: Data is routed to the sink node.
sensor node transmits a data message including
its own address, a destination address set to its
parent
On receiving parent transmits acknowledgement
If a parent fails, node selects neighbour with
highest residual energy as parent
26
27. ETR:
Phase III
Path maintenance:
Considers residual energy of nodes
Data messages have Residual Energy
information of the node
Any data transmitted is received by all
neighbouring nodes
A candidate is selected as parent based on this
list of neigbours
27
29. Jin Wang, Tinghuai Ma, Jinsung Cho, and Sungoung Lee,
“An Energy Efficient and Load Balancing Routing
Algorithm for Wireless Sensor Networks”, ComSIS Vol. 8,
No. 4, Special Issue, October 2011
REAR: Ring-based Energy Aware
Routing
30. REAR
Motivation:
Hotspot issue still an open problem
Nodes on the shortest path or close to the BS deplete
energy quickly
REAR aims to achieve both energy balancing and
energy efficiency for all nodes
Multi-hop route is built by BS in a centralized way:
BS has more powerful resources such as memory,
computation and communication
Algorithm considers:
Primary metric: Hop number and distance
Secondary metric: Residual energy
30
31. REAR:
Algorithm
1. If the source to BS distance d < ∑d(ni), use direct transmission
2. else, broadcast a multi-hop request to BS
3. BS determines the final multi-hop route with the optimal number n
and distances {d1, …., dn}
4. BS builds ring structure with different ring size
5. Classify nodes into different levels based on ring size
6. BS will determine the final multi-hop route as follows:
Choose some nodes from level n such that di,j ∈ (dn, dn + Δ)
Within these, BS will choose those which belong to level (n+1) to
make progress from source to BS
BS will choose the one from level (n+1) with maximal remaining
energy as the final next hop node
Source node will start the transmission of its data when it
receives the complete multi-hop route information
31
33. REAR:
Experimental Results
Average hop number
decreases as the
transmission radius R
increases
When 140≤R ≤220
REAR outperforms
greedy algorithm
33
34. REAR:
Experimental Results
R = 110m
Area = 20 m2
Averaging done
over 100 different
network topology
simulation result
REAR algorithm has
the longest lifetime
34
35. A Proposal: Novel WSN routing protocol based
on energy dissipation history
36. Network Survivability †
Critical node to maintain network
connectivity
Critical node as it is
the only one of its type
•Delay the death of highly active nodes ensuring long network lifetime
•Load balancing
•Predict nodes that may die early
† Images from Rahul C. Shah, Jan Rabaey, Berkeley Wireless Research Center, Dept. of EECS
University of California, Berkeley
http://bwrc.eecs.berkeley.edu/publications/2002/presentations/WCNC2002/wcnc.ppt
36
37. Routing based on Energy Usage
History in WSN
Highly active nodes should not be used for common or
periodic/routine chain transmissions
Aim to reroute data transmission paths along nodes that
are less active
Energy Usage Index(EUI)calculated before every
transmission
Use „energy spent per second’ for last λ seconds
EUI, Residual Energy Level piggybacked on data
packets.
Neighbouring nodes can overhear transmissions and
will know about other nodes‟ EUI
Prevention is better than cure:
Identify highly active nodes beforehand
37
38. Routing based on Energy Usage
History in WSN
Past-information about energy dissipation of nodes may
improve network lifetime
EWMA: applies weighting factors which decrease
exponentially
EUIt = α x Et + (1 - α) x EUIt-1
Weighting for each older data point decreases
exponentially, giving much more importance to recent
observations while still not discarding older observations
entirely.
38
EWMA weights,
N = 15
39. Routing based on Energy Usage
History in WSN
Energy Usage Index (EUI): Indicates at what rate a
node is using up its energy
Distance from BS (DB): parameter that restricts the
delay in propagation
Residual Energy (RE): Current energy level
These three parameters are used to select next-hop
node for the route
Nodes know only about their next-hop neighbours info
Node Ni forwards to neighbour NJ if ∀ neighbour of
current node Ni, NJ has
min(Total Cost Index = α x EUI + β x DB + γ x RE)
α, β, γ parameters can be adjusted as required.
39
40. High energy dissipation
zones: Areas of high
activityDip
Routing based on Energy Usage
History in WSN
Highly active nodes are not over-burdened
with extra transmission load by its neighbors
Graphical representation of spatial
energy dissipation in a random WSN
node dispersion
BS
40
41. Routing based on Energy Usage History in WSN:
Possible directions of further investigation
How to use it in a clustered-based approach?
Can EUI be calculated for a sub-region,
partition, cluster?
Can α, β, γ parameters be automatically
adapted (by cluster heads, neighbours)?
Simulation and comparison with other
protocols.
41
42. CONCLUSION
Network performance is application dependent
Need to clearly identify metrics of interest
Trade-off:
Accuracy vs. Latency vs. Lifetime vs. …..
Research directions
Routing graphs: selecting a tree, transmission
schedule, maintenance policy
Power aware routing: enhanced link sharing, load
balancing, improving lifetitme
Optimality in Algorithms
Open Problems everywhere!!
42
43. References
[1] Ming Liu, Yuan Zheng, Jiannong Cao, Guihai Chen, Lijun Chen,Haigang Gong, “An
Energy-Aware Protocol for Data Gathering Applications in Wireless Sensor
Networks”, IEEE Communications Society subject matter experts for publication in
the ICC 2007 proceedings
[2] R.C. Shah, J.M Rabaey, “Energy Aware Routing for Low Energy Ad Hoc Sensor
Networks”, IEEE WCNC’02, pp. 350-355, March 2002
[3] Kuong-Ho Chen, Jyh-Ming Huang, Chieh-Chuan Hsiao, “CHIRON: An energy-
efficient chain-based hierarchical routing protocol in wireless sensor
networks”, IEEE Wireless Telecommunications Symposium, 2009
[4] Jin Wang, Tinghuai Ma, Jinsung Cho, and Sungoung Lee, “An Energy Efficient and
Load Balancing Routing Algorithm for Wireless Sensor Networks”, ComSIS Vol.
8, No. 4, Special Issue, October 2011
[5] K.Ramanan, E.Baburaj, “Data Gathering Algorithms For Wireless Sensor
Networks: A Survey”, International Journal of Ad hoc, Sensor & Ubiquitous
Computing (IJASUC) Vol.1, No.4, December 2010
[6] S. Jamal N. Al-karaki, Ahmed E. Kamal, ”Routing Techniques In Wireless Sensor
Networks: A Survey”, IEEE Wireless Communications • December 2004
43
44. References
[8] S. M. Jung, Y. J. Han, and T. M. Chung, “The Concentric Clustering Scheme for
Efficient Energy Consumption in the PEGASIS,” Proceedings of the 9th
International Conference on Advanced Communication Technology, Vol. 1, pp. 260-
265, 2007
[9] Soyoung Hwang, Gwang-Ja Jin, Changsub Shin, Bongsoo Kim, “Energy-Aware
Data Gathering in Wireless Sensor Networks”, 6th IEEE Consumer
Communications and Networking Conference, 2009
Few images and slides have been take from the links given below:
[10] http://www.cs.ucf.edu/~turgut/COURSES/EEL6788_ACN_Fall05/Lecture7-Oct05-
05.ppt
[11] http://bwrc.eecs.berkeley.edu/publications/2002/presentations/WCNC2002/wcnc.ppt
[12] http://www.cs.binghamton.edu/~kang/teaching/cs580s/routing-survey.ppt
[13] http://www.senmetrics.org/papers/Senmetrics-keyNote-Helmy-2.ppt
44
45.
46. Introduction: Taxonomy
WSN protocols are classified according to their data delivery model
into the following categories [Kulik, et al, 2002]:
1. Continuous
LEACH: For routing data to base stations in static WSN
TEEN and PEGASIS: Improvements over LEACH
2. Observer-initiated
Directed Diffusion:
Data/information are named using attribute-value pairs
Interest based queries
3. Event-driven
SPIN: Set of negotiation based protocols
4. Hybrid
46
47. 47
Energy conservation policies
[2] Jones, Sivalingam, Agrawal, and Chen survey article in ACM WINET, July 2001
[3] Lindsey, Sivalingam, and Raghavendra book chapter in Wiley Handbook of Mobile Computing, Ivan
Stojmenovic, Editor, 2002
Physical Layer •Low power circuit (CMOS, etc.) design
•Optimum hardware, software function division
•Energy effective waveform/ code design
•Adaptive RF power control
MAC sub-layer • Energy effective MAC protocol
• Collision free, reduce retransmission and transceiver
on-times
• Intermittent, synchronized operation
• Rendezvous protocols
Link Layer • FEC versus ARQ schemes; Link packet length adapt.
Network Layer • Multi-hop route determination
• Energy aware route algorithm
• Route cache, directed diffusion
Application Layer • Video applications: compression and frame-dropping
• In-network data aggregation and fusion
48. C. Intanagonwiwat, R. Govindan and D. Estrin, “Directed
Diffusion: A scalable and robust communication paradigm
for sensor networks”, IEEE/ACM Mobicom, 2000
Directed Diffusion protocol
49. Directed Diffusion
Query-driven data delivery model
Diffusing data by using a naming scheme
named using attribute-value pairs
Interest, data propagation and data
aggregation are determined by local
interactions
Sink requests data by broadcasting interests
Interest diffuses through the WSN hop-by-hop
according to contents of the interest
49
50. Directed Diffusion:
Interest & Gradient
Interest is generally given by the sink node
For each active task, sink periodically broadcasts an interest
message to each of its neighbors
Sink periodically refreshes each interest by re-sending the
same interest with monotonically increasing timestamp
attribute for reliability purposes
Every node maintains an interest cache where each item in
the cache corresponds to a distinct interest
Interest entries in the cache do not contain information about
the sink
Definition of distinct interests may allow interest aggregation
The interest entry contains several gradient fields, up to one
per neighbor
50
51. Directed Diffusion:
Functioning
Setting up Gradient: When a node receives an interest, it
determines if the interest exists in the cache:
1. If no matching exist, the node creates an interest entry
This entry has single gradient towards the neighbor from
which the interest was received with specified data rate
Individual neighbors can be distinguished by locally unique
identifiers
2. If the interest entry exists, but no gradient for the sender of
interest
Node adds a gradient with the specified value
Updates the entry‟s timestamp and duration fields
3. If there exists both entry and a gradient,
The node updates the entry‟s timestamp and duration fields
51
52. Directed Diffusion:
Functioning
Data propagation
Data message is unicast individually to the relevant neighbors
A node receiving a data message from its neighbors checks to see if matching
interest entry in its cache exists according the matching rules described
1. If no match exist, the data message is dropped
2. If match exists, the node checks its data cache associated with the
matching interest entry
If a received data message has a matching data cache entry, the
data message is dropped
Otherwise, the received message is added to the data cache and
the data message is re-sent to the neighbors
Data cache keeps track of the recently seen data items, preventing loops
By checking the data cache, a node can determine the data rate of the
received events
52
53. Directed Diffusion:
Functioning
Destination
Source
Setting up gradients
Destination
Source
Sending data
oEvery node maintains an interest cache
oData message is unicast individually to the relevant neighbour
oRecent data is cached to prevent looping
oReinforcement of one neighbor to draw higher quality
achieved by data driven local rules: observed losses, delay variances
oNegative reinforcement of certain paths: low resource levels, etc
53
54. A. Manjeshwar , D. P. Agarwal, “TEEN: a Routing Protocol for
Enhanced Efficiency in Wireless Sensor Networks,” 1st Int’l.
Wksp. on Parallel and Distrib. Comp. Issues in WirelessNetworks
and Mobile Comp., 2001
Threshold sensitive Energy Efficient
Network protocol
55. Threshold sensitive Energy Efficient
Network protocol (TEEN)
Hierarchical, cluster-based data-centric
protocol
Designed to respond to sudden changes
For time-critical applications
Reactive network
Nodes sense continuously, but data
transmission is done infrequently
Control over energy consumption and
accuracy
55
56. TEEN : Multi-level hierarchical
clustering
56
Clusters
1st Level Cluster Head
Simple Node
2nd Level Cluster Head
Base Station
57. TEEN: Functioning
Every node in a cluster takes turns to become the CH
for a time interval called cluster period
At every cluster change time the cluster-head
broadcasts to its members
Hard threshold (HT) : A member only sends data to CH only if
data values are in the range of interest
Soft threshold (ST) : A member only sends data if its value
changes by at least the soft threshold
HT is the minimum possible value of an attribute.
Node transmits data only when the value of that attribute
changed by an amount equal to or greater than the ST
Tx(Ni): Δ (SV) ≥ ST
57
58. TEEN: Features & Discussion
Good for time-critical applications
Energy saving
Less energy than proactive approaches
Transmission consumes more energy than sensing
Inappropriate for periodic monitoring
Ambiguity between packet loss and unimportant
data (indicating no drastic change)
The ST can be varied, depending on the
criticality/accuracy required
58
59. APTEEN (Adaptive Threshold sensitive Energy
Efficient Network protocol)
Extends TEEN to support both periodic sensing &
reacting to time critical events
Unlike TEEN, a node must sample & transmit a data if
it has not sent data for a time period equal to CT
(count time) specified by CH
Network lifetime: TEEN ≥ APTEEN ≥ LEACH
Drawbacks of TEEN & APTEEN
Overhead & complexity of forming clusters in multiple
levels and implementing threshold-based functions
59
60. 60
TEEN: Hierarchical vs. flat
topologies
Jamal N. Al-karaki, Ahmed E. Kamal,” Routing Techniques In
WIRELESS SENSOR NETWORKS: A SURVEY”, IEEE Wireless Communications • December 2004
61. M.J. Handy, M. Haas, D. Timmermann, “Low Energy Adaptive
Clustering Hierarchy with Deterministic Cluster-Head
Selection”, Fourth IEEE Conference on Mobile and Wireless
Communications Networks, Stockholm, September 2002
LEACH: Low Energy Adaptive Clustering
Hierarchy
62. LEACH:
Phases
Cluster-based approach
The LEACH network has two phases: the set-
up phase and the steady-state
The Set-Up Phase
Where cluster-heads are chosen
The Steady-State
The cluster-head is maintained
Nodes transmit to cluster-head
62
63. LEACH:
The Cluster-Head
The LEACH Network is made up of nodes, some of which are called
cluster-heads
The job of the cluster-head is to collect data from their
surrounding nodes and pass it on to the base station
LEACH is dynamic because the job of cluster-head rotates
Cluster-heads can be chosen stochastically
If n < T(n), then that node becomes a cluster-head
63
64. LEACH:
An Example
While neither of
these diagrams is the
optimum scenario,
the second is better
because the cluster-
heads are spaced
out and the network
is more properly
sectioned
64
65. S. Lindsey, C.S.Raghavendra, “PEGASIS: Power Efficient
Gathering in Sensor Information Systems”, Proceedings of
IEEE ICC 2001, pp. 1125-1130, June 2001
Power-Efficient GAthering for Sensor
Information Systems
66. An enhancement over the LEACH
Minimize distance nodes must transmit
Minimize number of leaders that transmit to
BS
Minimize broadcasting overhead
Distribute work more equally among all
nodes
increase the lifetime of each node by using
collaborative techniques
PEGASIS
66
67. Greedy Chain Algorithm:
1. Start with node furthest away from BS
2. Add to chain closest neighbor to this node that
has not been visited
3. Repeat until all nodes have been added to chain
4. Constructed before 1st round of communication
and then reconstructed when nodes die
Data fusion at each node (except end nodes)
Only one message is passed at every node
Delay calculation: N units for an N-node
network
Sequential transmission is assumed
Node i (mod N) is the leader in round i
PEGASIS:
Greedy Chain Algorithm
67
69. PEGASIS:
Drawbacks:
Assumes that each sensor node is able to
communicate with the BS directly
Assumes that all sensor nodes have the same level of
energy and are likely to die at the same time
The single leader can become a bottleneck.
Excessive data delay
69
70. Extension of PEGASIS
Decrease the delay for the packets during transmission to
the base station
Simultaneous transmissions of data messages
Hierarchical PEGASIS
70
71. Another extension of PEGASIS
The sensing area, centered at the BS, is
circularized into several concentric cluster levels.
For each cluster level a node chain is constructed
Farthest to nearest multi-hop and leader-by-leader
data propagation
(S. M. Jung, Y. J. Han, and T. M. Chung, “The Concentric Clustering
Scheme for Efficient Energy Consumption in the PEGASIS,”
Proceedings of the 9th International Conference on Advanced
Communication Technology, Vol. 1, pp. 260-265, 2007)
Enhanced PEGASIS
71
72. REAR:
Algorithm
Assumptions:
1. All sensor nodes are static and homogeneous after
deployment.
2. The communication links are symmetric.
3. Each sensor node has several power levels which
they can adjust.
4. Each sensor node can know the distance to its
neighbors and to the BS.
5. There is no obstacle between nodes.
72
73. References
[1] Ming Liu, Yuan Zheng, Jiannong Cao, Guihai Chen, Lijun Chen,Haigang Gong, “An
Energy-Aware Protocol for Data Gathering Applications in Wireless Sensor
Networks”, IEEE Communications Society subject matter experts for publication in
the ICC 2007 proceedings
[2] Jones, Sivalingam, Agrawal, and Chen survey article in ACM WINET, July 2001;
[3] Lindsey, Sivalingam, and Raghavendra book chapter in Wiley Handbook of Mobile
Computing, Ivan Stojmenovic, Editor, 2002.
[4] C. Intanagonwiwat, R. Govindan and D. Estrin, “Directed Diffusion: A scalable
and robust communication paradigm for sensor networks”, IEEE/ACM
Mobicom, 2000
[5] A. Manjeshwar , D. P. Agarwal, “TEEN: a Routing Protocol for Enhanced
Efficiency in Wireless Sensor Networks,” 1st Int’l. Wksp. on Parallel and Distrib.
Comp. Issues in WirelessNetworks and Mobile Comp., 2001
[6] M.J. Handy, M. Haas, D. Timmermann, “Low Energy Adaptive Clustering
Hierarchy with Deterministic Cluster-Head Selection”, Fourth IEEE Conference
on Mobile and Wireless Communications Networks, Stockholm, September 2002
[7] S. Lindsey, C.S.Raghavendra, “PEGASIS: Power Efficient Gathering in Sensor
Information Systems”, Proceedings of IEEE ICC 2001, pp. 1125-1130, June 2001
73