Dynamic Proxy Tree-Based Data Dissemination Schemes for Wireless Sensor Networks Wensheng Zhang, Guohong Cao and Tom La Porta Department of Computer Science.

Slides:

Advertisements

Similar presentations

Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.

Advertisements

Dynamic Object Tracking in Wireless Sensor Networks Tzung-Shi Chen 1, Wen-Hwa Liao 2, Ming-De Huang 3, and Hua-Wen Tsai 4 1 National University of Tainan,

Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.

Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.

Wensheng Zhang and Guohong Cao. Dynamic Convoy Tree-based Collaboration (DCTC) 1. Constructing the Initial Convoy Tree  Apply existing root election.

산업 및 시스템 공학과 통신시스템 및 인터넷보안연구실 김효원 Optimizing Tree Reconfiguration for Mobile Target Tracking in Sensor Networks Wensheng Zhang and Guohong Cao.

A Query-Based Routing Tree in Sensor Networks In Chul Song Yohan Roh Dongjoon Hyun Myoung Ho Kim GSN 2006 (Geosensor Network) 1.

Computer Science 1 CSC 774 Advanced Network Security Enhancing Source-Location Privacy in Sensor Network Routing (ICDCS ’05) Brian Rogers Nov. 21, 2005.

Source-Location Privacy Protection in Wireless Sensor Network Presented by: Yufei Xu Xin Wu Da Teng.

1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.

Routing, Anycast, and Multicast for Mesh and Sensor Networks Roland Flury Roger Wattenhofer RAM Distributed Computing Group.

1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.

1 Prediction-based Strategies for Energy Saving in Object Tracking Sensor Networks Tzu-Hsuan Shan 2006/11/06 J. Winter, Y. Xu, and W.-C. Lee, “Prediction.

On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.

An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.

1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.

LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.

Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks Xueyan Tang School of Computer Engineering Nanyang Technological.

Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.

1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:

Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.

An adaptive framework of multiple schemes for event and query distribution in wireless sensor networks Vincent Tam, Keng-Teck Ma, and King-Shan Lui IEEE.

Secure Cell Relay Routing Protocol for Sensor Networks Xiaojiang Du, Fengiing Lin Department of Computer Science North Dakota State University 24th IEEE.

Research Projects in the Mobile Computing and Networking (MCN) Lab Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University.

Offline Algorithmic Techniques for Several Content Delivery Problems in Some Restricted Types of Distributed Systems Mugurel Ionut Andreica, Nicolae Tapus.

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.

Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

De-Nian Young Ming-Syan Chen IEEE Transactions on Mobile Computing Slide content thanks in part to Yu-Hsun Chen, University of Taiwan.

Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.

1 A Bidding Protocol for Deploying Mobile Sensors GuilingWang, Guohong Cao, and Tom LaPorta Department of Computer Science & Engineering The Pennsylvania.

G-REMiT: An Algorithm for Building Energy Efficient Multicast Trees in Wireless Ad Hoc Networks Bin Wang and Sandeep K. S. Gupta NCA’03 speaker ： Chi-Chih.

TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.

Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.

An Improved Kademlia Protocol In a VoIP System Xiao Wu ， Cuiyun Fu and Huiyou Chang Department of Computer Science, Zhongshan University, Guangzhou, China.

WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.

2007/03/26OPLAB, NTUIM1 A Proactive Tree Recovery Mechanism for Resilient Overlay Network Networking, IEEE/ACM Transactions on Volume 15, Issue 1, Feb.

Query Aggregation for Providing Efficient Data Services in Sensor Networks Wei Yu *, Thang Nam Le +, Dong Xuan + and Wei Zhao * * Computer Science Department.

Problem Wensheng Zhang, Dr. Guohong Cao, and Dr. Tom La Porta Example: Battlefield Surveillance Challenges Small Sensing Range Limitations in sensor nodes.

A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.

K-Anycast Routing Schemes for Mobile Ad Hoc Networks 指導老師 : 黃鈴玲教授學生 : 李京釜.

An Adaptive Energy-Efficient and Low- Latency MAC for Data Gathering in Wireless Sensor Networks Gang Lu, Bhaskar Krishnamachari, and Cauligi S. Raghavendra.

MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,

1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,

Node Reclamation and Replacement for Long-lived Sensor Networks Bin Tong, Wensheng Zhang, and Chuang Wang Department of Computer Science, Iowa State University.

Energy-Conserving Data Placement and Asynchronous Multicast in Wireless Sensor Networks Sagnik Bhattacharya, Hyung Kim, Shashi Prabh, Tarek Abdelzaher.

Ad Hoc Multicast Routing

Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.

A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.

Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.

Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +

An Adaptive Zone-based Storage Architecture for Wireless Sensor Networks Thang Nam Le, Dong Xuan and *Wei Yu Department of Computer Science and Engineering,

Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †

Centralized Transmission Power Scheduling in Wireless Sensor Networks Qin Wang Computer Depart., U. of Science & Technology Beijing Edward Y. Hua Wireless.

A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.

Auto-configuration In Wireless Sensor Networks Nakjung Choi, Haeyong Kim, Minji Nam April Fools’ Day.

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.

Fundamentals of Computer Networks ECE 478/578

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)

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.

Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.

Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.

Mobile Networks and Applications (January 2007) Presented by J.H. Su ( 蘇至浩 ) 2016/3/21 OPLab, IM, NTU 1 Joint Design of Routing and Medium Access Control.

VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰

A Spatial-based Multi-resolution Data Dissemination Scheme for Wireless Sensor Networks Jian Chen, Udo Pooch Department of Computer Science Texas A&M University.

Computer Science Least Privilege and Privilege Deprivation: Towards Tolerating Mobile Sink Compromises in Wireless Sensor Network Presented by Jennifer.

Author：Zarei.M.；Faez.K. ；Nya.J.M.

Virtual Domain and Coordinate Routing in Wireless Sensor Networks

任課教授：陳朝鈞教授學生：王志嘉、馬敏修

Presentation transcript:

Dynamic Proxy Tree-Based Data Dissemination Schemes for Wireless Sensor Networks Wensheng Zhang, Guohong Cao and Tom La Porta Department of Computer Science and Engineering The Pennsylvania State University IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS) 2004 Speaker: Shin-Wei Ho

Outline Introduction System Model Distributed Tree Reconfiguration Schemes Performance Evaluations Conclusion

Introduction Applications of Sensor networks Battlefield surveillance Environmental control Security management Source and the sinks may frequently move.

Introduction

Tree-based multicasting scheme A sink may frequently fail to receive data Broken paths Tree should be frequently configured to reconnect sources and sinks.

Introduction Goal Dynamic proxy tree-based framework tree reconfiguration is conducted in an energy efficient way. minimize the data dissemination cost

System Model stationary sensor nodes each sensor node knows its own location some mobile hosts mobile target

System Model -- Dynamic Proxy Tree-Based Framework proxy does not change until its distance to the source (sink) exceeds a certain threshold

Distributed Tree Reconfiguration Schemes The problem of forming a minimum- cost proxy tree minimum Steiner tree NP-hard problem Need to collect information Shortest Path-Based (SP) Scheme Spanning Range-Based (SR) Scheme

Distributed Tree Reconfiguration Schemes -- Shortest Path-Based (SP) Scheme Basic Idea A new proxy should join the current proxy tree by attaching to the tree node that has the shortest distance to it.

Distributed Tree Reconfiguration Schemes -- Shortest Path-Based (SP) Scheme Proxy Join Step 1: Pre-searching join_req join_rep

Distributed Tree Reconfiguration Schemes -- Shortest Path-Based (SP) Scheme Proxy Join Step 2: Finding the closest node discover confirm

Distributed Tree Reconfiguration Schemes -- Shortest Path-Based (SP) Scheme Proxy Join Step 3: Node join Full Steiner tree Steiner Point

Distributed Tree Reconfiguration Schemes -- Shortest Path-Based (SP) Scheme leave_req Proxy leave

