Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks Tzay-Farn Shih Department of Computer Science and Information.

Slides:



Advertisements
Similar presentations
Ranveer Chandra Ramasubramanian Venugopalan Ken Birman
Advertisements

Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
Tseng:1 Introduction to Ad Hoc Networking Perkin’s book: Ch 1 and Ch 2. Some data collected from the Internet by Prof. Yu-Chee Tseng.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
1 Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Yu-Ta Chen 2006 Advanced Wireless Network.
“Location-Aided Routing (LAR) in Mobile Ad Hoc Network” by Young-bae ko Nitin H. Validya presented by Mark Miyashita.
BeamStar: A New Low-cost Data Routing Protocol for Wireless Sensor Networks Shiwen Mao and Y. Thomas Hou The Bradley Department of Electrical and Computer.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Real Time Flow Handoff in Ad Hoc Wireless Networks using Mobility Prediction William Su Mario Gerla Comp Science Dept, UCLA.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
Distributed Token Circulation in Mobile Ad Hoc Networks Navneet Malpani, Intel Corp. Nitin Vaidya, Univ. Illinois Urbana-Champaign Jennifer Welch, Texas.
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
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.
Ad Hoc Wireless Routing COS 461: Computer Networks
Routing in Large Scale Ad Hoc and Sensor Networks Ten H. Lai Ohio State University.
Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Recipient of the MOBICOM'98 Best Student Paper Award.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Flooding-Based Geocasting Protocol for Mobile Ad Hoc Network YOUNG-BAE KO NITIN H. VAIDYA.
EAIT, February 2006 A Pragmatic Approach towards the Improvement of Performance of Ad Hoc Routing ProtocolsOptimizations To Multipath Routing Protocols.
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.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Ad-Hoc Networks. References r Elizabeth Royer and Chai-Keong Toh, " A Review of Current Routing Protocols for Ad Hoc Wireless Mobile Networks, " IEE Personal.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Efficient Overlay Multicast Protocol in Mobile Ad hoc Networks Hochoong Cho, Sang-Ho Lee Mobile Telecommunication Research Division, ETRI, KOREA Younghwan.
Cache Management of Dynamic Source Routing for Fault Tolerance in Mobile Ad Hoc Networks.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki MANET (Mobile Ad-hoc.
DDR-based Multicast routing Protocol with Dynamic Core (DMPDC) Shiyi WU, Navid Nikaein, Christian BONNET Mobile Communications Department EURECOM Institute,
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
Dynamic Routing in Mobile Ad Hoc Network 報告者:呂佐鴻 指導教授:李鴻璋.
DRP: An Efficient Directional Routing Protocol for Mobile Ad Hoc Networks Hrishikesh Gossain Mesh Networks Product Group, Motorola Tarun Joshi, Dharma.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Mohamed Elhawary Computer Science Department Cornell University PERCOM 2008 Zygmunt J. Haas Electrical and Computer Engineering Department Cornell University.
A Novel GPS-based Quorum Hybrid Routing Algorithm for Ad Hoc Wireless Network I-Shyan Hwang and Chih-Kang Chien.
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
Weight-Based Clustering Multicast Routing Protocol for Mobile Ad Hoc Networks Chun-Chieh Huang, Ruay-shiung Chang and Ming-Huang Guo National Dong-Hwa.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
GEOCASTING IN MOBILE AD HOC NETWORKS LOCATION- BASED MULTICAST ALGORITHMS 指導教授:許子衡 教授 學生:翁偉傑 1 Young-Bae Ko and Nitin H. Vaidya Department of Computer.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
A Protocol for Tracking Mobile Targets using Sensor Networks H. Yang and B. Sikdar Department of Electrical, Computer and Systems Engineering Rensselaer.
VORONOI DIAGRAM AND CONVEX HULL BASED GEOCASTING AND ROUTING IN WIRELESS NETWORKS 指導教授:許子衡 報告學生:翁偉傑 1 Copyright # 2006 John Wiley & Sons, Ltd. Wirel. Commun.
Routing with Congestion Awareness and Adaptivity in Mobile Ad hoc Networks Duc A. Tran and Harish Raghavendra Multimedia and Collaborative Networking Group.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
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.
2005/12/14 1 Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness Xin Yu Department of Computer Science.
Fault Tolerant Routing in Mobile Ad hoc Networks Yuan Xue and Klara Nahrstedt Computer Science Department University of Illinois.
Nov. 29, 2006GLOBECOM /17 A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi.
National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.
Mobile Ad Hoc Networking By Shaena Price. What is it? Autonomous system of routers and hosts connected by wireless links Can work flawlessly in a standalone.
HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu
Speaker: Ju-Mei Li Virtual Paths Routing: A Highly Dynamic Routing Protocol for Ad Hoc Wireless Networks Abdulrahman H. Altalhi and Golden G. Richard Computer.
Mobile Ad Hoc Networks. What is a MANET (Mobile Ad Hoc Networks)? Formed by wireless hosts which may be mobile No pre-existing infrastructure Routes between.
A Cluster-based Routing Protocol for Mobile Ad hoc Networks
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
IMPROVEMENT OF NETWORK LIFETIME BY IMPROVING ROUTE DISCOVERY PHASE IN MULTI-PATH DSR USING HYBRID ANT COLONY OPTIMIZATION.
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
MOBILE AD-HOC NETWORKS
A comparison of Ad-Hoc Routing Protocols
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks
Lei Chen and Wendi B. Heinzelman , University of Rochester
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
by Saltanat Mashirova & Afshin Mahini
A Talk on Mobile Ad hoc Networks (Manets)
Presentation transcript:

Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks Tzay-Farn Shih Department of Computer Science and Information Engineering, Chaoyan, University of Technology Hsu-Chun Yen Department of Electrical Engineering, Nation Taiwan University Wireless Network 2006

Outline Introduction Related Work Location-Aware Routing protocol with Dynamic Adaptation of Request zone (LARDAR) Simulation Conclusions

Introduction Mobile ad hoc network (MANET) No fixed routers No fixed hosts No fixed wireless base station How to design the route between source and destination is a problem

Related work Location-Aided Routing in mobile ad hoc network Young-Bae Ko, Nitin H. Vaidya Department of Computer Science, Texas Wireless Network 2000

Location-Aided Routing S (Xs, Ys) t1: t0, D (Xd, Yd), v D (Xd, Yd) r=v(t1-t0) A (Xs, Yd+r) B (Xd+r, Yd+r) C (Xd+r, Ys) r Expected Zone Request Zone

LARDAR Define the request zone and expected zone Determining the member of forwarding node Dynamic adaptation of request zone Route recovery

LARDAR -assumption Ad hoc node will update the location information by periodically Request packet contain Location information (source, destination) Location information obtained time Sequence number The angle of request triangle zone

LARDAR – define request and expected zone S (Xs, Ys) t1: t0, D (Xd, Yd), v D (Xd, Yd) r=v(t1-t0) B C E d r

LARDAR – define request and expected zone S (Xs, Ys)D (Xd, Yd) B C E d r DG F Reduction ratio between A SEG and A SDFG

LARDAR – determining the forwarding node Check two conditions If angle is less than angle L*cos is less than d+r D (Xd, Yd) B C E d r S (Xs, Ys) I (Xi, Yi) L J (Xj, Yj) Request packet contain: 1.Location information 2.The obtained time 3.Sequence number 4.α

LARDAR – dynamic adaptation of request zone D (Xd, Yd) B C E d r S (Xs, Ys) I1 I2

LARDAR – increase-exclusive search D (Xd, Yd) B C E r S (Xs, Ys) I1 I2 I3 I5 I4 I6 I7

LARDAR – route recovery The node detects the route broken sends a error packet to source node Source node will re-initial the route discovery The node detects the route broken will initial a route discovery process

Simulation Simulator : GloMoSim Region: 1000m* 1000m Node: [200,400,600,800,1000] Mobility model: Random

Simulation Routing overhead with Speed = 72 km/hr

Simulation Time of collision with Speed = 72 km/hr

Simulation Routing setup time with Speed = 72 km/hr

Simulation Routing setup time with Speed = 90 km/hr

Conclusions Proposed a location-based routing algorithm, called LARDAR Use triangle zone to cover the possible destination location Dynamic adaptation of request zone to redefine the request zone precisely LARDAR can save more power than LAR