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

Slides:

Advertisements

Similar presentations

4/12/2015© 2009 Raymond P. Jefferis IIILect Internet Protocol - Continued.

Advertisements

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

Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets R. Fonseca, Berkeley; S. Ratnasamy, Intel Research; J. Zhao, ICI; C. T. Ee,

指導教授：許子衡教授報告學生：馬敏修 2010/8/ Introduction 2. Geocast Routing Protocols  2.1 GAMER Overview 3. GAMER Details  3.1 Building the Mesh  3.2 Adaptation.

後卓越進度報告蔡育仁老師實驗室 2006/06/05. Step-by-Step Deployment of Location Sensors by Cramér-Rao Lower Bound Cramér-Rao Lower Bound (CRLB) is a lower bound of the.

後卓越進度報告蔡育仁老師實驗室 2007/03/19. Distribute Source Coding (DSC) in WSNs Distributed source coding is a data compression technique to reduce the redundancy.

1 後卓越計畫進度報告曾煜棋老師實驗室. 2 Problem Statement Event-driven Sensor Networks Exploiting the spatial correlation of sensor data Designing a specific MAC protocol.

1 大學學術追求卓越發展延續計畫年度成果發表 ~ 下一世代資訊通訊網路尖端技術與應用 ( 二 ) 子計畫四無線隨意及感測網路技術陳文村教授曾煜棋教授許健平教授陳志成教授蔡育仁教授王晉良教授張志勇教授楊舜仁教授.

後卓越進度報告蔡育仁老師實驗室 2006/12/06. Distribute Source Coding (DSC) in WSNs Distributed source coding (DSC) is a data compression technique to reduce the redundancy.

1 後卓越計畫進度報告曾煜棋老師實驗室. 2 A Link-layer Protocol for Event-driven WSNs Joint two subissues Exploiting the spatial correlation of sensor data Designing a.

1/7/ 後卓越計畫進度報告 Broadband System Laboratory Advisor : Prof. Chin-Liang Wang Presented by Tran Duc Thang A NEW TECHNIQUE FOR LOCALIZATION IN WIRELESS.

後卓越進度報告蔡育仁老師實驗室 2006/11/13. Distribute Source Coding (DSC) in WSNs Distributed source coding (DSC) is a data compression technique to reduce the redundancy.

後卓越計畫進度報告清華大學許健平教授淡江大學張志勇教授 96/08/13. Optimal Deployment rsrs rsrs rsrs AB C Sensing range rsrs.

後卓越計畫進度報告清華大學陳文村教授 Outline Completed works Current works Publications.

後卓越進度報告蔡育仁老師實驗室 2006/07/10. Non-uniform Deployment for Lifetime-based Sensor Networks Propose a non-uniform density for random deployment based on the.

Advanced Techniques of Mobile Ad Hoc and Wireless Sensor Networks 教育部顧問室 95 年度「通訊科技人才培育先導型計畫通訊科技領域特定課程 Prof. Yuh-Shyan Chen Department of Computer Science.

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.

後卓越進度報告蔡育仁老師實驗室 2006/09/04. Distribute Source Coding in WSNs Distributed source coding is a data compression technique to reduce the redundancy without.

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.

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.

後卓越進度報告蔡育仁老師實驗室 2006/05/01. Implementation — Coverage-preserving Routing (1/2) R1, R2 and R3: disjoint routes to the destination Coverage Metric: R2.

後卓越計畫 — 子計畫四進度報告陳文村校長實驗室 MNET. Lab.2 Group Guiding Services in WSNs Leader tracking Help service Member -recall.

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

Link State Routing Protocols Last Update Copyright Kenneth M. Chipps Ph.D.

Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.

Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.

Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.

Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.

The Network Layer.

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

A Survey of Geocast Routing Protocols 指導教授：許子衡教授報告學生：馬敏修指導教授：許子衡教授報告學生：馬敏修.

1 A Practical Routing Protocol for Vehicle-formed Mobile Ad Hoc Networks on the Roads 指導教授：許子衡教授報告學生：董藝興學生作者： Wang, S.Y.; Lin, C.C.; Hwang, Y.W.; Tao,

Dynamic Routing in Mobile Ad Hoc Network 報告者：呂佐鴻指導教授：李鴻璋.

Networking and internetworking devices. Repeater.

An Efficient Wireless Mesh Network A New Architecture 指導教授：許子衡教授學生：王志嘉.

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

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)

Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.

Architecture and algorithms for an IEEE based multi-channel wireless mesh network 指導教授：許子衡老師學生：王志嘉.

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

Adaptive Routing Protocol for VANETs in City Environments using Real-Time Traffic Information 指導教授：許子衡教授報告學生：董藝興學生作者： Arzil, S.A. ; Aghdam,.H. ; Jamali,

後卓越計畫進度報告楊舜仁老師實驗室 SCTP Multihoming.

2010 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), pp , 作者： Yoh Shiraishi, Ryo Miki 指導教授：許子衡教授.

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.

Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali :

“LPCH and UDLPCH: Location-aware Routing Techniques in WSNs”. Y. Khan, N. Javaid, M. J. Khan, Y. Ahmad, M. H. Zubair, S. A. Shah.

後卓越計畫進度報告楊舜仁老師實驗室 Outline  Introduction  SIP based mobile QoS model  MH registers the SIP based service  MH initiates the SIP based.

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

後卓越計畫進度報告中央大學許健平教授淡江大學張志勇教授 94/06/05 Obstacle-Free Routing for WSNs.

Time-stable geocast for ad hoc networks and its application with virtual warning signs Volume 27, Issue 11, 1 July 2004, Pages Applications and.

A New Recovery Method for Greedy Routing Protocols in High Mobile Vehicular Communications 指導教授：許子衡教授學生：董藝興.

CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.

MZR: A Multicast Protocol for Mobile Ad Hoc Networks Vijay Devarapalli Nokia research Center 313 Fairchild Drive, Mountain View, CA Deepinder Sidhu.

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

CSE 421 Computer Networks. Network Layer 4-2 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside.

GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks

Routing Protocols and Concepts

COMP 3270 Computer Networks

TODAY’S TENTATIVE AGENDA

Link-State Routing Protocols

後卓越計畫進度報告陳志成教授實驗室 2008/01/06.

(How the routers’ tables are filled in)

Link-State Routing Protocols

Intradomain Routing Outline Introduction to Routing

Networking CS 3470 Sarah Diesburg

Chapter 22. Network Layer: Routing

Link-State Routing Protocols

Networking CS 3470 Sarah Diesburg

Presentation transcript:

後卓越計畫進度報告 (2007/6/4) 中央大學許健平教授淡江大學張志勇教授

Routing with Hexagonal Virtual Coordinate in Wireless Sensor Networks

3 Introduction Our goal:  To create a virtual coordinate system and give load-balancing routing protocol  In addition, forwarding a packet across holes and the routing path generated as short as possible

4 Introduction (cont.) Hole Sink G B C D E F P Q H I J K A Hole T4T4 T3T3 T2T2 T1T1 Auxiliary Routing Path (ARP) S→T1→T2→T3→T4→D Hole Sink Hexagonal Virtual Coordinate HVC Chart

5 HVC construction protocol 1 Sink Second landmark With Max. ID within two-hop neighborhoodTo choice the Max. ID in this ring-shaped area to be the second landmark Local flooding within the R’th hop 2 R hops

6 HVC construction example Hole Sink

7 Construct the HVC chart Hole Sink P A B C D E Q F G J I H

8 HVC Routing Protocol Hole T4T4 T3T3 T2T2 T1T1 Find a shortest path in HVC chart from source node to a landmark nearest to the destination node to be the Auxiliary Routing Path (ARP)  Dijkstra’s algorithm ARP S→T 1 →T 2 →T 3 →T 4 →D

9 HVC Routing Protocol - Example D S T1T1 T2T2 T3T3 T5T5 T4T4