Title :
A graph split on greedy-algorithm-based Self organization protocols
Author :
Hu Yin ; Yunfei Lv
Author_Institution :
Wuhan Second Ship Design Inst., Wuhan, China
Abstract :
Recently, Self organization protocol has gained great focus from the research area for its efficient to save energy on wireless sensors network. We use a random graph model to compare some of the proposed self organization protocols in this thesis. Results show the impact of the surface on the percentage of the active set Thus, we focus on the graph splitting and the impact for the active set and the topology connectivity. Finally, we analyze the performance resulting for transmitted and received packets.
Keywords :
graph theory; greedy algorithms; protocols; wireless sensor networks; active set; energy saving; graph splitting; greedy algorithm; random graph model; received packets; self-organization protocol; topology connectivity; transmitted packets; wireless sensor networks; Decision support systems; Graph split; greedy algorithm; self organization protocol; wireless sensors network;
Conference_Titel :
Information Security and Intelligence Control (ISIC), 2012 International Conference on
Conference_Location :
Yunlin
Print_ISBN :
978-1-4673-2587-5
DOI :
10.1109/ISIC.2012.6449715
