Patch Based Mobile Sink Movement By Salman Saeed
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej
Outline • • • Introduction Goals and Expectations Project Description Implementation Results Simulation
Introduction
Introduction Wireless sensor network is an active research area with numerous applications and different techniques developed each year n Some Applications n Environmental monitoring n Battlefield Awareness n Tracking and Smart Environments n
Introduction Patch-based sensor networks is a sensor network divided into random areas called patches n Patches contain sensors which collect information, but do not forward them n Several mobile sinks are moving around the field, visiting patches and collecting information n We discuss a patch based sensor network that is distributed over a field to collect motion information about birds passing over n
Introduction Sensors are detecting bird existence n Whenever a bird comes into the transmission range of a sensor it stores that bird’s information n We have Mobile Sinks so mobility is what matters n Study, analyse and compare different sink movement models n Different mobile movements achieves: n Different amount of information n Different utilities of information n
Goals and Expectations
Goals and Expectations n Exploring the different ways that a sink can visit randomly distributed patches n Efficiency of a visiting technique can be represented by Amount of collected data n Power consumption n Utility of the collected results n Consistency of the results n
Goals and Expectations n Real life: n. A combination of all factors should be taken into consideration when evaluating a visiting technique n Our project: n will only consider the amount and utility of the collected data n Utility represented by how new or fresh is that data
Goals and Expectations n Expectations: n Simulate a patch based sensor network using YAES simulator n Conduct three different styles of movement for the sink n keep a log of all data gathered by each movement technique n Analyse the data and conclude the best sink visiting movement technique
Project Description
Project Description n In general, Patch based sensor network with mobile sinks is desired Easier routing: because of patch heads topology n Energy Efficient: High rate communications only occur on patch heads, other normal sensor nodes would save energy. Moreover, only sinks move in the field n
Project Description n Project: A field of an approximated area of half squared mile n Simple sensor nodes randomly deployed on the field n The sensor nodes are static in place and capable of detection of any bird flying over the sensors and within its transmission range n Birds are simulated by actuator agents who are moving randomly in the field n Multiple mobile sinks scattered collecting data from nodes n
Project Description n Patching Was implemented virtually n Each sensor node n Is a normal sensor: Senses birds existence n Is a patch head: communicates with the sinks n
Project Description n 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 n n 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
Project Description n Information Based Movement: n Sinks can get information about the amount of data generated in a patch n Each sink determines the hottest patch and moves to collect information from that patch while no other sink goes there n After a sink reaches the desired patch it will again search for the hottest non-reserved patch and head for it
Project Description n Communications Occurs when a bird agent comes within the transmission range of a sensor n The sensor will store data about the bird by filling a temporary buffer that each sensor maintains n 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 n n All data gathered from all sinks are delivered at the end to a data storage unit
Challenges and Problems
Challenges and Problems n n n Addition of multiple sinks and their movement in YAES. Implementation of Utility of information. Comparing Results to other experiments
Implementation
Implementation n Eclipse 3. 2 & YAES library YAES objects used: n Field n Sensor Node n Sink Node n Actuator Node (Bird) Field n Is a Java panel n Is relative in size to other objects
Implementation n Sensor Node n Has a location, name and an agent Patch Sensor Agent n Extends Abstract. Sensor. Agent class. n Can buffer data, can transmit and receive messages Sink Node n Extends Sensor. Node class n Has a location, name and an agent
Implementation n n Patch Sink Agent n Extends Abstract. Sensor. Agent class. n Can buffer data, can transmit and receive messages Actuator Node n Used as it is in YAES Moves randomly n Announces its location to sensor nodes n
Implementation n Changes made to YAES library n Multiple sinks n Arrangement helper class Deployment n Sensors and birds deployed randomly n Sink deployment dependent on movement type Communication n Messages n Each message has a sender and destination
Implementation n Communication n Sinks broadcast a message of type “Query” n Sensor reply with a message of type “Query. Reply” n 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) n At each simulation step, for each sink n Assign the hottest available sensor node to the sink if it has not already been assigned one n Make this sensor node unavailable to other sinks n If the distance between the sink and the sensor node is greater than the transmission range of the sensor node n Move the sink towards the sensor node n Otherwise make this sensor node available to other sinks and free its current assignment
Simulation
Results
Results n The simulation utility is calculated as follows:
Results n 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 Sinks Random Movement Regular Movement Information Movement 1 48. 51 53. 88 56. 25 2 49. 84 44. 88 58. 14 3 51. 25 52. 46 59. 27 4 55. 58 55. 63 58. 20 5 56. 00 55. 28 59. 61 6 56. 93 56. 61 59. 09 7 57. 52 58. 75 59. 84 8 57. 17 54. 54 60. 59 9 58. 10 58. 71 60. 52 10 57. 75 58. 98 60. 81 Based
Results
Future Work n n Patch generation and patch leader selection and communication. Sink movements n n n 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.
Thank You
- Slides: 33