A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy

Table 1

The parameter of simulation scenario.

Category	Parameter (unit)	Values
Scenario settings	Simulation time (s)	43200
	Simulation region (m)
Group characteristics	Group movement model	Shortest path map-based movement
	Buffer size (MB)	5
	Wait time (s)	0~120
	Speed (m/s)	0.5~1.5
	msgTtl (m)	300
Message characteristics	Events.nrof	1
	Events1.class	MessageEventGenerator
	Events1.interval	25~35
	Events1.size (kB)	500~1000
	Events1.hosts	0~29