Relevant bibliographies by topics / Opportunistic mobile social networks

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Opportunistic mobile social networks'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Opportunistic mobile social networks.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Opportunistic mobile social networks"

1

Yan, Yeqing, Zhigang Chen, Jia Wu, and Leilei Wang. "An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks." Algorithms 11, no. 8 (2018): 125. http://dx.doi.org/10.3390/a11080125.

Full text
Abstract:
With the popularization of mobile communication equipment, human activities have an increasing impact on the structure of networks, and so the social characteristics of opportunistic networks become increasingly obvious. Opportunistic networks are increasingly used in social situations. However, existing routing algorithms are not suitable for opportunistic social networks, because traditional opportunistic network routing does not consider participation in human activities, which usually causes a high ratio of transmission delay and routing overhead. Therefore, this research proposes an effective data transmission algorithm based on social relationships (ESR), which considers the community characteristics of opportunistic mobile social networks. This work uses the idea of the faction to divide the nodes in the network into communities, reduces the number of inefficient nodes in the community, and performs another contraction of the structure. Simulation results show that the ESR algorithm, through community transmission, is not only faster and safer, but also has lower transmission delay and routing overhead compared with the spray and wait algorithm, SCR algorithm and the EMIST algorithm.
APA, Harvard, Vancouver, ISO, and other styles
2

Yang, Yibo, Honglin Zhao, Jinlong Ma, and Xiaowei Han. "Social-aware data dissemination in opportunistic mobile social networks." International Journal of Modern Physics C 28, no. 09 (2017): 1750115. http://dx.doi.org/10.1142/s0129183117501157.

Full text
Abstract:
Opportunistic Mobile Social Networks (OMSNs), formed by mobile users with social relationships and characteristics, enhance spontaneous communication among users that opportunistically encounter each other. Such networks can be exploited to improve the performance of data forwarding. Discovering optimal relay nodes is one of the important issues for efficient data propagation in OMSNs. Although traditional centrality definitions to identify the nodes features in network, they cannot identify effectively the influential nodes for data dissemination in OMSNs. Existing protocols take advantage of spatial contact frequency and social characteristics to enhance transmission performance. However, existing protocols have not fully exploited the benefits of the relations and the effects between geographical information, social features and user interests. In this paper, we first evaluate these three characteristics of users and design a routing protocol called Geo-Social-Interest (GSI) protocol to select optimal relay nodes. We compare the performance of GSI using real INFOCOM06 data sets. The experiment results demonstrate that GSI overperforms the other protocols with highest data delivery ratio and low communication overhead.
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Junbao, Haojun Huang, Geyong Min, Wang Miao, and Dapeng Wu. "Social-Aware Routing in Mobile Opportunistic Networks." IEEE Wireless Communications 28, no. 2 (2021): 152–58. http://dx.doi.org/10.1109/mwc.001.2000189.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vidhya Lakshmi, Vimitha R., and Gireesh Kumar T. "Opportunistic mobile social networks: architecture, privacy, security issues and future directions." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 2 (2019): 1145. http://dx.doi.org/10.11591/ijece.v9i2.pp1145-1152.

Full text
Abstract:
Mobile Social Networks and its related applications have made a very great impact in the society. Many new technologies related to mobile social networking are booming rapidly now-a-days and yet to boom. One such upcoming technology is Opportunistic Mobile Social Networking. This technology allows mobile users to communicate and exchange data with each other without the use of Internet. This paper is about Opportunistic Mobile Social Networks, its architecture, issues and some future research directions. The architecture and issues of Opportunistic Mobile Social Networks are compared with that of traditional Mobile Social Networks. The main contribution of this paper is regarding privacy and security issues in Opportunistic Mobile Social Networks. Finally, some future research directions in Opportunistic Mobile Social Networks have been elaborated regarding the data's privacy and security.
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Ranyin, Xiaoming Wang, Fei Hao, et al. "Social identity-aware opportunistic routing in mobile social networks." Transactions on Emerging Telecommunications Technologies 29, no. 5 (2018): e3297. http://dx.doi.org/10.1002/ett.3297.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Sheng, Houzhong Liu, Caisen Chen, Zhaojun Shi, and William Wei Song. "Activity-based routing algorithm in opportunistic mobile social networks." International Journal of Distributed Sensor Networks 17, no. 9 (2021): 155014772110412. http://dx.doi.org/10.1177/15501477211041272.

Full text
Abstract:
In opportunistic mobile social networks, nodes are clustered according to their interests or hobbies and take part in different activities regularly. We delve into the temporal and spatial mobility characteristics of network nodes and put forward an activity-based message opportunistic forwarding algorithm. The main idea of the algorithm is that we choose different message forwarding methods according to the situation of nodes participating in activities. If the source node and the destination node are both attend in the same activities, we select the best relay node which has the biggest delivery probability. While the source node and the destination node are not in the same activities at the same time, we need to find the optimal path which owns highest indirect delivery probability, and messages will be transmitted through the optimal path. The simulation results show that the proposed routing algorithm can not only improve the successful delivery ratio of messages but also reduce the network delay and the network overhead obviously, in comparison with the classical opportunistic routing algorithms, such as community-aware message opportunistic transmission algorithm, community-based message transmission scheme algorithm, PRoPHET, Epidemic algorithm, and interest characteristic probability prediction algorithm.
APA, Harvard, Vancouver, ISO, and other styles
7

Xiao, Mingjun, Jie Wu, and Liusheng Huang. "Community-Aware Opportunistic Routing in Mobile Social Networks." IEEE Transactions on Computers 63, no. 7 (2014): 1682–95. http://dx.doi.org/10.1109/tc.2013.55.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

GAO, Zhenxiang, Yan SHI, Shanzhi CHEN, and Qihan LI. "Exploiting Social Relationship for Opportunistic Routing in Mobile Social Networks." IEICE Transactions on Communications E98.B, no. 10 (2015): 2040–48. http://dx.doi.org/10.1587/transcom.e98.b.2040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Socievole, Annalisa, Antonio Caputo, Floriano De Rango, and Peppino Fazio. "Routing in Mobile Opportunistic Social Networks with Selfish Nodes." Wireless Communications and Mobile Computing 2019 (February 3, 2019): 1–15. http://dx.doi.org/10.1155/2019/6359806.

Full text
Abstract:
When the connection to Internet is not available during networking activities, an opportunistic approach exploits the encounters between mobile human-carried devices for exchanging information. When users encounter each other, their handheld devices can communicate in a cooperative way, using the encounter opportunities for forwarding their messages, in a wireless manner. But, analyzing real behaviors, most of the nodes exhibit selfish behaviors, mostly to preserve the limited resources (data buffers and residual energy). That is the reason why node selfishness should be taken into account when describing networking activities: in this paper, we first evaluate the effects of node selfishness in opportunistic networks. Then, we propose a routing mechanism for managing node selfishness in opportunistic communications, namely, SORSI (Social-based Opportunistic Routing with Selfishness detection and Incentive mechanisms). SORSI exploits the social-based nature of node mobility and other social features of nodes to optimize message dissemination together with a selfishness detection mechanism, aiming at discouraging selfish behaviors and boosting data forwarding. Simulating several percentages of selfish nodes, our results on real-world mobility traces show that SORSI is able to outperform the social-based schemes Bubble Rap and SPRINT-SELF, employing also selfishness management in terms of message delivery ratio, overhead cost, and end-to-end average latency. Moreover, SORSI achieves delivery ratios and average latencies comparable to Epidemic Routing while having a significant lower overhead cost.
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Eric Ke, Yueping Li, Yunming Ye, S. M. Yiu, and Lucas C. K. Hui. "A Dynamic Trust Framework for Opportunistic Mobile Social Networks." IEEE Transactions on Network and Service Management 15, no. 1 (2018): 319–29. http://dx.doi.org/10.1109/tnsm.2017.2776350.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Opportunistic mobile social networks"

1

Pietiläinen, Anna-Kaisa. "Opportunistic mobile social networks at work." Paris 6, 2010. http://www.theses.fr/2010PA066587.

Full text
Abstract:
Les réseaux mobiles opportunistes ad-hoc se forment lorsque des terminaux mobiles portés par des utilisateurs communiquent entre eux sans aucune infrastructure. Ils diffèrent ainsi des réseaux classiques comme Internet dont l'architecture suppose la disponibilité instantanée de chemins reliant les hôtes et dont les délais de propagation, et le taux de perte des paquets, sont faibles. Dans les réseaux opportunistes, la mobilité des individus induit de nombreuses déconnexions et de grandes variations des délais. Dans cette thèse nous adoptons une démarche expérimentale pour concevoir et analyser les réseaux opportunistes. D'abord l'étude détaillée des communications opportunistes via Bluetooth dans des environnements contrôlés et réels, montre qu'en dépit des limitations pratiques de cette technologie, la communication opportuniste ad-hoc constitue un paradigme de communication efficace et attractif. Nous avons ensuite conçu et implémenté MobiClique, un middleware de communication destiné aux réseaux opportunistes qui s'appuie sur la mobilité et les relations sociales des utilisateurs pour le routage opportuniste des messages. Enfin, la réalisation d'une expérience grandeur nature mobilisant 80 personnes nous a permis de collecter les informations concernant leurs réseaux sociaux, leurs contacts ad-hoc et les traces de leurs communications. Nous proposons une méthodologie d'analyse des structures des communautés temporelles dans le réseau opportuniste. Nous étudions également de quelle façon ces structures et les interactions sociales caractérisent les chemins de dissémination du contenu.
APA, Harvard, Vancouver, ISO, and other styles
2

Huang, Rui. "Providing Location-Privacy in Opportunistic Mobile Social Networks." Thesis, Université d'Ottawa / University of Ottawa, 2018. http://hdl.handle.net/10393/37353.

Full text
Abstract:
Users face location-privacy risks when accessing Location-Based Services (LBSs) in an Opportunistic Mobile Social Networks (OMSNs). In order to protect the original requester's identity and location, we propose two location privacy obfuscation protocols utilizing social ties between users. The first one is called Multi-Hop Location-Privacy Protection (MHLPP) protocol. To increase chances of completing obfuscation operations, users detect and make contacts with one-hop or multi-hop neighbor friends in social networks. Encrypted obfuscation queries avoid users learning important information especially the original requester's identity and location except for trusted users. Simulation results show that our protocol can give a higher query success ratio compared to its existing counterpart. The second protocol is called Appointment Card Protocol (ACP). To facilitate the obfuscation operations of queries, we introduce the concept called Appointment Card (AC). The original requesters can send their queries to the LBS directly using the information in the AC, ensuring that the original requester is not detected by the LBS. Also, a path for reply message is kept when the query is sent, to help reduce time for replying queries. Simulation results show that our protocol preserves location privacy and has a higher query success ratio than its counterparts. We have also developed a new OMSN simulator, called OMSN Routing Simulator (ORS), for simulating OMSN protocols more efficiently and effectively for reliable performance.
APA, Harvard, Vancouver, ISO, and other styles
3

Yusuf, Lateef. "Improving quality of experience for mobile video streaming." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53423.

