A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Community Detection Using Maximum Connection Probability in Opportunistic Network
2013
2013 4th International Conference on Intelligent Systems, Modelling and Simulation
A novel approach is proposed in this paper to detect community structure in opportunistic networks. Different from the existing solutions, this approach uses Maximum Connection Probability (MCP) instead of encounter probability. This approach is established in two phases. Firstly, an algorithm is proposed to derive the MCP of any node to other nodes. Secondly, the community structure derived from the MCP is identified using a divisive algorithm. Simulation is conducted based on walking day
doi:10.1109/isms.2013.68
fatcat:7a5oh2ije5hrlmwmxqm4d7nhne