VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate- Based Routing in Wireless Sensor Networks Ming-Jer Tsai, Associate Professor.

Slides:

Advertisements

Similar presentations

Low Overhead With Speed Aware Routing (LOWSAR) in VANETs By Kannikar Siriwong Na Ayutaya.

Advertisements

Geographic Routing Without Location Information AP, Sylvia, Ion, Scott and Christos.

Multicasting in Mobile Ad hoc Networks By XIE Jiawei.

Scalable Content-Addressable Network Lintao Liu

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

Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.

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

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,

TDMA Scheduling in Wireless Sensor Networks

Geo – Routing in ad hoc nets References: Brad Karp and H.T. Kung “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000 M. Zorzi,

Geographic Routing Without Location Information A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, I. Stoica Paper and Slides by Presented by Ryan Carr.

Good afternoon everyone.

KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.

A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.

Haiyun Luo, Fan Ye, Jerry Cheng, Songwu Lu, Lixia Zhang

Efficient Hop ID based Routing for Sparse Ad Hoc Networks Yao Zhao 1, Bo Li 2, Qian Zhang 2, Yan Chen 1, Wenwu Zhu 3 1 Lab for Internet & Security Technology,

May 14, Organization Design and Dynamic Resources Huzaifa Zafar Computer Science Department University of Massachusetts, Amherst.

Axis-Based Virtual Coordinate Assignment Protocol and Delivery- Guaranteed Routing Protocol in Wireless Sensor Networks M.J.Tsai, H.Y.Yang, and W.Q.Huang.

後卓越計畫進度報告 (2007/6/4) 中央大學許健平教授淡江大學張志勇教授. Routing with Hexagonal Virtual Coordinate in Wireless Sensor Networks.

A Distance Routing Effect Algorithm for Mobility (DREAM)* Stefano Basagni Irnrich Chlamtac Violet R. Syrotiuk Barry A. Woodward.

Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets.

Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.

Delay-aware Routing in Low Duty-Cycle Wireless Sensor Networks Guodong Sun and Bin Xu Computer Science and Technology Department Tsinghua University, Beijing,

Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.

Fault Tolerant and Mobility Aware Routing Protocol for Mobile Wireless Sensor Network Name : Tahani Abid Aladwani ID :

A Framework for Energy- Saving Data Gathering Using Two-Phase Clustering in Wireless Sensor Networks Wook Chio, Prateek Shah, and Sajal K. Das Center for.

2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.

Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.

College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.

SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.

ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.

Efficient HopID Based Routing for Sparse Ad Hoc Networks Yan Chen Lab for Internet & Security Technology (LIST) Northwestern University

On Reducing Broadcast Redundancy in Wireless Ad Hoc Network Author: Wei Lou, Student Member, IEEE, and Jie Wu, Senior Member, IEEE From IEEE transactions.

PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.

Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,

SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.

A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.

Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up for Wireless Sensor Networks Zhihui Chen and Ashfaq Khokhar ECE Department, University.

Geographic Routing without Location Information Ananth Rao, Sylvia Ratnasamy, Christos Papadimitriou, Scott Shenker and Ion Stoica MobiCom 2003.

Ａ Novel GPS-based Quorum Hybrid Routing Algorithm for Ad Hoc Wireless Network I-Shyan Hwang and Chih-Kang Chien.

Sanjay K. Dhurandher, Mohammad S. Obaidat, Fellow of IEEE and Fellow of SCS, Siddharth Goel and Abhishek Gupta CAITFS, Division of Information Technology,

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.

GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks Qing Fang, Jie Gao, Leonidas J. Guibas, Vin de Silva, Li Zhang Department of Electrical.

Po-Yu Chen, Zan-Feng Kao, Wen-Tsuen Chen, Chi-Han Lin Department of Computer Science National Tsing Hua University IEEE ICPP 2011 A Distributed Flow-Based.

SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.

Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.

GEOCASTING IN MOBILE AD HOC NETWORKS LOCATION- BASED MULTICAST ALGORITHMS 指導教授：許子衡教授學生：翁偉傑 1 Young-Bae Ko and Nitin H. Vaidya Department of Computer.

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

A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks Wen-Tsuen Chen Department of Computer Science National Tsing Hua University Po-Yu.

FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee and Young- Bae Ko Ajou University.

Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.

指導教授：許子衡教授學生：黃群凱 2016/2/251 Proceedings of the 2008 IEEE International Conference on Vehicular Electronics and Safety Columbus, OH, USA. September 22-24,

VORONOI DIAGRAM AND CONVEX HULL BASED GEOCASTING AND ROUTING IN WIRELESS NETWORKS 指導教授：許子衡報告學生：翁偉傑 1 Copyright # 2006 John Wiley & Sons, Ltd. Wirel. Commun.

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)

Structure-Free Data Aggregation in Sensor Networks.

March 9, Broadcasting with Bounded Number of Redundant Transmissions Majid Khabbazian.

ProgessFace: An Algorithm to Improve Routing Efficiency of GPSR-like Routing Protocols in Wireless Ad Hoc Networks Chia-Hung Lin, Shiao-An Yuan, Shih-Wei.

1 Multipath Routing in WSN with multiple Sink nodes YUEQUAN CHEN, Edward Chan and Song Han Department of Computer Science City University of HongKong.

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, 鄭宇辰

-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.

Power-Aware Topology Control for Wireless Ad-Hoc Networks Wonseok Baek and C.-C. Jay Kuo Department of Electrical Engineering University of Southern California.

Geographic Routing without Location Information. Assumption by Geographic Routing Each node knows its own location.  outdoor positioning device: GPS:

Architecture and Algorithms for an IEEE 802

Virtual Domain and Coordinate Routing in Wireless Sensor Networks

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

High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks

Topology Control and Its Effects in Wireless Networks

Presentation transcript:

VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate- Based Routing in Wireless Sensor Networks Ming-Jer Tsai, Associate Professor Department of Computer Science National Tsing Hua University

Sensors Eco ( 周百祥教授 ) Octopus II ( 許建平教授 )

