An Efficient Privacy Preservation Scheme in an Opportunistic Network

A facilitating technology with the absence of infrastructure and fixed topologies is known as opportunistic networks. The range of communication devices receive relay messages from portable devices like trackers and integrated mobile networks. It is one of the challenges to discover the best path in these networks while also preserving privacy of the communicating devices in this network. In this study, a unique routing algorithm is proposed based on clustering to address this problem, which lower the whole message traffic and enhanced network efficiency. In order to comply with privacy requirements, network nodes potentially identifying data is also removed through cloaking. Comparing proposed method to Epidemic routing, First Contact routing algorithm, effectiveness and privacy of proposed routing framework in opportunistic networks in one simulation environment is assessed. The proposed algorithm has given better improved message delivery probability as compared to Epidemic, first contact and ProPHET routing algorithms.