research-article

FAN: friendship based anonymous routing in wireless social mobile networks of malicious communities

Authors:

Antonio Davoli,

Alessandro Mei,

Julinda StefaAuthors Info & Claims

ExtremeCom '11: Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition

Article No.: 13, Pages 1 - 6

https://doi.org/10.1145/2414393.2414406

Published: 26 September 2011 Publication History

Abstract

Pocket Switched Networks (PSN) whose main feature is the social-guided movement of users/devices, have attracted the attention of many researchers in the last years, mostly for the common belief to be a key technology in providing innovative services without the need of a fixed network infrastructure. However, the opportunistic and intermittent nature of the contacts among users make it very difficult to design secure and trustworthy services for these networks. In particular, anonymous communication remains among the most difficult services to achieve.

In this paper we present FAN (Friendship based ANonymity), a primitive that exploits strong friendship relationships among users to provide source anonymity and sender-receiver unlinkability in Pocket Switched Networks. The primitive is independent of the forwarding mechanism underneath, and therefore, can be coupled with any routing protocol. As shown from our large experimental results with different real data traces, FAN outperforms the TPS scheme, its only rival that provides the same anonymity properties for Pocket Switched Networks, in terms of delay, cost, and network throughput.

References

[1]

M. V. Barbera and A. Mei. Personal marks and community certificates: Detecting clones in mobile wireless networks of smart-phones. Preprint: http://arxiv.org/abs/1105.3716, 2011.

[2]

A. Boukerche, K. El-Khatib, L. Xu, and L. Korba. Sdar: A secure distributed anonymous routing protocol for wireless and mobile ad hoc networks. In Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks (LCN04), 2004.

Digital Library

[3]

R. M. Capocelli, A. D. Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes. Journal of Cryptology, 6:157--168.

Digital Library

[4]

M. Carpentieri, A. D. Santis, U. Vaccaro, A. De, and S. U. Vaccaro. Size of shares and probability of cheating in threshold schemes. In In Proc. of Eurocrypto'93, Lecture Notes in Computer Science, LNCS 765, pages 118--125. Springer-Verlag, 1993.

Digital Library

[5]

L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM, 24:84--90, February 1981.

Digital Library

[6]

E. M. Daly and M. Haahr. Social network analysis for routing in disconnected delay-tolerant manets. In MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, 2007.

Digital Library

[7]

R. Dingledine, N. Mathewson, and P. P. Syverson. Tor: the second-generation onion router. In Proceedings of the 13th conference on USENIX Security Symposium (SSYM'04), 2004.

Digital Library

[8]

N. Eagle and A. S. Pentland. CRAWDAD data set mit/reality (v. 2005-07-01). Downloaded from http://crawdad.cs.dartmouth.edu/mit/reality, July 2005.

[9]

V. Erramilli, M. Crovella, A. Chaintreau, and C. Diot. Delegation forwarding. In MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, 2008.

Digital Library

[10]

P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot. Pocket switched networks and human mobility in conference environments. In WDTN '05: Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, 2005.

Digital Library

[11]

P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: social-based forwarding in delay tolerant networks. In MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, 2008.

Digital Library

[12]

R. Jansen and R. Beverly. Toward Anonymity in Delay Tolerant Networks: Threshold Pivot Scheme. In Proceedings of The Military Communications Conference (MILCOM 2010).

[13]

D. Kotz, T. Henderson, I. Abyzov, and J. Yeo. CRAWDAD data set dartmouth/campus (v. 2009-09-09). Downloaded from http://crawdad.cs.dartmouth.edu/dartmouth/campus, Sept. 2009.

[14]

F. Li and J. Wu. LocalCom: a community-based epidemic forwarding scheme in disruption-tolerant networks. In SECON'09: Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2009.

Digital Library

[15]

A. Liu and P. Ning. Tinyecc: A configurable library for elliptic curve cryptography in wireless sensor networks. In Proceedings of the 7th International Conference on Information Processing in Sensor Networks (IPSN 2008), SPOTS Track, 2008.

Digital Library

[16]

X. Lu, P. Hui, D. Towsley, J. Pu, and Z. Xiong. Anti-localization anonymous routing for delay tolerant network. Computer Networks, 54(11):1899--1910, 2010.

Digital Library

[17]

A. Mei, G. Morabito, P. Santi, and J. Stefa. Social-Aware Stateless Forwarding in Pocket Switched Networks. In Proceedings of The 30th IEEE Conference on Computer Communications, mini-conference, (INFOCOM 2011), April 2011.

[18]

G. Palla, I. Derényi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043), 2005.

[19]

J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD trace cambridge/haggle/imote (v. 2009-05-29). Downloaded from http://crawdad.cs.dartmouth.edu/cambridge/haggle/imote, May 2009.

[20]

S. Seys and B. Preneel. ARM: anonymous routing protocol for mobile ad hoc networks. Int. J. Wire. Mob. Comput., 3:145--155, October 2009.

Digital Library

[21]

A. Shamir. How to share a secret. Communications of the ACM, 11(22):612--613, 1979.

Digital Library

[22]

R. Song, L. Korba, and G. Yee. Anondsr: efficient anonymous dynamic source routing for mobile ad-hoc networks. In Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks (SASN'05), 2005.

Digital Library

[23]

T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In ACM Sigcomm Workshops, Aug. 2005.

Digital Library

[24]

A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, 2000.

[25]

Y. Zhang, W. Liu, W. Lou, and Y. Fang. MASK: Anonymous on-demand routing in mobile ad hoc networks. IEEE Transactions on Wireless Communications, 21:2376--2385, 2006

Digital Library

Cited By

Ardagna CConti MLeone MStefa J(2013)Preserving Smartphone Users' Anonymity in Cloudy Days2013 22nd International Conference on Computer Communication and Networks (ICCCN)10.1109/ICCCN.2013.6614170(1-5)Online publication date: Jul-2013
https://doi.org/10.1109/ICCCN.2013.6614170

Index Terms

FAN: friendship based anonymous routing in wireless social mobile networks of malicious communities
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Networks

Recommendations

Bloom filter based secure and anonymous DSR protocol in wireless ad hoc networks

Wireless ad hoc networks, especially in the hostile environment, are vulnerable to traffic analysis which allows the adversary to trace the routing messages and the sensitive data packets. Anonymity mechanism in ad hoc networks is a critical securing ...
Mobility changes anonymity: new passive threats in mobile ad hoc networks: Research Articles
Wireless Network Security

Privacy in mobile ad hoc networks has new semantics in addition to the conventional notions for infrastructure networks. Mobility enabled by wireless communication has significantly changed privacy issues and anonymity research in many ways. In ...
Secure anonymous routing in ad hoc networks
COMPUTE '08: Proceedings of the 1st Bangalore Annual Compute Conference

Communication in Ad Hoc networks relies on the routing functionality of the intermediate nodes. Secure routing and preventing traffic analysis are important criterion for secure anonymous communication in Ad Hoc networks. By analyzing the traffic in ad ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences

ExtremeCom '11: Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition

September 2011

79 pages

ISBN:9781450310796

DOI:10.1145/2414393

General Chairs:
Anders Lindgren,
Pan Hui

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

UFAM: Federal University Of Amazonas
CAPES: Brazilian Higher Education Funding Council

In-Cooperation

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 September 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ExtremeCom 2011

Sponsor:

UFAM
CAPES

ExtremeCom 2011: 3rd Extreme Conference on Communication - The Amazon Expedition

September 26 - 30, 2011

Manaus, Brazil

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
88
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ardagna CConti MLeone MStefa J(2013)Preserving Smartphone Users' Anonymity in Cloudy Days2013 22nd International Conference on Computer Communication and Networks (ICCCN)10.1109/ICCCN.2013.6614170(1-5)Online publication date: Jul-2013
https://doi.org/10.1109/ICCCN.2013.6614170

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents