Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.

Slides:

Advertisements

Similar presentations

1 A Real-Time Communication Framework for Wireless Sensor-Actuator Networks Edith C.H. Ngai 1, Michael R. Lyu 1, and Jiangchuan Liu 2 1 Department of Computer.

Advertisements

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,

Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.

Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,

Fault-Tolerant Target Detection in Sensor Networks Min Ding +, Dechang Chen *, Andrew Thaeler +, and Xiuzhen Cheng + + Department of Computer Science,

Introduction to Wireless Sensor Networks

1 An Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks Chengfa Li, Mao Ye, Guihai Chen State Key Laboratory for Novel Software.

Rumor Routing Algorithm For sensor Networks David Braginsky, Computer Science Department, UCLA Presented By: Yaohua Zhu CS691 Spring 2003.

Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1

PORT: A Price-Oriented Reliable Transport Protocol for Wireless Sensor Networks Yangfan Zhou, Michael. R. Lyu, Jiangchuan Liu † and Hui Wang The Chinese.

Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.

Globecom 2004 Energy-Efficient Self-Organization for Wireless Sensor Networks: A Fully Distributed approach Liang Zhao, Xiang Hong, Qilian Liang Department.

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

LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.

Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha Presented by Ray Lam Oct 23, 2004.

An Energy-efficient Target Tracking Algorithm in Wireless Sensor Networks Wang Duoqiang, Lv Mingke, Qin Qi School of Computer Science and technology Huazhong.

LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.

Query Driven Data Collection and Data Forwarding in Intermittently Connected Mobile Sensor Networks Wei WU 1, Hock Beng LIM 2, Kian-Lee TAN 1 1 National.

Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang

A Sweeper Scheme for Localization and Mobility Prediction in Underwater Acoustic Sensor Networks K. T. DharanC. Srimathi*Soo-Hyun Park VIT University Vellore,

M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol

Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.

Dynamic Coverage Enhancement for Object Tracking in Hybrid Sensor Networks Computer Science and Information Engineering Department Fu-Jen Catholic University.

2015/10/1 A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks Tai-Jung Chang, Kuochen Wang, Yi-Ling Hsieh Department.

College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.

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.

Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.

Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.

DARP: Distance-Aware Relay Placement in WiMAX Mesh Networks Weiyi Zhang *, Shi Bai *, Guoliang Xue §, Jian Tang †, Chonggang Wang ‡ * Department of Computer.

Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.

Coordinated Sensor Deployment for Improving Secure Communications and Sensing Coverage Yinian Mao, Min Wu Security of ad hoc and Sensor Networks, Proceedings.

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

Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.

College of Engineering Grid-based Coordinated Routing in Wireless Sensor Networks Uttara Sawant Major Advisor : Dr. Robert Akl Department of Computer Science.

Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee

A Distributed Coordination Framework for Wireless Sensor and Actor Networks Tommaso Melodia, Dario Pompili, Vehbi C.Gungor, Ian F.Akyildiz (MobiHoc 2005)

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.

By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.

Maximizing Lifetime per Unit Cost in Wireless Sensor Networks

Sanjay K. Dhurandher, Mohammad S. Obaidat, Fellow of IEEE and Fellow of SCS, Siddharth Goel and Abhishek Gupta CAITFS, Division of Information Technology,

Murat Demirbas Onur Soysal SUNY Buffalo Ali Saman Tosun U. San Antonio Data Salmon: A greedy mobile basestation protocol for efficient data collection.

Ching-Ju Lin Institute of Networking and Multimedia NTU

1 Simultaneous Localization and Mobile Robot Navigation in a Hybrid Sensor Network Suresh Shenoy and Jindong Tan Michigan Technological University Intelligent.

Adaptive Tracking in Distributed Wireless Sensor Networks Lizhi Yang, Chuan Feng, Jerzy W. Rozenblit, Haiyan Qiao The University of Arizona Electrical.

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

Group Members Usman Nazir FA08-BET-179 M.Usman Saeed FA08-BET-173

Wireless sensor and actor networks: research challenges

Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +

Mobile Sensor Deployment for a Dynamic Cluster-based Target Tracking Sensor Network Niaoning Shan and Jindong Tan Department of Electrical and Computter.

A Protocol for Tracking Mobile Targets using Sensor Networks H. Yang and B. Sikdar Department of Electrical, Computer and Systems Engineering Rensselaer.

Problem Description: One line explanation of the problem to be solved Problem Description: One line explanation of the problem to be solved Proposed Solution:

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

Reliable Navigation of Mobile Sensors in Wireless Sensor Networks without Localization Service Qingjun Xiao, Bin Xiao, Jiaqing Luo and Guobin Liu Department.

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

I-Hsin Liu1 Event-to-Sink Directed Clustering in Wireless Sensor Networks Alper Bereketli and Ozgur B. Akan Department of Electrical and Electronics Engineering.

Selection and Navigation of Mobile Sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.

Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime Z. Maria Wang, Emanuel Melachrinoudis Department of Mechanical and Industrial Engineering.

Energy-Aware Target Localization in Wireless Sensor Networks Yi Zou and Krishnendu Chakrabarty IEEE (PerCom’03) Speaker: Hsu-Jui Chang.

Repairing Sensor Network Using Mobile Robots Y. Mei, C. Xian, S. Das, Y. C. Hu and Y. H. Lu Purdue University, West Lafayette ICDCS 2006 Speaker ： Shih-Yun.

1 Along & across algorithm for routing events and queries in wireless sensor networks Tat Wing Chim Department of Electrical and Electronic Engineering.

Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu

A Spatial-based Multi-resolution Data Dissemination Scheme for Wireless Sensor Networks Jian Chen, Udo Pooch Department of Computer Science Texas A&M University.

Scalable and Distributed GPS free positioning for Sensor Networks Rajagopal Iyengear and Biplab Sikdar IEEE International Conference on Communications.

Wireless Sensor Network Architectures

Introduction to Wireless Sensor Networks

Connected Sensor Cover Problem

Overview: Chapter 2 Localization and Tracking

Presentation transcript:

Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer Engineering Michigan Technological University Houghton, USA PerCom 2005 Jenchi

Outlines Introduction Introduction Problem Formulation Problem Formulation Credit Field Based Navigation Credit Field Based Navigation Selection of a Mobile Sensor Node Selection of a Mobile Sensor Node Simulation Results Simulation Results Conclusion Conclusion

Introductions Hybrid sensor networks Hybrid sensor networks –Military applications battle-field surveillance, reconnaissance and enemy tracking battle-field surveillance, reconnaissance and enemy tracking –Civil applications habitat monitoring, environment observation, health and other commercial applications. habitat monitoring, environment observation, health and other commercial applications.

Introductions In a hybrid sensor network In a hybrid sensor network –Upon detection of an event, static sensors around the event may request the mobile sensors navigate to the area of interests –Mobile sensors enhance sensing, communication and computation capabilities in the area of interests

Introductions The mobile sensors provides environmental sensing, communication, coordination and navigation to the hybrid sensor systems The mobile sensors provides environmental sensing, communication, coordination and navigation to the hybrid sensor systems –provide required coverage and specified sensing accuracy –collect data from close by static sensors with higher energy efficiency –task the static sensors –repair and maintain the network

Introductions Navigation of mobile sensor nodes (MSNs) is a challenging task Navigation of mobile sensor nodes (MSNs) is a challenging task Objectives of this paper Objectives of this paper –We have used sensor networks for guiding MSN towards the goal position

Introductions Navigation deals with guiding the mobile sensor from its present location to the desired location by avoiding obstacles Where am I ？ Where am I going ？ How should I get there ？

Introduction The basic concept of this paper The basic concept of this paper –A credit-based approach Nodes are assigned credit values according to their distance from the phenomenon Nodes are assigned credit values according to their distance from the phenomenon –The MSN calculates its navigation direction towards the phenomenon using the navigation force from the neighboring static sensor nodes

Problem Formulation For example ： the task of detecting a fire Region of phenomenon Alert signal

Credit Field Based Navigation Region of phenomenon Cluster leader Determines whether and how many mobile sensors are required to enhance the sensing quality Step1 ： to select a mobile sensor among available MSNs and build up a navigation path between the mobile sensor and the region of phenomenon

Credit Field Based Navigation Cluster leader Weight request packet (WREQ) Busy with some events Low in power the Weight of MSN Step2 ： to navigate the mobile sensor through the sensor network

Credit Field Based Navigation Step1 ： Building up the Navigation Field M1M1 S1S1 S3S3 S2S2 S4S4 S7S7 S5S5 S6S6 S9S9 S8S8 Hot Node Cold Node

Credit Field Based Navigation Step1 ： Building up the Navigation Field M1M1 S1S1 S3S3 S2S2 S4S4 S7S7 S5S5 S6S6 S9S9 S8S8 Advertisement packet (ADV) C1C1 C2C2 C2C2 C 2 (C 2 < C 1 ) Hot Node Cold Node C1C1 C1C1

Credit Field Based Navigation Step1 ： Building up the Navigation Field M1M1 S1S1 S3S3 S2S2 S4S4 S7S7 S5S5 S6S6 S9S9 S8S8 Advertisement packet (ADV) C1C1 C2C2 C2C2 C 2 (C 2 < C 1 ) C3C3 C3C3 C 3 (C 3 < C 2 ) Hot Node Cold Node C1C1 C1C1

