SocialRouting: The social-based routing algorithm for Delay Tolerant Networks

Delay and Disruptive Tolerant Networks (DTN) are relatively a new networking concept that could provide a robust communication in wide range of implementations from the space to battlefield or other military usage. However in such dynamic networks, which could be considered as a set of intermittently connected nodes, message forwarding strategy is a key issue. Existing routing solutions concentrate mainly on two major routing families flooding and knowledge based algorithms. This paper presents SocialRouting - the social-based routing algorithm designed for DTN. The use of the social properties of wireless mobile nodes is the novel way of message routing that is based on message ferrying between separated parts of the network. Proposed idea has been extensively tested using simulation tools. The simulations were made based on especially designed for measurements in DTN scenarios and compared with popular solutions

On exploiting priority relation graph for reliable multi-path communication in mobile social networks

© 2018 Elsevier Inc. A mobile social network (MSN) consists of certain amount of mobile users with social characteristics, and it provides data delivery concerning social relationships between mobile users. In MSN, ordinary people contact each other more frequently if they have more social features in common. In this paper, we apply a new topology structure–priority relation graph (PRG) to evaluate the data delivery routing in MSN on the system-level. By using the natural order of nodes’ representation, the diameter, the regular degree and the multi-path technology, we determine the priority relation graph-based social feature routing (PRG-SFR) algorithm to find disjointed multi-paths in MSN. Here, the multi-path technology can be exploited for ensuring that, between each pair of sender and receiver, the important information can be delivered through a highly reliable path. Then we calculate the tolerant ability of ‘faults’ and estimate the availability of MSN on the theoretical level. Finally, we analyze the efficiency of PRG-SFR algorithm from the numerical standpoint in terms of fault tolerance, forwarding number, transmission time and delivery rate. Moreover, we make comparisons between PRG-SFR algorithm and certain state-of-the-art technologies

Joint Head Selection and Airtime Allocation for Data Dissemination in Mobile Social Networks

Mobile social networks (MSNs) enable people with similar interests to interact without Internet access. By forming a temporary group, users can disseminate their data to other interested users in proximity with short-range communication technologies. However, due to user mobility, airtime available for users in the same group to disseminate data is limited. In addition, for practical consideration, a star network topology among users in the group is expected. For the former, unfair airtime allocation among the users will undermine their willingness to participate in MSNs. For the latter, a group head is required to connect other users. These two problems have to be properly addressed to enable real implementation and adoption of MSNs. To this aim, we propose a Nash bargaining-based joint head selection and airtime allocation scheme for data dissemination within the group. Specifically, the bargaining game of joint head selection and airtime allocation is first formulated. Then, Nash bargaining solution (NBS) based optimization problems are proposed for a homogeneous case and a more general heterogeneous case. For both cases, the existence of solution to the optimization problem is proved, which guarantees Pareto optimality and proportional fairness. Next, an algorithm, allowing distributed implementation, for join head selection and airtime allocation is introduced. Finally, numerical results are presented to evaluate the performance, validate intuitions and derive insights of the proposed scheme

Two-tier Intrusion Detection System for Mobile Ad Hoc Networks

Nowadays, a commonly used wireless network (i.e. Wi-Fi) operates with the aid of a fixed infrastructure (i.e. an access point) to facilitate communication between nodes when they roam from one location to another. The need for such a fixed supporting infrastructure limits the adaptability of the wireless network, especially in situations where the deployment of such an infrastructure is impractical. In addition, Wi-Fi limits nodes' communication as it only provides facility for mobile nodes to send and receive information, but not reroute the information across the network. Recent advancements in computer network introduced a new wireless network, known as a Mobile Ad Hoc Network (MANET), to overcome these limitations. MANET has a set of unique characteristics that make it different from other kind of wireless networks. Often referred as a peer to peer network, such a network does not have any fixed topology, thus nodes are free to roam anywhere, and could join or leave the network anytime they desire. Its ability to be setup without the need of any infrastructure is very useful, especially in geographically constrained environments such as in a military battlefield or a disaster relief operation. In addition, through its multi hop routing facility, each node could function as a router, thus communication between nodes could be made available without the need of a supporting fixed router or an access point. However, these handy facilities come with big challenges, especially in dealing with the security issues. This research aims to address MANET security issues by proposing a novel intrusion detection system that could be used to complement existing prevention mechanisms that have been proposed to secure such a network. A comprehensive analysis of attacks and the existing security measures proved that there is a need for an Intrusion Detection System (IDS) to protect MANETs against security threats. The analysis also suggested that the existing IDS proposed for MANET are not immune against a colluding blackmail attack due to the nature of such a network that comprises autonomous and anonymous nodes. The IDS architecture as proposed in this study utilises trust relationships between nodes to overcome this nodes' anonymity issue. Through a friendship mechanism, the problems of false accusations and false alarms caused by blackmail attackers in global detection and response mechanisms could be eliminated. The applicability of the friendship concept as well as other proposed mechanisms to solve MANET IDS related issues have been validated through a set of simulation experiments. Several MANET settings, which differ from each other based on the network's density level, the number of initial trusted friends owned by each node, and the duration of the simulation times, have been used to study the effects of such factors towards the overall performance of the proposed IDS framework. The results obtained from the experiments proved that the proposed concepts are capable to at least minimise i f not fully eliminate the problem currently faced in MANET IDS