1 / 33

Patch Based Mobile Sink Movement

Patch Based Mobile Sink Movement. By Salman Saeed Khan Omar Oreifej. Outline. Introduction Goals and Expectations Project Description Implementation Results Simulation. Introduction. Introduction.

lamont
Download Presentation

Patch Based Mobile Sink Movement

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. Outline • Introduction • Goals and Expectations • Project Description • Implementation • Results • Simulation

  3. Introduction

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

  5. Introduction • 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 • 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

  6. Introduction • Sensors are detecting bird existence • 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 • Study, analyse and compare different sink movement models • Different mobile movements achieves: • Different amount of information • Different utilities of information

  7. Goals and Expectations

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

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

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

  11. Project Description

  12. Project Description • In general, Patch based sensor network with mobile sinks is desired • 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

  13. Project Description • Project: • A field of an approximated area of half squared mile • 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 • Birds are simulated by actuator agents who are moving randomly in the field • Multiple mobile sinks scattered collecting data from nodes

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

  15. Project Description • Sink movement techniques are the main issue in the project • All movement models aims at collecting the most data with the most utility • Introducing three different sink movement techniques • 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

  16. Project Description • Information Based Movement: • 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 • After a sink reaches the desired patch it will again search for the hottest non-reserved patch and head for it

  17. Project Description • Communications • 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 • 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

  18. Challenges and Problems

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

  20. Implementation

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

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

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

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

  25. Implementation • Communication • Sinks broadcast a message of type “Query” • 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

  26. Implementation Information-based Movement (Algorithm) At each simulation step, for each sink 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 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 Otherwise make this sensor node available to other sinks and free its current assignment

  27. Simulation

  28. Results

  29. Results The simulation utility is calculated as follows:

  30. 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.

  31. Results

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

  33. Thank You

More Related