An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks Zhen Jiang Computer Science Department West Chester University.

Slides:

Advertisements

Similar presentations

Dynamic Object Tracking in Wireless Sensor Networks Tzung-Shi Chen 1, Wen-Hwa Liao 2, Ming-De Huang 3, and Hua-Wen Tsai 4 1 National University of Tainan,

Advertisements

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

A Presentation by: Noman Shahreyar

1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.

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,

Routing protocols in mobile sensor networks -Rajiv Menon.

Source-Location Privacy Protection in Wireless Sensor Network Presented by: Yufei Xu Xin Wu Da Teng.

Good afternoon everyone.

Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.

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

Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.

Locating and Bypassing Routing Holes in Sensor Networks Authors: Qing Fang, Jie Gao and Leonidas J. Guibas Presented by: Yinfei Pan.

An Implementation Framework for Trajectory-Based Routing in Ad Hoc Networks Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman Electrical, Computer,

Multi-dimensional Range Query in Sensor Networks Xin Li,Young Jim Kim, Ramesh Govindan (University of Southern California ) Wei Hong (Intel Research Lab.

1 Distributed Navigation Algorithms for Sensor Networks Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri Dept. of Computer Science, University of.

Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas Guibas, John Hershberger, Li Zhang, An Zhu.

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,

Avoiding Energy Holes in Wireless Sensor Network with Nonuniform Node Distribution Xiaobing Wu, Guihai Chen and Sajal K. Das Parallel and Distributed Systems.

SMART: A Scan-based Movement- Assisted Sensor Deployment Method in Wireless Sensor Networks Jie Wu and Shuhui Yang Department of Computer Science and Engineering.

1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.

1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed some Richard Yang‘s slides.

Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver

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.

An Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks - IEEE/ACM Trans. on Networking, Vol 16, Number 1, February 2008 D

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.

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.

WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.

Landmark-Based Information Storage and Retrieval in Sensor Networks Qing Fang Department of Electrical Engineering, Stanford University Jie Gao Department.

Prediction-based Object Tracking and Coverage in Visual Sensor Networks Tzung-Shi Chen Jiun-Jie Peng,De-Wei Lee Hua-Wen Tsai Dept. of Com. Sci. and Info.

1 A Bidding Protocol for Deploying Mobile Sensors GuilingWang, Guohong Cao, and Tom LaPorta Department of Computer Science & Engineering The Pennsylvania.

EILEEN BALCI GPSR: Greedy Perimeter Stateless Routing for Wireless Networks.

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.

Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.

Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.

1 Probabilistic Coverage in Wireless Sensor Networks Nadeem Ahmed, Salil S. Kanhere and Sanjay Jha Computer Science and Engineering, University of New.

Bounded relay hop mobile data gathering in wireless sensor networks

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

Hierarchical Grid Location Management for Large Wireless Ad hoc Networks Sumesh J. Philip Chunming Qiao Dept. of Computer Science and Engineering State.

SR: A Cross-Layer Routing in Wireless Ad Hoc Sensor Networks Zhen Jiang Department of Computer Science West Chester University West Chester, PA 19335,

Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks.

Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks Rik Sarkar, Xianjin Zhu, Jie Gao, Joseph S. B. Micchell, Leonidas.

KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by.

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

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

Ordering in Time: A New Routing Approach for Wireless Networks Stephen Dabideen and J.J. Garcia-Luna-Aceves Department of Computer Engineering University.

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 Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks Wen-Tsuen Chen Department of Computer Science National Tsing Hua University Po-Yu.

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

Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.

Scalable and Robust Data Dissemination in Wireless Sensor Networks Wei Liu, Yanchao Zhang, Yuguang Fang, Tan Wong Department of Electrical and Computer.

Younghwan Yoo† and Dharma P. Agrawal‡ † School of Computer Science and Engineering, Pusan National University, Busan, KOREA ‡ OBR Center for Distributed.

Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.

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 On Improving Data Accessibility in Storage Based Sensor Networks Tan Apaydin, Serdar Vural and Prasun Sinha IEEE International Conference on Mobile Adhoc.

Junchao Ma +, Wei Lou +, Yanwei Wu *, Xiang-Yang Li *, and Guihai Chen & Energy Efficient TDMA Sleep Scheduling in Wireless Sensor Networks + Department.

1 Hierarchical Data Dissemination Scheme for Large Scale Sensor Networks Anand Visvanathan and Jitender Deogun Department of Computer Science and Engg,

Survey of Ad Hoc Network Routing Protocols Team Adhocracy Presentation 1 – April 5, 2007 Jason Winnebeck Benjamin Willis Travis Thomas.

Survey of Ad Hoc Network Routing Protocols Team Adhocracy Presentation 3 – April 23, 2007 Jason Winnebeck Benjamin Willis Travis Thomas.

Xiaobing Wu, Guihai Chen and Sajal K. Das

A Straightforward Path Routing in Wireless Ad Hoc Sensor Networks

Surviving Holes and Barriers in Geographic Data Reporting for

GPSR: Greedy Perimeter Stateless Routing for Wireless Networks

Overview of Unicast Routing Protocols for Multihop Wireless Networks

Zhen Jiang Comp. Sci. Dept. West Chester University

Presentation transcript:

An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks Zhen Jiang Computer Science Department West Chester University Junchao Ma, Wei Lou Department of Computing The Hong Kong Polytechnic University Jie Wu Department of Computer Sci. & Eng. Florida Atlantic University Infocom 2008

Outline Introductions Related works Safety Model For LGF Routing Safety -Information-Based LGF Routing (SLFG) Experimental Results Conclusions

Introductions Geographic greedy forwarding routing is the most promising routing scheme in Wireless Ad-hoc Sensor Networks. An important challenge often faced in geographic greedy forwarding in WASNs is the “local minimum phenomenon (Dead end)”.

Introductions To mitigate the local minimum issue, GFG,GPSR and GOAFR are currently the most popular methods. However, without enough shape information of the holes, such a routing may use a long detour path in the perimeter routing.

Introductions – goal In this paper, the authors propose a simple and efficient method to achieve a shorter path.

Related works - Geographic greedy forwarding (GF) B. Karp and H. Kung, “GPSR: Greedy perimeter stateless routing for wireless sensor networks,” Proc. of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (ACM/IEEE MOBICOM’00), August 2000, pp Source Destination

Related works - Limited geographic greedy forwarding (LGF) Source Destination Quadrant I (Northeast) Quadrant IV (Southeast) Quadrant II (Northwest) Quadrant III (Southwest)

Related works - BOUNDHOLE Q. Fang, J. Gao, and L. Guibas, “Locating and bypassing routing holes in sensor networks,” Proc. of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM’04), 2004, pp Source Destination Boundary

Safety Model For LGF Routing - assumption Each node has its location information. Sources are aware of the location of the destination. All sensor has the same communication range Each node has four forwarding zone. The system is rounded based

Safety -Information-Based LGF Routing (SLGF) Unsafe Node Safe Node Source Destination Unsafe Area

Safety Model For LGF Routing – compare with BOUNDHOLE BOUNDHOLE needs boundaries to encircled the hole and there are many unnecessary nodes in a boundary. A boundary may be concave,but the shape of the unsafe are has been optimized to a rectangle in a local view of each unsafe node. Each unsafe node only stores the location of the opposite corner of rectangle Safety model don’t need to calculate to identify the boundary.

Safety Model For LGF Routing Quadrant I (NorthEast) Quadrant IV (SouthEast) Quadrant II (NorthWest) Quadrant III (SouthWest) u 1 (NE,NW,SW,SE) u1u1

Safety Model For LGF Routing u1(s,s,s,s)u1(s,s,s,s) u1u1 At the beginning, all forwarding regions are labeled as safe. u2(s,s,s,s)u2(s,s,s,s) u3(s,s,s,s)u3(s,s,s,s) u2u2 u3u3 u4u4 u4(s,s,s,s)u4(s,s,s,s)

Safety Model For LGF Routing u1(s,s,s,s)u1(s,s,s,s) u1u1 Each node starts labeling process u2(s,s,s,s)u2(s,s,s,s) u3(s,s,s,s)u3(s,s,s,s) u2u2 u3u3 u4u4 u4(s,s,s,s)u4(s,s,s,s)u4(u,s,s,s)u4(u,s,s,s) u3(u,s,s,s)u3(u,s,s,s) u2(u,s,s,s)u2(u,s,s,s) u1(u,s,s,s)u1(u,s,s,s) u5(s,s,s,s)u5(s,s,s,s)

Safety Model For LGF Routing Each unsafe node would estimated its unsafe area. Unsafe Area u1u1 u2u2

Safety Model For LGF Routing Source Destination Unsafe Node Proof in contrapositive form If a greedy forwarding path exists, we can find an unsafe node u j that its successor u j +1 is safe. ujuj u j+1

Safety -Information-Based LGF Routing (SLGF) Unsafe Node Safe Node Source Destination

Safety -Information-Based LGF Routing (SLGF) - Source or destination inside unsafe area The SLGF scheme will ignore unsafe node to avoid local minimum. Source Destination Source ? ?

Safety -Information-Based LGF Routing – destination inside unsafe area Destination Source Check if D is inside its unsafe area D is inside the area. Forward the packet and discard safety information.

Safety -Information-Based LGF Routing - source inside unsafe area The quickest way to leave such an unsafe area is to route in the opposite direction to d Source Destination

Experimental Results Simulator: built in c++ Field : 200m x 200m Uniform deployment (IA) (Hole is very small) Random deployment (FA) (Hole is larger than Uniform) The transmission radius of a node is 20m Number of nodes 400 to 800 in incensement of 50

Experimental Results - construction process under different information models Boundary of BOUNDHOLE Boundary of Safety Model for type I Both BOUNDHOLE & Safety Model

Experimental Results

Conclusions This paper is the first attempt to find the balance of the tradeoff between routing adaptivity and information model cost while pursuing better routing performance in WASNs. The authors proposed a easy and quick construction model

End