Distributed Tree Reconfiguration Schemes -- Shortest Path-Based (SP) Scheme Proxy leave

Distributed Tree Reconfiguration Schemes -- Shortest Path-Based (SP) Scheme Sink (Source) Movement Initiated Tree Reconfiguration a sink (source) moves and becomes far away from its proxy the current proxy should be changed to another node which is closer to the sink (source).

Distributed Tree Reconfiguration Schemes -- Shortest Path-Based (SP) Scheme Sink (Source) Movement Initiated Tree Reconfiguration Step 1: Establishing a temporary edge migrate_req

Distributed Tree Reconfiguration Schemes -- Shortest Path-Based (SP) Scheme Sink (Source) Movement Initiated Tree Reconfiguration Step 2: Finding the closest node

Distributed Tree Reconfiguration Schemes -- Shortest Path-Based (SP) Scheme Sink (Source) Movement Initiated Tree Reconfiguration Step 3: Joining the tree Steiner point Full Steiner tree

Distributed Tree Reconfiguration Schemes -- Shortest Path-Based (SP) Scheme Periodic Localized Tree Reconfiguration the subtrees that it leaves or joins are reconfigured the remaining part of the tree is untouched Each Steiner point node monitors the changes. Finds the optimal location for itself

Distributed Tree Reconfiguration Schemes -- Spanning Range-Based (SR) Scheme In the SP scheme, a new proxy needs to flood discover messages to find its position in the proxy tree. large overhead The Basic Idea Each subtree is assigned a certain spanning range

Distributed Tree Reconfiguration Schemes -- Spanning Range-Based (SR) Scheme The basic idea of the SR scheme

Distributed Tree Reconfiguration Schemes -- Spanning Range-Based (SR) Scheme The basic idea of the SR scheme

Distributed Tree Reconfiguration Schemes -- Spanning Range-Based (SR) Scheme Spanning Range Assignment

Distributed Tree Reconfiguration Schemes -- Spanning Range-Based (SR) Scheme

According to the spanning range assignment rule, each node on the tree decide the spanning range of its children send the range to them (piggybacked)

Distributed Tree Reconfiguration Schemes -- Spanning Range-Based (SR) Scheme Node Join Similar to the SP scheme, it selects a nearby sensor node Pn as its proxy and asks it to join the tree. Pn sends a join_req to the source proxy P

Distributed Tree Reconfiguration Schemes -- Spanning Range-Based (SR) Scheme P decides the location of Pn as follows: P calculates the spanning ranges of its children. Otherwise, P adds Pn as its child.

Distributed Tree Reconfiguration Schemes -- Spanning Range-Based (SR) Scheme

Sink Movement-Triggered Tree Reconfiguration If it is still in the range, Pi (the parent of Pn) follows the similar procedure of adding a new proxy. Otherwise, it forward add_req to its parent. pi pnPn ’

Distributed Tree Reconfiguration Schemes -- Spanning Range-Based (SR) Scheme Source Movement-Triggered Tree Reconfiguration P ’ P’P’ The change of root causes the other nodes in the tree to change their spanning ranges On receiving its new spanning range, each node Pn checks its children one by one

Performance Evaluations MATLAB 516, 2064 nodes 500×500, 1000×1000 square. 1 target 10 sinks NS MAC GPSR routing 516 nodes Communication range of 40m 500x500 square 1 target 10 sinks

Performance Evaluations -- Comparing the tree weights of different schemes (average velocity=2.5m/s, localized reconfiguration interval= 1s) MST SP SR

Performance Evaluations -- Comparing SR and SP

Performance Evaluation -- Impact of the localized reconfiguration mechanism ( SiMTR=Sink movement-initiated tree reconfiguration)

Performance Evaluations -- Impact of the SoMTP mechanism (average sink velocity=5.0m/s)

Conclusion In this paper, we addressed the problem of efficient dynamic multicasting in wireless sensor networks dynamic proxy tree-based framework Focused on the issue of efficiently reconfiguring the proxy tree The results showed that the SR scheme outperforms the SP scheme.

Question? Thank you.