无线传感器网络第四讲.pptxVIP

PROTOCOL STACK;第四讲 Network layer;Network layer ;Challenge ; Taxonomy of Routing Protocols for Sensor Networks;Routing Protocols;Network layer ;Data-centric and flat architecture;Instead of node IDs, data-centric routing requires attribute-based naming ;Data-centric routing ;Conventional ApproachFLOODING;51;ROUTING ALGORITHMS Gossiping;Problems of Flooding and Gossiping;Deficiencies;Problems;Gossiping;The Optimum Protocol;Ideal Dissemination;Data-centric routing ;SPIN: Sensor Protocol for Information via Negotiation(W.R. Heinzelman, J. Kulik, and H. Balakrishan, “Adaptive Protocols for Information Dissemination in Wireless Sensor Networks”, Proc. ACM MobiCom’99, pp. 174-185, 1999 );SPIN ;SPIN;SPIN; SPIN ;;;;;;;SPIN-1 Protocol;SPIN-2;SPIN-2;SPIN Algorithm Variants;CONCLUSIONS;Data-centric routing ;ROUTING ALGORITHM (DIRECTED DIFFUSION) ;Data Centric;DIRECTED DIFFUSION ;41;DIRECTED DIFFUSION ; DIRECTED DIFFUSION ; DIRECTED DIFFUSION ;Directed Diffusion; DIRECTED DIFFUSION ;INTERESTS;DIRECTED DIFFUSION ;GRADIENT;DIRECTED DIFFUSION ;Directed Diffusion;Directed Diffusion vs SPIN;Directed DiffusionAdvantages and Disadvantages;Qualitative Evaluation ;Qualitative Evaluation ;Network layer ;Hierarchical;LEACH;LEACH;LEACH ; LEACH ;Dynamic Clusters;LEACH ;LEACH ;LEACH;LEACH;Hierarchical;PEGASIS;PEGASIS;;Qualitative Evaluation ;Hierarchical;TEEN and APTEEN ;TEEN and APTEEN ;TEEN and APTEEN ;Hierarchical (Qualitative Evaluation);Hierarchical (Qualitative Evaluation);Network layer ;Location based;MECN and SMECN ;Network graph G′: each vertex represents a node and the edges connect two nodes that can communicate with each other. ;;MECN;Location based;Geographical Forwarding Schemes for Lossy Links ;Greedy forwarding ;Node A selects the feasible node that is closest to the destination. There exists several metrics that define the closest node to the destination ;Distance-Based Blacklisting ;Reception-Based Blacklisting ;Best PRR × distance ;Location based;PRADA ;Quali