Presentation is loading. Please wait.

Presentation is loading. Please wait.

6-7-2006Yang (SUTC 2006)1 OCO - a method for target tracking in wireless sensor networks T. Andrew Yang with Sam Tran Computer.

Similar presentations

Presentation on theme: "6-7-2006Yang (SUTC 2006)1 OCO - a method for target tracking in wireless sensor networks T. Andrew Yang with Sam Tran Computer."— Presentation transcript:

1 6-7-2006Yang (SUTC 2006)1 OCO - a method for target tracking in wireless sensor networks T. Andrew Yang ( with Sam Tran Computer Science Program University of Houston – Clear Lake Houston, Texas

2 6-7-2006Yang (SUTC 2006)2 Outline Introduction The Methods Simulation-based Evaluation Evaluation Results Conclusion and Future Work

3 6-7-2006Yang (SUTC 2006)3 Acknowledgement This work is supported in part by National Science Foundation (Grant DUE-0311592) Institute of Space Systems Operations (ISSO) UHCL Faculty Research and Support Fund (No. 859)

4 6-7-2006Yang (SUTC 2006)4 Introduction wireless sensor networks (WSN) -a network of wireless sensor nodes. -Each node is a computer with attached sensors (aka mote) that can process, exchange sensing data, as well as communicate wirelessly among themselves to perform various tasks. WSN have many applications in both military and civilian systems. Sample applications: data collection, surveillance, object tracking, etc.

5 6-7-2006Yang (SUTC 2006)5 WSN applications An example of wireless sensor network for data collection in agriculture

6 6-7-2006Yang (SUTC 2006)6 A scenario of enemy tracking using sensor networks WSN applications

7 6-7-2006Yang (SUTC 2006)7 The Challenges Small size of sensor node  Limited battery capacity and lower hardware performance Overlapping sensing areas (redundancy)  The network may be formed by randomly throwing thousands or even millions of sensor nodes in an area. Frequent change of network topology  The network is usually installed in a large area with many physical effects, such as earthquake, explosion, etc. Limited bandwidth of wireless links + interferences in the environment  Problems such as dropped packets and disconnected links

8 6-7-2006Yang (SUTC 2006)8 Requirements Accuracy of target detection – The primary goal is to ensure consistent accuracy without sacrificing the network’s longevity. Efficient energy dissipation – The goal is to increase the overall longevity of the WSN. Effective computation – Due to the limited processor and battery power of a sensor, computation performed on the sensor must be effective, in order to incur minimum energy dissipation. Re-configurability – When one or more of the sensors cease to function, the network should be able to self-organize or re-configure itself, in order to re- construct a functional WSN allowing the mission to continue to be fulfilled. Secure communications – In the context of WSN security, prevention-based security features such as authentication, data integrity, confidentiality, and availability are needed.

9 6-7-2006Yang (SUTC 2006)9 The Methods 1.OCO: Optimized Communication & Organization 2.DC: Direct Communication 3.LEACH: Low Energy Adaptive Clustering Hierarchy [Heinzelman, Chandrakasan, etc., 2000] Direct Communication –The sensor modules of all nodes are ON. –Nodes send data directly to the base. Advantages Gives the best accuracy. Disadvantages Unrealistic because the base has limited number of channels, and node energy is limited. Cannot be applied to a large area. Suffer redundancy

10 6-7-2006Yang (SUTC 2006)10 The Methods Cluster-based method (e.g., LEACH) –Build a hierarchy tree by using LEACH algorithm: Nodes randomly self-elect to become cluster heads. The cluster head invites its neighbors to join to the group. Re-elect cluster heads after a period of time for energy balancing. –Nodes send data to the base through the cluster heads. –Cluster heads communicate to the base directly. –Advantages Simple –Disadvantages All nodes are supposed to communicate directly with the base  Cannot be applied to a large area  suffer the channel limitation of the base Suffer redundancy.

11 6-7-2006Yang (SUTC 2006)11 OCO 4 phases - position collection, processing, tracking, and maintenance –In the position collection phase, the base-station collects positions of all reachable nodes in the network. –In the processing phase, it applies image processing techniques to clean up the redundant nodes, detect border nodes, and find the shortest path from each node to the base. –In the tracking phase, the sensors in the network all work together to detect and track intruding objects. –The maintenance phase involves re-organizing the network when, for example, a change in the topology of the network occurs, or some of the sensor nodes die (i.e., running out of power).

12 6-7-2006Yang (SUTC 2006)12 OCO - Position collection phase Assumption: The sensor nodes are randomly scattered in the geographical area. The base station sends a message to its neighbors to gather their IDs and positions, and at the same time advertise its own ID as the parent ID of the neighbor nodes. The base’s neighbor nodes, after sending its ID and position to its parent (the base), marks itself as recognized, and then performs the same actions as the base does by collecting IDs and positions from their neighbors, and advertising itself as the parent node, and so on. When a node gets the position and ID information from its neighbor, it forwards the information to its parent.

13 6-7-2006Yang (SUTC 2006)13 OCO - Processing phase 3 steps: 1.Clean up redundant nodes 2.Define the border nodes 3.Find the shortest path from each node to the base Table 1: Algorithm for Determining Redundant Nodes 1)Build a geographic image of the network by assigning color value = 1 for all points that is covered by at least one sensor node. The rest of the points are assigned color value = 0. 2)Initialize a list of nodes that are supposed to cover the whole network area, called Area_List. 3)Add the base node to the Area_List. 4)For all the nodes in the area, if a node is not overlapping with any node in the Area_List, add it to the Area_List. The purpose of this step is to optimize node distribution. 5)For each point in the network area, if the point is not covered by any node in the Area_List, add the node that contains the point to the Area_List. 6)Nodes that are not in the Area_list after the “for” loops in steps 4, and 5 are redundant nodes.

14 6-7-2006Yang (SUTC 2006)14 Clean up redundant nodes OCO: Processing phase

15 6-7-2006Yang (SUTC 2006)15 OCO’s reduction of sensor nodes Number of nodes in the sensing area OCO: number of nodes after redundancy removal + (number of border nodes) % of reduction 200178 (126 border nodes)11% 250212 (136 border nodes)15% 300230 (126 border nodes)23% 350251 (131 border nodes)28% 400269 (110 border nodes)33% 450280 (101 border nodes)38% 500285 (101 border nodes)43% 550291 (86 border nodes)47% 600287 (88 border nodes)52% 650278 (83 border nodes)57% 700299 (72 border nodes)57% 750297 (74 border nodes)60% 800294 (73 border nodes)63% 850293 (73 border nodes)66% 900279 (66 border nodes)69% 950315 (61 border nodes)67% 1000295 (60 border nodes)71%

16 6-7-2006Yang (SUTC 2006)16 1.Clean up redundant nodes 2.Define the border nodes 3.Find the shortest path from each node to the base Table 2: Algorithm for Finding the Border 1)For each pixel in the image, check if the color value =1. 2)If true (meaning this pixel belongs to an object), scan all its neighbors to see if any of them having the color value = 0. If true, this pixel belongs to the border. OCO: Processing phase - Determine the border nodes Finally, find a minimum set of nodes in the Area_List that contain all the border points, which are the border nodes.

17 6-7-2006Yang (SUTC 2006)17 Finding the Border Nodes OCO: Processing phase

18 6-7-2006Yang (SUTC 2006)18 Number of nodes vs percentage of border nodes Number of nodes in the sensing area OCO: number of border nodes % of border nodes / number of nodes 20012663% 25013654% 30012642% 35013137% 40011028% 45010122% 50010120% 5508616% 6008815% 6508313% 7007210% 7507410% 800739% 850739% 900667% 950616% 1000606%

19 6-7-2006Yang (SUTC 2006)19 OCO: Processing phase - find the shortest path Algorithm for finding the shortest path to the base for each node in the Area_List 1)Work only with nodes in the Area_List of the ‘cleaning up redundant nodes’ step (Table 1). 2)Assign parent_ID = 0 for all nodes. 3)Assign parent_ID = the base’s ID for all neighbors of the base and add these nodes to a list, called Processing List. 4)For each node in the Processing List, consider all its neighbors. If the neighbor has parent_ID = 0, assign the neighbor’s parent_ID = the node’s ID. Add the neighbor to the Processing List. 5)Repeat step 4 until all nodes are assigned parent_ID. After the loop, each node in the Area_list has a parent_ID. When a node wants to send a message to the base, it just delivers the message to its parent. The message is then continually forwarded until it reaches the base.

20 6-7-2006Yang (SUTC 2006)20 Find the shortest path to the base for each node in the Area_List.

21 6-7-2006Yang (SUTC 2006)21 Assigning roles to the nodes At the end of the processing phase, a ll nodes are assigned missions. The base broadcasts messages with node IDs to assign tasks for them. The redundant nodes are turned off to conserve energy. They just wake up after a long period (predefined) to receive commands from the base. If there is no command or the commands do not relate to them, they again switch to off totally. The border nodes have the sensor modules and the radio receiver modules ON (called ACTIVE state). The rest of the nodes in the sensor network are called forwarding nodes, which have their sensor modules OFF but the radio receiver modules is ON (called FORWARD state).

22 6-7-2006Yang (SUTC 2006)22 Roles of the nodes & initial states Border nodes Forwarding nodes Redundant Nodes + SensorActiveSleep RadioReceive Sleep MCU board Sleep; wake up to create messages only Sleep; wake up to create messages only Sleep + Periodically wake up to receive commands from the base

23 6-7-2006Yang (SUTC 2006)23 Objects are assumed to have come from the outside. Normally, only the border nodes are ACTIVE. When a border node detects an object, it periodically sends its position information to the base by first forwarding the information to its parent. OCO: Tracking phase

24 6-7-2006Yang (SUTC 2006)24 OCO: Maintenance phase Maintenance phase To reconfigure the network in the case of topology change (probably due to dying or dead nodes) Examples: exhausted nodes, damaged nodes, re-positioned nodes Exhausted nodes  turns all its child nodes to SLEEP (orphan nodes)  sends a report to the base. Global re-configuration: When the base gets the report, it enters the processing phase to reconfigure the whole network, with dead nodes being removed and the network restructured. Local re-configuration: Find new parent(s) to adopt the orphans.

25 6-7-2006Yang (SUTC 2006)25 OCO: Maintenance phase Sample case: The dead node is a forwarding node.

26 6-7-2006Yang (SUTC 2006)26 OCO: Maintenance phase Sample case: The dead node is a border node.

27 6-7-2006Yang (SUTC 2006)27 Simulation The tool used for simulation is OMNET++. There are 3 basic components needed for the simulation: –sensor node –intruder object –sensor network In addition, we need a module called manager to help configure and run the simulation.

28 6-7-2006Yang (SUTC 2006)28 Simulation of Sensor Nodes Application MAC Layer 0 Coordinator Module Sensor Energy Radio

29 6-7-2006Yang (SUTC 2006)29 Simulation - Intrusion object simulation An object has only two layers: the application layer + the physical layer. Simulating a sensor network with intruder objects

30 6-7-2006Yang (SUTC 2006)30 Energy consumption calculation Create/Receive a data message Create/Receive a signal message 100 µJ 3 µJ Send a data message (d<= 60m) Send a signal message (d<=60m) 820 µJ 26 µJ Send a message (d > 60m)100 µJ + 0.1*d^2 Sensor board (full operation)66 µJ/s Radio board (idle/receive mode)100 µJ/s We use the assumptions in [5] as the basis when calculating the energy dissipation for our simulations. [5] Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan (2000). “Energy-Efficient Communication Protocol for Wireless Microsensor Networks”. THE HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, 2000.

31 6-7-2006Yang (SUTC 2006)31 Metrics Four types of metrics are considered when comparing the performance of the three selected methods: The total energy consumption is defined as the total energy that the network spends in a scenario. The accuracy is a percentage of the number of detected object positions of the method over the number of detected positions of the DC. The cost per detected point is an average number of energy units that are spent for a detected position. The time before first dead node is the time when the first node of the network runs out of energy. This matrix is a significant indication of the sensor network’s ‘well-being’ or longevity.

32 6-7-2006Yang (SUTC 2006)32 Simulation Settings Num of nodesDCLEACH-basedOCO 200 178 (126 border nodes) 250 212 (136 border nodes) 300 230 (126 border nodes) 350 251 (131 border nodes) 400 269 (110 border nodes) 450 280 (101 border nodes) 500 285 (101 border nodes) 550 291 (86 border nodes) 600 287 (88 border nodes) 650 278 (83 border nodes) 700 299 (72 border nodes) 750 297 (74 border nodes) 800 294 (73 border nodes) 850 293 (73 border nodes) 900 279 (66 border nodes) 950 315 (61 border nodes) 1000 295 (60 border nodes)

33 6-7-2006Yang (SUTC 2006)33 Simulation Results in the case of no intruder object Energy consumption

34 6-7-2006Yang (SUTC 2006)34 Simulation Results in the case of no intruder object time before first dead node

35 6-7-2006Yang (SUTC 2006)35 Paths of intruding objects Intruder objects move following specific paths and come from outside of the network area. The moving paths of objects are created by draw images. A MATLAB program reads the images and generates appropriate text files of positions of the path images.

36 6-7-2006Yang (SUTC 2006)36 Simulation Results (one intruder) Energy consumption

37 6-7-2006Yang (SUTC 2006)37 time before first dead node Simulation Results (one intruder)

38 6-7-2006Yang (SUTC 2006)38 accuracy Simulation Results (one intruder)

39 6-7-2006Yang (SUTC 2006)39 cost per detected points Simulation Results (one intruder)

40 6-7-2006Yang (SUTC 2006)40 Summary We have devised a method, OCO, for efficient target tracking in wireless sensor networks, and have evaluated its performance in various simulation scenarios against two other methods (DC and LEACH). Based on the evaluations, OCO appears to consume less energy than the other methods while achieving superior accuracy. The main strengths of OCO include its efficiency and easy maintenance, meaning that, when too many nodes have exhausted their energy, new nodes can be refilled to the tracking area and the OCO method will be able to dynamically build up a new network.

41 6-7-2006Yang (SUTC 2006)41 Limitations & On-going Work The sensor network usually works in hostile environments; therefore, security features need to be added to OCO.  node-to-base and node-to-node authentications Re-configuration of the networks  algorithms in the maintenance phase OCO needs to be implemented in a real sensor network to further verify its performance.  WSN test beds

42 6-7-2006Yang (SUTC 2006)42 A WSN Test Bed

43 6-7-2006Yang (SUTC 2006)43 Questions? Contact: T. Andrew Yang University of Houston – Clear Lake Houston, TX

Download ppt "6-7-2006Yang (SUTC 2006)1 OCO - a method for target tracking in wireless sensor networks T. Andrew Yang with Sam Tran Computer."

Similar presentations

Ads by Google