• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 7
  • 2
  • 1
  • Tagged with
  • 15
  • 15
  • 15
  • 6
  • 4
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Trust in a decentralised mobile social network

Markides, Bradley Michael 31 August 2011 (has links)
M.Sc. / Social networks are evolving as mobile devices are able to establish direct communication with each other. The success of social networking sites such as FaceBook is prompting mobile phone vendors and operators to focus on providing a real human experience, as the presence of others who are in close proximity can be detected, enabling the formation of real as opposed to virtual friendships. Mobile devices are considered to be the next logical step in social networking, as they become more pervasive. Mobile social networking is a new movement in social networking, as people have membership of both a virtual community through an online social network environment, and a physical community where they are located. This research has the aim of extending the social networking experience between the virtual and physical worlds, to allow people to form real relationships with each other by using concepts from the virtual world. A move in mobile social networking is the decentralised exploration of friendships. Short-range wireless protocols like Bluetooth enable collaborative applications between mobile devices of users. Unlike conventional centralised social networks that rely upon a central authority to organise the opinions of each member of the social network and protect their personal information, members of a decentralised network are completely autonomous and responsible for their own individual behaviour. When people meet for the first time, they thus need help to determine if they can trust each other. The dissertation presents BlueTrust, a trust model for use in decentralised mobile social networks. The BlueFOAF prototype application demonstrates the operation of the BlueTrust mechanism. This application investigates the underlying technologies researched, as well as the implementation of BlueTrust to determine how others who are in close proximity can be trusted. It focuses on establishing trust between users by computing trust levels to support face-to-face user interaction.
2

Collaborative mobile services

Dong, Wei, active 2013 26 September 2013 (has links)
Mobile devices like smartphones and tablets are being adopted with unprecedented speed. The growth in demand and system complexity increasingly requires collaboration of multiple parties in order to achieve better functionality, efficiency, performance, etc. This poses unique challenges such as information sharing among different parties, utility sharing among different parties, and dishonest and collusive behaviors. Different mobile services may require different types of collaboration and involve different entities in the system. In this work we take a bottom-up approach by first looking at collaboration at the end user level, then the cross level collaboration and finally at the service provider level. Specifically, we first consider a completely distributed service: friend discovery in mobile social networks, where users of a mobile social network work together with each other to discover potential new friends nearby by computing their social proximity. We develop mathematically sound yet highly efficient approaches that simultaneously achieve privacy and verifiability. We then focus on cellular offloading where a cellular service provider seeks third party resource to offload cellular demand, as an example of cross level collaboration. We propose a reverse auction framework: iDEAL, which efficiently allocates cellular resource and third party resource in a joint optimization, effectively incentivize third party resource owners and mitigates dishonest and collusive behaviors. We validate our findings and approaches with real trace driven analysis and simulation, as well as real implementation. Finally we focus on collaboration at the service provider level and propose a double auction framework - DA². DA² allows cellular service providers to reallocate spectrum resource in a dynamic fashsion. It preserves all the desired economic properties. Compared with existing spectrum double auctions, DA² achieves higher efficiency, revenue, and spectrum resource utilization, due to its ability to more accurately capture the competition among buyers, which is characterized by a complex conflict graph. We evaluate DA² and demonstrate its superior performance via simulations on conflict graphs generated with real cell tower locations. / text
3

Providing Location-Privacy in Opportunistic Mobile Social Networks

Huang, Rui 03 April 2018 (has links)
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.
4

Content Dissemination in Mobile Social Networks

Kong, Chenguang 14 December 2016 (has links)
Mobile social networking(MSN) has emerged as an effective platform for social network users to pervasively disseminate the contents such as news, tips, book information, music, video and so on. In content dissemination, mobile social network users receive content or information from their friends, acquaintances or neighbors, and selectively forward the content or information to others. The content generators and receivers have different motivation and requirements to disseminate the contents according to the properties of the contents, which makes it a challenging and meaningful problem to effectively disseminate the content to the appropriate users. In this dissertation, the typical content dissemination scenarios in MSNs are investigated. According to the content properties, the corresponding user requirements are analyzed. First, a Bayesian framework is formulated to model the factors that influence users behavior on streaming video dissemination. An effective dissemination path detection algorithm is derived to detect the reliable and efficient video transmission paths. Second, the authorized content is investigated. We analyze the characteristics of the authorized content, and model the dissemination problem as a new graph problem, namely, Maximum Weighted Connected subgraph with node Quota (MWCQ), and propose two effective algorithms to solve it. Third, the authorized content dissemination problem in Opportunistic Social Networks(OSNs) is studied, based on the prediction of social connection pattern. We then analyze the influence of social connections on the content acquirement, and propose a novel approach, User Set Selection(USS) algorithm, to help social users to achieve fast and accurate content acquirement through social connections.
5

Opportunistic routing in intermittently connected wireless mobile social networks

Khosravi, Arian 07 May 2012 (has links)
Consumer electronics such as cellular phones and portable computers with short-range communication capabilities have enabled the large-scale information dissemination through user mobility and contact, without the assistance of communication infrastructures. In such a new communication paradigm, one challenge is to determine when and how to forward a message to the destination, possibly through a series of third parties. This problem has attracted a lot of attention in the literature lately, with proposals ranging from epidemic to single or multi-copy spray and wait or focus strategies. However most existing work assumed independent or identically distributed mobility. Observing most human mobility and interaction are interest-driven in the real world, in this research, we evaluate the performance of these schemes with an interest-driven mobility model. We further propose to take the user interest into account when determining routing strategies to further improve the performance of these schemes for mobile social networks. Simulation results have demonstrated the efficacy of the interest-aware routing strategies. / Graduate
6

Data Dissemination And Information Diffusion In Social Networks

Liu, Guoliang 15 December 2016 (has links)
Data dissemination problem is a challenging issue in social networks, especially in mobile social networks, which grows rapidly in recent years worldwide with a significant increasing number of hand-on mobile devices such as smart phones and pads. Short-range radio communications equipped in mobile devices enable mobile users to access their interested contents not only from access points of Internet but also from other mobile users. Through proper data dissemination among mobile users, the bandwidth of the short-range communications can be better utilized and alleviate the stress on the bandwidth of the cellular networks. In this dissertation proposal, data dissemination problem in mobile social networks is studied. Before data dissemination emerges in the research of mobile social networks, routing protocol of finding efficient routing path in mobile social networks was the focus, which later became the pavement for the study of the efficient data dissemination. Data dissemination priorities on packet dissemination from multiple sources to multiple destinations while routing protocol simply focus on finding routing path between two ends in the networks. The first works in the literature of data dissemination problem were based on the modification and improvement of routing protocols in mobile social networks. Therefore, we first studied and proposed a prediction-based routing protocol in delay tolerant networks. Delay tolerant network appears earlier than mobile social networks. With respect to delay tolerant networks, mobile social networks also consider social patterns as well as mobility patterns. In our work, we simply come up with the prediction-based routing protocol through analysis of user mobility patterns. We can also apply our proposed protocol in mobile social networks. Secondly, in literature, efficient data dissemination schemes are proposed to improve the data dissemination ratio and with reasonable overhead in the networks. However, the overhead may be not well controlled in the existing works. A social-aware data dissemination scheme is proposed in this dissertation proposal to study efficient data dissemination problem with controlled overhead in mobile social networks. The data dissemination scheme is based on the study on both mobility patterns and social patterns of mobile social networks. Thirdly, in real world cases, an efficient data dissemination in mobile social networks can never be realized if mobile users are selfish, which is true unfortunately in fact. Therefore, how to strengthen nodal cooperation for data dissemination is studied and a credit-based incentive data dissemination protocol is also proposed in this dissertation. Data dissemination problem was primarily researched on mobile social networks. When consider large social networks like online social networks, another similar problem was researched, namely, information diffusion problem. One specific problem is influence maximization problem in online social networks, which maximize the result of information diffusion process. In this dissertation proposal, we proposed a new information diffusion model, namely, sustaining cascading (SC) model to study the influence maximization problem and based on the SC model, we further plan our research work on the information diffusion problem aiming at minimizing the influence diffusion time with subject to an estimated influence coverage.
7

Security and Privacy Preservation in Mobile Social Networks

Liang, Xiaohui January 2013 (has links)
Social networking extending the social circle of people has already become an important integral part of our daily lives. As reported by ComScore, social networking sites such as Facebook and Twitter have reached 82 percent of the world's online population, representing 1.2 billion users around the world. In the meantime, fueled by the dramatic advancements of smartphones and the ubiquitous connections of Bluetooth/WiFi/3G/LTE networks, social networking further becomes available for mobile users and keeps them posted on the up-to-date worldwide news and messages from their friends and families anytime anywhere. The convergence of social networking, advanced smartphones, and stable network infrastructures brings us a pervasive and omnipotent communication platform, named mobile social network (MSN), helping us stay connected better than ever. In the MSN, multiple communication techniques help users to launch a variety of applications in multiple communication domains including single-user domain, two-user domain, user-chain domain, and user-star domain. Within different communication domains, promising mobile applications are fostered. For example, nearby friend search application can be launched in the two-user or user-chain domains to help a user find other physically-close peers who have similar interests and preferences; local service providers disseminate advertising information to nearby users in the user-star domain; and health monitoring enables users to check the physiological signals in the single-user domain. Despite the tremendous benefits brought by the MSN, it still faces many technique challenges among of which security and privacy protections are the most important ones as smartphones are vulnerable to security attacks, users easily neglect their privacy preservation, and mutual trust relationships are difficult to be established in the MSN. In this thesis, we explore the unique characteristics and study typical research issues of the MSN. We conduct our research with a focus on security and privacy preservation while considering human factors. Specifically, we consider the profile matching application in the two-user domain, the cooperative data forwarding in the user-chain domain, the trustworthy service evaluation application in the user-star domain, and the healthcare monitoring application in the single-user domain. The main contributions are, i) considering the human comparison behavior and privacy requirements, we first propose a novel family of comparison-based privacy-preserving profile matching (PPM) protocols. The proposed protocols enable two users to obtain comparison results of attribute values in their profiles, while the attribute values are not disclosed. Taking user anonymity requirement as an evaluation metric, we analyze the anonymity protection of the proposed protocols. From the analysis, we found that the more comparison results are disclosed, the less anonymity protection is achieved by the protocol. Further, we explore the pseudonym strategy and an anonymity enhancing technique where users could be self-aware of the anonymity risk level and take appropriate actions when needed; ii) considering the inherent MSN nature --- opportunistic networking, we propose a cooperative privacy-preserving data forwarding (PDF) protocol to help users forward data to other users. We indicate that privacy and effective data forwarding are two conflicting goals: the cooperative data forwarding could be severely interrupted or even disabled when the privacy preservation of users is applied, because without sharing personal information users become unrecognizable to each other and the social interactions are no longer traceable. We explore the morality model of users from classic social theory, and use game-theoretic approach to obtain the optimal data forwarding strategy. Through simulation results, we show that the proposed cooperative data strategy can achieve both the privacy preservation and the forwarding efficiency; iii) to establish the trust relationship in a distributed MSN is a challenging task. We propose a trustworthy service evaluation (TSE) system, to help users exchange their service reviews toward local vendors. However, vendors and users could be the potential attackers aiming to disrupt the TSE system. We then consider the review attacks, i.e., vendors rejecting and modifying the authentic reviews of users, and the Sybil attacks, i.e., users abusing their pseudonyms to generate fake reviews. To prevent these attacks, we explore the token technique, the aggregate signature, and the secret sharing techniques. Simulation results show the security and the effectiveness of the TSE system can be guaranteed; iv) to improve the efficiency and reliability of communications in the single-user domain, we propose a prediction-based secure and reliable routing framework (PSR). It can be integrated with any specific routing protocol to improve the latter's reliability and prevent data injection attacks during data communication. We show that the regularity of body gesture can be learned and applied by body sensors such that the route with the highest predicted link quality can always be chose for data forwarding. The security analysis and simulation results show that the PSR significantly increases routing efficiency and reliability with or without the data injection attacks.
8

Security and Privacy Preservation in Mobile Social Networks

Liang, Xiaohui January 2013 (has links)
Social networking extending the social circle of people has already become an important integral part of our daily lives. As reported by ComScore, social networking sites such as Facebook and Twitter have reached 82 percent of the world's online population, representing 1.2 billion users around the world. In the meantime, fueled by the dramatic advancements of smartphones and the ubiquitous connections of Bluetooth/WiFi/3G/LTE networks, social networking further becomes available for mobile users and keeps them posted on the up-to-date worldwide news and messages from their friends and families anytime anywhere. The convergence of social networking, advanced smartphones, and stable network infrastructures brings us a pervasive and omnipotent communication platform, named mobile social network (MSN), helping us stay connected better than ever. In the MSN, multiple communication techniques help users to launch a variety of applications in multiple communication domains including single-user domain, two-user domain, user-chain domain, and user-star domain. Within different communication domains, promising mobile applications are fostered. For example, nearby friend search application can be launched in the two-user or user-chain domains to help a user find other physically-close peers who have similar interests and preferences; local service providers disseminate advertising information to nearby users in the user-star domain; and health monitoring enables users to check the physiological signals in the single-user domain. Despite the tremendous benefits brought by the MSN, it still faces many technique challenges among of which security and privacy protections are the most important ones as smartphones are vulnerable to security attacks, users easily neglect their privacy preservation, and mutual trust relationships are difficult to be established in the MSN. In this thesis, we explore the unique characteristics and study typical research issues of the MSN. We conduct our research with a focus on security and privacy preservation while considering human factors. Specifically, we consider the profile matching application in the two-user domain, the cooperative data forwarding in the user-chain domain, the trustworthy service evaluation application in the user-star domain, and the healthcare monitoring application in the single-user domain. The main contributions are, i) considering the human comparison behavior and privacy requirements, we first propose a novel family of comparison-based privacy-preserving profile matching (PPM) protocols. The proposed protocols enable two users to obtain comparison results of attribute values in their profiles, while the attribute values are not disclosed. Taking user anonymity requirement as an evaluation metric, we analyze the anonymity protection of the proposed protocols. From the analysis, we found that the more comparison results are disclosed, the less anonymity protection is achieved by the protocol. Further, we explore the pseudonym strategy and an anonymity enhancing technique where users could be self-aware of the anonymity risk level and take appropriate actions when needed; ii) considering the inherent MSN nature --- opportunistic networking, we propose a cooperative privacy-preserving data forwarding (PDF) protocol to help users forward data to other users. We indicate that privacy and effective data forwarding are two conflicting goals: the cooperative data forwarding could be severely interrupted or even disabled when the privacy preservation of users is applied, because without sharing personal information users become unrecognizable to each other and the social interactions are no longer traceable. We explore the morality model of users from classic social theory, and use game-theoretic approach to obtain the optimal data forwarding strategy. Through simulation results, we show that the proposed cooperative data strategy can achieve both the privacy preservation and the forwarding efficiency; iii) to establish the trust relationship in a distributed MSN is a challenging task. We propose a trustworthy service evaluation (TSE) system, to help users exchange their service reviews toward local vendors. However, vendors and users could be the potential attackers aiming to disrupt the TSE system. We then consider the review attacks, i.e., vendors rejecting and modifying the authentic reviews of users, and the Sybil attacks, i.e., users abusing their pseudonyms to generate fake reviews. To prevent these attacks, we explore the token technique, the aggregate signature, and the secret sharing techniques. Simulation results show the security and the effectiveness of the TSE system can be guaranteed; iv) to improve the efficiency and reliability of communications in the single-user domain, we propose a prediction-based secure and reliable routing framework (PSR). It can be integrated with any specific routing protocol to improve the latter's reliability and prevent data injection attacks during data communication. We show that the regularity of body gesture can be learned and applied by body sensors such that the route with the highest predicted link quality can always be chose for data forwarding. The security analysis and simulation results show that the PSR significantly increases routing efficiency and reliability with or without the data injection attacks.
9

Contextualisation of instructional time utilising mobile social networks for learning efficiency: a participatory action research study for technical vocational education and training learners in South Africa

Dzvapatsva, Godwin Pedzisai 20 January 2021 (has links)
Despite the fact that some studies have shown a connection between learning efficiency and instructional time, there is lack of research that has been carried out within the Technical Vocational Education and Training sector with a particular focus on National Certificate Vocational programmes. To fill this gap, the current study utilised WhatsApp, an instance of a Mobile Social Network, in extending instructional time beyond the normal lecturing timetables with the objective of improving learning efficiency for NCV learners studying Computer Programming as a subject. To achieve the objective, a pragmatic approach was adopted in carrying out a participatory action research project. Qualitative data and quantitative data were collected concurrently in three phases using semi-structured interviews, questionnaire and documents. Thematic analyses and statistical analyses were applied to the data collected from five colleges in the Western Cape Province of South Africa. The findings of the study highlighted multiple issues: Firstly, awareness of instructional time phenomena was very minimal from the lecturers and the learners. Secondly, there were no formal interventions in place to recover or extend instructional time beyond the traditional college boundaries. In overall, the implementation of WhatsApp was well-supported at the five locations. However, statistical results from the five locations after implementation of the intervention were mixed. Results indicated an overall pass rate of 69.2% (n=54) of the total number of learners (N=78) who sat for the final examination. While pass rates at each of the other four locations was above 50%, the pass rate of the fifth location was considerably low (37%). The study generated three contributions to knowledge: practical, theoretical and methodological. Firstly, through the study, practical interventions were generated to assist learners outside the classes. Secondly, the thesis generated propositions from data and an integrated Mobile Social Network framework was developed which is expected to be a useful course of action for lecturers who want to improve learning efficiency through extending instructional time. A key methodological contribution has been the application of mixed methods choices in the collection, analyses of data and interpretation of results.
10

Designing Efficient Routing Protocols in Delay Tolerant Networks

Wang, Yunsheng January 2013 (has links)
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. / Computer and Information Science

Page generated in 0.0874 seconds