Social network analysis and small group ‘dark’ networks: an analysis of the London bombers and the problem of ‘fuzzy’ boundaries

Social network analysis (SNA) is believed to be capable of revealing significant insights into crime and terror groups, including identifying important individuals and unique approaches to disruption. However, SNA has a number of theoretical and practical limitations, particularly when applied to ‘dark’ networks. While most analysts certainly acknowledge at least some of these limitations, we need to know more about their potential impact in a crime intelligence context. This article aims to go some way towards that end by placing greater scrutiny on the problem of ‘fuzzy boundaries’ when applied to small group networks. SNA is applied to the groups responsible for the 7 July 2005 London bombings and the 21 July 2005 attempted London bombings. The article concludes that while SNA is a valuable tool for understanding crime and terror groups, the age-old problem of fuzzy boundaries can have a profound impact on the analysis of small dynamic networks.

Energy minimization in multi-task software-defined sensor networks

Abstract—
After a decade of extensive research on application-specific wireless sensor networks (WSNs), the recent development of information and communication technologies makes it practical to realize the software-defined sensor networks (SDSNs), which are able to adapt to various application requirements and to fully explore the resources of WSNs. A sensor node in SDSN is able to conduct multiple tasks with different sensing targets simultaneously. A given sensing task usually involves multiple sensors to achieve a certain quality-of-sensing, e.g., coverage ratio. It is significant to design an energy-efficient sensor scheduling and management strategy with guaranteed quality-of-sensing for all tasks. To this end, three issues are investigated in this paper: 1) the subset of sensor nodes that shall be activated, i.e., sensor activation, 2) the task that each sensor node shall be assigned, i.e., task mapping, and 3) the sampling rate on a sensor for a target, i.e., sensing scheduling. They are jointly considered and formulated as a mixed-integer with quadratic constraints programming (MIQP) problem, which is then reformulated into a mixed-integer linear programming (MILP) formulation with low computation complexity via linearization. To deal with dynamic events such as sensor node participation and departure, during SDSN operations, an efficient online algorithm using local optimization is developed. Simulation results show that our proposed online algorithm approaches the globally optimized network energy efficiency with much lower rescheduling time and control overhead.

Social networks in changing environments

Social network analysis (SNA) has become a widespread tool for the study of animal social organisation. However despite this broad applicability, SNA is currently limited by both an overly strong focus on pattern analysis as well as a lack of dynamic interaction models. Here, we use a dynamic modelling approach that can capture the responses of social networks to changing environments. Using the guppy, Poecilia reticulata, we identified the general properties of the social dynamics underlying fish social networks and found that they are highly robust to differences in population density and habitat changes. Movement simulations showed that this robustness could buffer changes in transmission processes over a surprisingly large density range. These simulation results suggest that the ability of social systems to self-stabilise could have important implications for the spread of infectious diseases and information. In contrast to habitat manipulations, social manipulations (e.g. change of sex ratios) produced strong, but short-lived, changes in network dynamics. Lastly, we discuss how the evolution of the observed social dynamics might be linked to predator attack strategies. We argue that guppy social networks are an emergent property of social dynamics resulting from predator–prey co-evolution. Our study highlights the need to develop dynamic models of social networks in connection with an evolutionary framework.

An efficient detection mechanism against packet faking attack in opportunistic networks

Security is a major challenge in Opportunistic Networks (OppNets) because of its characteristics, such as open medium, dynamic topology, no centralized management and absent clear lines of defense. A packet dropping attack is one of the major security threats in OppNets since neither source nodes nor destination nodes have the knowledge of where or when the packet will be dropped. In our previous novel attack (Packet Faking Attack [1]) we presented a special type of packet dropping where the malicious node drops one or more packets and then injects new fake packets instead. In this paper, we present an efficient detection mechanism against this type of attack where each node can detect the attack instead of the destination node. Our detection mechanism is very powerful and has very high accuracy. It relies on a very simple yet powerful idea, that is, the packet creation time of each packet. Simulation results show this robust mechanism achieves a very high accuracy, detection rate and good network traffic reduction.

Catabolism attack and anabolism defense: a novel attack and traceback mechanism in opportunistic networks

Security is a major challenge in Opportunistic Networks (OppNets) because of its characteristics, such as open medium, dynamic topology, no centralized management and absent clear lines of defense.A packet dropping attack is one of the major security threats in OppNets since neither source nodes nor destination nodes have the knowledge of where or when the packet will be dropped. In this paper, we present a novel attack and traceback mechanism against a special type of packet dropping where the malicious node drops one or more packets and then injects new fake packets instead. We call this novel attack a Catabolism Attack and we call our novel traceback mechanism against this attack Anabolism Defense. Our novel detection and traceback mechanism is very powerful and has very high accuracy. Each node can detect and then traceback the malicious nodes based on a solid and powerful idea that is, hash chain techniques. In our defense techniques we have two stages. The first stage is to detect the attack, and the second stage is to find the malicious nodes. Simulation results show this robust mechanism achieves a very high accuracy and detection rate.

