Minimizing Recovery State In Geographic Ad-Hoc Routing Noa Arad School of Electrical Engineering Tel Aviv University Yuval Shavitt School of Electrical.

Slides:



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

ECE /24/2005 A Survey on Position-Based Routing in Mobile Ad-Hoc Networks Alok Sabherwal.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
A Unified View to Greedy Routing Algorithms in Ad-Hoc Networks
A Presentation by: Noman Shahreyar
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
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,
SEEKER: An Adaptive and Scalable Location Service for Mobile Ad Hoc Networks Jehn-Ruey Jiang and Wei-Jiun Ling Presented by Jehn-Ruey Jiang National Central.
Smart city for VANETs using warning messages, traffic statistics and intelligent traffic lights (2012 Intelligent Vehicles SymposiumAlcalá de Henares,
Geographic Routing Without Location Information A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, I. Stoica Paper and Slides by Presented by Ryan Carr.
1 Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Yu-Ta Chen 2006 Advanced Wireless Network.
Good afternoon everyone.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Directional Routing for Wireless Mesh Networks: A Performance Evaluation Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
GeoLANMAR Routing: Asymptotic Analysis in Large and Dense Networks Broadnets 2005 Boston, Oct 5, 2005 Mario Gerla, Biao Zhou (UCLA) F. de Rango, S. Marano.
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,
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.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Focused Beam Routing protocol for Underwater Acoustic Networks Josep Miquel Jornet Montana, Milica Stojanovic, Michele Zorzi, Proc. WuWNet 2008.
A Distance Routing Effect Algorithm for Mobility (DREAM)* Stefano Basagni Irnrich Chlamtac Violet R. Syrotiuk Barry A. Woodward.
Geographic Routing Without Location Information A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica In Proceedings of the 9th Annual international Conference.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
Fast Failover for Control Traffic in Software-defined Networks Globecom 2012 Neda B. & Ying Z. Presented by: Szu-Ping Wang.
SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks Authors: Eric Rozner, Jayesh Seshadri, Yogita Ashok Mehta, Lili Qiu Published:
SHARP: A Hybrid Adaptive Routing Protocol for Mobile Ad Hoc Networks Venugopalan Ramasubramanian, Zygmunt J. Haas, and Emin Gun sirer ACM MobiHoc 2003.
EAIT, February 2006 A Pragmatic Approach towards the Improvement of Performance of Ad Hoc Routing ProtocolsOptimizations To Multipath Routing Protocols.
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.
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Topic: Vehicular Networks Team 6 R 陳彥璋 R 梁逸安 R 洪晧瑜.
EILEEN BALCI GPSR: Greedy Perimeter Stateless Routing for Wireless Networks.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Small-Scale and Large-Scale Routing in Vehicular Ad Hoc Networks Wenjing Wang 1, Fei Xie 2 and Mainak Chatterjee 1 1 School of Electrical Engineering and.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.
Power Control in Wireless Ad Hoc Networks Background An ad hoc network is a group of self configuring wireless nodes that lack infrastructure. Motivation—Power.
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Dynamic Routing in Mobile Ad Hoc Network 報告者:呂佐鴻 指導教授:李鴻璋.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks
Geographic Routing without Location Information Ananth Rao, Sylvia Ratnasamy, Christos Papadimitriou, Scott Shenker and Ion Stoica MobiCom 2003.
Scatternet Formation of Bluetooth Ad Hoc Networks Bin Zhen, Jonghun Park, Yongsuk Kim HICSS 2003.
1 Efficient Backbone Synthesis Algorithm for Multi-Radio Wireless Mesh Networks Huei-jiun Ju and Izhak Rubin Electrical Engineering Department University.
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Directional Routing for Wireless Mesh Networks: A Performance Evaluation Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
指導教授:許子衡 教授 學 生:黃群凱 2016/2/251 Proceedings of the 2008 IEEE International Conference on Vehicular Electronics and Safety Columbus, OH, USA. September 22-24,
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
A New Recovery Method for Greedy Routing Protocols in High Mobile Vehicular Communications 指導教授:許子衡 教授 學 生:董藝興.
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.
A New Class of Mobility Models for Ad Hoc Wireless Networks Rahul Amin Advisor: Dr. Carl Baum Clemson University SURE 2006.
Nov. 29, 2006GLOBECOM /17 A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi.
A Stable Routing Protocol to Support ITS Services in VANET Networks Tarik Taleb, Ehssan Sakhaee, Abbas Jamalipour, Kazuo Hashimoto, Nei Kato, Yoshiaki.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Density-Aware Hop-Count Localization (DHL) in Wireless Sensor Networks with Variable Density Sau Yee Wong 1,2, Joo Chee Lim 1, SV Rao 1, Winston KG Seah.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Network Valery Naumov, and Thomas R. Gross Proceedings of IEEE 26 th International Conference on Computer.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Geographic Routing without Location Information. Assumption by Geographic Routing Each node knows its own location.  outdoor positioning device: GPS:
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov, Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Spatial Aware Geographic Forwarding for Mobile Ad Hoc Networks Jing Tian, Illya Stepanov, Kurt Rothermel {tian, stepanov,
AODV-OLSR Scalable Ad hoc Routing
Virtual Domain and Coordinate Routing in Wireless Sensor Networks
GPSR Greedy Perimeter Stateless Routing
Surviving Holes and Barriers in Geographic Data Reporting for
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks
Kevin C. Lee, Uichin Lee, Mario Gerla Network Research Lab, UCLA
Presentation transcript:

Minimizing Recovery State In Geographic Ad-Hoc Routing Noa Arad School of Electrical Engineering Tel Aviv University Yuval Shavitt School of Electrical Engineering Tel Aviv University MobiHoc ‘06

Outline Introduction The NEAR (Node Elevation Ad-hoc Routing) Algorithm Simulation Conclusion

Introduction_ background Ad-Hoc network is a network without AP, and they have mobile ability in general Routing schemes of mobile Ad-Hoc networks – Topology-based routing – Position-based routing

Introduction_ motivations Most position-based routing protocols can’t prevent the packet from reaching a concave node sourcedestination concave node

Introduction_ motivations Most position-based routing protocols can’t prevent the packet from reaching a concave node Recovery Algorithm may choose a long path sourcedestination

Introduction_ goals To prevent the routing algorithm from entering concave node To minimize the recovery state

Concave Node A node that has no neighbor that can make a greedy progress towards the destination A concave node can not be predicted in advance, based on the position of its neighbor nodes

The NEAR Algorithm Repositioning Algorithm Routing Algorithm

Repositioning Algorithm_ goals To identify and mark concave node To improve the greedy routing To improve the recovery process

Repositioning Algorithm_ identify and mark concave node A B C D α = 180°

A B C A’ floating node z = z+1 Repositioning Algorithm_repositioning

A’(x 1, y 1, 1) AB C ABC B’(x 2, y 2, 1) A”(x 1, y 1, 2)

Repositioning Algorithm_ threshold angle A minimal angle of 180° is simply too low, and almost all nodes will float α = 210° − 230° was found to be best for various scenarios

Repositioning Algorithm_ an example Before repositioningAfter repositioning

Routing Algorithm_ three states Descending source destination

Routing Algorithm_ three states Descending Ground to ground

Routing Algorithm_ three states Descending Ground to ground Climbing source destination

Routing Algorithm_ descending A’(x 1, y 1, 2) AB B’(x 2, y 2, 1) C ABC Z max = 1Z max Z max = 0

Routing Algorithm_ ground to ground Protocol – GPSR Z max – Always 0

Routing Algorithm_ climbing A’(x 1, y 1, 2) AB B’(x 2, y 2, 1) C ABC Z max = 2

Routing Algorithm_ recovery state Environment – Ground to ground Protocol – GPSR Minimizing the recovery state

Simulation_ environment 1 Field: 2000m x 2000m Variable network density

Simulation_ elimination of concave nodes

Simulation_ routing hops

Simulation_ routing distance

Simulation_ routing success

Simulation_ environment 2 Mobile node 1 – 90Km/h – Updating messages per second Mobile node 2 – 4.5Km/h – Updating messages every 20 seconds

Simulation_ average numbers of iterations

Simulation_ average numbers of iterations per node

Simulation_ change of physical links per node

Conclusions Smoothing the shape of voids and concave nodes can be predicted by their added virtual height Improving greedy routing and minimizing the recovery state NEAR is believed to improve ad-hoc networks’ ability to deal with voids and concave nodes

Thank You !