A personal networking solution

This paper presents an overview of research being conducted on Personal Networking Solutions within the Mobile VCE Personal Distributed Environment Work Area. In particular it attempts to highlight areas of commonality with the MAGNET initiative. These areas include trust of foreign devices and service providers, dynamic real-time service negotiation to permit context-aware service delivery, an automated controller algorithm for wireless ad hoc networks, and routing protocols for ad hoc networking environments. Where possible references are provided to Mobile VCE publications to enable further reading

Secured Scheme for Privacy Preserving and Node Authentication Mechanism for a Special Mobile Ad hoc Network

Opportunistic networks are a special type of Mobile Ad hoc network which are wirelessly interlinked nodes with the absence of end to end connectivity. All nodes in an opportunistic network are free to move in an environment. Due to the high degree of mobility of nodes, opportunistic networks differ significantly from the existing traditional networks and it works on store, carry &forward mechanism in which, each node has a communication range. Within its proximity, if any node comes, it can send and receive messages. In an opportunistic network, there is no proper infrastructure available for communication and node have limited storage and computational capabilities. The major problem being faced in an opportunistic network is the identification of normal and malicious nodes because due to the open nature of the opportunistic network, malicious nodes also can join the network and perform some malicious activities like Sybil attack. We propose a remedy to address the authentication and privacy issue that can arise in an opportunistic network. According to the findings of the simulation, the proposed research work satisfies the authentication and privacy criteria of an opportunistic network

Opportunistic mobile social networks: architecture, privacy, security issues and future directions

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

A Taxonomy on Misbehaving Nodes in Delay Tolerant Networks

Delay Tolerant Networks (DTNs) are type of Intermittently Connected Networks (ICNs) featured by long delay, intermittent connectivity, asymmetric data rates and high error rates. DTNs have been primarily developed for InterPlanetary Networks (IPNs), however, have shown promising potential in challenged networks i.e. DakNet, ZebraNet, KioskNet and WiderNet. Due to unique nature of intermittent connectivity and long delay, DTNs face challenges in routing, key management, privacy, fragmentation and misbehaving nodes. Here, misbehaving nodes i.e. malicious and selfish nodes launch various attacks including flood, packet drop and fake packets attack, inevitably overuse scarce resources (e.g., buffer and bandwidth) in DTNs. The focus of this survey is on a review of misbehaving node attacks, and detection algorithms. We firstly classify various of attacks depending on the type of misbehaving nodes. Then, detection algorithms for these misbehaving nodes are categorized depending on preventive and detective based features. The panoramic view on misbehaving nodes and detection algorithms are further analyzed, evaluated mathematically through a number of performance metrics. Future directions guiding this topic are also presented

Novel Cross Optimization based Trusted and Opportunistic Routing Scheme in Wireless Sensor Network

Opportunistic routing in wireless networks under mobile computing domain is one of the point of attraction for the research. Consistency along with routing security are the challenges faced by many old schemes which results performance to be compromised. However the existing techniques developed for effective routing are cost effective without the concern for the exact positioning of nodes in the network but while designing the scheme, security still requires attention. A novel cross optimization based trusted and opportunistic routing scheme for WSN is proposed in this paper which is referred as Unified Trusted and Optimized Routing (UTOR) scheme. The prime intention of UTOR is to realize optimized data movement along with routing and data security. UTOR functions in two stages, the first stage recognizes and unites the unified nodes depending on defined liberal constant(LC) which has definite trust,  link stability, and quality components. Definite trust as well as link stability can be measured directly but time to live and the associated delay are considered for measuring the quality. Whereas in second stage optimized nodes selection takes place with the help of proposed UTOR over defined proclivity function(PF) based on definite_trust(DT), link_stability (LS), quality_of_node(QN) and distance. Proposed UTOR’s performance is evaluated based on performance measures for Ad-Hoc sensor network of varying range of dynamic nodes in the presence of black_hole and DoS attacks. UTOR exposes relatively superior throughput and detection rate at the same time showcases minimal distance and delay, which are comparatively better than competing schemes. Significantly higher throughput and detection_rate as 44.1 and 55.7 respectively alongside low distance and delay as 168.2 and 13 are shown by UTOR which are comparatively better performance parameters than competing schemes. UTOR’s effective use in WSN may be under real-time scenarios such as environmental monitoring, smart farming, automation industries etc

A Neighborhood-Based Trust Protocol for Secure Collaborative Routing in Wireless Mobile D2D HetNets

Heterogeneous Device-to-Device mobile networks are characterised by frequent network disruption and unreliability of peers delivering messages to destinations. Trust-based protocols has been widely used to mitigate the security and performance problems in D2D networks. Despite several efforts made by previous researchers in the design of trust-based routing for efficient collaborative networks, there are fewer related studies that focus on the peers’ neighbourhood as a routing metrics’ element for a secure and efficient trust-based protocol. In this paper, we propose and validate a trust-based protocol that takes into account the similarity of peers’ neighbourhood coefficients to improve routing performance in mobile HetNets environments. The results of this study demonstrate that peers’ neighborhood connectivity in the network is a characteristic that can influence peers’ routing performance. Furthermore, our analysis shows that our proposed protocol only forwards the message to the companions with a higher probability of delivering the packets, thus improving the delivery ratio and minimizing latency and mitigating the problem of malicious peers ( using packet dropping strategy)