Credit Field Based Navigation Step1 ： Building up the Navigation Field M1M1 S1S1 S3S3 S2S2 S4S4 S7S7 S5S5 S6S6 S9S9 S8S8 Advertisement packet (ADV) C1C1 C2C2 C2C2 C 2 (C 2 < C 1 ) C3C3 C3C3 C 3 (C 3 < C 2 ) C4C4 C4C4 C 4 (C 4 < C 3 ) Hot Node Cold Node C1C1 C1C1

Credit Field Based Navigation Step1 ： Building up the Navigation Field M1M1 S1S1 S3S3 S2S2 S4S4 S7S7 S5S5 S6S6 S9S9 S8S8 Hot Node Cold Node Navigation Field C1C1 C2C2 C2C2 C2C2 C3C3 C3C3 C3C3 C4C4 C4C4 C4C4 C1C1 C1C1

Credit Field Based Navigation Step2 ： Navigation of Mobile Sensor Node M1M1 S1S1 S3S3 S2S2 S4S4 S7S7 S5S5 S6S6 S9S9 S8S8 Hot Node Cold Node Navigation Request (NAV) C1C1 C2C2 C2C2 C2C2 C3C3 C3C3 C3C3 C4C4 C4C4 C4C4 C1C1 C1C1

Credit Field Based Navigation Step2 ： Navigation of Mobile Sensor Node M1M1 S1S1 S3S3 S2S2 S4S4 S7S7 S5S5 S6S6 S9S9 S8S8 Hot Node Cold Node Credit field value, ID, and Location information C1C1 C2C2 C2C2 C2C2 C3C3 C3C3 C3C3 C4C4 C4C4 C4C4 Select the highest credit value Executes navigation C1C1 C1C1

Credit Field Based Navigation Step2 ： Navigation of Mobile Sensor Node S1S1 S2S2 S5S5 S3S3 S4S4 M1M1 C3C3 C3C3 C3C3 C2C2 C2C2 (C 3 < C 2 ) C3C3 C2C2

Credit Field Based Navigation Step2 ： Navigation of Mobile Sensor Node The navigation process The navigation process –is suitable for dynamic events C 11 C 12 (C 12 > C 11 ) C 12 S1S1 S3S3 S2S2 S4S4 S5S5 S6S6 S8S8 S7S7 S9S9 C 13 (C 13 > C 12 )

Selection of a Mobile Sensor Node Each MSN calculated its weight with its Each MSN calculated its weight with its –Coverage –Power –Distance from the phenomenon Lower is the weight more is the probability of the MSN reaching the phenomenon Lower is the weight more is the probability of the MSN reaching the phenomenon

Selection of a Mobile Sensor Node — Coverage Coverage of the MSN Coverage of the MSN –MSN calculates its Voronoi Area Hello message

Selection of a Mobile Sensor Node — Coverage Coverage of the MSN Coverage of the MSN –MSN calculates its Voronoi Area Location information

Selection of a Mobile Sensor Node — Coverage –MSN calculates its Voronoi Area –Smaller is the Voronoi area of the MSN and less will be its weight

Selection of a Mobile Sensor Node — Power Greater the power of the mobile node greater is the distance it can traverse in the network Greater the power of the mobile node greater is the distance it can traverse in the network

Selection of a Mobile Sensor Node — Distance from the phenomenon The number of hops The number of hops –The total number of intermediate nodes through which the weight request WREQ packet travels from the phenomenon to the MSN More the number of hops more is the weight of the MSN More the number of hops more is the weight of the MSN

Selection of a Mobile Sensor Node — Weight Lower is the weight more is the probability of the MSN reaching the phenomenon Lower is the weight more is the probability of the MSN reaching the phenomenon In case of two or more MSN ’ s having equal weight the one which is closer to the phenomena in is selected for navigation In case of two or more MSN ’ s having equal weight the one which is closer to the phenomena in is selected for navigation

Simulation Results The NRL ’ s Sensor Network Extension to ns-2 The NRL ’ s Sensor Network Extension to ns-2 The phenomenon was simulated using a phenom node which transmitted phenom packets The phenomenon was simulated using a phenom node which transmitted phenom packets The environment ： 500m * 500m The environment ： 500m * 500m –A uniformly distributed sensor network –A randomly distributed sensor network –A sensor network with a “ coverage hole ”

Simulation Results — Uniformly distributed sensor network Phenom node Mobile sensor 4 MSNs 45 static sensor 1 phenom node

Simulation Results — Randomly distributed sensor network 4 MSNs 45 static sensor 1 phenom node

Simulation Results — Sensor network with a coverage hole 1 MSNs 80 static sensor 1 phenom node

Simulation Results — Navigation with dynamic events

Conclusion A credit field for mobile sensor navigation A credit field for mobile sensor navigation –Provide navigation path between the mobile sensor and region of phenomenon A distributed navigation algorithm is presented A distributed navigation algorithm is presented Robust to failures of static sensor Robust to failures of static sensor