Routing in Disruption-Tolerant Networks Based on Mobility History and Contact Time Prediction
- 1Anna University Chennai, Krishnasamy College of Engineering and Technology, Cuddalore, IN
- 2Anna University Chennai, Krishnasamy College of Engineering and Technology, Cuddalore, IN
In Disruption-Tolerant Networks, routing is one of the most challenging and open problem, because the wireless links are short-lived. The connection between the nodes in the network changes over time and the nodes do not move completely at random. Instead they move around a set of well-visited locations. The routing is done based on the prediction of future contacts by using the node’s mobility history. The node’s mobility is estimated based on the history of observations. The existing DTN routing methods predict whether two nodes would encounter each other, without considering when the contact occurs. In the proposed Predict and Relay method, the routing is done based on the prediction of contact times, which focus on the time-based mobility prediction. The Time-Homogeneous Semi-Markov model is used to predict the node’s future contacts and the time of contact. After predicting the mobility, the relay node is selected that has the highest probability of delivery to the destination. Packets are forwarded hop-by-hop in the succession of contacts. The simulation result shows that this approach improves the delivery ratio and also reduces the energy required to predict the node’s mobility and the delivery latency.
Conclusion
This paper proposes the Predict and Relay scheme, an efficient routing scheme in DTNs. Time-homogeneous semi-Markov process model is used to predict the future contacts of two specified nodes at a specified time. With this model, a node can select a proper neighbor as the next hop to forward the message. The Simulation result shows that this approach raises the delivery ratio, as well as reduces the energy required to predict the node’s mobility and the delivery latency.
References
[1]“Sensor Networking with Delay Tolerance(SeNDT),”http://down.dsg.cs.tcd.ie/sendt/, 2011.
[2] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, Aug. 2002.
[3] A. Balasubramanian, B.N. Levine, and A. Venkataramani, “DTN Routing as a Resource Allocation Problem,” Proc. SIGCOMM, 2007.
[4] N. Banerjee, M. Corner, and B. Levine, “An Energy-Efficient Architecture for DTN Throwboxes,” Proc. IEEE INFOCOM,2007.
[5] J. Burgess, B. Gallagher, D. Jensen, and B.N. Levine, “Maxprop: Routing for Vehicle-Based Disruption-Tolerant Networks,” Proc. IEEE INFOCOM, 2006.
[6] I. Cardei, C. Liu, J. Wu, and Q. Yuan, “DTN Routing with Probabilistic Trajectory Prediction,” Proc. Int’l Conf. Wireless Algorithms, Systems and Applications (WASA ’08), 2008.
[7] H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, “Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages,” Proc. Fourth ACM Int’l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc ’03), 2003.
[8] K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” Proc. SIGCOMM, 2003.
[9] P. Hui, J. Crowcroft, and E. Yoneki, “Bubble Rap: Social Based Forwarding in Delay Tolerant Networks,” Proc. Ninth ACM Int’l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc ’08),2008.
[10] R. Shah, S. Jain, S. Roy, and W. Brunette, “Data Mules: Modeling a Three-Tier Architecture for Sparse Sensor Networks,” Technical Report IRS-TR-03-001, Intel Research Seattle, 2003.
[11] A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” Technical Report CS-200006, Duke Univ., 2000.
[12] J. Wu, M. Lu, and F. Li, “Utility-Based Opportunistic Routing in Multi-Hop Wireless Networks,” Proc. 28th Int’l Conf. Distributed Computing Systems (ICDCS ’08), 2008.
Keywords: Disruption-Tolerant Network, routing, prediction, mobility history
Citation: Vargelin Reeni*,Jayapratha,Vargelin Reeni,Jayapratha ( 2013), Routing in Disruption-Tolerant Networks Based on Mobility History and Contact Time Prediction. , 1(2): 1-3
Received: 01/06/2024; Accepted: 01/06/2024;
Published: 01/06/2024
Edited by:
Mr.ERES JOURNALSReviewed by:
Copyright: @ERES Publications.
*Correspondence: Vargelin Reeni, vargelin.varghees@gmail.com
