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

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

Advertisements

Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.

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,

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

Movement-Assisted Sensor Deployment Author : Guiling Wang, Guohong Cao, Tom La Porta Presenter : Young-Hwan Kim.

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

Maryam Hamidirad CMPT  Introduction  Power Counting Mechanism  Proposed Algorithm  Results  Conclusion  Future Work 2.

Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks Wei-Peng Chen*, Jennifer C. Hou and Lui Sha Department of Computer Science.

Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.

Tracking a moving object with real-time obstacle avoidance Chung-Hao Chen, Chang Cheng, David Page, Andreas Koschan and Mongi Abidi Imaging, Robotics and.

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.

Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.

Distributed Algorithms for Guiding Navigation across a Sensor Network Qun Li, Michael DeRosa, and Daniela Rus Dartmouth College MOBICOM 2003.

1 Distributed Algorithms for Guiding Navigation across a Sensor Network Qun Li, Michael De Rosa, and Daniela Rus Department of Computer Science Dartmouth.

Direct movement has long relocation time and overuses the redundant sensor Motivation Coverage under random deployment Coverage under clustering All the.

Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)

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

Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.

Lifetime and Coverage Guarantees Through Distributed Coordinate- Free Sensor Activation ACM MOBICOM 2009.

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

MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.

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.

A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a, Takumi Miyoshi a,b a Graduate School of Engineering,

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.

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.

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.

Distributed Monitoring and Aggregation in Wireless Sensor Networks INFOCOM 2010 Changlei Liu and Guohong Cao Speaker: Wun-Cheng Li.

A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks Jian Li and Prasant Mohapatra GlobeCom’03 Speaker ︰ CHUN-WEI.

An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.

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

Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.

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

Trade-offs Between Mobility and Density for Coverage in Wireless Sensor Networks Wei Wang, Vikram Srinivasan and Kee-Chaing Chua National University of.

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.

ELECTIONEL ECTI ON ELECTION: Energy-efficient and Low- latEncy sCheduling Technique for wIreless sensOr Networks Shamim Begum, Shao-Cheng Wang, Bhaskar.

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,

Shibo He 、 Jiming Chen 、 Xu Li 、, Xuemin (Sherman) Shen and Youxian Sun State Key Laboratory of Industrial Control Technology, Zhejiang University, China.

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.

Po-Yu Chen, Zan-Feng Kao, Wen-Tsuen Chen, Chi-Han Lin Department of Computer Science National Tsing Hua University IEEE ICPP 2011 A Distributed Flow-Based.

Energy-Aware Data-Centric Routing in Microsensor Networks Azzedine Boukerche SITE, University of Ottawa, Canada Xiuzhen Cheng, Joseph Linus Dept. of Computer.

Simulation of DeReClus Yingyue Xu September 6, 2003.

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

A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks Wen-Tsuen Chen Department of Computer Science National Tsing Hua University Po-Yu.

Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Ming Ma and Yuanyuan Yang Department of Electrical & Computer Engineering.

Mobile Sensor Network Deployment Using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem Andrew Howard, Maja J Matari´c,

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

TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.

Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.

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.

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

KAIS T Sensor Deployment Based on Virtual Forces Reference: Yi Zou and Krishnendu Chakarabarty, “Sensor Deployment and Target Localization Based on Virtual.

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 Networks: A Survey I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci.

In the name of God.

GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks

Author：Zarei.M.；Faez.K. ；Nya.J.M.

任課教授：陳朝鈞教授學生：王志嘉、馬敏修

On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE,

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 Speaker: stephan

Introduction A hybrid sensor network. Mobile sensor nodes (MSNs) and static sensor nodes can enhance each other’s capability: –MSN can reallocate sensing, networking, and computing resources to provide required coverage and sensing accuracy. –static sensors can guide the MSN to solve some navigation problem.

Problem Formulation

Modeling of Sensor Network n: num of static sensor nodes m: num of mobile sensor nodes Mobile sensor nodes: –M = { M 1, M 2, …, M m } Configuration of MSN, M i : –q i (t) = [x i, y i, θ i ] T i = 1, 2,..m x i, y i : the coordinates of MSN, M i θ i : the orientation of the MSN with respect to its local coordinate system.

Dynamics of M i : –u i : the navigational control input Provide MSN with the direction towards which it should navigate. Mobile sensor nodes: –S = { S 1, S 2, …, S n } Configuration of static sensor nodes:

Credit Field Based Navigation A cluster forms cluster leader: determine whether and how many MSNs are required. –Select –Build up the Navigation Field –Navigation of MSN

Select –find available MSNs using WREQ packet (broadcasted by leader) MSN reply its weight back to the leader by reversing the route through which the WREQ propagated. Lower is the weight of the MSN, greater is its probability of navigation of the region of phenomenon.

Build up the Navigation Field (using ADV packet)

Navigation of MSN

The navigational controller u i is calculated on the basis of virtual attractive force generated by each static sensor which have the maximum credit field value during each phase of broadcast of navigation packet.

The total energy associated with a MSN is defined: –p ij is a vector from MSN, Mi to static sensor nodes Sn in the coordinate frame –|| p ij || = –k i and k iv are parameters of virtual potential energy and kinetic energy of the MSN.

u i : F i is the virtual navigation force generated by static sensor nodes which are at the maximum credit value during each phase of broadcast of navigation packet.

Weight of a Mobile Sensor Node three metrics to calculate the weight of a MSN: –coverage: leave a smaller coverage hole. –power: saving energy of MSN –distance

coverage : –don’t know the topology of the whole network: using Voronoi cell approach to determine the coverage of MSN.

Power: –greater the power of MSN, greater is the distance it can traverse and less will be its weight.

Distance: –don’t know the topology of the whole network: the total num of intermediate nodes through which the WREQ travels is used. –more num of hops more is the weight of MSN.

Weight = Voronoi_cell * distance / power –lower is the weight, more is the probability of MSN reaching the goal.

Simulation 500 x 500 meters. Phenom node Three scenarios: –a uniformly distributed sensor network –a randomly distributed sensor network –a sensor network with a “coverage hole” in it which could represent an “obstacle”.

uniformly distributed sensor network

randomly distributed sensor network

a sensor network with a “coverage hole”

Dynamic events Mobile phenom

Conclusion The algorithm is robust to failures of static sensor. The algorithms have been verified in an ns-2 environment.