Energy Aware Self Organized Communication in Complex Networks Jakob Salzmann, Dirk Timmermann SPP 1183 Third Colloquium Organic Computing, 14.-15.09.2006,

Slides:



Advertisements
Similar presentations
1 A Real-Time Communication Framework for Wireless Sensor-Actuator Networks Edith C.H. Ngai 1, Michael R. Lyu 1, and Jiangchuan Liu 2 1 Department of Computer.
Advertisements

Distributed Algorithms for Mobile Sensor Networks Chelsea Sanders Ben Tullis.
Using Cramer-Rao-Lower-Bound to Reduce Complexity of Localization in Wireless Sensor Networks Dominik Lieckfeldt, Dirk Timmermann Department of Computer.
Multirate adaptive awake-sleep cycle in hierarchical heterogeneous sensor network BY HELAL CHOWDHURY presented by : Helal Chowdhury Telecommunication laboratory,
Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.
A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,
University of Rostock Applied Microelectronics and Computer Science Dept.
Introduction to Wireless Sensor Networks
1 On Constructing k- Connected k-Dominating Set in Wireless Networks Department of Computer Science and Information Engineering National Cheng Kung University,
Distributed Scheduling of a Network of Adjustable Range Sensors for Coverage Problems Akshaye Dhawan, Ursinus College Aung Aung and Sushil K. Prasad Georgia.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
Apr 26th, 2006 Solving Generic Role Assignment Exactly Christian Frank and Kay Römer ETH Zurich, Switzerland.
Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks Xueyan Tang School of Computer Engineering Nanyang Technological.
Wireless Distributed Sensor Networks Special Thanks to: Jasvinder Singh Hitesh Nama.
APTEEN: A Hybrid Protocol for Efficient Routing and Comprehensive Information Retrieval in Wireless Sensor Networks Arati Manjeshwar, Dharma P. Agrawaly.
1 Sensor Placement and Lifetime of Wireless Sensor Networks: Theory and Performance Analysis Ekta Jain and Qilian Liang, Department of Electrical Engineering,
Routing Algorithm for Large Data Sensor Networks Raghul Gunasekaran Group Meeting Spring 2006.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.
Sensor Positioning in Wireless Ad-hoc Sensor Networks Using Multidimensional Scaling Xiang Ji and Hongyuan Zha Dept. of Computer Science and Engineering,
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
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.
Christian Frank, Kay Römer ETH Zurich Algorithms for Generic Role Assignment in Wireless Sensor Networks.
SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.
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.
Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, , Braunschweig Institute of Applied Microelectronics.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
FRE 2672 TFG Self-Organization - 01/07/2004 Engineering Self-Organization in MAS Complex adaptive systems using situated MAS Salima Hassas LIRIS-CNRS Lyon.
Maximum Lifetime Routing in Wireless Sensor Networks by Collins Adetu Nicole Powell Course: EEL 5784 Instructor: Dr. Ming Yu.
Multi-Resolution Spatial and Temporal Coding in a Wireless Sensor Network for Long-Term Monitoring Applications You-Chiun Wang, Member, IEEE, Yao-Yu Hsieh,
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
Bounded relay hop mobile data gathering in wireless sensor networks
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
Redeployment for Mobile Wireless Sensor Networks Weihong Fan, Hengyang Zhang and Xuanping Cai Yunhui Liu Yunhui LiuJoint Center of Intelligent Sensing.
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
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”,
Cooperative Location- Sensing for Wireless Networks Authors : Haris Fretzagias Maria Papadopouli Presented by cychen IEEE International Conference on Pervasive.
1/8/2016 Wireless Sensor Networks COE 499 Sleep-based Topology Control I Tarek Sheltami KFUPM CCSE COE
Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.
Wireless sensor and actor networks: research challenges
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Data Dissemination Based on Ant Swarms for Wireless Sensor Networks S. Selvakennedy, S. Sinnappan, and Yi Shang IEEE 2006 CONSUMER COMMUNICATIONS and NETWORKING.
Utilization Based Duty Cycle Tuning MAC Protocol for Wireless Sensor Networks Shih-Hsien Yang, Hung-Wei Tseng, Eric Hsiao-Kuang Wu, and Gen-Huey Chen Computer.
Critical Area Attention in Traffic Aware Dynamic Node Scheduling for Low Power Sensor Network Proceeding of the 2005 IEEE Wireless Communications and Networking.
Ben Miller.   A distributed algorithm is a type of parallel algorithm  They are designed to run on multiple interconnected processors  Separate parts.
Scalable and Robust Data Dissemination in Wireless Sensor Networks Wei Liu, Yanchao Zhang, Yuguang Fang, Tan Wong Department of Electrical and Computer.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Energy-Aware Target Localization in Wireless Sensor Networks Yi Zou and Krishnendu Chakrabarty IEEE (PerCom’03) Speaker: Hsu-Jui Chang.
Dynamic Proxy Tree-Based Data Dissemination Schemes for Wireless Sensor Networks Wensheng Zhang, Guohong Cao and Tom La Porta Department of Computer Science.
Deploying Sensors for Maximum Coverage in Sensor Network Ruay-Shiung Chang Shuo-Hung Wang National Dong Hwa University IEEE International Wireless Communications.
Repairing Sensor Network Using Mobile Robots Y. Mei, C. Xian, S. Das, Y. C. Hu and Y. H. Lu Purdue University, West Lafayette ICDCS 2006 Speaker : Shih-Yun.
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:
Introduction to Wireless Sensor Networks
Distributed Algorithms for Mobile Sensor Networks
Introduction to Wireless Sensor Networks
Net 435: Wireless sensor network (WSN)
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE,
Edinburgh Napier University
Presentation transcript:

Energy Aware Self Organized Communication in Complex Networks Jakob Salzmann, Dirk Timmermann SPP 1183 Third Colloquium Organic Computing, , Stuttgart Institute of Applied Microelectronics and Computer Engineering University of Rostock

DFG 1183 Organic Computing2 Outline Project introduction OC principles in research Current work Future work Conclusion

DFG 1183 Organic Computing3 Sensor network = paradigm of a complex network Task: Collection of sensor data at many locations Transmit collected data to sink Applications: Forest fire surveillance Movement of cars Detection of volcanic activity Intelligent house Project introduction (1)

DFG 1183 Organic Computing4 Active node Sink Properties of a sensor network: –High node count –Random node distribution –Wireless communication Project introduction (2) Properties of a node: Typical problems: – Energy limits lifetime – Node failure rate high – Centralized control infeasible – Limited energy per node – Transmission range – Sensing range Transmission range ? Sensing range !

DFG 1183 Organic Computing5 Our goal: Increase lifetime and robustness of sensor networks using self-organized communication and organic principles Lifetime and robustness of a sensor network A network „lives“ completely: –iff phenomens still can be detected in each observed location –iff messages from acquiring nodes can reach the sink A structure of a sensor network is robust: –iff deliberate and random node failures up to a given extent do not impact lifetime Project introduction (3)

DFG 1183 Organic Computing6 OC principles in research Role assignment  Less communication Graceful degradation / Controlled shutdown  Less communication  Less computation Scale free network  More robustness Stigmergy  Energy balancing

DFG 1183 Organic Computing7 Role assignment Clusterhead: –Distributes necessary data to his cluster (i.e. sensoring cycle) –Collects and aggregates data –Communicates outside cluster Sensor nodes (Active nodes): –Measure data –Communicate with their clusterhead only Active node Sink Clusterhead In Nature: –Concentration on specialized work –Data aggregation –Improvement by learning Introducing two roles

DFG 1183 Organic Computing8 Graceful degradation / Controlled shutdown (1) In nature: Hibernation of animals In sensor networks: Detection and temporary shutdown of redundant nodes Detection: Redundant, if transmitting and sensing function can be adopted by adjacent nodes Inside a cell, only one node is necessary for coverage High effort for redundancy detection Our approach: define a grid Active node Sensing range Redundant node Max. Cellsize Active node Sink

DFG 1183 Organic Computing9 Controlled shutdown Nodes inside a cell establish a cluster Graceful degradation / Controlled shutdown (2) Clusterhead can shutdown all nodes in its cell until specified time Active node Sink Clusterhead Switched off node

DFG 1183 Organic Computing10 Scale free network (1) Network results from preferred connection US airline system Scale free network Most nodes have alike number of connections US highway system Random network

DFG 1183 Organic Computing11 Scale free network (2) Random network break down at random faults Scale free network very robust against random faults But prone to attack on main nodes

DFG 1183 Organic Computing12 Active node Sink Scale free network (3) Our approach: –starting with sink…. –after attending the network, node connects with all unconnected nodes in transmission range Combination with graceful degradation Clusterhead Switched off node

DFG 1183 Organic Computing13 Switched off node Clusterhead Switched off node Sink Stigmergy Behavior of nodes adapts to different environments Clusterheads in highly populated clusters can be exchanged easily Permitted to spend more energy Permitted to connect with more adjacent nodes New energy balanced scale free structure g Sink Clusterhead (Sparsely populated Cluster) Clusterhead (Highly populated Cluster) Switched off node

DFG 1183 Organic Computing14 Current work (1) Simulation of scale free routing strategies to analyze –Guaranteed connectivity –Behaviour of network with failed nodes –Balanced hop number Matlab  Less programming effort  Advantageous visualization Changing connection rules Higher transmission range for densely populated cells

DFG 1183 Organic Computing15 Current work (2) Simulation of selected network strategies to analyze –Energy behaviour of nodes –Network lifetime –Balancing factors NS2  Energy model available  Realistic simulation Extracting Energy

DFG 1183 Organic Computing16 Current work (3) Lifetime extension via energy aware role changing –Simulation of one routing path –Assignment of roles: Clusterhead, Gateway, Aggregator, Sensor Lifetime extension by 40%

DFG 1183 Organic Computing17 Current work (4) Analysis of different cell shapes –Hexagonal, triangular Enlargement of cells to include more nodes

DFG 1183 Organic Computing18 Future work Robustness by altruism? Adaption of changing environment parameters through learning at runtime? Improved network behavior by more specialized roles?

DFG 1183 Organic Computing19 Generic OC principles adopted and optimized for sensor networks New energy balanced and coverage aware OC routing strategy developed Successfully implemented in Matlab simulation environment Strategies should be compared in NS2 regarding network‘s robustness and lifetime Conclusion Salzmann, J.; Kubisch, S.; Reichenbach, F.; Timmermann, D., Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks, Fifth Annual IEEE International Conference on Pervasive Computing and Communications, New York, March 2007, (submitted) Kubisch, S.; Hecht, R.; Salomon, R.; Timmermann, D., Intrinsic Flexibility and Robustness in Adaptive Systems: A Conceptual Framework, 2006 IEEE Mountain Workshop on Adaptive and Learning Systems (SMCals/06), Logan, Utah, U.S.A., July 2006 Reichenbach, F.; Bobek, A.; Hagen, P.; Timmermann, D.; Increasing Lifetime of Wireless Sensor Networks with Energy-Aware Role-Changing, Proceedings of the 2nd IEEE International Workshop on Self- Managed Networks, Systems & Services (Self Man 2006), Dublin, Ireland, June 2006 Publications