The Community for Technology Leaders
RSS Icon
Issue No.05 - May (2009 vol.8)
pp: 606-621
Elizabeth M. Daly , Distributed Systems Group, Trinity College Dublin, Dublin
Mads Haahr , Distributed Systems Group, Trinity College Dublin, Dublin
Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely (if ever) connected. A key challenge is to find a route that can provide good delivery performance and low end-to-end delay in a disconnected network graph where nodes may move freely. We cast this challenge as an information flow problem in a social network. This paper presents social network analysis metrics that may be used to support a novel and practical forwarding solution to provide efficient message delivery in disconnected delay-tolerant MANETs. These metrics are based on social analysis of a node's past interactions and consists of three locally evaluated components: a node's "betweenness" centrality (calculated using ego networks) and a node's social 'similarity' to the destination node and a node's tie strength relationship with the destination node. We present simulations using three real trace data sets to demonstrate that by combining these metrics delivery performance may be achieved close to Epidemic Routing but with significantly reduced overhead. Additionally, we show improved performance when compared to PRoPHET Routing.
Store and forward networks, Wireless communication
Elizabeth M. Daly, Mads Haahr, "Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs", IEEE Transactions on Mobile Computing, vol.8, no. 5, pp. 606-621, May 2009, doi:10.1109/TMC.2008.161
[1] L.A. Adamic and E. Adar, “Friends and Neighbors on the Web,” Social Networks, vol. 25, no. 3, pp. 211-230, July 2003.
[2] A. Beaufour, M. Leopold, and P. Bonnet, “Smart-Tag Based Data Dissemination,” Proc. First ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA '02), pp. 68-77, Sept. 2002.
[3] M. Benassi, A. Greve, and J. Harkola, “Looking for a Network Organization: The Case of GESTO,” J. Market-Focused Management, vol. 4, no. 3, pp. 205-229, Oct. 1999.
[4] P. Blumstein and P. Kollock, “Personal Relationships,” Ann. Rev. Sociology, vol. 14, pp. 467-490, 1988.
[5] S.P. Borgatti, “Centrality and Network Flow,” Social Networks, vol. 27, no. 1, pp. 55-71, Jan. 2005.
[6] J.J. Brown and P.H. Reingen, “Social Ties and Word-of-Mouth Referral Behavior,” The J. Consumer Research, vol. 14, no. 3, pp. 350-362, Dec. 1987.
[7] J. Burgess, B. Gallagher, D. Jensen, and B.N. Levine, “Maxprop: Routing for Vehicle-Based Disruption-Tolerant Networking,” Proc. IEEE INFOCOM, Mar. 2006.
[8] 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.
[9] S. Corson and J. Macker, Mobile Ad Hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations, IETF RFC 2501, Jan. 1999.
[10] E.M. Daly and M. Haahr, “Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs,” Proc. ACM MobiHoc, Sept. 2007.
[11] H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, “Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages,” Proc. ACM MobiHoc, pp. 257-266, 2003.
[12] M. Everett and S.P. Borgatti, “Ego Network Betweenness,” Social Networks, vol. 27, no. 1, pp. 31-38, Jan. 2005.
[13] L.C. Freeman, “A Set of Measures of Centrality Based on Betweenness,” Sociometry, vol. 40, no. 1, pp. 35-41, Mar. 1977.
[14] L.C. Freeman, “Centrality in Social Networks Conceptual Clarification,” Social Networks, vol. 1, no. 3, pp. 215-239, 1978-1979.
[15] R.H. Frenkiel, B.R. Badrinath, J. Borres, and R.D. Yates, “The Infostations Challenge: Balancing Cost and Ubiquity in Delivering Wireless Data,” IEEE Personal Comm., vol. 7, no. 2, pp. 66-71, 2000.
[16] J. Ghosh, H.Q. Ngo, and C. Qiao, “Mobility Profile Based Routing within Intermittently Connected Mobile Ad Hoc Networks (ICMAN),” Proc. Int'l Conf. Wireless Comm. and Mobile Computing (IWCMC '06), pp. 551-556, 2006.
[17] N. Glance, D. Snowdon, and J.-L. Meunier, “Pollen: Using People as a Communication Medium,” Computer Networks, vol. 35, no. 4, pp. 429-442, Mar. 2001.
[18] M.S. Granovetter, “The Strength of Weak Ties,” The Am. J. Sociology, vol. 78, no. 6, pp. 1360-1380, May 1973.
[19] E.L. Gray, “A Trust-Based Reputation Management System,” PhD thesis, Apr. 2006.
[20] M. Grossglauser and M. Vetterli, “Locating Nodes with Ease: Last Encounter Routing in Ad Hoc Networks through Mobility Diffusion,” Proc. IEEE INFOCOM, vol. 3, pp. 1954-1964, 2003.
[21] R. Handorean, C. Gill, and G.-C. Roman, “Accommodating Transient Connectivity in Ad Hoc and Mobile Settings,” Proc. Second Int'l Conf. Pervasive Computing (PERVASIVE '04), A.Ferscha and F. Mattern, eds., pp. 305-322, Mar. 2004.
[22] W. Hsu and A. Helmy, “On Nodal Encounter Patterns in Wireless LAN Traces,” Proc. Fourth Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt '06), pp. 1-10, Apr. 2006.
[23] W.-J. Hsu and A. Helmy, ”Impact: Investigation of Mobile-User Patterns across University Campuses Using WLAN Trace Analysis,“ Proc. IEEE INFOCOM, Aug. 2005.
[24] P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot, “Pocket Switched Networks and Human Mobility in Conference Environments,” Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN '05), pp. 244-251, Aug. 2005.
[25] P. Hui and J. Crowcroft, “How Small Labels Create Big Improvements,” Proc. Fifth Ann. IEEE Int'l Conf. Pervasive Computing and Comm. Workshops (PerCom Workshops '07), pp. 65-70, 2007.
[26] S. Jain, K. Fall, and R. Patra, “Routing in a Delay Tolerant Network,” SIGCOMM Computer Comm. Rev., vol. 34, no. 4, pp.145-158, Oct. 2004.
[27] D.B. Johnson and D.A. Maltz, Dynamic Source Routing in Ad-Hoc Wireless Networks, vol. 353, pp.153-181. Kluwer Academic Publishers, 1996.
[28] A. Khelil, P.J. Marron, and K. Rothermel, “Contact-Based Mobility Metrics for Delay-Tolerant Ad Hoc Networking,” Proc. 13th IEEE Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecomm. Systems (MASCOTS '05) pp. 435-444, 2005.
[29] Y.-B. Ko and N.H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks,” Wireless Networks, vol. 6, no. 4, pp.307-321, Sept. 2000.
[30] J. Lebrun, C.-N. Chuah, D. Ghosal, and M. Zhang, “Knowledge-Based Opportunistic Forwarding in Vehicular Wireless Ad Hoc Networks,” Proc. IEEE 61st Conf. Vehicular Technology (VTC-Spring '05), vol. 4, pp. 2289-2293, May 2005.
[31] J. Leguay, T. Friedman, and V. Conan, “Evaluating Mobility Pattern Space Routing for DTNs,” Proc. IEEE INFOCOM, Apr. 2006.
[32] Q. Li and D. Rus, “Sending Messages to Mobile Users in Disconnected Ad-Hoc Wireless Networks,” Proc. ACM MobiCom, pp. 44-55, Aug. 2000.
[33] D. Liben-Nowell and J. Kleinberg, “The Link Prediction Problem for Social Networks,” Proc. 12th Int'l Conf. Information and Knowledge Management (CIKM '03), pp. 556-559, Nov. 2003.
[34] N. Lin, P. Dayton, and P. Reenwald, “Analyzing the Instrumental Use of Relations in the Context of Social Structure,” Sociological Methods and Research, vol. 7, no. 2, pp. 149-166, 1978.
[35] N. Lin, J.C. Vaughn, and W.M. Ensel, “Social Resources and Occupational Status Attainment,” Social Forces, vol. 59, no. 4, pp.1163-1181, June 1981.
[36] A. Lindgren, A. Doria, and O. Schelén, “Probabilistic Routing in Intermittently Connected Networks,” Proc. First Int'l Workshop Service Assurance with Partial and Intermittent Resources (SAPIR '04), pp. 239-254, Aug. 2004.
[37] P.V. Marsden, “Egocentric and Sociocentric Measures of Network Centrality,” Social Networks, vol. 24, no. 4, pp. 407-422, Oct. 2002.
[38] P.V. Marsden and K.E. Campbell, “Measuring Tie Strength,” Social Forces, vol. 63, no. 2, pp. 482-501, Dec. 1984.
[39] S. Merugu, M. Ammar, and E. Zegura, “Routing in Space and Time in Networks with Predictable Mobility,” technical report, July 2004.
[40] S. Milgram, “The Small World Problem,” Psychology Today, vol. 2, pp. 60-67, May 1967.
[41] M. Musolesi, S. Hailes, and C. Mascolo, “Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks,” Proc. Sixth IEEE Int'l Symp. World of Wireless Mobile and Multimedia Networks (WOWMOM '05), pp. 183-189, 2005.
[42] M.E.J. Newman, “Clustering and Preferential Attachment in Growing Networks,” Physical Rev. E, vol. 64, no. 2, July 2001.
[43] M.E.J. Newman, “A Measure of Betweenness Centrality Based on Random Walks,” Social Networks, vol. 27, no. 1, pp. 39-54, Jan. 2005.
[44] S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM MobiCom, pp. 151-162, Aug. 1999.
[45] C.E. Perkins and E.M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications (WMCSA '99), pp. 90-100, Feb. 1999.
[46] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM, vol. 24, pp. 234-244, Oct. 1994.
[47] R.C. Shah, S. Roy, S. Jain, and W. Brunette, “Data Mules: Modeling a Three-Tier Architecture for Sparse Sensor Networks,” Proc. First IEEE Int'l Workshop Sensor Network Protocols and Applications (SNPA '03), pp. 30-41, May 2003.
[48] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, “Single-Copy Routing in Intermittently Connected Mobile Networks,” Proc. First Ann. IEEE Comm. Soc. Conf. Sensor and Ad Hoc Comm. and Networks (SECON '04), pp. 235-244, Oct. 2004.
[49] 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), pp. 252-259, Aug. 2005.
[50] K. Tan, Q. Zhang, and W. Zhu, “Shortest Path Routing in Partially Connected Ad Hoc Networks,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '03), vol. 2, pp. 1038-1042, Dec. 2003.
[51] A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” technical report, Apr. 2000.
[52] D.J. Watts and S.H. Strogatz, “Collective Dynamics of “Small-World” Networks,” Nature, vol. 393, no. 6684, pp. 440-442, June 1998.
[53] G. Yan, T. Zhou, B. Hu, Z.Q. Fu, and B.H. Wang, “Efficient Routing on Complex Networks,” Physical Rev. E (Statistical, Nonlinear, and Soft Matter Physics), vol. 73, no. 4, Apr. 2006.
[54] W. Zhao, M. Ammar, and E. Zegura, “A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 187-198, May 2004.
37 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool