A Straightforward Path Routing in Wireless Ad Hoc Sensor Networks

Slides:



Advertisements
Similar presentations
Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.
Advertisements

1 S4: Small State and Small Stretch Routing for Large Wireless Sensor Networks Yun Mao 2, Feng Wang 1, Lili Qiu 1, Simon S. Lam 1, Jonathan M. Smith 2.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.
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,
Improvement on LEACH Protocol of Wireless Sensor Network
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
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.
The University of Iowa. Copyright© 2005 A. Kruger 1 Introduction to Wireless Sensor Networks Routing in WSNs 28 February 2005.
An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks Zhen Jiang Computer Science Department West Chester University.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:
KUASAR An efficient and light-weight protocol for routing and data dissemination in ad hoc wireless sensor networks David Andrews Aditya Mandapaka Joe.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
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,
Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
Geographic Routing Without Location Information A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica In Proceedings of the 9th Annual international Conference.
Connected Dominating Sets in Wireless Networks My T. Thai Dept of Comp & Info Sci & Engineering University of Florida June 20, 2006.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
Sidewinder A Predictive Data Forwarding Protocol for Mobile Wireless Sensor Networks Matt Keally 1, Gang Zhou 1, Guoliang Xing 2 1 College of William and.
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
GUI: GPS-Less Traffic Congestion Avoidance in Urban Area with Inter-Vehicular Communication Presenter: Zhen Jiang or
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.
Mobiquitous'07 Poster1 On Reducing the Moving Distance in Approaching Optimal Configuration in MANETs Muddana Roopa, Akasapu Girish, Zhen Jiang Computer.
The Chinese Univ. of Hong Kong Dept. of Computer Science & Engineering POWER-SPEED A Power-Controlled Real-Time Data Transport Protocol for Wireless Sensor-Actuator.
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.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.
/ 22 1 A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks Hai Liu Xiaohua Jia Peng-Jun Wan Dept. of Comput.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
SR: A Cross-Layer Routing in Wireless Ad Hoc Sensor Networks Zhen Jiang Department of Computer Science West Chester University West Chester, PA 19335,
Network Coding Data Collecting Mechanism based on Prioritized Degree Distribution in Wireless Sensor Network Wei Zhang, Xianghua Xu, Qinchao Zhang, Jian.
Joint Replication-Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Temple University Zhen Jiang Feng Li West Chester Unveristy.
A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.
Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
On Optimal Geographic Routing in Wireless Networks with Holes and Non-Uniform Traffic Sundar Subramanian, Sanjay Shakkottai and Piyush Gupta INFOCOM 2007.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
VORONOI DIAGRAM AND CONVEX HULL BASED GEOCASTING AND ROUTING IN WIRELESS NETWORKS 指導教授:許子衡 報告學生:翁偉傑 1 Copyright # 2006 John Wiley & Sons, Ltd. Wirel. Commun.
Fundamentals of Computer Networks ECE 478/578
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.
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 Networks. What is a MANET (Mobile Ad Hoc Networks)? Formed by wireless hosts which may be mobile No pre-existing infrastructure Routes between.
William Stallings Data and Computer Communications
Author:Zarei.M.;Faez.K. ;Nya.J.M.
IMPROVING OF WIRELESS MESH NETWORKS.
A Location-Based Routing Method for Mobile Ad Hoc Networks
Delay-Tolerant Networks (DTNs)
Universal Opportunistic Routing Scheme using Network Coding
GPSR Greedy Perimeter Stateless Routing
Surviving Holes and Barriers in Geographic Data Reporting for
Internet Networking recitation #4
Net 435: Wireless sensor network (WSN)
Zhen Jiang Comp. Sci. Dept. West Chester University
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Topology Control and Its Effects in Wireless Networks
Meshed Multipath Routing: An Efficient Strategy in Wireless Sensor Networks Swades DE Chunming QIAO Hongyi WU EE Dept.
Overview: Chapter 3 Networking sensors
Dhruv Gupta EEC 273 class project Prof. Chen-Nee Chuah
Presentation transcript:

A Straightforward Path Routing in Wireless Ad Hoc Sensor Networks Zhen Jiang Comp. Sci. Dept. West Chester University Junchao Ma, Wei Lou Dept. of Computing The HK Polytechnic University Jie Wu College of Computer & Information Sciences Temple University 8/28/2018 WWASN'09

Outline Introduction Our Approaches Experimental Results Conclusion 8/28/2018 WWASN'09

Goal A straightforward path in wireless ad-hoc sensor networks (WASNs) Fewer hops and detours Faster data delivery More energy conserved destination source 8/28/2018 WWASN'09

Problem Local minimum phenomenon (void) Sparse deployment Physical obstacles Node failures Communication jamming Power exhaustion Animus interference block void stuck node destination source 8/28/2018 WWASN'09

Idea Information helps routing to Predict the ‘void’ ahead Make a slight turn early to sufficiently avoid being blocked Non-detour routing, i.e., greedy forwarding without perimeter routing Change forwarding direction only if necessary To keep the optimality of a straight forwarding 8/28/2018 WWASN'09

Task 1 Identification of the affected area of a void Relative to the positions of the source and the destination destination destination source destination source source affected area destination affected area Case 1 Case 2 8/28/2018 WWASN'09

Task 2 Mutual impact of void areas Global optimization achieved by neighborhood optimizations No routing table, flooding, or broadcasting Routing decision at each intermediate node Neighbor information collection and distribution destination source area of mutual impact 8/28/2018 WWASN'09

What kind of information and how to conduct a forecast? Challenge Unstructured WASNs Hard to ensure whether the forwarding still achievable ahead destination ? What kind of information and how to conduct a forecast? source 8/28/2018 WWASN'09

Our Previous Results (Safety Information Model) Tradeoff between routing adaptivity and structure regularity Safety information for such a forwarding Information based forwarding (SLGF routing) to avoid entering detour areas (local minima) 8/28/2018 WWASN'09

Our Approaches (Improvement) Further study the use of safety information Increase the adaptivity of safety information based routing Achieve a straightforward path in more routing cases (a new routing algorithm: SLGF2) 8/28/2018 WWASN'09

Tradeoff LAR 1 LAR 2 A forwarding with infrastructure in WASNs LAR2: Forwarding to a neighbor that is closer to the destination We adopt LAR1 Forwarding limited in the so-called request zone destination destination forwarding candidate LAR 1 LAR 2 request zone current node current node 8/28/2018 WWASN'09

Safety Information Inspired by the safety model for 2-D mesh networks An unsafe area contains nodes that definitely causing routing detour. Constructed by information exchanges among neighbors only. 8/28/2018 WWASN'09

Estimation of Unsafe Area A local view at each unsafe node of the blocking effect of local minima (i.e., the topology configuration that makes such a node unsafe) Ultimate description of all LAR1 forwardings from that unsafe node which are blocked by local minima (in any type) Simple rectangular shape Constructed with safety information updates, without extra cost 8/28/2018 WWASN'09

Details of the Information Construction Unsafe node A node without any neighbor in the request zone A node without any safe neighbor in the request zone Unsafe area Connected unsafe nodes Estimated as a rectangle at an unsafe node. 4 Different types of unsafe status Due to 4 different types of request zones 8/28/2018 WWASN'09

Type-I Safety Information and the Estimation of Unsafe Area 8/28/2018 WWASN'09

SLGF2 Routing (new) Three phases conducted in the order Safe forwarding Smartly select appropriate safe nodes as forwarding successors to achieve shorter path around unsafe area Backup path routing Guarantee a successful path by multiple safe-forwardings to detour around local minima Perimeter routing Be able to detect the network disconnection and avoid unnecessary detours 8/28/2018 WWASN'09

SLGF2 Routing Cases 8/28/2018 WWASN'09

Simulation To verify whether Forwarding routings LAR1(-) + Safety Info. (-) + Info. based routing (+) is efficient to achieve straightforward path. Forwarding routings GF (LAR2 + boundary information) LGF (LAR1) SLGF (LAR1 + safety information) SLGF2 (LAR1 + new use of safety information) 8/28/2018 WWASN'09

8/28/2018 WWASN'09

Result Summary # of hops Length of path LGF < GF < SLGF < SLGF2 Length of path 8/28/2018 WWASN'09

Conclusion New balance point of the tradeoff between routing adaptivity and information model cost More accurate safety information Better forwarding routing to achieve more straight path 8/28/2018 WWASN'09

Questions? Thank you! 8/28/2018 WWASN'09