A temporal message ordering and object tracking application

dc.contributor.authorLakshman, Kaveti
dc.date.accessioned2008-11-13T20:11:31Z
dc.date.available2008-11-13T20:11:31Z
dc.date.graduationmonthDecemberen
dc.date.issued2008-11-13T20:11:31Z
dc.date.published2008en
dc.description.abstractTinyOS is an operating system designed for wireless embedded sensor network which supports the component based development language called Nesc. Wireless sensor network are becoming increasingly popular and are being used in various applications including surveillance applications related to object tracking. Wireless sensor devices called motes can generate an event in the network whenever there is some object moving in its vicinity. This project aims to develop an application which detects the path information of object moving in the sensor field by capturing the order of events occurs in the network. This application builds a logical topology called DAG (Directed acyclic graph) between the motes in the network which is similar to the tree topology where a child can have multiple parents which are in communication range and a level closer to the root. Using a DAG, motes can communicate efficiently to order the events occurring in the sensor field. The root of the DAG is the base station which receives all the events occurred in the network and orders them based on the information it has from previous events received. Every event occurring in the network is assigned a time stamp and is identified by a tuple (mote_id, timestamp) which describes that the mote with identity id has detected the object with the timestamp, and ordering all such events based on the timestamps we get the path information. There are two time stamping algorithms written in this project. In the first time stamping algorithm, whenever any event occurs, it updates the timestamp information of the entire neighboring mote in the field and when the object enters in the detection range of neighboring mote of previous detected mote, it assigns the new timestamp. The second time stamping algorithm just send the message to the parent and it passes on to its parent until the message is received at the base station, and base station itself assigns the timestamps based the event on first come first serve basis. The application is tested by displaying the path information received and ordered at the base station.en
dc.description.advisorGurdip Singhen
dc.description.degreeMaster of Scienceen
dc.description.departmentDepartment of Computing and Information Sciencesen
dc.description.levelMastersen
dc.identifier.urihttp://hdl.handle.net/2097/1005
dc.language.isoen_USen
dc.publisherKansas State Universityen
dc.subjectMessageen
dc.subjectOrderingen
dc.subjectObjecten
dc.subjectTrackingen
dc.subject.umiComputer Science (0984)en
dc.titleA temporal message ordering and object tracking applicationen
dc.typeReporten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
LakshmanKaveti2008.pdf
Size:
702.92 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description: