HUBCODE

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

HUBCODE: message forwarding using hub-based network coding in delay tolerant networks

Full text

Pdf (467 KB)

Source

International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems table of contents

Tenerife, Canary Islands, Spain

SESSION: DTNs table of contents

Pages 288-296

Year of Publication: 2009

ISBN:978-1-60558-616-8

Authors

Shabbir Ahmed	The University of New South Wales, Sydney, Australia
Salil S. Kanhere	The University of New South Wales, Sydney, Australia

Sponsor

SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 4, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1641804.1641853 What is a DOI?

ABSTRACT

Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of Hubs, a fraction of the nodes, which are collectively connected to the rest of the nodes. In this paper, we propose a novel forwarding strategy called HubCode, which seeks to use the hubs as message relays. The hubs employ random linear network coding to encode multiple messages addressed to the same destination, reducing the forwarding overheads. Further, the use of the hubs as relays, ensures that most messages are delivered to the destinations. Two versions of HubCode are presented, with each scheme exhibiting contrasting behavior in terms of the computational costs and routing overheads. We simulate a large-scale vehicular DTN using empirically collected movement traces of a city-wide public transport network and demonstrate the efficacy of our solutions in comparison with other forwarding schemes.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	R. Ahlswede, N. Cai, S. Y. R. Li, and R. W. Yeung. Network information flow. In IEEE Transaction on Information Theory, volume 46, July 2000.
	2	M. Balazinsky and P. Castro. Characterizing mobility and network usage in a corporate wireless local-area networks. In Proceedings of MobiSys, May 2003.
	3	J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. Maxprop: Routing for vehicle-based disruption tolerant networks. In Proceedings of IEEE INFOCOM, Barcelona, Spain, April 2006.
	4	L. J. Chen, Y. C. Chen, T. Sun, P. Sreedevi, K. T. Chen, C. H. Yu, and H. H. Chu. Finding self-similarity in opportunistic people networks. In Proceedings of IEEE INFOCOM, May 2007.
	5	L. J. Chen, C. H. Yu, T. Sun, Y. C. Chen, and H. H. Chu. A hybrid routing approach for opportunistic networks. In Proceedings of ACM SIGCOMM workshop on Challenged Networks, September 2006.
	6	Q. J. Chen, S. S. Kanhere, M. Hassan, and K.-C. Lan. Adaptive position update in geographic routing. In Proceedings of IEEE International Conference on Communications, June 2006.
	7	S. Deb and M. Medard. Algebraic gossip: A network coding approach to optimal multiple rumor mongering. In Proceedings of Allerton, September 2004.
	8	Q. Dong, J. Wu, W. Hu, and J. Crowcroft. Practical network coding in wireless networks. In Proceedings of ACM MobiCom, September 2007.
	9	V. Erramilli, M. Crovella, A. Chaintreau, and C. Diot. Feasibility study of bluetooth-based content distribution stations on public transit systems. In Proceedings of the 1st international workshop on decentralized resource sharing in mobile computing and networking, MobiShare, September 2006.
	10	B. H. et al. Cartel: A distributed mobile sensor computing platform. In Proceedings of ACM SenSys, October 2006.
	11	L. Freeman. A set of measuring centrality based on betweenness. In Sociometry, pages 35--41, 1977.
	12	T. Henderson, D. Kotz, and I. Abyzov. The changing usage of a mature campus-wide wireless networks. In Proceedings of ACM MobiCom, September 2004.
	13	W. J. Hsu and A. Helmy. On nodal encounter patterns in wireless lan traces. In Proceedings of the second IEEE International Workshop on Wireless Network Measurement (WiNMee), April 2006.
	14	P. Hui, A. Chaintreau, J. Scott, R. Gass, C. Diot, and J. Crowcroft. Pocket switched networks and human mobility in conference environments. In Proceedings of SIGCOMM, August 2005.
	15	P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: Social-based forwarding in delay tolerant networks. In Proceedings of MobiHoc, May 2008.
	16	J. G. Jetcheva, Y. C. Hu, S. P. Chaudhuri, A. K. Saha, and D. B. Johnson. Design and evaluation of a metropolitan area multitier wireless ad hoc network architecture. In Proceedings of fifth IEEE workshop on Mobile Computing Systems and Applications, October 2003.
	17	J. Jun, P. Peddabachagari, and M. L. Sichitiu. Theoretical maximum throughput of IEEE 802.11 and its application. In Proceedings of Network Computing and Applications, April 2003.
	18	S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft. XORs in the air: Practical wireless network coding. In Proceedings of ACM SIGCOMM, June 2006.
	19	J. Lebrun and C. N. Chuah. Delegation forwarding. In Proceedings of MobiHoc, May 2008.
	20	Z. Li and B. Li. Network coding: the case of multiple unicast sessions. In Proceedings of the 42nd Allerton Annual Conference on Communication, Control, and Computing, September 2004.
	21	Y. Lin, B. Li, and B. Liang. Stochastic analysis of network coding in epidemic routing. In Proceedings of ACM MobiOpp, June 2007.
	22	D. S. Lun, M. Medard, and R. Koetter. Network coding for efficient wireless unicast. In Proceedings of International Zurich Seminar on Communications, February 2006.
	23	L. Rudolf and N. Harald. In Finite Fields (2nd ed.). Cambridge University Press, 1997.
	24	J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD data set cambridge/haggle (v. 2006-09-15). Downloaded from http://crawdad.cs.dartmouth.edu/cambridge/haggle.
	25	T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of ACM SIGCOMM, August 2005.
	26	A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. In Technical Report CS-200006, Duke University, 2000.
	27	J. Widmer and J.-Y. L. Boudec. Network coding for efficient communication in extreme networks. In Proceedings of ACM SIGCOMM workshop on delay tolerant networking and related topics (WDTN), August 2005.
	28	Y. Xi and E. M. Yeh. Distributed algorithms for minimum cost multicast with network coding in wireless networks. In Proceedings of the 4th International symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, April 2006.
	29	E. Yoneki, P. Hui, and J. Crowcroft. Distinct types of hubs in human dynamic networks. In SocialNets, September 2008.
	30	X. Zhang, J. Kursoe, B. Levine, D. Towsley, and H. Zhang. Study of a bus-based disruption tolerant network: Mobility modeling and impact on routing. In Proceedings of MobiCom, September 2007.
	31	X. Zhang, G. Neglia, J. Kursoe, and D. Towsley. On the benefits of random linear coding for unicast applications in disruption tolerant networks. In Proceedings of the 2nd Workshop on Network Coding, theory and applications (NetCod), April 2006.