Novel Resource Allocation Algorithms for the Social Internet of Things Based Fog Computing Paradigm

Table 1

Symbols and parameters used in the proposed algorithm.

Notations	Explanation
	the set of mobile devices
	the set of the social ties
	a real-valued number to measure the strength of the social tie between and
	the set of the social friendsof
	the social power function of ,
	a parameter to control the speed of social power saturation
	the maximum outcome of a user to normalize the social power
	the fog-computing based access point
	the set of corresponding mobile devices in the ’s covering area
	The two-phase game in
	the social power and the voting power of
	the set of application tasks, which are offloaded in the for FC services
	the ratio of relative service weights given to different type applications in the
	the utility function of
	a finite set of voting game players
	the coalition S’s maximal gain
	the gain that can achieve when is the opposite coalition
	the set of all bicooperative games with players
	the player ’s value in a game on
	the identity game
	the superior unanimity game
	the inferior unanimity game
	the payoff of voter
	the sum of voting weights of coalition ’s players
	the quota for the decision-taking
	the quota for the decision-blocking
	a weighted ternary voting game
	the total available bandwidth amount
	the pre-defined minimum bandwidth amount for the service
	the bandwidth request of mobile device
	the decided bandwidth amount for the
,	the constraint thresholds, which are chosen to satisfy each condition
	the preference ratio of class I application services
	each F-AP’s total computation capacity
,	control parameters to adjust the payoff of
	the total computation capacity of