Pocket switched networks (PSNs) take advantage of @entity1 mobility to deliver data. Investigations on real-world trace data indicate that @entity1 mobility shows an obvious spatial regularity: a @entity1 being usually visits a few places at high frequencies. These most frequently visited places form the home of a node, which is exploited in this paper to design two @entity1297 ( @entity1297 ) algorithms. Both algorithms input single data copy into the network at any time. In the basic @entity1297 , only the first node encountered by the source and whose home overlaps a destination's home is selected as a relay while the enhanced @entity1297 keeps finding more optimal relay that visits the destination's home with higher probability. The two proposed algorithms only require the relays to exchange the information of their home and/or the visiting frequencies to their home when two nodes meet. As a result, the information update is reduced and there is no global status information that needs to be maintained. This causes light loads on relays because of the low communication cost and storage requirements. Additionally, only simple operations are needed in the two proposed algorithms, resulting in little computation overhead at relays. At last, a theoretical analysis is performed on some key metrics and then the real-world based simulations indicate that the two @entity1297 algorithms are efficient and effective through employing only one or a few relays.

Wireless Relay Selection in Pocket Switched Networks Based on Spatial Regularity of XXXX Mobility.

@entity1 :: ('9606', 'Species') :: ['human'] @entity1297 :: ('MESH:D019292', 'Disease') :: ['HomE based Relay selectiOn', 'HERO']
@entity1 :: (9606,Species) :: ['Human']
