TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.

Slides:



Advertisements
Similar presentations
6LoWPAN Extending IP to Low-Power WPAN 1 By: Shadi Janansefat CS441 Dr. Kemal Akkaya Fall 2011.
Advertisements

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
4/29/2015 Wireless Sensor Networks COE 499 Deployment of Sensor Networks II Tarek Sheltami KFUPM CCSE COE
Kyung Tae Kim, Hee Yong Youn (Sungkyunkwan University)
Sensor network Routing protocol A study on LEACH protocol and how to improve it.
CLUSTERING IN WIRELESS SENSOR NETWORKS B Y K ALYAN S ASIDHAR.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
Introduction to Wireless Sensor Networks
Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui.
Low-Energy Adaptive Clustering Hierarchy An Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks M. Aslam hayat.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
SENSOR NETWORKS ECE 654 Irene Ioannou. Sensor networks communication architecture.
A novel Energy-Efficient and Distance- based Clustering approach for Wireless Sensor Networks M. Mehdi Afsar, Mohammad-H. Tayarani-N.
Routing Protocols for Sensor Networks Presented by Siva Desaraju Computer Science WMU Negotiation-based protocols for Disseminating Information in Wireless.
Adaptive Protocols for Information Dissermination in Wireless Sensor Networks Authors : Joanna Kulik, Wendi Rabiner, Hari Balakrishnan Speaker.
1 Routing Techniques in Wireless Sensor networks: A Survey.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
Progress Report Wireless Routing By Edward Mulimba.
PEDS September 18, 2006 Power Efficient System for Sensor Networks1 S. Coleri, A. Puri and P. Varaiya UC Berkeley Eighth IEEE International Symposium on.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
CS 599 Intelligent Embedded Systems1 Adaptive Protocols for Information Dissemination in Wireless Sensor Networks W.R.Heinzelman, J.kulik, H.Balakrishnan.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Wireless Distributed Sensor Networks Special Thanks to: Jasvinder Singh Hitesh Nama.
Kick-off meeting 3 October 2012 Patras. Research Team B Communication Networks Laboratory (CNL), Computer Engineering & Informatics Department (CEID),
Routing Algorithm for Large Data Sensor Networks Raghul Gunasekaran Group Meeting Spring 2006.
Sidewinder A Predictive Data Forwarding Protocol for Mobile Wireless Sensor Networks Matt Keally 1, Gang Zhou 1, Guoliang Xing 2 1 College of William and.
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
Energy-Aware Routing Paper #1: “Wireless sensor networks: a survey” Paper #2: “Online Power-aware Routing in Wireless Ad-hoc Networks” Robert Murawski.
M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
Wireless Sensor Networks COE 499 Energy Aware Routing
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
Lan F.Akyildiz,Weilian Su, Erdal Cayirci,and Yogesh sankarasubramaniam IEEE Communications Magazine 2002 Speaker:earl A Survey on Sensor Networks.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.
Xiaobing Wu, Guihai Chen
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
An Energy-Aware Periodical Data Gathering Protocol Using Deterministic Clustering in Wireless Sensor Networks (WSN) Mohammad Rajiullah & Shigeru Shimamoto.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
A Power Assignment Method for Multi-Sink WSN with Outage Probability Constraints Marcelo E. Pellenz*, Edgard Jamhour*, Manoel C. Penna*, Richard D. Souza.
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Evaluating Wireless Network Performance David P. Daugherty ITEC 650 Radford University March 23, 2006.
Modeling In-Network Processing and Aggregation in Sensor Networks Ajay Mahimkar The University of Texas at Austin March 24, 2004.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Ching-Ju Lin Institute of Networking and Multimedia NTU
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Energy-Efficient Signal Processing and Communication Algorithms for Scalable Distributed Fusion.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Prolonging the Lifetime of Wireless Sensor Networks via Unequal Clustering Stanislava Soro Wendi B. Heinzelman University of Rochester IPDPS 2005.
Data funneling : routing with aggregation and compression for wireless sensor networks Petrovic, D.; Shah, R.C.; Ramchandran, K.; Rabaey, J. ; SNPA 2003.
Abstract 1/2 Wireless Sensor Networks (WSNs) having limited power resource report sensed data to the Base Station (BS) that requires high energy usage.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Minimum Power Configuration in Wireless Sensor Networks Guoliang Xing*, Chenyang Lu*, Ying Zhang**, Qingfeng Huang**, and Robert Pless* *Washington University.
A Secure Routing Protocol with Intrusion Detection for Clustering Wireless Sensor Networks International Forum on Information Technology and Applications.
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
SPIN: Sensor Protocols for Information via Negotiation
Protocols for Wireless Sensor Networks
Wireless Sensor Network Architectures
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
Net 435: Wireless sensor network (WSN)
Intra-Domain Routing Jacob Strauss September 14, 2006.
Leach routing protocol in WSN
Leach routing protocol in WSN
Presentation transcript:

TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.

INTRODUCTION: A smart sensor is a collection of integrated sensors and electronics. A wireless smart sensor network node are constructed using these smart sensors, so these individual nodes can be resource-aware, and resource-adaptive. The fields in which these networks include are space exploration, medicine and many others. Many of the topologies proposed for wired networks cannot be used for wireless networks, for in wired networks, a higher dimension can be implemented by connecting the nodes in some fashion to simulate higher dimensions. Topologies that we are going to investigate for WSN’s are 1. LEACH 2. SPIN 3. DSAP

LEACH (Low-Energy Adaptive Clustering Hierarchy): 1. It is a new communication protocol that tries to evenly distribute the energy load among the network nodes. 2. This assumes that we have a finite amount of power and aims at conserving as much energy as possible despite a dynamic network. 3. It uses data compression to reduce the amount of data that must be transmitted to a base station.. SPIN (Sensor Protocols for Information via Negotiation): 1. It is a unique and complete set of protocols for energy-efficient communication among wireless sensors. 2. It incorporate two key ideas to overcome the network implosion caused by flooding, overlapping transmission ranges, and power conservation : negotiation and resource adaptation. 3. Using very small meta-data packets to negotiate, SPIN efficiently communicates with fewer redundancies than traditional approaches, dealing with implosion and overlap.

DSAP (Directional Source-Aware Protocol): 1. The routing works by assigning each node an identifier that places that node in the network. Each of the numbers tells how many nodes separate that node from the edge of the network through all possible directions 2. DSAP has many benefits when compared to the normal routing protocols  it contains embedded power considerations  uses no routing table.

HOW DOES IT WORK: SOURCE : Node 51 DESTINATION : Node 33 Source DV : (1, 5, 4, 4, 0, 0) Destination DV : (3, 3, 2, 2, 2, 2) Subtract : (-2, 2, 2, 2, -2, -2) Discard (-) values: (0, 2, 2, 2, 0, 0) Now we have nodes 41,42 and 52 as each of these neighbors have the same values in the final DV of the result. Out of these approaching, in the similar manner 42 will have the smaller values. So the path 51  42  33 is selected.

HOW TO INTRODUCE ENERGY EFFICIENCY ?  consider the maximum available power at each node which falls in the direction the message should be routed and minimal directional value when picking which node route to take  Instead of simply picking the node with the lowest directional value, the directional value is divided by the power available at that node.  The smaller value of this RATIO power-constrained directional value is the path that is chosen.  ANALYSIS OF POWER USAGE  First, the routing is studied over the diameter of the network and along two possible routes—along the edge and through the interior.  Finally, we simulate DSAP with and without power-aware routing and show the relative performance of each.

Degree of Routing Freedom:  It is the number of alternative paths that a routing protocol can select. It show that as the number of neighbors increases, the degree of routing freedom increases Trade-Off:  There is an fundamental between the number of neighbors and the total power dissipated in the system. HOW DO WE ESTIMATE THE POWER DISSIPATED?  Java simulation program was developed that incorporated the number of nodes, topology, distance, number of bits transmitted, power transmitted / received for each node.  It takes the message, source node and destination node as input and returns the energy dissipated as output.

RESULTS :  For 2D Networks with different number of neighbors the energy consumed is as follows  OBSERVATIONS: edge routing involves less power than interior routing in all cases except for 3 neighbors. Because edge routing must intern fallow interior routing With either routing strategy, as the number of neighbors increases the power dissipated increases for the same number of transmissions.

RESULTS [CONTD.]:  For 3D networks with 1000 nodes and each node having 6 neighbors the energy consumed is as fallows.  Power assessment for 3D network as the number of nodes increased.  OBSERVATIONS : Power dissipated is less when Power-DSAP is used for both the 2D as well as the 3D. The 3D network consumes less power than any of the 2D configurations.

RESULTS [CONTD.]:

CONCLUSIONS:  From this it is clear that path selection affects the amount of power used in the network.  When the power considerations are added to the protocol, we find that the overall power consumption is much more balanced than without taking power into account.  As for now the Power-Aware DSAP is one of the best topology related to wireless sensor networks.

THANK YOU

?