Joint Scheduling & Jamming for Data Secrecy in Wireless Networks

The broadcast nature of the wireless medium jeopardizes secure transmissions. Cryptographic measures fail to ensure security when eavesdroppers have superior computational capability; however, it can be assured from information theoretic security approaches. We use physical layer security to guarantee non-zero secrecy rate in single source, single destination multi-hop networks with eavesdroppers for two cases: when eavesdropper locations and channel gains are known and when their positions are unknown. We propose a two-phase solution which consists of finding activation sets and then obtaining transmit powers subject to SINR constraints for the case when eavesdropper locations are known. We introduce methods to find activation sets and compare their performance. Necessary but reasonable approximations are made in power minimization formulations for tractability reasons. For scenarios with no eavesdropper location information, we suggest vulnerability region (the area having zero secrecy rate) minimization over the network. Our results show that in the absence of location information average number of eavesdroppers who have access to data is reduced.

A fast and accurate performance analysis of beaconless IEEE 802.15.4 multi-hop networks

We develop an approximate analytical technique for evaluating the performance of multi-hop networks based on beaconless IEEE 802.15.4 ( the ``ZigBee'' PHY and MAC), a popular standard for wireless sensor networks. The network comprises sensor nodes, which generate measurement packets, relay nodes which only forward packets, and a data sink (base station). We consider a detailed stochastic process at each node, and analyse this process taking into account the interaction with neighbouring nodes via certain time averaged unknown variables (e.g., channel sensing rates, collision probabilities, etc.). By coupling the analyses at various nodes, we obtain fixed point equations that can be solved numerically to obtain the unknown variables, thereby yielding approximations of time average performance measures, such as packet discard probabilities and average queueing delays. The model incorporates packet generation at the sensor nodes and queues at the sensor nodes and relay nodes. We demonstrate the accuracy of our model by an extensive comparison with simulations. As an additional assessment of the accuracy of the model, we utilize it in an algorithm for sensor network design with quality-of-service (QoS) objectives, and show that designs obtained using our model actually satisfy the QoS constraints (as validated by simulating the networks), and the predictions are accurate to well within 10% as compared to the simulation results in a regime where the packet discard probability is low. (C) 2015 Elsevier B.V. All rights reserved.

Performance evaluation of mobile agent based resource management protocol for MANETs

The nodes with dynamicity, and management without administrator are key features of mobile ad hoc networks (1VIANETs). Increasing resource requirements of nodes running different applications, scarcity of resources, and node mobility in MANETs are the important issues to be considered in allocation of resources. Moreover, management of limited resources for optimal allocation is a crucial task. In our proposed work we discuss a design of resource allocation protocol and its performance evaluation. The proposed protocol uses both static and mobile agents. The protocol does the distribution and parallelization of message propagation (mobile agent with information) in an efficient way to achieve scalability and speed up message delivery to the nodes in the sectors of the zones of a MANET. The protocol functionality has been simulated using Java Agent Development Environment (JADE) Framework for agent generation, migration and communication. A mobile agent migrates from central resource rich node with message and navigate autonomously in the zone of network until the boundary node. With the performance evaluation, it has been concluded that the proposed protocol consumes much less time to allocate the required resources to the nodes under requirement, utilize less network resources and increase the network scalability. (C) 2015 Elsevier B.V. All rights reserved.

Molecular dynamics and simulations study on the vibrational and electronic solvatochromism of benzophenone

Solvent plays a key role in diverse physico-chemical and biological processes. Therefore, understanding solute-solvent interactions at the molecular level of detail is of utmost importance. A comprehensive solvatochromic analysis of benzophenone (Bzp) was carried out in various solvents using Raman and electronic spectroscopy, in conjunction with Density Functional Theory (DFT) calculations of supramolecular solute-solvent clusters generated using classical Molecular Dynamics Simulations (c-MDSs). The >C=O stretching frequency undergoes a bathochromic shift with solvent polarity. Interestingly, in protic solvents this peak appears as a doublet: c-MDS and ad hoc explicit solvent ab initio calculations suggest that the lower and higher frequency peaks are associated with the hydrogen bonded and dangling carbonyl group of Bzp, respectively. Additionally, the dangling carbonyl in methanol (MeOH) solvent is 4 cm(-1) blue-shifted relative to acetonitrile solvent, despite their similar dipolarity/polarizability. This suggests that the cybotactic region of the dangling carbonyl group in MeOH is very different from its bulk solvent structure. Therefore, we propose that this blue-shift of the dangling carbonyl originates in the hydrophobic solvation shell around it resulting from extended hydrogen bonding network of the protic solvents. Furthermore, the 1(1)n pi* (band I) and 1(1)pi pi* (band II) electronic transitions show a hypsochromic and bathochromic shift, respectively. In particular, these shifts in protic solvents are due to differences in their excited state-hydrogen bonding mechanisms. Additionally, a linear relationship is obtained for band I and the >C=O stretching frequency (cm(-1)), which suggests that the different excitation wavelengths in band I correspond to different solvation states. Therefore, we hypothesize that the variation in excitation wavelengths in band I could arise from different solvation states leading to varying solvation dynamics. This will have implications for ultrafast processes associated with electron-transfer, charge transfer, and also the photophysical aspects of excited states. (C) 2016 AIP Publishing LLC.

Direct Link-Aware Relay Selection for Average Interference-Constrained Underlay Cognitive Radio

Cooperative relaying combined with selection exploits spatial diversity to significantly improve the performance of interference-constrained secondary users in an underlay cognitive radio network. We present a novel and optimal relay selection (RS) rule that minimizes the symbol error probability (SEP) of an average interference-constrained underlay secondary system that uses amplify-and-forward relays. A key point that the rule highlights for the first time is that, for the average interference constraint, the signal-to-interference-plus-noise-ratio (SINR) of the direct source-to-destination (SI)) link affects the choice of the optimal relay. Furthermore, as the SINR increases, the odds that no relay transmits increase. We also propose a simpler, more practical, and near-optimal variant of the optimal rule that requires just one bit of feedback about the state of the SD link to the relays. Compared to the SD-unaware ad hoc RS rules proposed in the literature, the proposed rules markedly reduce the SEP by up to two orders of magnitude.

Near-Optimal Distributed Failure Circumscription

Small failures should only disrupt a small part of a network. One way to do this is by marking the surrounding area as untrustworthy --- circumscribing the failure. This can be done with a distributed algorithm using hierarchical clustering and neighbor relations, and the resulting circumscription is near-optimal for convex failures.

Modelling uncertainty in agricultural image analysis

C.M. Onyango, J.A. Marchant and R. Zwiggelaar, 'Modelling uncertainty in agricultural image analysis', Computers and Electronics in Agriculture 17 (3), 295-305 (1997)

Measuring Bottleneck Bandwidth of Targeted Path Segments

Accurate measurement of network bandwidth is crucial for flexible Internet applications and protocols which actively manage and dynamically adapt to changing utilization of network resources. These applications must do so to perform tasks such as distributing and delivering high-bandwidth media, scheduling service requests and performing admission control. Extensive work has focused on two approaches to measuring bandwidth: measuring it hop-by-hop, and measuring it end-to-end along a path. Unfortunately, best-practice techniques for the former are inefficient and techniques for the latter are only able to observe bottlenecks visible at end-to-end scope. In this paper, we develop and simulate end-to-end probing methods which can measure bottleneck bandwidth along arbitrary, targeted subpaths of a path in the network, including subpaths shared by a set of flows. As another important contribution, we describe a number of practical applications which we foresee as standing to benefit from solutions to this problem, especially in emerging, flexible network architectures such as overlay networks, ad-hoc networks, peer-to-peer architectures and massively accessed content servers.

Development of miniaturized wireless sensor nodes suitable for building energy management and modelling

Buildings consume 40% of Ireland's total annual energy translating to 3.5 billion (2004). The EPBD directive (effective January 2003) places an onus on all member states to rate the energy performance of all buildings in excess of 50m2. Energy and environmental performance management systems for residential buildings do not exist and consist of an ad-hoc integration of wired building management systems and Monitoring & Targeting systems for non-residential buildings. These systems are unsophisticated and do not easily lend themselves to cost effective retrofit or integration with other enterprise management systems. It is commonly agreed that a 15-40% reduction of building energy consumption is achievable by efficiently operating buildings when compared with typical practice. Existing research has identified that the level of information available to Building Managers with existing Building Management Systems and Environmental Monitoring Systems (BMS/EMS) is insufficient to perform the required performance based building assessment. The cost of installing additional sensors and meters is extremely high, primarily due to the estimated cost of wiring and the needed labour. From this perspective wireless sensor technology provides the capability to provide reliable sensor data at the required temporal and spatial granularity associated with building energy management. In this paper, a wireless sensor network mote hardware design and implementation is presented for a building energy management application. Appropriate sensors were selected and interfaced with the developed system based on user requirements to meet both the building monitoring and metering requirements. Beside the sensing capability, actuation and interfacing to external meters/sensors are provided to perform different management control and data recording tasks associated with minimisation of energy consumption in the built environment and the development of appropriate Building information models(BIM)to enable the design and development of energy efficient spaces.

Wireless networked control systems with QoS-based sampling

Closing feedback loops using an IEEE 802.11b ad hoc wireless communication network incurs many challenges sensitivity to varying channel conditions and lower physical transmission rates tend to limit the bandwidth of the communication channel. Given that the bandwidth usage and control performance are linked, a method of adapting the sampling interval based on an 'a priori', static sampling policy has been proposed and, more significantly, assuring stability in the mean square sense using discrete-time Markov jump linear system theory. Practical issues including current limitations of the 802.11 b protocol, the sampling policy and stability are highlighted. Simulation results on a cart-mounted inverted pendulum show that closed-loop stability can be improved using sample rate adaptation and that the control design criteria can be met in the presence of channel errors and severe channel contention.

Millimeter-Wave Soldier-to-Soldier Communications for Covert Battlefield Operations

Mobile ad hoc networking of dismounted combat personnel is expected to play an important role in the future of network-centric operations. High-speed, short-range, soldier-to-soldier wireless communications will be required to relay information on situational awareness, tactical instructions, and covert surveillance related data during special operations reconnaissance and other missions. This article presents some of the work commissioned by the U. K. Ministry of Defence to assess the feasibility of using 60 GHz millimeter-wave smart antenna technology to provide covert communications capable of meeting these stringent networking needs. Recent advances in RF front-end technology, alongside physical layer transmission schemes that could be employed in millimeter-wave soldier-mounted radio, are discussed. The introduction of covert communications between soldiers will require the development of a bespoke directive medium access layer. A number of adjustments to the IEEE 802.11 distribution coordination function that will enable directional communications are suggested. The successful implementation of future smart antenna technologies and direction of arrival-based protocols will be highly dependent on thorough knowledge of transmission channel characteristics prior to deployment. A novel approach to simulating dynamic soldier-to-soldier signal propagation using state-of-the-art animation-based technology developed for computer game design is described, and important channel metrics such as root mean square angle and delay spread for a team of four networked infantry soldiers over a range of indoor and outdoor environments is reported.

Characterization of Inter-Body Interference in Context Aware Body Area Networking (CABAN)

The characterization and understanding of body to body communication channels is a pivotal step in the development of emerging wireless applications such as ad-hoc personnel localisation and context aware body area networks (CABAN). The latter is a recent innovation where the inherent mobility of body area networks can be used to improve the coexistence of multiple co-located BAN users. Rather than simply accepting reductions in communication performance, sensed changes in inter-network co-channel interference levels may facilitate intelligent inter-networking; for example merging or splitting with other BANs that remain in the same domain. This paper investigates the inter-body interference using controlled measurements of the full mesh interconnectivity between two ambulatory BANs operating in the same environment at 2.45 GHz. Each of the twelve network nodes reported received signal strength to allow for the creation of carrier to interference ratio time series with an overall entire mesh sampling period of 54 ms. The results indicate that even with two mobile networks, it is possible to identify the onset of co-channel interference as the BAN users move towards each other and, similarly, the transition to more favourable physical layer channel conditions as they move apart. © 2011 IEEE.

Algorithms for Self-Healing Networks

Many modern networks are \emph{reconfigurable}, in the sense that the topology of the network can be changed by the nodes in the network. For example, peer-to-peer, wireless and ad-hoc networks are reconfigurable. More generally, many social networks, such as a company's organizational chart; infrastructure networks, such as an airline's transportation network; and biological networks, such as the human brain, are also reconfigurable. Modern reconfigurable networks have a complexity unprecedented in the history of engineering, resembling more a dynamic and evolving living animal rather than a structure of steel designed from a blueprint. Unfortunately, our mathematical and algorithmic tools have not yet developed enough to handle this complexity and fully exploit the flexibility of these networks. We believe that it is no longer possible to build networks that are scalable and never have node failures. Instead, these networks should be able to admit small, and maybe, periodic failures and still recover like skin heals from a cut. This process, where the network can recover itself by maintaining key invariants in response to attack by a powerful adversary is what we call \emph{self-healing}. Here, we present several fast and provably good distributed algorithms for self-healing in reconfigurable dynamic networks. Each of these algorithms have different properties, a different set of gaurantees and limitations. We also discuss future directions and theoretical questions we would like to answer. %in the final dissertation that this document is proposed to lead to.

Prioritisation of citizen centric information for disaster response

In the aftermath of a disaster event, and in the absence of trained professionals, many responsibilities are taken on by uninjured citizens who are willing and able to help, such as care of the injured or search and rescue. These citizens are constrained by communications and logistics problems but are less equipped to deal with them as most often they are cut off from any coordinated assistance. The method proposed in this study would increase the survivability of those injured or trapped by a disaster event by providing a facility to allow citizens to coordinate and share information among themselves. This is facilitated by the proposed deployment and the autonomous management of an ad hoc infrastructure that liaises (OK?) directly with survivors without central control. Furthermore, as energy concerns present critical constraints to these networks, this research proposes a system of categorising information elements within the network to ensure efficient information exchange.

Wireless networks congestion control

Congestion control in wireless networks is an important and open issue. Previous research has proven the poor performance of the Transport Control Protocol (TCP) in such networks. The factors that contribute to the poor performance of TCP in wireless environments concern its unsuitability to identify/detect and react properly to network events, its TCP window based ow control algorithm that is not suitable for the wireless channel, and the congestion collapse due to mobility. New rate based mechanisms have been proposed to mitigate TCP performance in wired and wireless networks. However, these mechanisms also present poor performance, as they lack of suitable bandwidth estimation techniques for multi-hop wireless networks. It is thus important to improve congestion control performance in wireless networks, incorporating components that are suitable for wireless environments. A congestion control scheme which provides an e - cient and fair sharing of the underlying network capacity and available bandwidth among multiple competing applications is crucial to the definition of new e cient and fair congestion control schemes on wireless multi-hop networks. The Thesis is divided in three parts. First, we present a performance evaluation study of several congestion control protocols against TCP, in wireless mesh and ad-hoc networks. The obtained results show that rate based congestion control protocols need an eficient and accurate underlying available bandwidth estimation technique. The second part of the Thesis presents a new link capacity and available bandwidth estimation mechanism denoted as rt-Winf (real time wireless inference). The estimation is performed in real-time and without the need to intrusively inject packets in the network. Simulation results show that rt-Winf obtains the available bandwidth and capacity estimation with accuracy and without introducing overhead trafic in the network. The third part of the Thesis proposes the development of new congestion control mechanisms to address the congestion control problems of wireless networks. These congestion control mechanisms use cross layer information, obtained by rt-Winf, to accurately and eficiently estimate the available bandwidth and the path capacity over a wireless network path. Evaluation of these new proposed mechanisms, through ns-2 simulations, shows that the cooperation between rt-Winf and the congestion control algorithms is able to significantly increase congestion control eficiency and network performance.