Effective Data Transmission and Control Based on Social Communication in Social Opportunistic Complex Networks

Algorithm 1

GreedyA.

	Input: network size, source node, node position, maximum transmission distance, signal transmission power, SIC-specific threshold, noise power, signal attenuation index;
	Output: transmission time slice and broadcast delay of all nodes;
	Begin
	Let breadth first search tree T; //creating a breadth first search tree with the source node as the root node T
	; //dividing all nodes into different layers, including ;
	;//represents the height of the breadth first search tree;
	Broadcast tree ; //according to the rule that the node with the largest number of covered nodes takes precedence as the parent node, construct the broadcast tree layer by layer starting from the top layer ;
	; //scheduling time slice
	; //the set of nodes that have scheduled transmission time slices
	FOR to DO
	FOR to length () DO
	Take out the node in ;
	IF the set of child node of node is not an empty set THEN
	;
	WHILE exist signal interference between nodes and DO
	;
	END
	The transmission time slice of the scheduling node is ;
	END
	END
	END
	Broadcast delay;
	RETURN transmission time slice and broadcast delay of all nodes