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

Slides:



Advertisements
Similar presentations
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
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,
SELF-ORGANIZING MEDIA ACCESS MECHANISM OF A WIRELESS SENSOR NETWORK AHM QUAMRUZZAMAN.
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
Introduction to Wireless Sensor Networks
Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui.
Sensor Network 教育部資通訊科技人才培育先導型計畫. 1.Introduction General Purpose  A wireless sensor network (WSN) is a wireless network using sensors to cooperatively.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
Rumor Routing Algorithm For sensor Networks David Braginsky, Computer Science Department, UCLA Presented By: Yaohua Zhu CS691 Spring 2003.
1 Routing Techniques in Wireless Sensor networks: A Survey.
1 Distributed Adaptive Sampling, Forwarding, and Routing Algorithms for Wireless Visual Sensor Networks Johnsen Kho, Long Tran-Thanh, Alex Rogers, Nicholas.
A Query-Based Routing Tree in Sensor Networks In Chul Song Yohan Roh Dongjoon Hyun Myoung Ho Kim GSN 2006 (Geosensor Network) 1.
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
Three heuristics for transmission scheduling in sensor networks with multiple mobile sinks Damla Turgut and Lotzi Bölöni University of Central Florida.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
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.
Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea
Talha Naeem Qureshi Joint work with Tauseef Shah and Nadeem Javaid
Speed and Direction Prediction- based localization for Mobile Wireless Sensor Networks Imane BENKHELIFA and Samira MOUSSAOUI Computer Science Department.
Presented by: Chaitanya K. Sambhara Paper by: Maarten Ditzel, Caspar Lageweg, Johan Janssen, Arne Theil TNO Defence, Security and Safety, The Hague, The.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Vikramaditya. What is a Sensor Network?  Sensor networks mainly constitute of inexpensive sensors densely deployed for data collection from the field.
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
A Framework for Energy- Saving Data Gathering Using Two-Phase Clustering in Wireless Sensor Networks Wook Chio, Prateek Shah, and Sajal K. Das Center for.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Wireless Sensor Networks COE 499 Energy Aware Routing
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
1 Virtual Patrol : A New Power Conservation Design for Surveillance Using Sensor Networks Prasant Mohapatra, Chao Gui Computer Science Dept. Univ. California,
WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
Bounded relay hop mobile data gathering in wireless sensor networks
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.
Ching-Ju Lin Institute of Networking and Multimedia NTU
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Simulation of DeReClus Yingyue Xu September 6, 2003.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
Data funneling : routing with aggregation and compression for wireless sensor networks Petrovic, D.; Shah, R.C.; Ramchandran, K.; Rabaey, J. ; SNPA 2003.
Ben Miller.   A distributed algorithm is a type of parallel algorithm  They are designed to run on multiple interconnected processors  Separate parts.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.
EASE: An Energy-Efficient In-Network Storage Scheme for Object Tracking in Sensor Networks Jianliang Xu Department of Computer Science Hong Kong Baptist.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Energy-Aware Target Localization in Wireless Sensor Networks Yi Zou and Krishnendu Chakrabarty IEEE (PerCom’03) Speaker: Hsu-Jui Chang.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
1 Hierarchical Data Dissemination Scheme for Large Scale Sensor Networks Anand Visvanathan and Jitender Deogun Department of Computer Science and Engg,
Efficient Route Update Protocol for Wireless Sensor Networks Xuhui Hu, Yong Liu, Myung J. Lee, Tarek N. Saadawi City University of New York, City College.
Straight Line Routing for Wireless Sensor Networks Cheng-Fu Chou, Jia-Jang Su, and Chao-Yu Chen Computer Science and Information Engineering Dept., National.
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Introduction to Wireless Sensor Networks
Net 435: Wireless sensor network (WSN)
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Edinburgh Napier University
Presentation transcript:

Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej

Introduction Introduction Goals and Expectations Goals and Expectations Project Description Project Description Implementation Implementation Results Results Simulation Simulation Outline

Introduction

Introduction Wireless sensor network is an active research area with numerous applications and different techniques developed each year Wireless sensor network is an active research area with numerous applications and different techniques developed each year Some Applications Some Applications Environmental monitoring Environmental monitoring Battlefield Awareness Battlefield Awareness Tracking and Smart Environments Tracking and Smart Environments

Introduction Patch-based sensor networks is a sensor network divided into random areas called patches Patch-based sensor networks is a sensor network divided into random areas called patches Patches contain sensors which collect information, but do not forward them Patches contain sensors which collect information, but do not forward them Several mobile sinks are moving around the field, visiting patches and collecting information Several mobile sinks are moving around the field, visiting patches and collecting information We discuss a patch based sensor network that is distributed over a field to collect motion information about birds passing over the field We discuss a patch based sensor network that is distributed over a field to collect motion information about birds passing over the field

Introduction Sensors are detecting bird existence Sensors are detecting bird existence Whenever a bird comes into the transmission range of a sensor it stores that bird’s information Whenever a bird comes into the transmission range of a sensor it stores that bird’s information We have Mobile Sinks so mobility is what matters We have Mobile Sinks so mobility is what matters Study, analyse and compare different sink movement models Study, analyse and compare different sink movement models Different mobile movements achieves: Different mobile movements achieves: Different amount of information Different amount of information Different utilities of information Different utilities of information

Goals and Expectations

Exploring the different ways that a sink can visit randomly distributed patches Exploring the different ways that a sink can visit randomly distributed patches Efficiency of a visiting technique can be represented by Efficiency of a visiting technique can be represented by Amount of collected data Amount of collected data Power consumption Power consumption Utility of the collected results Utility of the collected results Consistency of the results Consistency of the results

Goals and Expectations Real life: Real life: A combination of all factors should be taken into consideration when evaluating a visiting technique A combination of all factors should be taken into consideration when evaluating a visiting technique Our project: Our project: will only consider the amount and utility of the collected data will only consider the amount and utility of the collected data Utility represented by how new or fresh is that data Utility represented by how new or fresh is that data

Goals and Expectations Expectations: Expectations: Simulate a patch based sensor network using YAES simulator Simulate a patch based sensor network using YAES simulator Conduct three different styles of movement for the sink Conduct three different styles of movement for the sink keep a log of all data gathered by each movement technique keep a log of all data gathered by each movement technique Analyse the data and conclude the best sink visiting movement technique Analyse the data and conclude the best sink visiting movement technique

Project Description

In general, Patch based sensor network with mobile sinks is desired In general, Patch based sensor network with mobile sinks is desired Easier routing: because of patch heads topology Easier routing: because of patch heads topology Energy Efficient: High rate communications only occur on patch heads, other normal sensor nodes would save energy. Moreover, only sinks move in the field Energy Efficient: High rate communications only occur on patch heads, other normal sensor nodes would save energy. Moreover, only sinks move in the field

Project Description Project: Project: A field of an approximated area of half squared mile A field of an approximated area of half squared mile Simple sensor nodes randomly deployed on the field Simple sensor nodes randomly deployed on the field The sensor nodes are static in place and capable of detection of any bird flying over the sensors and within its transmission range The sensor nodes are static in place and capable of detection of any bird flying over the sensors and within its transmission range Birds are simulated by actuator agents who are moving randomly in the field Birds are simulated by actuator agents who are moving randomly in the field Multiple mobile sinks scattered collecting data from nodes Multiple mobile sinks scattered collecting data from nodes

Project Description Patching Patching Was implemented virtually Was implemented virtually Each sensor node Each sensor node Is a normal sensor: Senses birds existence Is a normal sensor: Senses birds existence Is a patch head: communicates with the sinks Is a patch head: communicates with the sinks

Project Description Sink movement techniques are the main issue in the project Sink movement techniques are the main issue in the project All movement models aims at collecting the most data with the most utility All movement models aims at collecting the most data with the most utility Introducing three different sink movement techniques Introducing three different sink movement techniques Random Movement: Sinks are moving around randomly within the fields range Random Movement: Sinks are moving around randomly within the fields range Regular Movement: Sinks are deployed into a straight line covering the whole width of the field and they are moving back and forth along the height of the field Regular Movement: Sinks are deployed into a straight line covering the whole width of the field and they are moving back and forth along the height of the field

Project Description Information Based Movement: Information Based Movement: Sinks can get information about the amount of data generated in a patch Sinks can get information about the amount of data generated in a patch Each sink determines the hottest patch and moves to collect information from that patch while no other sink goes there Each sink determines the hottest patch and moves to collect information from that patch while no other sink goes there After a sink reaches the desired patch it will again search for the hottest non-reserved patch and head for it After a sink reaches the desired patch it will again search for the hottest non-reserved patch and head for it

Project Description Communications Communications Occurs when a bird agent comes within the transmission range of a sensor Occurs when a bird agent comes within the transmission range of a sensor The sensor will store data about the bird by filling a temporary buffer that each sensor maintains The sensor will store data about the bird by filling a temporary buffer that each sensor maintains When a sink is able to communicate with a sensor node, the node gives all what it has to the sink and then flushes its buffer When a sink is able to communicate with a sensor node, the node gives all what it has to the sink and then flushes its buffer All data gathered from all sinks are delivered at the end to a data storage unit All data gathered from all sinks are delivered at the end to a data storage unit

Challenges and Problems

Addition of multiple sinks and their movement in YAES. Addition of multiple sinks and their movement in YAES. Implementation of Utility of information. Implementation of Utility of information. Comparing Results to other experiments Comparing Results to other experiments

Implementation

Implementation Eclipse 3.2 & YAES library Eclipse 3.2 & YAES library YAES objects used: YAES objects used: Field Field Sensor Node Sensor Node Sink Node Sink Node Actuator Node (Bird) Actuator Node (Bird) Field Field Is a Java panel Is a Java panel Is relative in size to other objects Is relative in size to other objects

Implementation Sensor Node Sensor Node Has a location, name and an agent Has a location, name and an agent Patch Sensor Agent Patch Sensor Agent Extends AbstractSensorAgent class. Extends AbstractSensorAgent class. Can buffer data, can transmit and receive messages Can buffer data, can transmit and receive messages Sink Node Sink Node Extends SensorNode class Extends SensorNode class Has a location, name and an agent Has a location, name and an agent

Implementation Patch Sink Agent Patch Sink Agent Extends AbstractSensorAgent class. Extends AbstractSensorAgent class. Can buffer data, can transmit and receive messages Can buffer data, can transmit and receive messages Actuator Node Actuator Node Used as it is in YAES Used as it is in YAES Moves randomly Moves randomly Announces its location to sensor nodes Announces its location to sensor nodes

Implementation Changes made to YAES library Changes made to YAES library Multiple sinks Multiple sinks Arrangement helper class Arrangement helper class Deployment Deployment Sensors and birds deployed randomly Sensors and birds deployed randomly Sink deployment dependent on movement type Sink deployment dependent on movement type Communication Communication Messages Messages Each message has a sender and destination address, message type and message content Each message has a sender and destination address, message type and message content

Implementation Communication Communication Sinks broadcast a message of type “Query” Sinks broadcast a message of type “Query” Sensor reply with a message of type “Query-Reply” Sensor reply with a message of type “Query-Reply” Bird location and its utility is stored in a buffer. The utility of information decreases with each simulation. The whole buffer is instantaneously transmitted when replying to the sink Bird location and its utility is stored in a buffer. The utility of information decreases with each simulation. The whole buffer is instantaneously transmitted when replying to the sink

Implementation Information-based Movement (Algorithm) At each simulation step, for each sink At each simulation step, for each sink Assign the hottest available sensor node to the sink if it has not already been assigned one Assign the hottest available sensor node to the sink if it has not already been assigned one Make this sensor node unavailable to other sinks Make this sensor node unavailable to other sinks If the distance between the sink and the sensor node is greater than the transmission range of the sensor node If the distance between the sink and the sensor node is greater than the transmission range of the sensor node Move the sink towards the sensor node Move the sink towards the sensor node Otherwise make this sensor node available to other sinks and free its current assignment Otherwise make this sensor node available to other sinks and free its current assignment

Simulation

Results

Results The simulation utility is calculated as follows: The simulation utility is calculated as follows:

Results Comparison between different sink movements is done by calculating the total utility of information gathered by all sinks in the simulation plotted against the number of sink nodes. Comparison between different sink movements is done by calculating the total utility of information gathered by all sinks in the simulation plotted against the number of sink nodes. 10 *Logarithm of Total Utility Number of SinksRandom MovementRegular MovementInformation Based Movement

Results

Future Work Patch generation and patch leader selection and communication. Patch generation and patch leader selection and communication. Sink movements Sink movements Distance, Hotness, Remaining Energy (Optimization problem) Distance, Hotness, Remaining Energy (Optimization problem) Probabilistic etc. Probabilistic etc. Comparison of sink movement techniques and results to other suggested papers. Comparison of sink movement techniques and results to other suggested papers. Implementing a power consumption function for the sinks Implementing a power consumption function for the sinks Introducing packet loss over network based on signal strength and noise. Introducing packet loss over network based on signal strength and noise.

Thank You