A graph split on greedy-algorithm-based Self organization protocols

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.