A Trust-Based Relay Selection Approach to the Multi-Hop Network Formation Problem in Cognitive Radio Networks

One of the major challenges for today’s wireless communications is to meet the growing demand for supporting an increasing diversity of wireless applications with limited spectrum resource. In cooperative communications and networking, users share resources and collaborate in a distributed approach, similar to entities of active social groups in self organizational communities. Users’ information may be shared by the user and also by the cooperative users, in distributed transmission. Cooperative communications and networking is a fairly new communication paradigm that promises significant capacity and multiplexing gain increase in wireless networks. This research will provide a cooperative relay selection framework that exploits the similarity of cognitive radio networks to social networks. It offers a multi-hop, reputation-based power control game for routing. In this dissertation, a social network model provides a humanistic approach to predicting relay selection and network analysis in cognitive radio networks

Spectrum Trading: An Abstracted Bibliography

This document contains a bibliographic list of major papers on spectrum trading and their abstracts. The aim of the list is to offer researchers entering this field a fast panorama of the current literature. The list is continually updated on the webpage \url{http://www.disp.uniroma2.it/users/naldi/Ricspt.html}. Omissions and papers suggested for inclusion may be pointed out to the authors through e-mail (\textit{[email protected]})

A game theory control scheme in medium access for wireless body area network

Wireless Body Area Network (WBAN) has been considered for applications in medical, healthcare and sports fields. Although there are several protocols for wireless personal area networks, specific features and reliability requirements in WBAN bring new challenges in protocol design. An appropriate control scheme in the MAC layer can make a significant improvement in network performance. Based on traffic priority and prior knowledge this paper proposes a game theoretical framework to smartly control access in contention period and contention free period as defined in IEEE 802.15.6 standard. The coordinator controls access probability of contention period based on users' priority in CSMA/CA and allocates suitable slots with strategies for best payoff based on link states in guaranteed time slots (GTS). The simulation results show the improved performance especially in heavily loaded channel condition when the optimal control mode is applied

A survey on pseudonym changing strategies for Vehicular Ad-Hoc Networks

The initial phase of the deployment of Vehicular Ad-Hoc Networks (VANETs) has begun and many research challenges still need to be addressed. Location privacy continues to be in the top of these challenges. Indeed, both of academia and industry agreed to apply the pseudonym changing approach as a solution to protect the location privacy of VANETs'users. However, due to the pseudonyms linking attack, a simple changing of pseudonym shown to be inefficient to provide the required protection. For this reason, many pseudonym changing strategies have been suggested to provide an effective pseudonym changing. Unfortunately, the development of an effective pseudonym changing strategy for VANETs is still an open issue. In this paper, we present a comprehensive survey and classification of pseudonym changing strategies. We then discuss and compare them with respect to some relevant criteria. Finally, we highlight some current researches, and open issues and give some future directions

A Comprehensive Survey of Data Mining-based Fraud Detection Research

This survey paper categorises, compares, and summarises from almost all published technical and review articles in automated fraud detection within the last 10 years. It defines the professional fraudster, formalises the main types and subtypes of known fraud, and presents the nature of data evidence collected within affected industries. Within the business context of mining the data to achieve higher cost savings, this research presents methods and techniques together with their problems. Compared to all related reviews on fraud detection, this survey covers much more technical articles and is the only one, to the best of our knowledge, which proposes alternative data and solutions from related domains.Comment: 14 page

A Game Theoretic Optimization of RPL for Mobile Internet of Things Applications

The presence of mobile nodes in any wireless network can affect the performance of the network, leading to higher packet loss and increased energy consumption. However, many recent applications require the support of mobility and an efficient approach to handle mobile nodes is essential. In this paper, a game scenario is formulated where nodes compete for network resources in a selfish manner, to send their data packets to the sink node. Each node counts as a player in the noncooperative game. The optimal solution for the game is found using the unique Nash equilibrium (NE) where a node cannot improve its pay-off function while other players use their current strategy. The proposed solution aims to present a strategy to control different parameters of mobile nodes (or static nodes in a mobile environment) including transmission rate, timers and operation mode in order to optimize the performance of RPL under mobility in terms of packet delivery ratio (PDR), throughput, energy consumption and end-to-end-delay. The proposed solution monitors the mobility of nodes based on received signal strength indication (RSSI) readings, it also takes into account the priorities of different nodes and the current level of noise in order to select the preferred transmission rate. An optimized protocol called game-theory based mobile RPL (GTM-RPL) is implemented and tested in multiple scenarios with different network requirements for Internet of Things applications. Simulation results show that in the presence of mobility, GTM-RPL provides a flexible and adaptable solution that improves throughput whilst maintaining lower energy consumption showing more than 10% improvement compared to related work. For applications with high throughput requirements, GTM-RPL shows a significant advantage with more than 16% improvement in throughput and 20% improvement in energy consumption

PROTECT: Proximity-based Trust-advisor using Encounters for Mobile Societies

Many interactions between network users rely on trust, which is becoming particularly important given the security breaches in the Internet today. These problems are further exacerbated by the dynamics in wireless mobile networks. In this paper we address the issue of trust advisory and establishment in mobile networks, with application to ad hoc networks, including DTNs. We utilize encounters in mobile societies in novel ways, noticing that mobility provides opportunities to build proximity, location and similarity based trust. Four new trust advisor filters are introduced - including encounter frequency, duration, behavior vectors and behavior matrices - and evaluated over an extensive set of real-world traces collected from a major university. Two sets of statistical analyses are performed; the first examines the underlying encounter relationships in mobile societies, and the second evaluates DTN routing in mobile peer-to-peer networks using trust and selfishness models. We find that for the analyzed trace, trust filters are stable in terms of growth with time (3 filters have close to 90% overlap of users over a period of 9 weeks) and the results produced by different filters are noticeably different. In our analysis for trust and selfishness model, our trust filters largely undo the effect of selfishness on the unreachability in a network. Thus improving the connectivity in a network with selfish nodes. We hope that our initial promising results open the door for further research on proximity-based trust