NDLI: Random graph models for wireless and social networks: keynote talk abstract

Please wait, while we are loading the content...

Random graph models for wireless and social networks: keynote talk abstract

On context awareness and social distance in human mobility traces

Utility-based forwarding: a comparison in different mobility scenarios

Making the most of your contacts: transfer ordering in data-centric opportunistic networks

Demo of a collaborative music sharing system

404 not found: a quest for DTN applications

Less is more: long paths do not help the convergence of social-oblivious forwarding in opportunistic networks

Vicinity-based DTN characterization

A disruption-tolerant transmission protocol for practical mobile data offloading

PePiT: opportunistic dissemination of large contents on android mobile devices

Information dissemination dynamics in delay tolerant network: a bipartite network approach

Performance of collaborative GPS localization in pedestrian ad hoc networks

QuickSilver: application-driven inter- and intra-cluster communication in Vanets

Mobile video broadcasting system with multiple mobile devices for improving availability

Opportunistic networks and cognitive management systems in the service of the future internet: indicative scenarios of coverage and capacity extension

Illinois vehicular project, live data sampling and opportunistic internet connectivity

Gossipmule: scanning and disseminating information between stations in cooperative WLANs

Sensing multi-dimensional human behavior in opportunistic networks

From ego network to social network models

Twitter in disaster mode: smart probing for opportunistic peers

Random graph models for wireless and social networks: keynote talk abstract

Content Provider	ACM Digital Library
Author	Grossglauser, Matthias
Abstract	Operating large-scale social applications over opportunistic wireless networks entails many fascinating engineering challenges. We strive for robust and efficient algorithms for specific problems like opportunistic forwarding, routing, or publish-subscribe, and we want to ascertain global properties like security, privacy, fairness, and high performance. One particular set of challenges concerns the scalability of this whole endeavor: is it fundamentally possible for such applications and underlying methods to scale up to large networks, without jeopardizing desirable system properties? We discuss recent progress in some of the key problems in this area at three conceptual layers: opportunistic forwarding, routing under mobility, and social network privacy. Opportunistic forwarding exploits the random broadcast nature of the wireless channel and the availability of multiple "good" routes towards a destination. This approach can deliver a message to its destination at a potentially lower expected cost than over a single shortest path. We introduce a forwarding algorithm and associated "anypath metric" that is optimal, building on the observation that no single-path metric can achieve optimality in general. In routing under mobility, the key challenge is to keep track of the changing network topology, so that efficient routes can be computed at any time between any pair of nodes. We ask whether there exist low-overhead schemes that produce low-stretch routes, even in large networks where all the nodes are mobile. We present a scheme that maintains a hierarchical structure within which constant-stretch routes can be efficiently computed between every pair of nodes. The scheme rebuilds each level of the hierarchy periodically, at a rate that decreases exponentially with the level of the hierarchy, and achieves constant stretch under a mild smoothness condition on the mobility process. Finally, we address the problem of the privacy of an anonymized social network. The specific challenge is the sharing or public release of anonymized network data without accidentally leaking personally identifiable information (PII). Unfortunately, it is often difficult to ascertain that sophisticated statistical techniques, potentially employing additional external data sources, are unable to break anonymity. We show an asymptotic condition, based on a random graph model, under which a computationally powerful adversary would be able to re-identify the anonymized node identities. This has important implications for privacy policies in social network structures. What binds the above problem formulations and results together is our reliance on stochastic network models that retain only the salient features of each problem. These abstractions allow us to make precise statements about scalability to very large systems. We hope that these results complement and inform more focused work on methods, protocols, and applications for mobile, opportunistic, and social networks.
Starting Page	1
Ending Page	2
Page Count	2
File Format	PDF
ISBN	9781450312080
DOI	10.1145/2159576.2159578
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-03-15
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Scalability Wireless networks Opportunistic forwarding Mobility Routing Social networks Graph embedding Network privacy
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in