Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Anycast routing is very useful for many applications such as resource discovery in Delay Tolerant Networks (DTNs). , based on a new DTN model,  first analyze the any- cast semantics for DTNs. Then  present a novel metric named EMDDA (Expected Multi-Destination Delay for Anycast) and a corresponding routing algorithm for anycast routing in DTNs. Extensive simulation results show that the proposed EMDDA routing scheme can effectively improve the efficiency of anycast routing in DTNs. It outperforms another algorithm, Minimum Expected Delay (MED) algorithm, by 11.3% on average in term of routing delays and by 19.2% in term of average max queue length. I. INTRODUCTION Thus efficient anycast service is important for supporting these applications in DTNs. Though anycast in the Internet and mobile ad hoc net- works has been studied extensively in the past, due to the unpredictability of network connectivity and delay, and limited storage capacity, anycast in DTNs is a quite unique and challenging problem. It requires both re-definition of anycast semantics and new routing algorithms. Moreover, in unicast in DTNs, the destination of a message is determined when it is generated, while in anycast, the destination can be any one of a group of nodes and during routing, both the path to a group member and the destination can change dynamically according to current mobile device movement situation. ,  define three semantics models of anycast in DTNs, namely CM (Current Membership), TIM (Temporal Interval Membership) and TPM (Temporal Point Membership Model), which unambiguously define the intended receivers of a message in the anycast routing. Based on the model,  also propose a novel routing metric named EMDDA (Ex- pected Multi-Destination Delay for Anycast) which utilizes the uncontrolled random moving characteristic of mobile devices.  use a probabilistic approach that characterizes the practical average delay more accurately and develop a corresponding algorithm. The performance of the algorithm is analyzed and compared by simulation which demonstrates the effectiveness and efficiency of the proposed metric. Our simulations show that the EMDDA routing scheme can effectively improve the efficiency of anycast routing in DTNs. It achieves 11.3% lor average routing delays and 19.2% lor average max queue length compared to another algorithm, Minimum Expected Delay (MED)(2).
['Yili Gong', 'Yongqiang Xiong', 'Qian Zhang', 'Zhensheng Zhang', 'Wenjie Wang', 'Zhiwei Xu']
I am writing a research paper on a idea Anycast Routing in Delay Tolerant Networks
[{"from": "human", "value": "I am writing a research paper on a idea Anycast Routing in Delay 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: Anycast routing is very useful for many applications such as resource discovery in Delay Tolerant Networks (DTNs). , based on a new DTN model,  first analyze the any- cast semantics for DTNs. Then  present a novel metric named EMDDA (Expected Multi-Destination Delay for Anycast) and a corresponding routing algorithm for anycast routing in DTNs. Extensive simulation results show that the proposed EMDDA routing scheme can effectively improve the efficiency of anycast routing in DTNs. It outperforms another algorithm, Minimum Expected Delay (MED) algorithm, by 11.3% on average in term of routing delays and by 19.2% in term of average max queue length. I. INTRODUCTION Thus efficient anycast service is important for supporting these applications in DTNs. Though anycast in the Internet and mobile ad hoc net- works has been studied extensively in the past, due to the unpredictability of network connectivity and delay, and limited storage capacity, anycast in DTNs is a quite unique and challenging problem. It requires both re-definition of anycast semantics and new routing algorithms. Moreover, in unicast in DTNs, the destination of a message is determined when it is generated, while in anycast, the destination can be any one of a group of nodes and during routing, both the path to a group member and the destination can change dynamically according to current mobile device movement situation. ,  define three semantics models of anycast in DTNs, namely CM (Current Membership), TIM (Temporal Interval Membership) and TPM (Temporal Point Membership Model), which unambiguously define the intended receivers of a message in the anycast routing. Based on the model,  also propose a novel routing metric named EMDDA (Ex- pected Multi-Destination Delay for Anycast) which utilizes the uncontrolled random moving characteristic of mobile devices.  use a probabilistic approach that characterizes the practical average delay more accurately and develop a corresponding algorithm. The performance of the algorithm is analyzed and compared by simulation which demonstrates the effectiveness and efficiency of the proposed metric. Our simulations show that the EMDDA routing scheme can effectively improve the efficiency of anycast routing in DTNs. It achieves 11.3% lor average routing delays and 19.2% lor average max queue length compared to another algorithm, Minimum Expected Delay (MED)(2)."}]