A distributed gateway selection algorithm for UAV networks

In recent years, unmanned aerial vehicle (UAV) has been widely adopted in military and civilian applications. For small UAVs, cooperation based on communication networks can effectively expand their working area. Although the UAV networks are quite similar to the traditional mobile ad hoc networks, the special characteristics of the UAV application scenario have not been considered in the literature. In this paper, we propose a distributed gateway selection algorithm with dynamic network partition by taking into account the application characteristics of UAV networks. In the proposed algorithm, the influence of the asymmetry information phenomenon on UAVs' topology control is weakened by dividing the network into several subareas. During the operation of the network, the partition of the network can be adaptively adjusted to keep the whole network topology stable even though UAVs are moving rapidly. Meanwhile, the number of gateways can be completely controlled according to the system requirements. In particular, we define the stability of UAV networks, build a network partition model, and design a distributed gateway selection algorithm. Simulation results show using our proposed scheme that the faster the nodes move in the network, the more stable topology can be found, which is quite suitable for UAV applications.

Dynamic access point association using software defined networking

Previous attempts in addressing Access Point (AP) association at overlapping zone of IEEE 802.11 networks have shown some issues. They work passively and estimate load from different network metrics such as frame delay, packet loss, number of users etc. that may not always true. Further the user behaviour is selfish i.e. illegitimate user consume high network resources. This adversely affect existing or new users which in turn motivates them to change locations. To alleviate these issues, we propose the use of a Software Defined Networking (SDN) enabled client side (wireless end user) solution. In this paper, we start by proposing a dynamic AP selection algorithm/framework in wireless user device. The device receive network resource related statistics from SDN Controller and guide the client device to associate itself with the best selected AP. We justify that the use of SDN discourage users to act selfishly. Further, a mathematical modelling of the proposed scheme is derived using Fuzzy membership function and the simulation is carried out. Results obtained from simulation necessitates to implement SDN enabled client side methods.

Malicious node traceback in opportunistic networks using merkle trees

Security is a major challenge in Opportunistic Networks because of its characteristics, such as open medium, dynamic topology, no centralized management and absent clear lines of defense. A packet dropping attack is one of the major security threats in OppNets since neither source nodes nor destination nodes have the knowledge of where or when the packet will be dropped. In this paper, we present a malicious nodes detection mechanism against a special type of packet dropping attack where the malicious node drops one or more packets and then injects new fake packets instead. Our novel detection and traceback mechanism is very powerful and has very high accuracy. Each node can detect and then traceback the malicious nodes based on a solid and powerful idea that is, Merkle tree hashing technique. In our defense techniques we have two stages. The first stage is to detect the attack, and the second stage is to find the malicious nodes. We have compared our approach with the acknowledgement based mechanisms and the networks coding based mechanism which are well known approaches in the literature. Simulation results show this robust mechanism achieves a very high accuracy and detection rate.

Energy efficient sleep schedule with service coverage guarantee in wireless sensor networks

Service oriented architecture has been proposed to support collaborations among distributed wireless sensor network (WSN) applications in an open dynamic environment. However, WSNs are resource constraint, and have limited computation abilities, limited communication bandwidth and especially limited energy. Fortunately, sensor nodes in WSNs are usually deployed redundantly, which brings the opportunity to adopt a sleep schedule for balanced energy consumption to extend the network lifetime. Due to miniaturization and energy efficiency, one sensor node can integrate several sense units and support a variety of services. Traditional sleep schedule considers only the constraints from the sensor nodes, can be categorized to a one-layer (i.e., node layer) issue. The service oriented WSNs should resolve the energy optimization issue considering the two-layer constraints, i.e., the sensor nodes layer and service layer. Then, the one-layer energy optimization scheme in previous work is not applicable for service oriented WSNs. Hence, in this paper we propose a sleep schedule with a service coverage guarantee in WSNs. Firstly, by considering the redundancy degree on both the service level and the node level, we can get an accurate redundancy degree of one sensor node. Then, we can adopt fuzzy logic to integrate the redundancy degree, reliability and energy to get a sleep factor. Based on the sleep factor, we furthermore propose the sleep mechanism. The case study and simulation evaluations illustrate the capability of our proposed approach.

Dynamic prediction models and optimization of polyacrylonitrile (PAN) stabilization processes for production of carbon fiber

Thermal stabilization process of polyacrylonitrile (PAN) is the slowest and the most energy-consuming step in carbon fiber production. As such, in industrial production of carbonfiber, this step is considered as amajor bottleneck in the whole process. Stabilization process parameters are usually many in number and highly constrained, leading to high uncertainty. The goal of this paper is to study and analyze the carbon fiber thermal stabilization process through presenting several effective dynamic models for the prediction of the process. The key point with using dynamic models is that using an evolutionary search technique, the heat of reaction can be optimized. The employed components of the study are Levenberg–Marquardt algorithm (LMA)-neural network (LMA-NN), Gauss–Newton (GN)-curve fitting, Taylor polynomial method, and a genetic algorithm. The results show that the procedure can effectively optimize a given PAN fiber heat of reaction based on determining the proper values of heating rampand temperature

Data mining via minimal spanning tree clustering for prolonging lifetime of wireless sensor networks

Clustering is applied in wireless sensor networks for increasing energy efficiency. Clustering methods in wireless sensor networks are different from those in traditional data mining systems. This paper proposes a novel clustering algorithm based on Minimal Spanning Tree (MST) and Maximum Energy resource on sensors named MSTME. Also, specified constrains of clustering in wireless sensor networks and several evaluation metrics are given. MSTME performs better than already known clustering methods of Low Energy Adaptive Clustering Hierarchy (LEACH) and Base Station Controlled Dynamic Clustering Protocol (BCDCP) in wireless sensor networks when they are evaluated by these evaluation metrics. Simulation results show MSTME increases energy efficiency and network lifetime compared with LEACH and BCDCP in two-hop and multi-hop networks, respectively. © World Scientific Publishing Company.

Delay tolerant networks

The delay-tolerant networks (DTNs) are emerging research topics that have attracted keen research efforts from both academia and industry. Different from the traditional communication networks, DTNs consider an extreme network condition where a complete end-to-end path between the data source and destination may not exist, and the network is subject to dynamic node connections and unstable topologies. With the above features, DTNs find broad applications in the situations where legacynetworks cannot work effectively, such as data communications in rural areas, where stable communications infrastructure is not available or costly, and crucial areas, e.g., disaster rescue and battlefield communications. To summarize, the DTNs, as an important technology complementary to traditional networkings, can be widely applied to national welfare and the people’s livelihood.

Time cumulative complexity modeling and analysis for space-based networks

In this paper, the notion of the cumulative time varying graph (C-TVG) is proposed to model the high dynamics and relationships between ordered static graph sequences for space-based information networks (SBINs). In order to improve the performance of management and control of the SBIN, the complexity and social properties of the SBIN's high dynamic topology during a period of time is investigated based on the proposed C-TVG. Moreover, a cumulative topology generation algorithm is designed to establish the topology evolution of the SBIN, which supports the C-TVG based complexity analysis and reduces network congestions and collisions resulting from traditional link establishment mechanisms between satellites. Simulations test the social properties of the SBIN cumulative topology generated through the proposed C-TVG algorithm. Results indicate that through the C-TVG based analysis, more complexity properties of the SBIN can be revealed than the topology analysis without time cumulation. In addition, the application of attack on the SBIN is simulated, and results indicate the validity and effectiveness of the proposed C-TVG and C-TVG based complexity analysis for the SBIN.

Streaming analysis in wireless sensor networks

Two new incremental models for online anomaly detection in data streams at nodes in wireless sensor networks are discussed. These models are incremental versions of a model that uses ellipsoids to detect first, second, and higher-ordered anomalies in arrears. The incremental versions can also be used this way but have additional capabilities offered by processing data incrementally as they arrive in time. Specifically, they can detect anomalies 'on-the-fly' in near real time. They can also be used to track temporal changes in near real-time because of sensor drift, cyclic variation, or seasonal changes. One of the new models has a mechanism that enables graceful degradation of inputs in the distant past (fading memory). Three real datasets from single sensors in deployed environmental monitoring networks are used to illustrate various facets of the new models. Examples compare the incremental version with the previous batch and dynamic models and show that the incremental versions can detect various types of dynamic anomalies in near real time.

Network coding based converge-cast scheme in wireless sensor networks

The converge-cast in wireless sensor networks (WSNs) is widely applied in many fields such as medical applications and the environmental monitoring. WSNs expect not only providing routing with high throughput but also achieving efficient energy saving. Network coding is one of the most promising techniques to reduce the energy consumption. By maximizing the encoding number, the message capacity per package can be extended to the most efficient condition. Thus, many researchers have focused their work on this field. Nevertheless, the packages sent by the outer nodes need to be temporary stored and delayed in order to maximize the encoding number. To find out the balance between inserting the delay time and maximizing the encoding number, a Converge-cast Scheme based on data collection rate prediction (CSRP) is proposed in this paper. To avoid producing the outdated information, a prediction method based on Modifying Index Curve Model is presented to deal with the dynamic data collection rate of every sensor in WSNs. Furthermore, a novel coding conditions based on CDS is proposed to increase the coding opportunity and to solve the collision problems. The corresponding analysis and experimental results indicate that the feasibility and efficiency of the CSRP is better than normal conditions without the prediction.