Wireless Sensor Network 台北市政府空調監測系統玻璃基板輸送帶震動監控土石流暨五彎仔邊坡滑動監測生理資訊追蹤及肢體互動系統

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Wireless Sensor Network

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab.  Geographic Routing Protocol -GPS Assistance -A large amount of power consumption -Cannot be used indoor -Not suitable for wireless sensor networks  Virtual-Coordinate-Based Routing Protocol -Virtual Coordinate Assignment Protocol Routing Protocol

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. VCap (0,8,5) (1,7,4) (2,7,4) (2,8,3) (2,6,3) (3,6,4) (3,5,3) (3,5,2) (3,7,2) (4,6,1) (4,5,1) (4,4,2) (4,4,3) (5,6,0) (5,5,1) (5,3,3) (5,4,4) (6,5,5) (6,2,4) (6,4,5) (7,4,6) (7,3,6) (8,3,7) (8,2,7) (7,1,5) (8,1,6) (8,0,6) X Z Y (4,4,3)

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. VCap Routing Protocol (0,8,5) (1,7,4) (2,7,4) (2,8,3) (2,6,3) (3,6,4) (3,5,3) (3,5,2) (3,7,2) (4,6,1) (4,5,1) (4,4,2) (4,4,3) (5,6,0) (5,5,1) (5,3,3) (5,4,4) (6,5,5) (6,2,4) (6,4,5) (7,4,6) (7,3,6) (8,3,7) (8,2,7) (7,1,5) (8,1,6) (8,0,6) D(15,1)=sqrt(22), D(15,4)=sqrt(27), D(15,12)=sqrt(36), D(15,23)=sqrt(12), D(15,25)=sqrt(14). 23 D(15,1)=sqrt(22), D(15,2)=sqrt(3), D(15,4)=sqrt(27), D(15,23)=sqrt(12), D(15,25)=sqrt(14). 2 Src Dst D(15,2)=sqrt(3), D(15,15)=sqrt(0), D(15,23)=sqrt(12).

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Dead-End Problem of VCap Routing Protocol (0,8,5) (1,7,4) (2,7,4) (2,8,3) (2,6,3) (3,6,4) (3,5,3) (3,5,2) (3,7,2) (4,6,1) (4,5,1) (4,4,2) (4,4,3) (5,6,0) (5,5,1) (5,3,3) (5,4,4) (6,5,5) (6,2,4) (6,4,5) (7,4,6) (7,3,6) (8,3,7) (8,2,7) (7,1,5) (8,1,6) (8,0,6) 22 D(22,8)=sqrt(2), D(22,11)=sqrt(5), D(22,12)=sqrt(2), D(22,16)=sqrt(5), D(22,21)=sqrt(2). 21 Src Dst

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Virtual-Coordinate-Based Routing Protocols Routing ProtocolDelivery Guarantee Feature MAP (Mobicom 2005) Yes Axis-based, long path, need global topology ABVCap (Infocom 2007)YesAxis-based, long path VCap (Infocom 2005)NoLandmark-based, short path NoLandmark-based, short path HopID (TMC 2007)NoLandmark-based, short path VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual- Coordinate-Based Routing in Wireless Sensor Networks GLIDER (Infocom 2005) NoLandmark-based, short path GLDR (Infocom 2007)

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Outline  Virtual Face Construction Protocol  Virtual Face Naming Protocol  The VirtualFace Algorithm (VF)  Performance Evaluation  Conclusion

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. The Purpose X Y Z (10,0,6) (6,4,3) (7,4,2) (5,5,2) (6,5,1) (7,5,2) (8,6,3) (9,7,4) (6,6,3) (7,3,3) (4,6,3) (3,7,4) (2,8,5)(1,9,6) (0,10,7) (7,6,0) (9,1,5) (8,2,4) Src Dst (7,5,4) Dead-End Node (6,6,3) (8,6,3) (6,6,3) (7,7,4)

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. The Purpose X Y Z (10,0,6) (6,4,3) (7,4,2) (5,5,2) (6,5,1) (7,5,2) (8,6,3) (9,7,4) (7,3,3) (4,6,3) (3,7,4) (2,8,5)(1,9,6) (0,10,7) (7,6,0) (9,1,5) (8,2,4) Src Dst (7,5,4) Dead-End Node (6,6,3) (8,6,3) Progress Node (6,6,3) (7,7,4)

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. The Idea Head Node Tail Node

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. The Implementation Preprogrammed Node (0) (1) (2) (3) (4) (2) (4) (5) (6) Tail Node

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. The Implementation (0) (1) (2) (3) (4) (2) (4) (5) (6) Tail Node

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Message Reduction (1) (0) (1) (2) (3) (4) (2) (4) (5) (6) Tail Node (2)

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Construction of Connected Dominating Set

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Message Reduction (2) (0) (1) (2) (1) (3) (2) (4) (2) (3) (5) (6)

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Generation of Triangle-Free Subnetwork

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Virtual Face Construction Protocol

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Outline  Virtual Face Construction Protocol  Virtual Face Naming Protocol  The VirtualFace Algorithm (VF)  VCap augmented with the VirtualFace algorithm (VCap+VF)  Performance Evaluation  Conclusion

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. The Purpose (6,4,3) (7,4,2) (5,5,2) (6,5,1) (7,5,2) (8,6,3) (9,7,4) (7,3,3) (4,6,3) (3,7,4) (2,8,5)(1,9,6) (7,6,0) (9,1,5) (8,2,4) Src Dst (6,6,3) (9,7,4) f1 f2 f7 f5 f4 f6 f3

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. The Idea f1 f2 f7 f5 f4 f6 f3 f4 f6 f5 f7 f2 f1 f3 Src Dst

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. The Idea f4 f6 f5 f7 f2 f1 f3 f4 f6 f5 f7 f2 f1 f3

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. f1 f2 f7 f3 f6 f4 f5 0 2π2π 02π/8 0 f2 f7 2π/4 3π/12 f2 f6 f7 2π/8 The Idea 6π/12 f1 f2 f7 f5 f4 f6 f

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. f1 f2 f7 f5 f4 f6 f3 u w v m : f1.radius=0, f1.angle= : f4.radius=0, f4.angle= : f5.radius=0, f5.angle= fp=f1, f1.id, f1.angle, f1.radius f1.size=8, u.seq(f1)=2, f2.id, f6.id, f7.id u message content: w: f2.radius=1, f2.angle= fp=f1, f1.id, f1.angle, f1.radius f1.size=8, m.seq(f1)=1, f2.id, f7.id m message content: w: f2.radius=1, f2.angle= n fp=f4, f4.id, f4.angle, f4.radius f4.size=4, n.seq(f1)=2, f6.id n message content: v: f6.radius=1, f6.angle= The Implementation

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Outline  Virtual Face Construction Protocol  Virtual Face Naming Protocol  The VirtualFace Algorithm (VF)  Performance Evaluation  Conclusion

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. The Purpose (6,4,3) (7,4,2) (5,5,2) (6,5,1) (7,5,2) (8,6,3) (9,7,4) (7,3,3) (4,6,3) (3,7,4) (2,8,5) (1,9,6) (7,6,0) (9,1,5) (8,2,4) Src Dst (6,6,3) (9,7,4) f1 f2 f7 f5 f4 f6 f3 Route a packet in a virtual face closest to the destination virtual face

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. The Idea f1 f2 f7 f3 f6 f4 f5 f1 f2 f3 f6 f4 f5 Dst Src Dst Src

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Delivery Guarantee It suffices to show for each virtual face, there exists a neighboring virtual face closer to the destination virtual face. f1 f2 f7 f3 f6 f4 f5 Src f4 Dst f1 Src Dst

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. VCap + VirtualFace X (6,4,3) (7,4,2) (5,5,2) (6,5,1) (7,5,2) (8,6,3) (9,7,4) (6,6,3) (7,3,3) (4,6,3) (3,7,4) (2,8,5) (1,9,6) (0,10,7) (7,6,0) (9,1,5) (8,2,4) (8,3,4) (8,4,4) (8,6,3) (9,7,4) (10,8,5) (8,6,3) (9,7,4) Y Z (10,0,6) (8,3,4) VCap VirtualFace Src Dst

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab.  Virtual Face Construction Protocol  Virtual Face Naming Protocol  The VirtualFace Algorithm (VF)  Performance Evaluation  Conclusion Outline

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Performance Evaluation  Assumptions -The network was static. -The transmission range of a node was a circle of radius 1. -Network behavior were not taken into consideration.  Setup -Network size: 25*25 -Network density: 10, 15, 20, 25, 30 -Node Failure : 0%, 10%  Empirical data were obtained by averaging data of 1000 source-destination pairs from 100 networks.

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Packet Delivery Rate

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Routing Path Length

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Number of Next Hop Neighbors

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Load Imbalance Factor

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Number of Broadcasts

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Packet Delivery Rate in Networks with Node Failure

National Tsing Hua University Department of Computer Science Mobile and Distributed Computing Lab. Conclusion  We proposed the VirtualFace algorithm to guarantee packet delivery of virtual-coordinate-based routing protocols in wireless sensor networks.  After augmented with the VirtualFace algorithm, virtual-coordinate-based routing protocols GLIDER, Hop ID, GLDR, and VCap each -guarantee packet delivery -improve load balance -enhance fault tolerance -suffer from longer routing paths -decrease routing flexibility -require larger coordinate assignment costs  As compared to ABVCap, after augmented with the VirtualFace algorithm, -Hop ID, GLDR, and VCap each have a shorter routing path -GLIDER, Hop ID, GLDR, and VCap each have a higher packet delivery rate in networks with node failure