Rumor routing algorithm adapted from braginsky 2002

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: [Braginsky+ 2002] Rumor Routing Algorithm Advantages: Deliver queries to events in large networks with less average cumulative hops and lower energy requirements than simple flooding. The algorithm can handle node failure gracefully, degrading its delivery rate linearly with the number of failed nodes. Rumor Routing Algorithm Disadvantages: The path found by the agent sometimes is not the shortest and could be unavailable if one of the links of the path is broken. The agent may carry lots of routing information of events even some events have disappeared. No hints from the paper about the number of agents which should be created from the event zone. Can the nodes make a query for an event if no such event is existing in the network? It seems that each event should have an id, but no information is provided in the paper. Optimization is not considered A Stream Enabled Routing (SER) Protocol for Sensor Networks [Weilian+ 2002] SER protocol allows sources to choose the routes based on the instruction (or task) provided by the sinks An instruction is a predefined as an identifier value instead of attributes being assigned to task as in the case of directed diffusion [Intanagonwiwat + 2000]. Therefore, only identifier is sent rather than the attribute list, resulting in memory conservation It takes...
View Full Document

Ask a homework question - tutors are online