Programming Pervasive and Versatile Processing Applications: The TOTA Approach

Programming pervasive and mobile computing applications the tota approach l.jpg
1 / 38
791 days ago, 298 views
PowerPoint PPT Presentation
Title: Programming pervasive and portable registering applications: The TOTA approach ... TOTA bolster pervasive and portable applications. By utilizing circulated tuples so specialists can ...

Presentation Transcript

Slide 1

Programming Pervasive and Mobile Computing Applications: The TOTA Approach Presented By: Hector M Lugo-Cordero, MS EEL 6883

Slide 2

Full Citation Authors: Marco Mamei and Franco Zambonelli From: Universit à di Modena e Reggio Emilia Title: Programming unavoidable and portable processing applications: The TOTA approach Published at: ACM Transactions on Software Engineering and Methodology (TOSEM), vol. 18, issue 4, July 2009

Slide 3

Agenda Introduction Essentials Programming Evaluation Conclusions References

Slide 4

Agenda Introduction Essentials Programming Evaluation Conclusions References

Slide 5

The Problem Information preparing is consolidated into ordinary items Agents can come and leave whenever Information is setting (environment) subordinate Need for a straightforward programming structure

Slide 6

TOTA A tupple situated middleware Tuples are infused into the system No focal regular space

Slide 7

Case Study Scenario Imagine a gigantic exhibition hall like Le Louver on France Many vacationers come every day Makes hard for the administration of administrations and data Assume each client has a remote empowered PC Museum format can change after some time and individuals travel every which way as they need

Slide 8

Current Approaches Direct correspondence Communicate with different specialists is immediate (i.e. hardcoded) Not exceptionally dynamic Shared information space Hard coordination Event base Notifications required These are general (no setting mindfulness)

Slide 9

Agenda Introduction Essentials Programming Evaluation Conclusions References

Slide 10

The TOTA Approach Gathers components from both tuple-based and occasion base models Distributed tuples infused to the system are cloned and proliferated over the system A shared system, every hub running TOTA is the space with restricted neighbors Tuples structure: T = (C, P, M) C = content, P = spread, M = support

Slide 11

TOTA Example (Information)

Slide 12

TOTA in Le Louver Assumption that there is a vast remote system, with a spine How to give data and wanting to stay away from lines ArtPiece C = (depiction, area, separate) P = Propagate to all companions expanding separation M = upgrade if topology changes

Slide 13

Solutions (Information) Solution 1 Art pieces engender tuples Tourists question for the one with lower remove esteem Solution 2 Art pieces don't proliferate tuples Users inquiry for data Art pieces answer

Slide 14

TOTA Example (Meeting)

Slide 15

Solution (Meeting) Meeting C = (tourist_name, separate) P = spread to all associates, increment remove by one M = overhaul the separation tuple upon traveler move Tourist are guided with a GUI to a similar place utilizing the most noteworthy separation recursive process No coordination is indicated by TOTA

Slide 16

TOTA Architecture

Slide 17

Agenda Introduction Essentials Programming Evaluation Conclusions References

Slide 18

TOTA Implementation Java based Using 802.11b communicate Avoid unicast handshake Deployed emulator to build organize estimate Only 16 PDAs and a few portable PCs were utilized a similar code of the emulator could be utilized on gadgets Emulator kept running as a part of blended modes (genuine and copied gadgets)

Slide 19

TOTA Requirements What are the primitives that interface with the middleware? How to determine tuples T = (C, P, M)? How to code composed and setting mindful exercises?

Slide 20

TotaTuple open class MyTuple broadens TotaTuple, actualizes ReactiveComponent {/ReactiveComponent uncovered the respond() technique } TotaTuple myTuple = new MyTuple(new Object[]{"Hello"});

Slide 21

Tota API

Slide 22

TOTA Predefined Tuples

Slide 23

Programming ArtAgent1

Slide 24

Programming TouristAgent1

Slide 25

Programming ArtAgent2

Slide 26

Programming TouristAgent2

Slide 27

Programming MeetingAgent

Slide 28

Agenda Introduction Essentials Programming Evaluation Conclusions References

Slide 29

Software Engineering Analysis Context data makes TOTA general yet more troublesome for operators to respond Separation of tuples (setting) and specialists (rationale) however streamline this Incorporation of summon and layout outline designs encourage tuple programming

Slide 30

Tuple Propagation/Deletion Evaluation Highly adaptable since just engender to its quick neighbors Tu = Trcv + Tprop + Tsend + Ttravel Propagation Time on a WiFi PDA (IPAQ 400 MHz) Tprop 99.7 ms Tsend 67.2 ms Ttravel 0 ms Trcv 21.2 ms Tu 188.1 ms

Slide 31

Tuple Propagation/Deletion Evaluation (cont.) For X bounces T XU = X*T U practically speaking is somewhat more (10–20% from mean) Only HotTuples/MetricTuples and SpaceTuples were influenced by topology

Slide 32

Load and Memory Evaluation Load is accounted to nearby specialist execution and proliferation/upkeep rules Storage is sufficiently little for small scale sensors, yet requires every one to store it Java usage leaves TOTA opened for enhancements in an improved C form

Slide 33

Agenda Introduction Essentials Programming Evaluation Conclusions References

Slide 34

Conclusions TOTA bolster unavoidable and versatile applications By utilizing dispersed tuples so specialists can Extract relevant data Coordinate each other Dynamically modifies as topology changes TOTA shortcomings Strict structure (hard mapping) Security and protection issues Complex operations aren't exceptionally upheld

Slide 35

My Thoughts Strengths: TOTA appears like a capable, convenient API Weaknesses: Authors guaranteed that it is setting free yet just the gallery situation was utilized Unclear mapping on the most proficient method to change genuine issues to TOTA tuples Suggestions: Adding stream of movement by layer to perceive how to translate the pool of tuples over the system Demonstrate the application on various areas, and give a clearer mapping Implementation in C for gadgets that don't gangs a JVM Include wired spine

Slide 36

Agenda Introduction Essentials Programming Evaluation Conclusions References

Slide 37


Slide 38