Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Data dissemination is useful for many applications of Disruption Tolerant Networks (DTNs). Current data dissemination schemes are generally network-centric ignoring user interests. ,  propose a novel approach for user-centric data dissemination in DTNs, which considers satisfying user interests and maximizes the cost-effectiveness of data dissemination. Our approach is based on a social centrality metric, which considers the social contact patterns and interests of mobile users simultaneously, and thus ensures effective relay selection. The performance of our approach is evaluated from both theoretical and experimental perspectives. By formal analysis,  show the lor bound on the cost-effectiveness of data dissemination, and analytically investigate the tradeoff beten the effectiveness of relay selection and the overhead of maintaining network information. By trace-driven simulations,  show that our approach achieves better cost-effectiveness than existing data dissemination schemes.
['Wei Gao', 'Guohong Cao']
I am writing a research paper on a idea User-centric data dissemination in disruption tolerant networks
[{"from": "human", "value": "I am writing a research paper on a idea User-centric data dissemination in disruption tolerant networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Data dissemination is useful for many applications of Disruption Tolerant Networks (DTNs). Current data dissemination schemes are generally network-centric ignoring user interests. ,  propose a novel approach for user-centric data dissemination in DTNs, which considers satisfying user interests and maximizes the cost-effectiveness of data dissemination. Our approach is based on a social centrality metric, which considers the social contact patterns and interests of mobile users simultaneously, and thus ensures effective relay selection. The performance of our approach is evaluated from both theoretical and experimental perspectives. By formal analysis,  show the lor bound on the cost-effectiveness of data dissemination, and analytically investigate the tradeoff beten the effectiveness of relay selection and the overhead of maintaining network information. By trace-driven simulations,  show that our approach achieves better cost-effectiveness than existing data dissemination schemes."}]