Sources to sink and not the other way around sensor

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: lems due to maintaining information about its neighbors and parents (reputation history) Maintaining multiple paths requires more resources ARRIVE Suggestions/Improvements/Future Work: Beneficial to measure how much passive listening affects energy use Nodes can be mobile during the simulation instead of static If there is a significant mobility, state information should be updated using a better mechanism than flooding Explanation of how multiple packets are generated How much redundant data is sufficient to optimize the network Energy-awareness needs to be taken into consideration Possibly use energy level parameter in the decision making Include probabilistic analysis of the algorithm Study the tradeoff the communication cost of ARRIVE vs. its robustness Consider load balancing issues such that nodes near the sink deplete their resources sooner than nodes farther away Lack of quantitative analysis of passive participation for security reasons Experiment with larger number of events Rumor Routing Algorithm Preliminaries Each node has its neighbor list, and an events table, with forwarding information to all the events it knows. After a node witnesses an event, an agent may be created, which is a long-lived packet...
View Full Document

This note was uploaded on 08/25/2011 for the course EEL 5937 taught by Professor Staff during the Spring '08 term at University of Central Florida.

Ask a homework question - tutors are online