52 research outputs found
Recent Advances in Cellular D2D Communications
Device-to-device (D2D) communications have attracted a great deal of attention from researchers in recent years. It is a promising technique for offloading local traffic from cellular base stations by allowing local devices, in physical proximity, to communicate directly with each other. Furthermore, through relaying, D2D is also a promising approach to enhancing service coverage at cell edges or in black spots. However, there are many challenges to realizing the full benefits of D2D. For one, minimizing the interference between legacy cellular and D2D users operating in underlay mode is still an active research issue. With the 5th generation (5G) communication systems expected to be the main data carrier for the Internet-of-Things (IoT) paradigm, the potential role of D2D and its scalability to support massive IoT devices and their machine-centric (as opposed to human-centric) communications need to be investigated. New challenges have also arisen from new enabling technologies for D2D communications, such as non-orthogonal multiple access (NOMA) and blockchain technologies, which call for new solutions to be proposed. This edited book presents a collection of ten chapters, including one review and nine original research works on addressing many of the aforementioned challenges and beyond
Radio Resource Management for Unmanned Aerial Vehicle Assisted Wireless Communications and Networking
In recent years, employing unmanned aerial vehicles (UAVs) as aerial communication platforms or users is envisioned as a promising solution to enhance the performance of the existing wireless communication systems. However, applying UAVs for information technology applications also introduces many new challenges.
This thesis focuses on the UAV-assisted wireless communication and networking, and aims to address the challenges through exploiting and designing efficient radio resource management methods. Specifically, four research topics are studied in this thesis. Firstly, to address the constraint of network heterogeneity and leverage the benefits of diversity of UAVs, a hierarchical air-ground heterogeneous network architecture enabled by software defined networking is proposed, which integrates both high and low altitude platforms into conventional terrestrial networks to provide additional capacity enhancement and expand the coverage of current network systems. Secondly, to address the constraint of link disconnection and guarantee the reliable communications among UAVs as aerial user equipment to perform sensing tasks, a robust resource allocation scheme is designed while taking into account the dynamic features and different requirements for different UAV transmission connections. Thirdly, to address the constraint of privacy and security threat and motivate the spectrum sharing between cellular and UAV operators, a blockchain-based secure spectrum trading framework is constructed where mobile network operators and UAV operators can share spectrum in a distributed and trusted environment based on blockchain technology to protect users' privacy and data security. Fourthly, to address the constraint of low endurance of UAV and prolong its flight time as an aerial base station for delivering communication coverage in a disaster area, an energy efficiency maximization problem jointly optimizing user association, UAV's transmission power and trajectory is studied in which laser charging is exploited to supply sustainable energy to enable the UAV to operate in the sky for a long time
Integrating Blockchain and Fog Computing Technologies for Efficient Privacy-preserving Systems
This PhD dissertation concludes a three-year long research journey on the integration of Fog Computing and Blockchain technologies. The main aim of such integration is to address the challenges of each of these technologies, by integrating it with the other. Blockchain technology (BC) is a distributed ledger technology in the form of a distributed transactional database, secured by cryptography, and governed by a consensus mechanism. It was initially proposed for decentralized cryptocurrency applications with practically proven high robustness. Fog Computing (FC) is a geographically distributed computing architecture, in which various heterogeneous devices at the edge of network are ubiquitously connected to collaboratively provide elastic computation services. FC provides enhanced services closer to end-users in terms of time, energy, and network load. The integration of FC with BC can result in more efficient services, in terms of latency and privacy, mostly required by Internet of Things systems
Wireless social networks: a survey of recent advances, applications and challenges
With the ubiquitous use of smartphones and other connected pieces of equipment, the number of devices connected to the Internet is exponentially growing. This will test the efficiency of the envisioned 5G network architectures for data acquisition and its storage. It is a common observation that the communication between smart devices is typically influenced by their social relationship. This suggests that the theory of social networks can be leveraged to improve the quality of service for such communication links. In fact, the social networking concepts of centrality and community have been investigated for an efficient realization of novel wireless network architectures. This work provides a comprehensive introduction to social networks and reviews the recent literature on the application of social networks in wireless communications. The potential challenges in communication network design are also highlighted, for a successful implementation of social networking strategies. Finally, some future directions are discussed for the application of social networking strategies to emerging wireless technologies such as non-orthogonal multiple access and visible light communications
A patient agent controlled customized blockchain based framework for internet of things
Although Blockchain implementations have emerged as revolutionary technologies for various industrial applications including cryptocurrencies, they have not been widely deployed to store data streaming from sensors to remote servers in architectures known as Internet of Things. New Blockchain for the Internet of Things models promise secure solutions for eHealth, smart cities, and other applications. These models pave the way for continuous monitoring of patient’s physiological signs with wearable sensors to augment traditional medical practice without recourse to storing data with a trusted authority. However, existing Blockchain algorithms cannot accommodate the huge volumes, security, and privacy requirements of health data. In this thesis, our first contribution is an End-to-End secure eHealth architecture that introduces an intelligent Patient Centric Agent. The Patient Centric Agent executing on dedicated hardware manages the storage and access of streams of sensors generated health data, into a customized Blockchain and other less secure repositories. As IoT devices cannot host Blockchain technology due to their limited memory, power, and computational resources, the Patient Centric Agent coordinates and communicates with a private customized Blockchain on behalf of the wearable devices. While the adoption of a Patient Centric Agent offers solutions for addressing continuous monitoring of patients’ health, dealing with storage, data privacy and network security issues, the architecture is vulnerable to Denial of Services(DoS) and single point of failure attacks. To address this issue, we advance a second contribution; a decentralised eHealth system in which the Patient Centric Agent is replicated at three levels: Sensing Layer, NEAR Processing Layer and FAR Processing Layer. The functionalities of the Patient Centric Agent are customized to manage the tasks of the three levels. Simulations confirm protection of the architecture against DoS attacks. Few patients require all their health data to be stored in Blockchain repositories but instead need to select an appropriate storage medium for each chunk of data by matching their personal needs and preferences with features of candidate storage mediums. Motivated by this context, we advance third contribution; a recommendation model for health data storage that can accommodate patient preferences and make storage decisions rapidly, in real-time, even with streamed data. The mapping between health data features and characteristics of each repository is learned using machine learning. The Blockchain’s capacity to make transactions and store records without central oversight enables its application for IoT networks outside health such as underwater IoT networks where the unattended nature of the nodes threatens their security and privacy. However, underwater IoT differs from ground IoT as acoustics signals are the communication media leading to high propagation delays, high error rates exacerbated by turbulent water currents. Our fourth contribution is a customized Blockchain leveraged framework with the model of Patient-Centric Agent renamed as Smart Agent for securely monitoring underwater IoT. Finally, the smart Agent has been investigated in developing an IoT smart home or cities monitoring framework. The key algorithms underpinning to each contribution have been implemented and analysed using simulators.Doctor of Philosoph
Recommended from our members
Fair relay selection in wireless rural networks using game theory
Access to Internet is the key to facilitate the economic growth and development of the rural communities and to bridge the digital-divide between the urban and rural population. The traditional broadband access technologies are not always suitable for the rural areas due to their difficult topography and sparsely populated communities. Specialized relay stations can be deployed to extend the coverage of a wireless rural network but they come with an inherited increase in the infrastructural cost. An alternative is to utilize the in-range users as relays to enhance the coverage range of the wireless rural network.
In this thesis, the in-range ordinary users termed as primary users (PUs) are used to act as relays for the out-of-range users called the secondary users (SUs). Two relay selection solutions, the Fair Battery Power Consumption (FBPC) algorithm and the Credit based Fair Relay Selection (CF-RS) protocol have been proposed with the aim of providing fair chance to every PU to assist the SUs, thus resulting in fair utilization of battery power of all relays along with the coverage extension. The FBPC algorithm uses the concept of proportional fairness as the relay selection criterion. However, if only proportionally fair consumption of battery power is taken as the relay selection parameter, the FBPC algorithm may result in selecting relays with poor channel conditions. The rural network may also consist of selfish PUs which need to be incentivized to use their resources for the SUs. The CF-RS protocol is developed which takes into account both the achievable data rate and consumption of battery power for selection of a relay. The CF-RS protocol is formulated using Stackelberg game which employs a credit-based incentive mechanism to motivate the self-interested PUs to help the SUs by providing instantaneous as well as long term benefit to the PUs.
A basic network model consisting of PUs and SUs has been simulated and the performance of the FBPC algorithm and the CF-RS protocol have been evaluated in terms of data rate and utility achievable at the SUs, dissipation of battery power of the PUs and Jain’s fairness index to determine fairness in utilization of battery power. The results obtained show that the FBPC algorithm achieves approximately 100% fairness for utilization of battery power of relays but compromises the data rate attainable by the SUs. Thus the FBPC algorithm shall be viewed as a trade-off between the fair battery power dissipation of relays and the data rate achievable by the SUs. Whereas, the CF-RS protocol provides 55% better utility and longer service time to the SUs without harming the attainable data rate and achieves 80% fairness. When the CF-RS protocol is used for relay selection, it is advantageous even for the self-interested users to participate in the relaying process to earn some benefit to utilize it when needed to buy assistance from other users
BNAIC 2008:Proceedings of BNAIC 2008, the twentieth Belgian-Dutch Artificial Intelligence Conference
Advances in Information Security and Privacy
With the recent pandemic emergency, many people are spending their days in smart working and have increased their use of digital resources for both work and entertainment. The result is that the amount of digital information handled online is dramatically increased, and we can observe a significant increase in the number of attacks, breaches, and hacks. This Special Issue aims to establish the state of the art in protecting information by mitigating information risks. This objective is reached by presenting both surveys on specific topics and original approaches and solutions to specific problems. In total, 16 papers have been published in this Special Issue
Recommended from our members
Characterizing and Leveraging Social Phenomena in Online Networks
Social phenomena have been studied extensively in small scales by social scientists. With the increasing popularity of Web 2.0 and online social networks/media, a large amount of data on social phenomena have become available. In this dissertation we study online social phenomena such as social influence in social networks in various contexts.
This dissertation has two major components: 1. Identifying and characterizing online social phenomena 2. Leveraging online social phenomena for economic and commercial purposes.
We begin the dissertation by developing multi-level revenue sharing schemes for viral marketing on social networks. Viral marketing leverages social influence among users of the social network. For our proposed models, we develop results on the computational complexity, individual rationality, and potential reach of employing the Shapley value as a revenue sharing scheme. Our results indicate that under the multi-level tree-based propagation model, the Shapley value is a promising scheme for revenue sharing, whereas under other models there are computational or incentive compatibility issues that remain open.
We continue with another application of social influence: social advertising. Social advertising is a new paradigm that is utilized by online social networks. Social advertising is based in the premise that social influence can be leveraged to place ads more efficiently. The goal of our work is to understand how social ads can affect click-through rates in social networks. We propose a formal model for social ads in the context of display advertising. In our model, ads are shown to users one after the other. The probability of a user clicking an ad depends on the users who have clicked this ad so far. This information is presented to users as a social cue, thus the click probability is a function of this cue. We introduce the social display optimization problem: suppose an advertiser has a contract with a publisher for showing some number (say B) impressions of an ad. What strategy should the publisher use to show these ads so as to maximize the expected number of clicks? We show hardness results for this problem and in light of the general hardness results, we develop heuristic algorithms and compare them to natural baseline ones.
We then study distributed content curation on the Web. In recent years readers have turned to the social web to consume content. In other words, they rely on their social network to curate content for them as opposed to the more traditional way of relying on news editors for this purpose -- this is an implicit consequence of social influence as well. We study how efficient this is for users with limited budgets of attention. We model distributed content curation as a reader-publisher game and show various results. Our results imply that in the complete information setting, when publishers maximize their utility selfishly, distributed content curation reaches an equilibrium which is efficient, that is, the social welfare is a constant factor of that under an optimal centralized curation.
Next, we initiate the study of an exchange market problem without money that is a natural generalization of the well-studied kidney exchange problem. From the practical point of view, the problem is motivated by barter websites on the Internet, e.g., swap.com, and u-exchange.com. In this problem, the users of the social network wish to exchange items with each other. A mechanism specifies for each user a set of items that she gives away, and a set of items that she receives. Consider a set of agents where each agent has some items to offer, and wishes to receive some items from other agents. Each agent would like to receive as many items as possible from the items that she wishes, that is, her utility is equal to the number of items that she receives and wishes. However, she will have a large dis-utility if she gives away more items than what she receives, because she considers such a trade to be unfair. To ensure voluntary participation (also known as individual rationality), we require the mechanism to avoid this. We consider different variants of this problem: with and without a constraint on the length of the exchange cycles and show different results including their truthfulness and individual rationality.
In the other main component of this thesis, we study and characterize two other social phenomena: 1. friends vs. the crowd and 2. altruism vs. reciprocity in social networks. More specifically, we study how a social network user's actions are influenced by her friends vs. the crowd's opinion. For example, in social rating websites where both ratings from friends and average ratings from everyone is available, we study how similar one's ratings are to each other. In the next part, we aim to analyze the motivations behind users' actions on online social media over an extended period of time. We look specifically at users' likes, comments and favorite markings on their friends' posts and photos. Most theories of why people exhibit prosocial behavior isolate two distinct motivations: Altruism and reciprocity. In our work, we focus on identifying the underlying motivations behind users' prosocial giving on social media. In particular, our goal is to identify if the motivation is altruism or reciprocity. For that purpose, we study two datasets of sequence of users' actions on social media: a dataset of wall posts by users of Facebook.com, and another dataset of favorite markings by users of Flickr.com. We study the sequence of users' actions in these datasets and provide several observations on patterns related to their prosocial giving behavior
- …