1 / 24

Autonomous Messenger Based Routing in Disjoint clusters of Mobile Sensor Network

Autonomous Messenger Based Routing in Disjoint clusters of Mobile Sensor Network. Authors: Nisar Hundewale, Qiong Cheng, Xiaolin Hu, Anu Bourgeois, Alex Zelikovsky @cs.gsu.edu. Georgia State University. Outline. Problem Definition Messenger Based Solution

yvon
Download Presentation

Autonomous Messenger Based Routing in Disjoint clusters of Mobile Sensor Network

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. Autonomous Messenger Based Routingin Disjoint clusters of Mobile Sensor Network Authors: Nisar Hundewale, Qiong Cheng, Xiaolin Hu, Anu Bourgeois, Alex Zelikovsky @cs.gsu.edu Georgia State University

  2. Outline • Problem Definition • Messenger Based Solution • Agent Simulation • Related Work • Conclusion • Future Work

  3. Outline • Problem Definition • Messenger Based Solution • Agent Simulation • Related Work • Conclusion • Future Work

  4. Introduction • Mini modern battle field • - UVA’s Group Management Model ? ? ? Base Station IR Server Leader Follower Member Node

  5. Why adding mobility in regular sensor network? • The distance between sub nets is beyond maximum transmission range; • Information can not be directly delivered; Adding mobility in regular sensor networks.

  6. Project Goal Goal • Maintain connectivity in disjointed mobile sensor network • Design a framework for routing protocol • Design autonomous messenger-based route discovery protocols • Design agent simulation Methodology • Discrete event system simulation specification • Autonomous agent system design

  7. Outline • Problem Definition • Messenger Based Solution • Agent Simulation • Related Work • Conclusion • Future Work

  8. Cluster Based Management Component Routing Discovery/Maintenance Component Based on Straight Line Movement of Messengers (SLMM) Based on Flexible Sharing Policy of Messengers (FSPM) Advanced Routing Component Solution Framework Roles Messenger Assignment Policy

  9. Cluster regular member Messenger Target Network Partition Wireless Communication Messaging Returning Cut edges between networks partitions (MST edges) Solution Process Cluster Head

  10. Solution Assumption • Every mobile sensor initially has the exact location of base station • Homogenous environment • No obstacle and no noise

  11. 3, 5 1 2 Messenger A’ Cluster A Leader 6 4.2 4 4.1 Messenger C Cluster B Cached Pipeline • B communication cycle Towards 3, 5 Pipeline Base Station Flexible Sharing Policy of Messengers (FSPM) • Communication process loop

  12. State Transition Diagram

  13. Route Discovery PROCEDURE Pseudo Code (sensor) 1 IF (sensor is in roaming status) 2 THEN IF (targets have been sensed) 3 THEN IF (cluster exists around the targets) 4 THEN IF (cluster is full & cluster doesn't need more) 5 THEN Change direction 6 ELSE Enter in the cluster and possess a suitable position; Share the cluster Head content; Change status; 7 ELSE Become the head of the cluster 8 ELSE Continue to move with random angle 9 ELSE IF (sensor is in active status) 10 THEN IF (sensor is cluster head) 11 THEN Recording; receiving data; change status; processing, checking pipeline and waiting time; select messenger; send messenger; 12 ELSE Recording; sending to cluster head

  14. Outline • Problem Definition • Messenger Based Solution • Agent Simulation • Related Work • Conclusion • Future Work

  15. Motivation • Mobile sensor networks possess the nature of high dynamical connection and disconnection which is not predicted and predetermined. • Agent simulation adapts to the nature. • Every autonomous agent corresponds to a self-configurable, self-adaptable and self-maintainable mobile sensor. • We designed the agent simulator. It utilized the Discrete Event System Specification (DEVS) and DEVSJAVA which was developed by University of Arizona.

  16. Responsibility: • Register/Deregister Cluster Coordinator Agent; • Coupling Management in DMSN; • Dynamic Simulation Environment Management; DMSN Coordinator Agent • Responsibility of Every Cluster Coordinator Agent: • Member Management; • Role Management; • Action Management; • Topology Management; Cluster Coordinator Agent Cluster Coordinator Agent …… • Responsibility of Every Sensor and Target Agent: • Data Structure; • Action Base; • State Transition Machine; • Action Policy; • Messages In/Out; Sensor Agent Sensor Agent Target Agent …… Basic Architecture of DMSN Agents

  17. DMSN Coordinator Agent Coordinator Coupled Coordinator Coupled Simulator Cluster Coordinator Agent Cluster Coordinator Agent Sensor Agent Sensor Agent Target Agent Framework for DMSN agents modeling & simulation DEVS Simulation DEVS Modeling DMSN Agents System Applied Applied Coupled Model ……Coupled Coordinator ……Model Coupled Model …… ……Model ……Coupled Simulator Atomic Model ……

  18. Screenshot

  19. Evaluation for Route Discoveries

  20. Outline • Problem Definition • Messenger Based Solution • Agent Simulation • Related Work • Conclusion • Future Work

  21. Related Work • Ferry based approach; [Ammar MB2002] • Table-driven routing such as DSDV; • Source-initiated on-demand routing such as DSR and AODV; • J. Stankovic, Darpa CleanPoint Presentation Slides - VigilNet, Cleanpoint Talk, Dec. 2004

  22. Conclusion • Study route discovery and routing protocol in disjoint mobile sensor networks; • Design two messenger based route discovery protocols, SLMM and FSPM; • FSPM is more energy-efficiency than SLMM; • More works…

  23. Future Work • Routing component • Target tracking • Intelligently path decision of messengers

  24. THANKS!

More Related