MMLAB NETWORK SEMINAR Tree-Based Data Broadcast in IEEE 802.15.4 and ZigBee Networks Written by Gang Ding(Purdue Univ.), Zafer Sahinoglu(MERL), Philip.

Slides:



Advertisements
Similar presentations
Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/06/26.
Advertisements

Computer Networking A Top-Down Approach Chapter 4.7.
Scalable Content-Addressable Network Lintao Liu
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
CSE 534 Fundamentals of Computer Networks Lecture 4: Bridging (From Hub to Switch by Way of Tree) Based on slides from D. Choffnes Northeastern U. Revised.
CS 4700 / CS 5700 Network Fundamentals Lecture 7: Bridging (From Hub to Switch by Way of Tree) Revised 1/14/13.
Wavelength Assignment in Optical Network Design Team 6: Lisa Zhang (Mentor) Brendan Farrell, Yi Huang, Mark Iwen, Ting Wang, Jintong Zheng Progress Report.
Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/6/26.
Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Minema 1 From chemical signals to event dissemination in a mobile system EPFL Distributed Programming Laboratory Sébastien Baehni, Chirdeep S. Chhabra,
Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.
1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.
1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.
Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.
1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.
A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc Networks R. S. Sisodia, Karthigeyan. I, B. S. Manoj, and C. Siva Ram Murthy ICC 2003.
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
Finding Protection Cycles in DWDM Networks 2002 IEEE ICC on Volume 5, 28 April-2 May Page(s): Reporter: Jyun-Yong Du.
Topology-Aware Overlay Networks By Huseyin Ozgur TAN.
Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
1 The Orphan Problem in ZigBee- based Wireless Sensor Networks IEEE Trans. on Mobile Computing (also in MSWiM 2007) Meng-Shiuan Pan and Yu-Chee Tseng Department.
Efficient and Reliable Broadcast in ZigBee Networks Purdue University, Mitsubishi Electric Lab. To appear in SECON 2005.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
Wireless internet routing Philippe Jacquet. Internet and networking Internet –User plurality connected to –Sources plurality.
Power-Balance Broadcast in Wireless Mobile Ad Hoc Networks Jang-Ping Sheu, Yu-Chia Chang, and Hsiu- Ping Tsai National Central University, Chung-Li, 32054,Taiwan.
Presented by Fei Huang Virginia Tech April 4, 2007.
CS-691 SEMINAR Dr. Omar Abdullah Batarfi
CS 5565 Network Architecture and Protocols Godmar Back Lecture 22.
Tonghong Li, Yuanzhen Li, and Jianxin Liao Department of Computer Science Technical University of Madrid, Spain Beijing University of Posts & Telecommunications.
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks Jian Li and Prasant Mohapatra GlobeCom’03 Speaker ︰ CHUN-WEI.
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
On Reducing Broadcast Redundancy in Wireless Ad Hoc Network Author: Wei Lou, Student Member, IEEE, and Jie Wu, Senior Member, IEEE From IEEE transactions.
/ 22 1 A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks Hai Liu Xiaohua Jia Peng-Jun Wan Dept. of Comput.
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Efficient Flooding in Ad Hoc Networks: a Comparative Performance Study
Geographic Routing without Location Information Ananth Rao, Sylvia Ratnasamy, Christos Papadimitriou, Scott Shenker and Ion Stoica MobiCom 2003.
PRIN WOMEN PROJECT Research Unit: University of Naples Federico II G. Ferraiuolo
On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks By J. Wu and H. Li Instructor: Dr. Yinghsu Li Presented by: Chinh.
A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.
On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using Directional Antennas Minglu Li ( Department of Computer Science.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Scalable and Robust Data Dissemination in Wireless Sensor Networks Wei Liu, Yanchao Zhang, Yuguang Fang, Tan Wong Department of Electrical and Computer.
Time-stable geocast for ad hoc networks and its application with virtual warning signs Volume 27, Issue 11, 1 July 2004, Pages Applications and.
Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.
1 Along & across algorithm for routing events and queries in wireless sensor networks Tat Wing Chim Department of Electrical and Electronic Engineering.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Localization for Anisotropic Sensor Networks
A Location-Based Routing Method for Mobile Ad Hoc Networks
Salah A. Aly ,Moustafa Youssef, Hager S. Darwish ,Mahmoud Zidan
A Study of Group-Tree Matching in Large Scale Group Communications
Link-State Routing Protocols
GPSR Greedy Perimeter Stateless Routing
Trajectory Based Forwarding
Optimal Configuration of OSPF Aggregates
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
by Saltanat Mashirova & Afshin Mahini
Dewan Tanvir Ahmed and Shervin Shirmohammadi
Link-State Routing Protocols
Connected Dominating Sets
CRBcast: A Collaborative Rateless Scheme for Reliable and Energy-Efficient Broadcasting in Wireless Sensor/Actuator Networks Nazanin Rahnavard, Badri N.
Link-State Routing Protocols
The Coverage Problem in a Wireless Sensor Network
Pouya Ostovari, Jie Wu, and Abdallah Khreishah
Presentation transcript:

MMLAB NETWORK SEMINAR Tree-Based Data Broadcast in IEEE 802.15.4 and ZigBee Networks Written by Gang Ding(Purdue Univ.), Zafer Sahinoglu(MERL), Philip Orlik(MERL), Jinyun Zhang(MERL), Bharat Bhargava(Purdue Univ.) 2007.03.23 Presented by Chang, Dukhyun

Contents Introduction Background Proposed Algorithms 802.15.4 & ZigBee Networks Proposed Algorithms ZigBee On-Tree Self-Pruning Algorithms ZigBee On-Tree Selection Algorithms Performance Evaluations Conclusion

Introduction Broadcasting in Ad hoc Networks Flooding -> broadcasting storm problem Finding minimum forwarding nodes -> NP hard Some heuristic algorithms algorithms based on greedy forward node selection algorithms assuming extra info (location, 2-hop neighbor info) -> inefficient or not practical in ZigBee Networks

Introduction Characteristics of ZigBee Networks limited computation and storage capacity no sophisticated algorithms small size & low cost no accurate location info. low data rate & low power no exchanging large neighbor info Motivated to find localized and light-weight broadcast algorithm

802.15.4 & ZigBee Networks Device Types FFD, RDD Network Structure

802.15.4 & ZigBee Networks Routing Tree Routing AODVjr Forming tree structure with assigning address An = Aparent + Cskipx(n-1) + n (n≥1) Cskip

802.15.4 & ZigBee Networks Assigning address No Routing tables ! if Cskip= 21 when d=0 Current Broadcasting in ZigBee Networks only tree neigbors rebroadcast A0=0 No Routing tables ! A0=1 A0=22

ZigBee On-Tree Self-Pruning Motivation General Self-Pruning (a Scalable Broadcast Algorithm(SBA)) rebroadcasting after random period if all neighbors of a node v(=N(v)) are covered, no rebroadcasting must receive packets from N(v) 2-hop neighbor info is assumed need to exchange neighbor info. -> not practical in ZigBee networks ZigBee On-Tree Self-Pruning using light info. tree structure info. 1-hop neighbor’s address 1-hop neighbor’s # of children when node u is a neighbor node of node v we cannot know N(u) but on-tree neighbor of node u(=TN(u))

ZigBee On-Tree Self-Pruning ZigBee On-Tree Self-Pruning Algorithm rebroadcasting after random period if all On-Tree neighbors of a node v(=TN(v)) are covered, no rebroadcasting can know coverage rapidly using TN(u)

ZigBee On-Tree Selection Goal Find the smallest node set subset F(v) s.t. F(v) is subset of N(v) to on-tree cover TN(N(v)) Motivation no 2-hop neighbor info. -> using on-tree neighbor info. solves problem in polynomial time (OOS) solves problem with polynomial memory (ZOS) cover the whole network Consider covering TN(N(v)) -> trade-off!

ZigBee On-Tree Selection Optimal On-Tree Selection Algorithm Candidate forward nodes of v To-be-covered nodes of A

ZigBee On-Tree Selection Example compare with greedy algorithm (Ad Hoc Broadcast Protocol(AHBP))

Performance Evaluation an event-driven simulator in MATLAB 100m x 100m Comparison Scalable Broadcast Algorithm(SBA) Ad Hoc Broadcast Protocol(AHBP) ZigBee broadcast algorithm currently used Global algorithm (global network topology is known)

Performance Evaluation Physical topology ZigBee topology ZigBee(100) SBA(85) OSR(51) AHBP(36) ZOS(31) Global(10)

Performance Evaluation The number of rebroadcasting nodes Coverage time

Performance Evaluation Average duplicated packets

Conclusion Given only phisical 1-hop neighbor & logical tree neighbors, this paper two roadcast algorithms for IEEE 802.15.4 & ZigBee networks the on-tree self –pruning rebroadcast algorithm the ZigBee on-tree selection algorithm, ZOS The proposed schemes outperform other schemes These schemes are feasible in computation complexity & memory space complexity