The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (2009 vol.8)
pp: 1397-1411
Chao Chen , Indiana University - Purdue University Fort Wayne, Fort Wayne
Zesheng Chen , Florida International University, Miami
ABSTRACT
The movement of real users often follows patterns that can be characterized by certain statistical metrics of the contacts. Such metrics are useful for routing decisions, especially in sparse mobile ad hoc networks where node connectivity is opportunistic and messages are delivered using store-carry-forward routing. Past analysis on real-world data traces indicates that human behaviors affect the node contact pattern and spatial dependency exists among mobile nodes. A new metric called the expected dependent delay that characterizes the expected delay of a contact dependent on the previous hop is proposed. It characterizes the spatial dependency between neighboring contact pairs and reflects the regularity in node movement. In sparse opportunistic mobile ad hoc networks, a good approximation of the expected delay of a multihop path can be derived as the sum of the expected delay of the first hop and the expected dependent delays of later hops. We apply the proposed path-delay estimation to end-to-end routing. Simulation results show that compared with routing schemes that consider only the delivery probability or the expected delay, the proposed scheme can reduce the message delay significantly, when the network is sufficiently sparse and the spatial dependency is quantitatively constant over time. Moreover, the proposed method is tractable and can be easily implemented in combination with other routing techniques such as multipath routing and per-contact routing.
INDEX TERMS
Opportunistic networks, delay-tolerant networks, routing, spatial dependency, end-to-end delay.
CITATION
Chao Chen, Zesheng Chen, "Exploiting Contact Spatial Dependency for Opportunistic Message Forwarding", IEEE Transactions on Mobile Computing, vol.8, no. 10, pp. 1397-1411, October 2009, doi:10.1109/TMC.2009.55
REFERENCES
[1] Delay Tolerant Networking Research Group, http:/www.dtnrg. org, 2009.
[2] I.F. Akyildiz, O.B. Akan, C. Chen, J. Fang, and W. Su, “The State-of-the-Art in InterPlaNetary Internet,” IEEE Comm. Magazine, vol. 42, no. 7, pp. 108-118, July 2004.
[3] A. Pentland, R. Fletcher, and A. Hasson, “DakNet: Rethinking Connectivity in Developing Nations,” Computer, vol. 37, no. 1, pp.78-83, Jan. 2004.
[4] Wizzy Digital Courier, http:/www.wizzy.org.za/, 2009.
[5] P. Juang, H. Oki, Y. Wang, M. Martonosi, L.-S. Peh, and D. Rubenstein, “Energy-Efficient Computing for Wildlife Tracking: Design Tradeoff and Early Experiences with ZebraNet,” Proc. 10th Ann. Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS '02), pp. 96-107, Oct. 2002.
[6] J. Arnold, B. Levine, R. Manmatha, F. Lee, P. Shenoy, M.-C. Tsai, T. Ibrahim, D. O'Brien, and D. Walsh, “Information-Sharing in Out-of-Hospital Disaster Response: The Future Role of Information Technology,” Prehospital and Disaster Medicine, vol. 19, no. 3, pp. 201-207, 2004.
[7] A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” Technical Report CS-200006, Dept. of Computer Science, Duke Univ., 2000.
[8] M. Grossglauser and D. Tse, “Mobility Increases the Capacity of Ad Hoc Wireless Networks,” IEEE/ACM Trans. Networking, vol. 10, no. 4, pp. 477-486, Aug. 2002.
[9] Z. Zhang, “Routing in Intermittently Connected Mobile Ad Hoc Networks and Delay Tolerant Networks: Overview and Challenges,” IEEE Comm. Surveys and Tutorials, vol. 8, no. 1, pp. 24-37, 2006.
[10] S. Jain, K. Fall, and R. Patra, “Routing in a Delay Tolerant Network,” Proc. ACM SIGCOMM, pp. 145-158, Aug./Sept. 2004.
[11] A. Lindgren, A. Doria, and O. Schelen, “Probabilistic Routing in Intermittently Connected Networks,” Mobile Computing and Comm. Rev., vol. 7, no. 3, pp. 19-20, 2003.
[12] M. Musolesi, S. Hailes, and C. Mascolo, “Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks,” Proc. IEEE Int'l Symp. World of Wireless Mobile and Multimedia Networks (WoWMoM '05), vol. 1, pp. 183-189, June 2005.
[13] J. Ghosh, S. Philip, and C. Qiao, “Sociological Orbit Aware Location Approximation and Routing in MANET,” Ad Hoc Networks, vol. 5, no. 2, pp. 189-209, Mar. 2007.
[14] J. Leguay, T. Friedman, and V. Conan, “Evaluating Mobility Pattern Space Routing for DTNs,” Proc. IEEE INFOCOM, Apr. 2006.
[15] J. Karvo and J. Ott, “Time Scales and Delay-Tolerant Routing Protocols,” Proc. ACM SIGCOMM Workshop Challenged Networks (CHANTS '08), pp. 33-40, Sept. 2008.
[16] J. Leguay, A. Lindgren, J. Scott, T. Friedman, and J. Crowcroft, “Opportunistic Content Distribution in an Urban Setting,” Proc. ACM SIGCOMM Workshop Challenged Networks (CHANTS '06), pp.205-212, Sept. 2006.
[17] 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, Apr. 2006.
[18] T. Karagiannis, J. Le Boudec, and M. Vojnović, “Power Law and Exponential Decay of Inter Contact Times between Mobile Devices,” Proc. ACM MobiCom, pp. 183-194, Sept. 2007.
[19] E. Yoneki, P. Hui, S. Chan, and J. Crowcroft, “A Socio-Aware Overlay for Publish/Subscribe Communication in Delay Tolerant Networks,” Proc. ACM/IEEE Int'l Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems (WSWiM '07), pp. 225-234, Oct. 2007.
[20] E. Daly and M. Haahr, “Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs,” Proc. ACM MobiHoc, pp.32-40, Sept. 2007.
[21] P. Hui, J. Crowcroft, and E. Yoneki, “BUBBLE Rap: Social-Based Forwarding in Delay Tolerant Networks,” Proc. ACM MobiHoc, pp. 241-250, May 2008.
[22] C. Chen and Z. Chen, “Evaluating Contacts for Routing in Highly Partitioned Mobile Networks,” Proc. Int'l Workshop Mobile Opportunistic Networking (MobiOpp '07), pp. 17-24, June 2007.
[23] K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” Proc. ACM SIGCOMM, pp. 27-34, Aug. 2003.
[24] J. Burgess, B. Gallager, D. Jensen, and B. Levine, “MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks,” Proc. IEEE INFOCOM, Apr. 2006.
[25] B. Burns, O. Brock, and B. Levine, “MV Routing and Capacity Building in Disruption Tolerant Networks,” Proc. IEEE INFOCOM, vol. 1, pp. 398-408, Mar. 2005.
[26] K. Tan, Q. Zhang, and W. Zhu, “Shortest Path Routing in Partially Connected Ad Hoc Networks,” Proc. IEEE Global Comm. Conf. (GLOBECOM '03), vol. 2, pp. 1038-1042, Dec. 2003.
[27] E. Jones, “Practical Routing in Delay-Tolerant Networks,” master's thesis, Dept. of Electrical and Computer Eng., Univ. of Waterloo, 2006.
[28] S. Ross, Introduction to Probability Models, eighth ed., pp. 416-425, Academic Press, 2003.
[29] E. Jones, L. Li, and P. Ward, “Practical Routing in Delay-Tolerant Networks,” Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN '05), pp. 237-243, Aug. 2005.
[30] CRAWDAD: A Community Resource for Archiving Wireless Data at Dartmouth, http:/crawdad.cs.dartmouth.edu, 2009.
[31] N. Eagle and A. Pentland, “Reality Mining: Sensing Complex Social Systems,” Personal and Ubiquitous Computing, vol. 10, no. 4, pp. 255-268, May 2006.
[32] T. Henderson, D. Kotz, and I. Abyzov, “The Changing Usage of a Mature Campus-Wide Wireless Network,” Proc. ACM MobiCom, pp. 187-201, Sept. 2004.
[33] M. McNett and G.M. Voelker, “Access and Mobility of Wireless PDA Users,” ACM Mobile Computing and Comm. Rev., vol. 9, no. 2, pp. 40-55, Apr. 2005.
[34] M. Kim, D. Kotz, and S. Kim, “Extracting a Mobility Model from Real User Traces,” Proc. IEEE INFOCOM, pp. 1-13, Apr. 2006.
[35] W. Hsu, T. Spyropoulos, K. Psounis, and A. Helmy, “Modeling Time-Variant User Mobility in Wireless Mobile Networks,” Proc. IEEE INFOCOM, pp. 758-766, May 2007.
[36] I. Rhee, M. Shin, S. Hong, K. Lee, and S. Chong, “Human Mobility Patterns and Their Impact on Routing in Human-Driven Mobile Networks,” Proc. ACM Sixth Workshop Hot Topics in Networks (HotNets-Vi '07), Nov. 2007.
[37] M. Musolesi and C. Mascolo, “A Community Based Mobility Model for Ad Hoc Network Research,” Proc. Second ACM/SIGMOBILE Int'l Workshop Multi-Hop Ad Hoc Networks: From Theory to Reality (REALMAN '06), pp. 31-38, May 2006.
[38] T. Spyropoulos, K. Psounis, and C. Raghavendra, “Performance Analysis of Mobility-Assisted Routing,” Proc. ACM MobiHoc, pp.49-60, May 2006.
[39] T. Spyropoulos, K. Psounis, and C. Raghavendra, “Efficient Routing in Intermittently Connected Networks: The Single-Copy Case,” IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 63-76, Feb. 2008.
[40] V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, “Delegation Forwarding,” Proc. ACM MobiHoc, pp. 251-260, May 2008.
[41] M. Shin, S. Hong, and I. Rhee, “DTN Routing Strategies Using Optimal Search Patterns,” Proc. ACM SIGCOMM Workshop Challenged Networks (CHANTS '08), pp. 27-32, Sept. 2008.
[42] V. Conan, J. Leguay, and T. Friedman, “Fixed Point Opportunistic Routing in Delay Tolerant Networks,” IEEE J. Selected Areas in Comm., vol. 26, no. 5, pp. 773-782, June 2008.
[43] R.J. La and Y. Han, “Distribution of Path Durations in Mobile Ad Hoc Networks and Path Selection,” IEEE/ACM Trans. Networking, vol. 15, no. 5, pp. 993-1006, Oct. 2007.
[44] K. Harras, K. Almeroth, and E. Belding-Royer, “Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks,” Proc. Int'l Federation for Information Processing (IFIP) Networking Conf., pp. 1180-1192, May 2005.
[45] R. Ramanathan, R. Hansen, P. Basu, R. Hain, and R. Krishnan, “Prioritized Epidemic Routing for Opportunistic Networks,” Proc. Int'l Workshop Mobile Opportunistic Networking (MobiOpp '07), pp.62-66, June 2007.
[46] T. Mastuda and T. Takine, “(p,q)-Epidemic Routing for Sparsely Populated Mobile Ad Hoc Networks,” IEEE J. Selected Areas in Comm., vol. 26, no. 5, pp. 783-793, June 2008.
[47] B.D. Walker, J.K. Glenn, and T.C. Clancy, “Analysis of Simple Counting Protocols for Delay-Tolerant Networks,” Proc. ACM SIGCOMM Workshop Challenged Networks (CHANTS '07), pp. 19-26, Sept. 2007.
[48] T. Spyropoulos, K. Psounis, and C. Raghavendra, “Efficient Routing in Intermittently Connected Networks: The Multi-Copy Case,” ACM/IEEE Trans. Networking, vol. 16, no. 1, pp. 77-90, Feb. 2008.
[49] A. Balasubramanian, B.N. Levine, and A. Venkataramani, “DTN Routing as a Resource Allocation Problem,” Proc. ACM SIGCOMM, pp. 372-384, Aug. 2007.
[50] V. Erramilli and M. Crovella, “Forwarding in Opportunistic Networks with Resource Constraints,” Proc. ACM SIGCOMM Workshop Challenged Networks (CHANTS '08), pp. 41-48, Sept. 2008.
[51] P. Costa, C. Mascolo, M. Musolesi, and G. Picco, “Socially-Aware Routing for Publish-Subscribe in Delay-Tolerant Mobile Ad Hoc Networks,” IEEE J. Selected Areas in Comm., vol. 26, no. 5, pp. 748-760, June 2008.
[52] J. Su, J. Scott, P. Hui, E. Upton, M. Lim, C. Diot, J. Crowcroft, A. Goel, and E. de Lara, “Haggle: Clean-Slate Networking for Mobile Devices,” Technical Report UCAM-CL-TR-680, Univ. of Cambridge, Computer Laboratory, Jan. 2007.
[53] S. Jung, U. Lee, A. Chang, D. Cho, and M. Gerla, “BlueTorrent: Cooperative Content Sharing for Bluetooth Users,” Pervasive and Mobile Computing, vol. 3, no. 6, pp. 609-634, Dec. 2007.
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool