1 Constructing Locally Centralized Applications by Mobile Agents in Wireless Sensor Networks 2008/05/14 Shunichiro Suenaga* (Nihon Unisys Ltd./The Graduate.

Slides:



Advertisements
Similar presentations
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
Advertisements

Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
TDMA Scheduling in Wireless Sensor Networks
A Distributed Security Framework for Heterogeneous Wireless Sensor Networks Presented by Drew Wichmann Paper by Himali Saxena, Chunyu Ai, Marco Valero,
CLUSTERING IN WIRELESS SENSOR NETWORKS B Y K ALYAN S ASIDHAR.
Wireless sensor networks in autonomic environments
1 Distributed Adaptive Sampling, Forwarding, and Routing Algorithms for Wireless Visual Sensor Networks Johnsen Kho, Long Tran-Thanh, Alex Rogers, Nicholas.
Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.
What is a Wireless Sensor Network (WSN)? An autonomous, ad hoc system consisting of a collective of networked sensor nodes designed to intercommunicate.
A High-Accuracy, Low-Cost Localization System for Wireless Sensor Networks Radu Stoleru, Tian He, John A. Stankovic, David Luebke University of Virginia.
1/14 Ad Hoc Networking, Eli M. Gafni and Dimitri P. Bertsekas Distributed Algorithm for Generating Loop-free Routes in Networks With Frequently.
Murat Demirbas Youngwhan Song University at Buffalo, SUNY
1 Enhancing Cellular Multicast Performance Using Ad Hoc Networks Jun Cheol Park Sneha Kumar Kasera School of.
Agent-friendly aggregation 1 On agent-friendly aggregation in networks ATSN 2008 (at AAMAS 2008) Christian Sommer and Shinichi Honiden National Institute.
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks (WSNs) Murat Demirbas, Xuming Lu Dept of Computer Science and Engineering, University.
ATSN 2009 Towards an Extensible Agent-based Middleware for Sensor Networks and RFID Systems Dirk Bade University of Hamburg, Germany.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks (WSNs) Murat Demirbas, Xuming Lu Dept of Computer Science and Engineering, University.
Bluenet a New Scatternet Formation Scheme * Huseyin Ozgur Tan * Zifang Wang,Robert J.Thomas, Zygmunt Haas ECE Cornell Univ*
802.11b Vulnerabilities, Ad-Hoc Mode, RF Jamming and Receiver Design Ritesh H Shukla Graduate Student ECE Dept Under the Guidance of Prof. William R Michalson.
Adaptive Traffic Light Control with Wireless Sensor Networks Presented by Khaled Mohammed Ali Hassan.
A Node-Centric Load Balancing Algorithm for Wireless Sensor Networks Hui Dai, Richar Han Department of Computer Science University of Colorado at Boulder.
Mobile Agents in Wireless Sensor Networks Ivan Vukasinovic Zoran Babovic Goran Rakocevic.
Energy Saving In Sensor Network Using Specialized Nodes Shahab Salehi EE 695.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Nuttapon Boonpinon Advisor Dr. Attawith Sudsang Department of Computer Engineering,Chulalongkorn University Pattern Formation for Heterogeneous.
A Sweeper Scheme for Localization and Mobility Prediction in Underwater Acoustic Sensor Networks K. T. DharanC. Srimathi*Soo-Hyun Park VIT University Vellore,
Multimedia & Networking Lab
1 Adaptive QoS Framework for Wireless Sensor Networks Lucy He Honeywell Technology & Solutions Lab No. 430 Guo Li Bin Road, Pudong New Area, Shanghai,
Rapid Development and Flexible Deployment of Adaptive Wireless Sensor Network Applications Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu
Dart: A Meta-Level Object-Oriented Framework for Task-Specific Behavior Modeling by Domain Experts R. Razavi et al..OOPSLA Workshop DSML‘ Dart:
Rapid Development and Flexible Deployment of Adaptive Wireless Sensor Network Applications Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
Presentation of Master’s thesis Simulation and Analysis of Wireless Mesh Network In Smart Grid / Advanced Metering Infrastructure Philip Huynh.
A Proposal of Application Failure Detection and Recovery in the Grid Marian Bubak 1,2, Tomasz Szepieniec 2, Marcin Radecki 2 1 Institute of Computer Science,
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Wireless Sensor Network Wireless Sensor Network Based.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Distance Estimation by Constructing The Virtual Ruler in Anisotropic Sensor Networks Yun Wang,Kai Li, Jie Wu Southeast University, Nanjing, China, Temple.
NGMAST 2008 A Proactive and Distributed QoS Negotiation Approach for Heterogeneous environments Anis Zouari, Lucian Suciu, Jean Marie Bonnin, and Karine.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Resilient Approach for Energy Management on Hot Spots in WSNs Fernando Henrique Gielow Michele Nogueira Aldri Luiz dos Santos
Supervisor: Antoine Bagula Students: Mthokozisi Moyo Luis Sa Wireless Sensor Network Repairing.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
Toward a Packet Duplication Control for Opportunistic Routing in WSNs Georgios Z. Papadopoulos, Julien Beaudaux, Antoine Gallais, Periklis Chatzimisios,
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
Murat Demirbas Onur Soysal SUNY Buffalo Ali Saman Tosun U. San Antonio Data Salmon: A greedy mobile basestation protocol for efficient data collection.
Node failure tolerance in wireless sensor networks CS 2310 Seminar Mengsi Lou.
Shambhu Upadhyaya 1 Sensor Networks – Hop- by-Hop Authentication Shambhu Upadhyaya Wireless Network Security CSE 566 (Lecture 22)
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by.
TempLab : A Testbed to Study the Impact of Temperature on Wireless Sensor Networks C.A. Boanoy, M.A. Zúñiga, J. Brownz, U. Roedigz, C. Keppitiyagama§,
Name Of The College & Dept
1 Routing security against Threat models CSCI 5931 Wireless & Sensor Networks CSCI 5931 Wireless & Sensor Networks Darshan Chipade.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Grid-Based Energy-Efficient Routing from Multiple Sources to Multiple Mobile Sinks in Wireless Sensor Networks Kisuk Kweon, Hojin Ghim, Jaeyoung Hong and.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Unpredictable Software-based Attestation Solution for Node Compromise Detection in Mobile WSN Xinyu Jin 1 Pasd Putthapipat 1 Deng Pan 1 Niki Pissinou 1.
Juan Alapin Alon Shahaf Traditional WSN “Sensor Clould” Other stuff??!?
LA-MAC: A Load Adaptive MAC Protocol for MANETs IEEE Global Telecommunications Conference(GLOBECOM )2009. Presented by Qiang YE Smart Grid Subgroup Meeting.
Source : 2014 IEEE Ninth International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP) Auther : Nacer Khalil, Mohamed.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Wireless Sensor Network Localization with Neural Networks
Presented by: Saurav Kumar Bengani
Net 435: Wireless sensor network (WSN)
TCP in Mobile Ad-hoc Networks
Presentation transcript:

1 Constructing Locally Centralized Applications by Mobile Agents in Wireless Sensor Networks 2008/05/14 Shunichiro Suenaga* (Nihon Unisys Ltd./The Graduate University for Advanced Studies) Shinichi Honiden (The University of Tokyo/ National Institute of Informatics) ATSN-2008

2 Index 1.Overview 2.Problems and Requirements 3.Approach 4.Evaluation 5.Related Work 6.Conclusions

3 Overview When an application is constructed by multiple agents, existing works have problems –Architecture –Group Migration We propose –Architecture (Three different role of agents) –Group Migration (Agent generation)

4 2. Problems and Requirements

Assumed Environment WSN (roof) Base Station LAN Stock Management Warehouse Goods: Arrival/ Relocation/ Shipping “Stock Management” manages locations of goods.

Locally Centralized Application Temp. MonitoringIntruder Detection + Goods location sometimes change Addition and Deletion (Arrival and Shipping) Specific processing for each goods.

Requirements ① Spatial sensing around the goods. ( multiple programs are needed to cover spatial area ) ② Programs can move to the new location (of the goods) and continue the processing . Existing Works ) Reprogramming (Deluge, Mate) and Mobile Agent (Agilla,Actornet) can realize addition and deletion of programs in a WSN.

8 Reprograming VS MA Addition and Deletion of Programs Specific Node Reprogram Update ! Bottle- neck! Base-Station ReprogrammingMobile Agent

Problems ① Architecture to constructing LCA (Locally Centralized Application ) by multiple mobile agents ② Simultaneous Group Migration to move to the new location of the goods

10 Unsophisticated agent architecture introduces following possibilities  Disrupts periodical sensing  Makes Light weight agent heavy 2.4. Problem ① ( Architecture)

Problem ② (Group Migration) Migration failure makes application execution impossible Individual migrations of agents introduce following possibility ・ Lost ・ Fall away Can’t continue execution

12 3. Approach

Approach ① (Architecture) LCA Requirements A) Sensing Execution of sensing on several nodes. B) Information collection Exchange of information between base station. C) Application specific processing judgment of the sensing results, execution of the processing in each specific situation.