Full text
Abstract:
Thanks to their increasing sophistication and popularity, mobile devices, in the form of smartphones and tablets, have become the fastest growing contributors to Internet traffic. Indeed, smartphones are projected to account for 50% of global Internet traffic by 2017, with the share of mobile video increasing to about 40% of total Internet traffic. As users embrace Internet streaming of video, several studies have found that a small decrease in video quality leads to a substantial increase in viewer abandonment and disengagement rates. To handle the explosive growth in video traffic, Adaptive HTTP streaming, which exploits the prevalence of commodity web servers and content distribution networks, has emerged as the key technology for delivering video to end users. Although a number of systems have been proposed for HTTP video streaming in traditional environments and for fixed clients, existing platforms for video streaming on mobile devices are still in their infancy and do not address the additional challenges often experienced by mobile clients: high fluctuations in network conditions, heterogeneous networking interfaces, multiple form-factors, and limited battery life. In this dissertation, we propose a number of solutions for improving the Quality of Experience of HTTP video streaming on mobile devices. We begin by evaluating the performance of several existing video quality adaptation schemes when deployed on mobile platforms. Through experiments with smartphones in wide-area environments, we assemble several key findings. First, we show that the high fluctuations in network throughput on cellular and Wi-Fi networks impose significant challenges for efficiently architecting the video adaptation scheme. Second, we find significant differences between the performance of the current state-of-the-art schemes in controlled experimental settings and their performance in mobile settings on key quality metrics such as inefficiency, instability, rebuffering ratio, and startup latency. We also find noticeable differences in the behavior of the schemes under Wi-Fi and cellular network access, with most of the schemes performing worse when the network access is cellular. Given these observations, we hypothesize on the possible causes of these inefficiencies. We also identify the best practices of existing schemes and key insights from experimental results that can serve as foundations for addressing many of the limitations. Armed with these measurement-driven insights, we propose a novel video quality adaptation scheme, called MASS, which is more robust to the vagaries of the wireless networking conditions. We implement and evaluate our solution on commodity Android smartphones, and demonstrate significant performance gains over existing schemes. To further improve the streaming experience, we introduce an extension to HTTP video streaming that leverages the synergy between social network participation and video streaming to optimize end-user Quality of Experience. Our system, called SDASH, integrates and applies well-known concepts such as cooperative caching, prefetching, and P2P streaming for reducing bitrate fluctuations and optimizing the viewing experience. Finally, we develop a general infrastructure for constructing temporally and spatially localized P2P communities of mobile devices sharing similar interests. The platform enables on-demand cooperation among mobile clients based on device context and client preferences. We use a concrete implementation of the mobile P2P infrastructure for evaluating the performance of SDASH. This dissertation addresses the challenges facing Adaptive HTTP Streaming under mobile networking conditions. Through experimentation with commodity mobile devices, we show that the proposed techniques for bitrate adaptation and cooperative streaming can significantly improve the video viewing experience.
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Yunsheng. "Designing Efficient Routing Protocols in Delay Tolerant Networks." Diss., Temple University Libraries, 2013. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/224066.

Full text
Abstract:
Computer and Information Science<br>Ph.D.<br>This thesis presents the design and evaluation of routing protocols for efficient content delivery and dissemination in delay tolerant networks. With the advancement in technology, the communication devices with wireless interfaces become more and more universal. Delay tolerant networks (DTNs) are characterized by intermittent connectivity and limited network capacity. There exist several different application scenarios: connectivity of developing countries, vehicular DTN road communications, and social contact networks. In this thesis, we explore the characteristics in DTNs, such as mobility pattern, contact history information, and social feature information, to design efficient routing schemes. The research reported in this thesis investigates the technical challenges and their solutions of applying different DTN routing protocols. We design multicast schemes to forward the information to a group of destinations in DTN environment. We extend the delegation forwarding scheme in DTN multicasting. An non-replication multicast tree is also studied in this report. We also apply ticket-based and social-tie-based approaches in content distribution systems. We leverage the users' social feature information to study the hypercube-based routing schemes in social contact networks. We also study the resource management problem in DTNs. We design a joint replication-migration-based scheme to solve the storage congestion. These techniques are evaluated comprehensively in realistic simulation studies, by comparing the performance with state-of-the-art approaches in both synthetic and real traces.<br>Temple University--Theses
APA, Harvard, Vancouver, ISO, and other styles
5

Erramilli, Vijay. "Forewarding in Mobile Opportunistic Networks." Boston University Computer Science Department, 2009. https://hdl.handle.net/2144/1722.

Full text
Abstract:
Recent advances in processor speeds, mobile communications and battery life have enabled computers to evolve from completely wired to completely mobile. In the most extreme case, all nodes are mobile and communication takes place at available opportunities – using both traditional communication infrastructure as well as the mobility of intermediate nodes. These are mobile opportunistic networks. Data communication in such networks is a difficult problem, because of the dynamic underlying topology, the scarcity of network resources and the lack of global information. Establishing end-to-end routes in such networks is usually not feasible. Instead a store-and-carry forwarding paradigm is better suited for such networks. This dissertation describes and analyzes algorithms for forwarding of messages in such networks. In order to design effective forwarding algorithms for mobile opportunistic networks, we start by first building an understanding of the set of all paths between nodes, which represent the available opportunities for any forwarding algorithm. Relying on real measurements, we enumerate paths between nodes and uncover what we refer to as the path explosion effect. The term path explosion refers to the fact that the number of paths between a randomly selected pair of nodes increases exponentially with time. We draw from the theory of epidemics to model and explain the path explosion effect. This is the first contribution of the thesis, and is a key observation that underlies subsequent results. Our second contribution is the study of forwarding algorithms. For this, we rely on trace driven simulations of different algorithms that span a range of design dimensions. We compare the performance (success rate and average delay) of these algorithms. We make the surprising observation that most algorithms we consider have roughly similar performance. We explain this result in light of the path explosion phenomenon. While the performance of most algorithms we studied was roughly the same, these algorithms differed in terms of cost. This prompted us to focus on designing algorithms with the explicit intent of reducing costs. For this, we cast the problem of forwarding as an optimal stopping problem. Our third main contribution is the design of strategies based on optimal stopping principles which we refer to as Delegation schemes. Our analysis shows that using a delegation scheme reduces cost over naive forwarding by a factor of O(√N), where N is the number of nodes in the network. We further validate this result on real traces, where the cost reduction observed is even greater. Our results so far include a key assumption, which is unbounded buffers on nodes. Next, we relax this assumption, so that the problem shifts to one of prioritization of messages for transmission and dropping. Our fourth contribution is the study of message prioritization schemes, combined with forwarding. Our main result is that one achieves higher performance by assigning higher priorities to young messages in the network. We again interpret this result in light of the path explosion effect.<br>Thomson Research, Paris; National Science Foundation (CCR-0325701, ANI-0322990); HAGGLE FET Project; Erramilli family.
APA, Harvard, Vancouver, ISO, and other styles
6

Heinemann, Andreas. "Collaboration in Opportunistic Networks." Phd thesis, Saarbrücken VDM Verlag Dr. Müller, 2007. http://tuprints.ulb.tu-darmstadt.de/834/1/heinemann07-diss.pdf.

Full text
Abstract:
Motivation. With the increasing integration of wireless short-range communication technologies (Bluetooth, 802.11b WiFi) into mobile devices, novel applications for spontaneous communication, interaction and collaboration are possible. We distinguish between active and passive collaboration. The devices help users become aware of each other and stimulate face-to-face conversation (active collaboration). Also, autonomous device communication for sharing information without user interaction is possible, i.e., devices pass information to other devices in their vicinity (passive collaboration). Both, active and passive collaboration requires a user to specify what kind of information he offers and what kind of information he is interested in. Object of Research: Opportunistic Networks. Spontaneous communication of mobile devices leads to so-called opportunistic networks, a new and promising evolution in mobile ad-hoc networking. They are formed by mobile devices which communicate with each other while users are in close proximity. There are two prominent characteristics present in opportunistic networks: 1) A user provides his personal device as a network node. 2) Users are a priori unknown to each other. Objectives. Due to the fact that a user dedicates his personal device as a node to the opportunistic network and interacts with other users unknown to him, collaboration raises questions concerning two important human aspects: user privacy and incentives. The users’ privacy is at risk, since passive collaboration applications may expose personal information about a user. Furthermore, some form of incentive is needed to encourage a user to share his personal device resources with others. Both issues, user privacy and incentives, need to be taken into account in order to increase the user acceptability of opportunistic network applications. These aspects have not been addressed together with the technical tasks in prior opportunistic network research. Scientific Contribution and Evaluation. This thesis investigates opportunistic networks in their entirety, i.e., our technical design decisions are appropriate for user privacy preservation and incentive schemes. In summary, the proposed concepts comprise system components, a node architecture, a system model and a simple one-hop communication paradigm for opportunistic network applications. One focus of this work is a profile-based data dissemination mechanism. A formal model for this mechanism will be presented. On top of that, we show how to preserve the privacy of a user by avoiding static and thus linkable data and an incentive scheme that is suitable for opportunistic network applications. The evaluation of this work is twofold. We implemented two prototypes on off-the-shelf hardware to show the technical feasibility of our opportunistic network concepts. Also, the prototypes were used to carry out a number of runtime measurements. Then, we developed a novel two-step simulation method for opportunistic data dissemination. The simulation combines real world user traces with artificial user mobility models, in order to model user movements more realistically. We investigate our opportunistic data dissemination process under various settings, including different communication ranges and user behavior patterns. Our results depict, within the limits of our model and assumptions, a good performance of the data dissemination process.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Boying. "Large Scale Message Dissemination in Mobile Opportunistic Networks." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1338398822.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Zhimin. "Opportunistic Computing in Wireless Networks." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1267743144.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kouyoumdjieva, Sylvia T. "System Design for Opportunistic Networks." Doctoral thesis, KTH, Kommunikationsnät, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-176479.

Full text
Abstract:
Device-to-device communication has been suggested as a complement to traditional cellular networks as a means of offloading cellular traffic. In this thesis we explore a solution for device-to-device communication based on opportunistic content distribution in a content-centric network. Communication opportunities arise as mobile nodes roam around in an area and occasionally enter in direct communication range with one another. We consider a node to be a pedestrian equipped with a mobile device and explore the properties of opportunistic communication in the context of content dissemination in urban areas. The contributions of this thesis lie in three areas. We first study human mobility as one of the main enablers of opportunistic communication. We introduce traces collected from a realistic pedestrian mobility simulator and demonstrate that the performance of opportunistic networks is not very sensitive to the accurate estimation of the probability distributions of mobility parameters. However, capturing the space in which mobility occurs may be of high importance. Secondly, we design and implement a middleware for opportunistic content-centric networking, and we evaluate it via a small-scale testbed, as well as through extensive simulations. We conclude that energy-saving mechanisms should be part of the middleware design, while caching should be considered only as an add-on feature. Thirdly, we present and evaluate three different energy-saving mechanisms in the context of opportunistic networking: a dual-radio architecture, an asynchronous duty-cycling scheme, and an energy-aware algorithm which takes into account node selfishness. We evaluate our proposals analytically and via simulations. We demonstrate that when a critical mass of participants is available, the performance of the opportunistic network is comparable to downloading contents directly via the cellular network in terms of energy consumption while offloading large traffic volumes from the operator.<br><p>QC 20151120</p>
APA, Harvard, Vancouver, ISO, and other styles
10

Phe-Neau, Tiphaine. "Properties and Impact of Vicinity in Mobile Opportunistic Networks." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2014. http://tel.archives-ouvertes.fr/tel-00957864.

Full text
Abstract:
The networking paradigm uses new information vectors consisting of human carried devices is known as disruption-tolerant networks (DTN) or opportunistic networks. We identify the binary assertion issue in DTN. We notice how most DTNs mainly analyze nodes that are in contact. So all nodes that are not in contact are in intercontact. Nevertheless, when two nodes are not in contact, this does not mean that they are topologically far away from one another. We propose a formal definition of vicinities in DTNs and study the new resulting contact/intercontact temporal characterization. Then, we examine the internal organization of vicinities using the Vicinity Motion framework. We highlight movement types such as birth, death, and sequential moves. We analyze a number of their characteristics and extract vicinity usage directions for mobile networks. Based on the vicinity motion outputs and extracted directions, we build the TiGeR that simulates how pairs of nodes interact within their vicinities. Finally, we inquire about the possibilities of vicinity movement prediction in opportunistic networks. We expose a Vicinity Motion-based heuristic for pairwise shortest distance forecasting. We use two Vicinity Motion variants called AVM and SVM to collect vicinity information. We find that both heuristics perform quite well with performances up to 99% for SVM and around 40% for AVM.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Opportunistic mobile social networks"

1

Misra, Sudip, Barun Kumar Saha, and Sujata Pal. Opportunistic Mobile Networks. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29031-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mobile opportunistic networks: Architectures, protocols and applications. CRC Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Machinery, Association for Computing, and International Conference on Mobile Systems, Applications and Services (5th : 2007 : San Juan, P.R.), eds. MobiOpp '07: Proceedings of the First International MobiSys Workshop on Mobile Opportunistic Networking : San Juan, Puerto Rico, June 11, 2007. Association for Computing Machinery, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liang, Xiaohui, Rongxing Lu, Xiaodong Lin, and Xuemin Shen. Security and Privacy in Mobile Social Networks. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8857-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Su, Zhou, Qichao Xu, Kuan Zhang, and Xuemin Shen. Modeling and Optimization for Mobile Social Networks. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-47922-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Jiming. Data dissemination and query in mobile social networks. Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chen, Jiming, Jialu Fan, and Youxian Sun. Data Dissemination and Query in Mobile Social Networks. Springer US, 2012. http://dx.doi.org/10.1007/978-1-4614-2254-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

1962-, Ma Jianhua, ed. Mobile social networking and computing: A multidisciplinary integrated perspective. CRC Press, Taylor & Francis Group, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Travel connections: Tourism, technology, and togetherness in a mobile world. Routledge, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kiefer, Peter. Mobile intention recognition. Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Opportunistic mobile social networks"

1

Mao, Hualin, Mingjun Xiao, An Liu, Jianbo Li, and Yawei Hu. "OCC: Opportunistic Crowd Computing in Mobile Social Networks." In Database Systems for Advanced Applications. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-32055-7_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhou, Huan, Shouzhi Xu, and Chungming Huang. "Temporal Centrality Prediction in Opportunistic Mobile Social Networks." In Internet of Vehicles - Safe and Intelligent Mobility. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27293-1_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Asandei, Alexandru, Ciprian Dobre, and Matei Popovici. "Social-Based Routing with Congestion Avoidance in Opportunistic Networks." In Ad-hoc, Mobile, and Wireless Network. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39247-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ciobanu, Radu Ioan, Ciprian Dobre, and Valentin Cristea. "Social Aspects to Support Opportunistic Networks in an Academic Environment." In Ad-hoc, Mobile, and Wireless Networks. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31638-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mtibaa, Abderrahmen, Martin May, and Mostafa Ammar. "Social Forwarding in Mobile Opportunistic Networks: A Case of PeopleRank." In Handbook of Optimization in Complex Networks. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-0857-4_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tsai, Tzu-Chieh, Chien-Chun Han, and Shou-Yu Yen. "Collaborative Network Coding in Opportunistic Mobile Social Network." In Communications in Computer and Information Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48021-3_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yang, Yibo, and Honglin Zhao. "A Social Aware Routing Protocol with Multi-social Features in Opportunistic Mobile Social Networks." In Lecture Notes in Electrical Engineering. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-6571-2_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhu, Tieying, Cheng Wang, and Dandan Liu. "Community Roamer: A Social-Based Routing Algorithm in Opportunistic Mobile Networks." In Algorithms and Architectures for Parallel Processing. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11197-1_61.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sassi, Salma Ben, and Nicolas Le Sommer. "Towards an Opportunistic and Location-Aware Service Provision in Disconnected Mobile Ad Hoc Networks." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01802-2_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Qin, Xuening, Ljiljana Platisa, Tien Huu Do, et al. "Context-Based Analysis of Urban Air Quality Using an Opportunistic Mobile Sensor Network." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51005-3_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Opportunistic mobile social networks"

1

Leedham, James, and Thanassis Tiropanis. "Opportunistic social networks for academia." In 2011 Workshop on Mobile and Online Social Networks (MOSN). IEEE, 2011. http://dx.doi.org/10.1109/mosn.2011.6060785.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chaintreau, Augustin, Pierre Fraigniaud, and Emmanuelle Lebhar. "Opportunistic spatial gossip over mobile social networks." In the first workshop. ACM Press, 2008. http://dx.doi.org/10.1145/1397735.1397752.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mtibaa, Abderrahmen, and Khaled A. Harras. "Social-Based Trust in Mobile Opportunistic Networks." In 2011 20th International Conference on Computer Communications and Networks - ICCCN 2011. IEEE, 2011. http://dx.doi.org/10.1109/icccn.2011.6006047.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bigwood, Greg, and Tristan Henderson. "Bootstrapping opportunistic networks using social roles." In 2011 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM). IEEE, 2011. http://dx.doi.org/10.1109/wowmom.2011.5986139.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yunsheng Wang and Jie Wu. "Social-tie-based information dissemination in mobile opportunistic social networks." In 2013 IEEE 14th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM). IEEE, 2013. http://dx.doi.org/10.1109/wowmom.2013.6583411.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lenando, Halikul, Mohammad Nazim Jambli, Kartinah Zen, and Rajan Thangaveloo. "Forming a Social structure in mobile opportunistic networks." In 2011 IEEE 17th Asia-Pacific Conference on Communications (APCC). IEEE, 2011. http://dx.doi.org/10.1109/apcc.2011.6152851.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Junbao, Haojun Huang, Changlin Yang, Jizhao Liu, and Yinting Fan. "Destination-Aware Social Routing for Mobile Opportunistic Networks." In 2018 IEEE 20th International Conference on High Performance Computing and Communications; IEEE 16th International Conference on Smart City; IEEE 4th International Conference on Data Science and Systems (HPCC/SmartCity/DSS). IEEE, 2018. http://dx.doi.org/10.1109/hpcc/smartcity/dss.2018.00094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Huang, Rui, Bidi Ying, and Amiya Nayak. "Protecting location privacy in opportunistic mobile social networks." In NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium. IEEE, 2018. http://dx.doi.org/10.1109/noms.2018.8406248.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Yunsheng, Jie Wu, and Mingjun Xiao. "Hierarchical cooperative caching in mobile opportunistic social networks." In GLOBECOM 2014 - 2014 IEEE Global Communications Conference. IEEE, 2014. http://dx.doi.org/10.1109/glocom.2014.7036843.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bulut, Eyuphan, and Aashish Dhungana. "Social-Aware Energy Balancing in Mobile Opportunistic Networks." In 2020 16th International Conference on Distributed Computing in Sensor Systems (DCOSS). IEEE, 2020. http://dx.doi.org/10.1109/dcoss49796.2020.00064.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Opportunistic mobile social networks"

1

Chen, Ing-Ray, Fenye Bao, Moonjeong Chang, and Jin-Hee Cho. Integrated Social and QoS Trust-Based Routing in Mobile Ad Hoc Delay Tolerant Networks. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada532173.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Opportunistic mobile social networks' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography