The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - Jan. (2013 vol.62)
pp: 83-97
Ze Li , Dept. of Electr. & Comput. Eng., Clemson Univ., Clemson, SC, USA
Haiying Shen , Dept. of Electr. & Comput. Eng., Clemson Univ., Clemson, SC, USA
ABSTRACT
This work focuses on Delay Tolerant Networks (DTNs) in a social network environment. DTNs do not have a complete path from a source to a destination most of the time. Previous data routing approaches in DTNs are primarily based on either flooding or single-copy routing. However, these methods incur either high overhead due to excessive transmissions or long delays due to suboptimal choices for relay nodes. Probabilistic forwarding that forwards a message to a node with a higher delivery utility enhances single-copy routing. However, current probabilistic forwarding methods only consider node contact frequency in calculating the utility while neglecting the influence of contact duration on the throughput, though both contact frequency and contact duration reflect the node movement pattern in a social network. In this paper, we theoretically prove that considering both factors leads to higher throughput than considering only contact frequency. To fully exploit a social network for high throughput and low routing delay, we propose a Social network oriented and duration utility-based distributed multicopy routing protocol (SEDUM) for DTNs. SEDUM is distinguished by three features. First, it considers both contact frequency and duration in node movement patterns of social networks. Second, it uses multicopy routing and can discover the minimum number of copies of a message to achieve a desired routing delay. Third, it has an effective buffer management mechanism to increase throughput and decrease routing delay. Theoretical analysis and simulation results show that SEDUM provides high throughput and low routing delay compared to existing routing approaches. The results conform to our expectation that considering both contact frequency and duration for delivery utility in routing can achieve higher throughput than considering only contact frequency, especially in a highly dynamic environment with large routing messages.
INDEX TERMS
telecommunication network management, buffer storage, delay tolerant networks, probability, routing protocols,buffer management mechanism, SEDUM, utility-based distributed routing, delay tolerant networks, social network environment, data routing approaches, single-copy routing, probabilistic forwarding methods, contact frequency, low routing delay, utility-based distributed multicopy routing protocol, node movement patterns, routing delay,Social network services, Delay tolerant networks,epidemic routing, Delay tolerant networks, social networks, utility-based routing, probabilistic routing
CITATION
Ze Li, Haiying Shen, "SEDUM: Exploiting Social Networks in Utility--Based Distributed Routing for DTNs", IEEE Transactions on Computers, vol.62, no. 1, pp. 83-97, Jan. 2013, doi:10.1109/TC.2011.232
REFERENCES
[1] H. Wu, R. Fujimoto, R. Guensler, and M. Hunter, “MDDV: Mobility-Centric Data Dissemination Algorithm for Vehicular Networks,” Proc. First ACM Int'l Workshop Vehicular Ad Hoc Networks (VANET '04), 2004.
[2] P. Juang, H. Oki, M. Martonosi, Y. Wang, L.S. Peh, and D. Rubenstein, “Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs,and Early Experiences with Zebranet,” Proc. 10th Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2002.
[3] S. Jain, K. Fall, and R. Patra, “Routing in a Delay Tolerant Network,” Proc. SIGCOMM, 2004.
[4] S. Burleigh, A. Hooke, L. Torgerson, K. Fall, B. Durst, V. Cerf, and K. Scott, “Delay-Tolerant Networking: An Approach to Interplantary Internet,” IEEE Comm. Magzine, vol. 41, no. 6, pp. 128-136, June 2003.
[5] J. Partan, J. Kurose, and B.N. Levine, “A Survey of Practical Issues in Underwater Networks,” Proc. First ACM Int'l Workshop Underwater Networks (WUWNet '06), 2006.
[6] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, “Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks,” Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN '05), 2005.
[7] A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” Technical Report CS-200006, Duke Univ., 2000.
[8] Y. Wang et al., “Erasure-Coding Based Routing for Opportunistic Networks,” Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN '05), 2005.
[9] T. Spyropoulos, K. Psounis, and C. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case,” ACM/IEEE Trans. Networking, vol. 16, no. 1, pp. 63-76, Feb. 2007.
[10] A. Lindgren, A. Doria, and O. Schelen, “Probabilistic Routing in Intermittently Connected Networks,” ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 7, no. 3, pp. 19-20, 2003.
[11] P. Costa, C. Mascolo, M. Musolesi, and G.P. Picco, “Socially-Aware Routing for Publish-Subscribe in Delay-Tolerant Mobile Ad Hoc Networks,” IEEE J. Selected Areas Comm., vol. 26, no. 5, pp. 748-760, June 2008.
[12] J. Burgess, B. Gallagher, D. Jensen, and B. Levine, “Maxprop: Routing for Vehicle-Based Disruption-Tolerant Networks,” Proc. IEEE INFOCOM, 2006.
[13] M. Musolesi, S. Hailes, and C. Mascolo, “Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks,” Proc. IEEE Sixth Int'l Symp. World of Wireless Mobile and Multimedia Networks (WOWMOM '05), 2005.
[14] E. Paulos and E. Goodman, “The Familiar Stranger: Anxiety Comfort, and Play in Public Places,” Proc. SIGCHI Conf. Human Factors in Computing Systems (CHI '04), 2004.
[15] P. Hui and J. Crowcroft, “How Small Labels Create Big Improvements,” Proc. PERCOMW, 2007.
[16] F. Li and J. Wu, “MOPS: Providing Content-Based Service in Disruption-Tolerant Networks,” Proc. Int'l Conf. Distributed Computing Systems, 2009.
[17] J. Ghosh, S.J. Philip, and C. Qiao, “Sociological Orbit Aware Location Approximation and Routing (SOLAR) in MANET,” Ad Hoc Networks, vol. 5, pp. 189-209, Mar. 2007.
[18] P. Costa, C. Mascolo, M. Musolesi, and G.P. Picco, “Socially-Aware Routing for Publish-Subscribe in Delay-Tolerant Mobile Ad Hoc Networks,” IEEE J. Selected Areas Comm., vol. 26, no. 5, pp. 748-760, June 2008.
[19] E.M. Daly and M. Haahr, “Social Network Analysis for Routing in Disconnected Delay-Tolerant Manets,” Proc. MobiHoc, 2007.
[20] P. Hui, J. Crowcroft, and E. Yoneki, “Bubble Rap: Social-Based Forwarding in Delay Tolerant Networks,” IEEE Trans. Mobile Computing, vol. 10, no. 11, pp. 1576-1589, Nov. 2010.
[21] W. Gao, Q. Li, B. Zhao, and G. Cao, “Multicasting in Delay Tolerant Networks: A Social Network Perspective,” Proc. MobiHoc, 2009.
[22] V. Conan, J. Leguay, and T. Friedman, “Fixed Point Opportunistic Routing in Delay Tolerant Networks,” IEEE J. Selected Areas Comm., vol. 26, no. 5, pp. 773-782, June 2008.
[23] S. Chen, J. Zhang, and Q. Gao, “An Efficient Hybrid Routing Based on Contact History in DTN,” Proc. Seventh Int'l Conf. Wireless and Optical Comm. Networks (WOCN), 2010.
[24] X. Zhang, G. Neglia, J. Kurose, and D. Towsley, “Performance Modeling of Epidemic Routing,” Proc. IFIP, 2006.
[25] T. Small and Z. Haas, “Resource and Performence Tradeoffs in Delay-Tolerant Wireless Networks,” Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN '05), 2005.
[26] J. Widmer and J.Y.L. Boudec, “Network Coding for Efficient Communication in Extreme Networks,” Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN '05), 2005.
[27] Y. Wang and H. Wu, “A New Paradigm for Pervasive Information Gathering,” IEEE Trans. Mobile Computing, vol. 6, no. 9, pp. 1021-1034, Sept. 2007.
[28] H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, “Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages,” Proc. MobiHoc, 2003.
[29] S.S. Haykin, Kalman Filtering and Neural Networks. Wiley-Interscience, 2001.
[30] B.N. Levine, A. Balasubrama, and A. Venkataramani, “DTN Routing as a Resource Allocation Problem,” Proc. SIGCOMM, 2007.
[31] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, “Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms,” Proc. IEEE INFOCOM, 2006.
[32] L.B. Koralov and Y.G. Sinai, “Theory of Probability and Random Processes,” Springer-Verlag Berlin Heidelberg, 2007.
[33] N. Bansal and Z. Liu, “Capacity Delay and Mobility in Wireless Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2003.
[34] K. Lee, S. Hong, S.J. Kim, I. Rhee, and S. Chong, “Slaw: A Mobility Model for Human Walks,” Proc. IEEE INFOCOM, 2009.
[35] A. Jardosh, E.M. Belding, K.C. Almeroth, and S. Suri, “Towards Realistic Mobility Models for Mobile Ad Hoc Networks,” Proc. MobiCom, 2003.
[36] B. Pasztor, M. Musolesi, and C. Mascolo, “Opportunistic Mobile Sensor Data Collection with Scar,” Proc. IEEE Int'l Conf. Mobile Adhoc and Sensor Systems (MASS), 2007.
[37] T.H. Cormen, Introduction to Algorithms. The MIT Press, 2001.
[38] A. Balasubrama, B. Levine, and A. Venkataramani, “DTN Routing as a Resource Allocation Problem,” Proc. SIGCOMM, 2007.
[39] M.J. Neely and E. Modiano, “Improving Delay in Ad-Hoc Mobile Networks via Redundant Packet Transfers,” Proc. Conf. Information Sciences and Systems (CISS), 2003.
[40] A. Keranen, J. Ott, and T. Karkkainen, “The One Simulator for DTN Protocol Evaluation,” Proc. Second Int'l Conf. Simulation Tools and Techniques (SIMUTools '09), 2009.
[41] Orbit, geni, http://groups.geni.net/geni/wikiORBIT, 2011.
[42] Z. Li and H. Shen, “Utility-Based Distributed Routing in Intermittently Connected Networks,” Proc. 37th Int'l Conf. Parallel Processing (ICPP '08), 2008.
504 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool