Data Dissemination \(Part II\) - DAIICT Intranet
Data Dissemination \(Part II\) - DAIICT Intranet
Data Dissemination \(Part II\) - DAIICT Intranet
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Data</strong> <strong>Dissemination</strong><br />
(<strong>Part</strong> II)<br />
By,<br />
Maulik Soni<br />
200411011
<strong>Data</strong> <strong>Dissemination</strong><br />
• Distributed processing of vast<br />
quantities of data<br />
• Fault tolerance<br />
• Sink nodes connected to<br />
Internet
SPIN - Introduction<br />
• Sensor Protocols for Information<br />
via Negotiation<br />
• Adaptive Protocol<br />
• <strong>Data</strong> descriptors<br />
• Application specific knowledge<br />
• Resource Awareness
Decisions on Nodes<br />
• Application<br />
• Current information that the<br />
node has<br />
• Knowledge of Computing<br />
• Communication<br />
• Energy Resources
Primary Obstacles<br />
• Energy<br />
• Computation<br />
• Communication
Problems with classical<br />
Flooding<br />
• Implosion<br />
• Overlap<br />
• Resource Blindness
Implosion
Overlap
SPIN solution<br />
• Negotiation<br />
– <strong>Data</strong> identification<br />
• Resource Adaptation<br />
– Resource manager<br />
– Prudent in forwarding third party<br />
data
SPIN Flavors<br />
• SPIN 1<br />
• SPIN 2<br />
– Includes resource adaptation
ALF Principle<br />
• ALF (Application Level Framing)<br />
• Packetization is in terms of ADU<br />
• Common data naming between<br />
transmission protocol &<br />
application<br />
• Application specific routing<br />
decisions
SPIN Messages<br />
• ADV<br />
• REQ<br />
• DATA
SPIN 1
SPIN 1
SPIN 1
Other protocols<br />
• Flooding<br />
– Converges in O(d) rounds<br />
• Gossiping<br />
– Randomized neighbor selection<br />
– Avoids implosion<br />
• Ideal <strong>Dissemination</strong><br />
– Source specific shortest path tree
Gossiping
Simulation Details
Simulation Details
Percentage of <strong>Data</strong> Acquired<br />
in the network
Total Energy dissipated
Message Profiles
Unlimited energy
Limited Energy<br />
• In the paper, Fig no. 12, 13 & 14.
Convergence Time<br />
• No – overlapping of data<br />
• Overlapped data<br />
• In the paper, Fig No. 15 & 16
Thank You.<br />
Maulik Soni<br />
200411011
Change language