Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, 07.06.2007, Braunschweig Institute of Applied Microelectronics.

Slides:



Advertisements
Similar presentations
A Data Dissemination Method for Supporting Mobile Sinks in Hierarchical Routing Protocol of WSN APAN 2008 Jieun Cho 4, August,
Advertisements

On the Coverage Problem in Video- based Wireless Sensor Networks Stanislava Soro Wendi Heinzelman University of Rochester.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
University of Rostock Applied Microelectronics and Computer Science Dept.
Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.
Kai Li, Kien Hua Department of Computer Science University of Central Florida.
A novel Energy-Efficient and Distance- based Clustering approach for Wireless Sensor Networks M. Mehdi Afsar, Mohammad-H. Tayarani-N.
Topology Control Presenter: Ajit Warrier With Dr. Sangjoon Park (ETRI, South Korea), Jeongki Min and Dr. Injong Rhee (advisor) North Carolina State University.
1 School of Computing Science Simon Fraser University, Canada PCP: A Probabilistic Coverage Protocol for Wireless Sensor Networks Mohamed Hefeeda and Hossein.
Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.
Energy Aware Self Organized Communication in Complex Networks Jakob Salzmann, Dirk Timmermann SPP 1183 Third Colloquium Organic Computing, ,
A Practical Approach to QoS Routing for Wireless Networks Teresa Tung, Zhanfeng Jia, Jean Walrand WiOpt 2005—Riva Del Garda.
1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
May 14, Organization Design and Dynamic Resources Huzaifa Zafar Computer Science Department University of Massachusetts, Amherst.
1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.
1 Sensor Placement and Lifetime of Wireless Sensor Networks: Theory and Performance Analysis Ekta Jain and Qilian Liang, Department of Electrical Engineering,
Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol
IPCCC’111 Assessing the Comparative Effectiveness of Map Construction Protocols in Wireless Sensor Networks Abdelmajid Khelil, Hanbin Chang, Neeraj Suri.
A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a, Takumi Miyoshi a,b a Graduate School of Engineering,
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Mobile Ad hoc Networks Sleep-based Topology Control
Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks Jae-Young Choi, Jun-Hui Lee, and Yeong-Jee Chung Dept. of Computer Engineering, College.
Scalable Data Aggregation for Dynamic Events in Sensor Networks Kai-Wei Fan Kai-Wei Fan, Sha Liu, and Prasun.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
Prediction-based Object Tracking and Coverage in Visual Sensor Networks Tzung-Shi Chen Jiun-Jie Peng,De-Wei Lee Hua-Wen Tsai Dept. of Com. Sci. and Info.
Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors Weikuan Yu Dept. of Computer and Info. Sci. The Ohio State University.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
Lan F.Akyildiz,Weilian Su, Erdal Cayirci,and Yogesh sankarasubramaniam IEEE Communications Magazine 2002 Speaker:earl A Survey on Sensor Networks.
Multi-Criteria Routing in Pervasive Environment with Sensors Santhanakrishnan, G., Li, Q., Beaver, J., Chrysanthis, P.K., Amer, A. and Labrinidis, A Department.
College of Engineering Grid-based Coordinated Routing in Wireless Sensor Networks Uttara Sawant Major Advisor : Dr. Robert Akl Department of Computer Science.
Improving Routing in Sensor Networks with Heterogeneous Sensor Nodes Xiaojiang Du & Fengjing Lin Vehicular Technology Conference,2005 Spring,Volume 4.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
Optimal Self-placement of Heterogeneous Mobile Sensors in Sensor Networks Lidan Miao AICIP Research Oct. 19, 2004.
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
Collaborative Broadcasting and Compression in Cluster-based Wireless Sensor Networks Anh Tuan Hoang and Mehul Motani National University of Singapore Wireless.
1/8/2016 Wireless Sensor Networks COE 499 Sleep-based Topology Control I Tarek Sheltami KFUPM CCSE COE
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.
MCEEC: MULTI-HOP CENTRALIZED ENERGY EFFICIENT CLUSTERING ROUTING PROTOCOL FOR WSNS N. Javaid, M. Aslam, K. Djouani, Z. A. Khan, T. A. Alghamdi.
Scalable Data Aggregation for Dynamic Events in Sensor Networks Kai-Wei Fan, Sha Liu, Prasun Sinha Computer Science and Engineering, Ohio State University.
A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.
Overview of Wireless Networks: Cellular Mobile Ad hoc Sensor.
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
Data Dissemination Based on Ant Swarms for Wireless Sensor Networks S. Selvakennedy, S. Sinnappan, and Yi Shang IEEE 2006 CONSUMER COMMUNICATIONS and NETWORKING.
Simulation of DeReClus Yingyue Xu September 6, 2003.
ICIIS Peradeniya, Sri Lanka1 An Enhanced Top-Down Cluster and Cluster Tree Formation Algorithm for Wireless Sensor Networks H. M. N. Dilum Bandara,
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.
I-Hsin Liu1 Event-to-Sink Directed Clustering in Wireless Sensor Networks Alper Bereketli and Ozgur B. Akan Department of Electrical and Electronics Engineering.
Younghwan Yoo† and Dharma P. Agrawal‡ † School of Computer Science and Engineering, Pusan National University, Busan, KOREA ‡ OBR Center for Distributed.
COMMUNICATING VIA FIREFLIES: GEOGRAPHIC ROUTING ON DUTY-CYCLED SENSORS S. NATH, P. B. GIBBONS IPSN 2007.
Deploying Sensors for Maximum Coverage in Sensor Network Ruay-Shiung Chang Shuo-Hung Wang National Dong Hwa University IEEE International Wireless Communications.
On Efficient Clustering of Wireless Sensor Networks Mohamed Younis, Poonam Munshi, Gaurav Gupta, and Sameh M. Elsharkawy Dependability and Security in.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
In the name of God.
Overview of Wireless Networks:
Vineet Mittal Should more be added here Committee Members:
Net 435: Wireless sensor network (WSN)
Padmalaya Nayak, and Bhavani Vathasava
Coverage and Connectivity in Sensor Networks
Presentation transcript:

Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, , Braunschweig Institute of Applied Microelectronics and Computer Engineering University of Rostock

2 Outline Motivation Clustering Routing Conclusion & Outlook

3 Motivation Photo: Jason Hill, UCB Cheaper and smaller, but more nodes Main problem: energy consumption

4 Dividing the network into clusters Less Communication Hierarchical Structure Clustering I Clusterhead consumes more energy Problem: Different position in a cluster  Different transmission range New Clusterheads have to check for connections  Communication overhead Our goal: Limits for clusters which allow unconditional role changes Lifetime increase by role changing Sensor nodeSinkClusterhead

5 Clustering II Grid with quadratic cells Max cell size restricted by Transmission range Sensing range Transmission Range R T Sensing Range R S L L L

6 Clustering III Sensor node Sink Clusterhead Switched-off node Estimation of the virtual grid Determining the Clusterhead in each cell Temporary switch-off remaining nodes without loss of performance Emerging of clusters with different lifetimes Low populated Cluster Well populated Cluster

7 Scale Free Networks US airline system Internet Network results from preferred connection Many nodes with few connections, few nodes with many connections Robust against random attacks Our goal: Adoption of Scale free behavior to our developed clustering algorithm

8 Routing Algorithm SinkSwitched-off nodeLow populated Cluster Well populated Cluster Our approach: Starting with the sink After attending the network, nodes connect with all unconnected nodes in range Built up a network with scale free behavior Optimizations: Range Reduction Limited Connectivity Wait and See Well populated cluster become hubs

9 Conclusion & Outlook Results Developed a clustering algorithm Unconditional role changing Considers coverage and connectivity Applied a routing algorithm Scale free behavior Robust against random failures Future Work Improvement of cell sizes Stronger cross linking for improved robustness