Approach ① (Architecture) NameDescription C) Master Judgment of the sensing results, Application specific processing, Group Migration, management of the lifecycles of Slave-S,Slave-M.(Approach ②) A) Slave-S Sensing around the goods. Multiple Slave-S are deployed in a group. S: Sensing / Stationary B) Slave-M Master gives an order to information collection Slave-M. (Information Exchange between node and base station) M: Mobile

Approach ① ( Architecture ) LCA (Wine Example) When wine moves, group also needs to move..

Approach ② (Group Migration) ■Success Rate of migration (existing works) P: Failure rate ( common in WSN ) N: number of programs Success Rate= (1-P)^N Decreasing N is a solution Slave-Ss and a Slave-M are included in Master code. Our Approach: Make N 1.

Approach ② (Group Migration) Slave-S , Slave-T are included in Master Master generates Slave-S and Slave-T Mote Middle Mote Middle Migration Transmitted transformed Re-generation transformed

Approach ② (Group Migration) 1.Master Injected 2.Slave Deployment 3.Start 4.Slave Killed 5.Migration 6.Deployed

Approach ②( Group Migration) ■ Deployment Pattern (Static) -number of Slaves -Deployment Pattern -All Surrounding node -N-Hop ■ Static Deployment Pattern Example - 4 Slave-S are deployed on 4 of 1hop neighbors. - 1 Slave-M is deployed on 1 of 1hop neighbors. Optimization and Dynamic Deployment are Future Work Where are Slave-S and Slave-M deployed ? (Specified in Master code)

Implementation We extended Agilla (ICDCS 2005) Points Hierarchy (Master,Slave) Location Management Kill Manager

21 Evaluation

Evaluation ① Architecture - Scenario base - Drawbacks of our approach success rate of kill ② Group Migration - Success rate of migration

Simulation Setting TOSSIM ・ Topology : grid ・ size : 8x8 ・ baud rate : 40Kbps ・ Lossy : 5feet, 8feet,10feet

Evaluation ① (1/3) Scenario (How many times can a group execute processing around the goods? ) Master moves to the new location Master deploys 4 Slave-S to 4 of 1hop neighbors Master deploys 1 Slave-M to 1 of 1hop neigbors . Master gives an order to Slave-M to go to base station Slave-M obtains the new location of goods Group start to migrate to the new location.

Evaluation ① (2/3) 5feet8feet10feet 2times-Our Approach 2times-Agilla 100% 73.3% 93.3% 60.0% 73.3% 33.3% 3times-Our Approach 3times-Agilla 93.3% 53.3% 73.3% 40.0% 20.0% 4times-Our Approach 4times-Agilla 93.3% 33.3% 66.7% 20.0% 40.0% 6.8% 5times-Our Approach 5times-Agilla 86.6% 26.7% 60.0% 13.3% 33.3% 0%

Evaluation ① (3/3) 5feet8feet10feet Success rate of Kill90.9%68.6%52.4% Success rate of Kill (Retransmit) 100% Slaves can be killed completely in simulation environment.

Evaluation ② (1/2 ) 4-times Group Migration Agilla (three agents) Our Approach ( 1Master→Master,SlaveS,SlaveM ) 5lossy8lossy10lossy Agilla %60%40% Our Approach %80%67% Spatial distance of agents are 1hop

Evaluation ② (2/2 ) 5lossy8lossy10lossy Agilla %26.6%13.3% Our Approach %73.3%60% Spatial distance of agents are 2hop 4-times Group Migration Agilla (three agents) Our Approach ( 1Master→Master,SlaveS,SlaveM )

29 Summary of Evaluation ① Architecture –Architecture looks fair –Disadvantage is overcome in simulation environment ② Group Migration –Our approach has better success rate than existing work

30 Related Work ■ WSN Reprogramming (Deluge, Mate , XNP, MNP , FireCracker) –code mobility WSN-MA (Agilla,ActorNet,SensorWare) –group migration ■ Wired Network MA(Mobile Space,Ishikawa et al. ) Assumed Environment purpose

31 Conclusions We propose, Architecture and Group Migration We show the efficiency of our approach in simulation environment Our approach will be one of the solutions to realize multiple simultaneous applications in WSNs.

32 Thank you !

33 Appendix

Assumed Environment “Stock Management” manages locations of goods. WSN is ① Arrival ② Relocation ③ Shipping Shelf ID Link goods ID and shelf ID (Relocation) Delete shipped goods ID Stock Management Wi-Fi Shipping ID PDA

35 Limitation Migration Failure of Master –makes application execution impossible –while, existing work also has this problem Ignore Execution State of Slaves –Our approach always kill Slaves –Not required in assumed application

36 Future Work Dynamic acquisition of Deployment Pattern Now: Middleware deploys Slaves in according to the static deployment pattern Future: Master can adopt the situation, i.e. battery level, link state, number of neighbors, etc..

37 Sample Code