An Algorithm for Dexterous Scanning Neighbour Devices in Opportunistic Mobile Social Networks

In personal mobile devices, information is exchanged between the devices by encountering each other. While, frequent scanning for opportunistic encounters would soon drain the battery on existing devices. We propose a new hybrid algorithm  for neighbour discovery called the Amalgam algorithm a combination approach of STAR and PISTONSv2 algorithms. STAR is based on contact probe time, which dynamically selects the probing interval using both the short-term contact history and also  the long-term history based on time. PISTONv2 is based on inter probe time calculation, which enables mobile devices dynamically alter the rate when searching for other devices, thus creating a fully decentralized autonomous network and also save energy. By combined approach of STAR and PISTONv2 called Amalgam algorithm which saves  power consumptions of a battery and detect more encounters as compared to individual approach of STAR and PISTONv2 algorithm.