With the emergence of wireless communications and mobile computing. new ways for people to interact with each other and their surrounding environment are emerging. Mobile devices, such as Personal Digital Assistants (PDAs) with wireless communication interfaces are able to communicate directly with each other if they are "close enough". If such devices are also able to act as message relays (routers), then a very powerful facility in the form of a mobile ad hoc network can be made available to applications. Although present day PDAs have sufficient networking and processing capabilities to support interesting interactive applications, as yet, there is hardly any software available for constructing and maintaining ad hoc networks and not many practical interactive applications have been built and tested. Rather, much of the research work is still at simulation and modelling stage. Thus it is difficult at this stage to decide what system support (middleware) for interactive applications a PDA should contain. This work is a step in the direction of remedying the situation by considering a class of applications where interactions between users can be supported by one of the nodes in the ad hoc network acting as a server. The thesis presents the design, implementation and evaluation of three such applications on PDAs, and based on that experience, describes what system support (middleware) for such applications is required. These applications are: Auction, Bingo game and Chatting that work over ad hoc networks. The work presented here can be used as a basis for deciding how the current generation of PDA operating systems can be extended for supporting ad hoc networking and what additional services are required for interactive applications.

No description available.

Different or similar workflow systems, hosted anywhere on a network, written in any language and running on different operating systems, can easily use the full range of PS-SWIF tools to interoperate with each other. The PS-SWIF approach provides interoperability among a wide range of scientific workflow systems.

This thesis presents generic analytical models of homogeneous clustered Wireless Sensor Networks (WSNs) with a centrally located Cluster Head (CH) coordinating cluster communication with the sink directly or through other intermediate nodes. The focus is to integrate performance and availability studies of WSNs in the presence of sensor nodes and channel failures and repair/replacement. The main purpose is to enhance improvement of WSN Quality of Service (QoS). Other research works also considered in this thesis include modelling of packet arrival distribution at the CH and intermediate nodes, and modelling of energy consumption at the sensor nodes. An investigation and critical analysis of wireless sensor network architectures, energy conservation techniques and QoS requirements are performed in order to improve performance and availability of the network. Existing techniques used for performance evaluation of single and multi-server systems with several operative states are investigated and analysed in details. To begin with, existing approaches for independent (pure) performance modelling are critically analysed with highlights on merits and drawbacks. Similarly, pure availability modelling approaches are also analysed. Considering that pure performance models tend to be too optimistic and pure availability models are too conservative, performability, which is the integration of performance and availability studies is used for the evaluation of the WSN models developed in this study. Two-dimensional Markov state space representations of the systems are used for performability modelling. Following critical analysis of the existing solution techniques, spectral expansion method and system of simultaneous linear equations are developed and used to solving the proposed models. To validate the results obtained with the two techniques, a discrete event simulation tool is explored. In this research, open queuing networks are used to model the behaviour of the CH when subjected to streams of traffic from cluster nodes in addition to dynamics of operating in the various states. The research begins with a model of a CH with an infinite queue capacity subject to failures and repair/replacement. The model is developed progressively to consider bounded queue capacity systems, channel failures and sleep scheduling mechanisms for performability evaluation of WSNs. Using the developed models, various performance measures of the considered system including mean queue length, throughput, response time and blocking probability are evaluated. Finally, energy models considering mean power consumption in each of the possible operative states is developed. The resulting models are in turn employed for the evaluation of energy saving for the proposed case study model. Numerical solutions and discussions are presented for all the queuing models developed. Simulation is also performed in order to validate the accuracy of the results obtained. In order to address issues of performance and availability of WSNs, current research present independent performance and availability studies. The concerns resulting from such studies have therefore remained unresolved over the years hence persistence poor system performance. The novelty of this research is a proposed integrated performance and availability modelling approach for WSNs meant to address challenges of independent studies. In addition, a novel methodology for modelling and evaluation of power consumption is also offered. Proposed model results provide remarkable improvement on system performance and availability in addition to providing tools for further optimisation studies. A significant power saving is also observed from the proposed model results. In order to improve QoS for WSN, it is possible to improve the proposed models by incorporating priority queuing in a mixed traffic environment. A model of multi-server system is also appropriate for addressing traffic routing. It is also possible to extend the proposed energy model to consider other sleep scheduling mechanisms other than On-demand proposed herein. Analysis and classification of possible arrival distribution of WSN packets for various application environments would be a great idea for enabling robust scientific research.

Wireless communications have been extensively studied for several decades, which has led to various new advancements, including new technologies in the field of Intelligent Transport Systems. Vehicular Ad hoc Networks or VANETs are considered to be a long-term solution, contributing significantly towards Intelligent Transport Systems in providing access to critical life-safety applications and infotainment services. These services will require ubiquitous connectivity and hence there is a need to explore seamless handover mechanisms. Although VANETs are attracting greater commercial interest, current research has not adequately captured the realworld constraints in Vehicular Ad hoc Network handover techniques. Due to the high velocity of the vehicles and smaller coverage distances, there are serious challenges in providing seamless handover from one Road Side Unit (RSU) to another and this comes at the cost of overlapping signals of adjacent RSUs. Therefore, a framework is needed to be able to calculate the regions of overlap in adjacent RSU coverage ranges to guarantee ubiquitous connectivity. This thesis is about providing such a framework by analysing in detail the communication mechanisms in a VANET network, firstly by means of simulations using the VEINs framework via OMNeT++ and then using analytical analysis of the probability of successful packet reception. Some of the concepts of the Y-Comm architecture such as Network Dwell Time, Time Before Handover and Exit Times have been used to provide a framework to investigate handover issues and these parameters are also used in this thesis to explore handover in highly mobile environments such as VANETs. Initial investigation showed that seamless communication was dependant on the beacon frequency, length of the beacon and the velocity of the vehicle. The effects of each of these parameters are explored in detail and results are presented which show the need for a more probabilistic approach to handover based on cumulative probability of successful packet reception. In addition, this work shows how the length of the beacon affects the rate of change of the Signal-to-Noise ratio or SNR as the vehicle approaches the Road-Side Unit. However, the velocity of the vehicle affects both the cumulative probability as well as the Signal-to-Noise ratio as the vehicle approaches the Road-Side Unit. The results of this work will enable systems that can provide ubiquitous connectivity via seamless handover using proactive techniques because traditional models of handover are unable to cope with the high velocity of the vehicles and relatively small area of coverage in these environments. Finally, a testbed has been set-up at the Middlesex University, Hendon campus for the purpose of achieving a better understanding of VANET systems operating in an urban environment. Using the testbed, it was observed that environmental effects have to be taken into considerations in real-time deployment studies to see how these parameters can affect the performance of VANET systems under different scenarios. This work also highlights the fact that in order to build a practical system better propagation models are required in the urban context for highly mobile environments such as VANETs.

No description available.

In an information network consisting of different types of communication devices equipped with various types of sensors, it is inevitable that a huge amount of data will be generated. Considering the practical network constraints such as bandwidth and energy limitations, storing, processing and transmitting this very large volume of data is very challenging, if not impossible. However, In-Network Processing (INP) has opened a new door to possible solutions for optimising the utilisation of network resources. INP methods primarily aim to aggregate (e.g., compression, fusion and averaging) data from different sources with the objective of reducing the data volume for further transfer, thus, reducing energy consumption, and increasing the network lifetime. However, processing data often results in an imprecise outcome such as irrelevancy, incompleteness, etc. Therefore, besides characterising the Quality of Information (QoI) in these systems, which is important, it is also crucial to consider the effect of further data processing on the measured QoI associated with each specific piece of information. Typically, the greater the degree of data aggregation, the higher the computation energy cost that is incurred. However, as the volume of data is reduced after aggregation, less energy is needed for subsequent data transmission and reception. Furthermore, aggregation of data can cause deterioration of QoI. Therefore, there is a trade-off among the QoI requirement and energy consumption by computation and communication. We define the optimal data reduction rate parameter as the degree to which data can be efficiently reduced while guaranteeing the required QoI for the end user. Using wireless sensor networks for illustration, we concentrate on designing a distributed framework to facilitate controlling of INP process at each node while satisfying the end user's QoI requirements. We formulate the INP problem as a non-linear optimisation problem with the objective of minimising the total energy consumption through the network subject to a given QoI requirement for the end user. The proposed problem is intrinsically a non-convex, and, in general, hard to solve. Given the non-convexity and hardness of the problem, we propose a novel approach that can reduce the computation complexity of the problem. Specifically, we prove that under the assumption of uniform parameters' settings, the complexity of the proposed problem can be reduced significantly, which may be feasible for each node with limited energy supply to carry out the problem computation. Moreover, we propose an optimal solution by transforming the original problem to an equivalent one. Using the theory of duality optimisation, we prove that under a set of reasonable cost and topology assumptions, the optimal solution can be efficiently, obtained despite the non-convexity of the problem. Furthermore, we propose an effective and efficient distributed, iterative algorithm that can converge to the optimal solution. We evaluate our proposed complexity reduction framework under different parameter settings, and show that the problem with N variables can be reduced to the problem with logN variables presenting a significant reduction in the complexity of the problem. The validity and performance of the proposed distributed optimisation framework has been evaluated through extensive simulation. We show that the proposed distributed algorithm can converge to the optimal solution very fast. The behaviour of the proposed framework has been examined under different parameters' setting, and checked against the optimal solution obtained via an exhaustive search algorithm. The results show the quick and efficient convergences for the proposed algorithm.

Computer-mediated communication has expanded the ways in which individuals can seek information and create content. Moreover, it allows for the forming of new connections between individuals that may otherwise be impossible. In the last decade, video-mediated communication has been adopted by the lesbian, gay, bisexual, and transgender (LGBT) community, as well as straight allies to share information and reach out to the wider community, particularly those who have been the victim of bullying. Despite this increase in video-mediated communication, most research in the area of gay men and lesbians has been focused on the construction of online identity and narratives of the coming-out journey. Therefore, it is necessary to investigate how video is utilised to disclose matters pertaining to lived experience to further understand this community, and identify how video could be used to better support this minority group. In the first stage of this research study, a qualitative analysis of online video was carried out to investigate how individuals engage with LGBT bullying content. The findings revealed individuals to openly disclose deeply personal, and identifiable, information to a global audience. Next an empirical study was carried out with a sample of gay men and lesbians to allow for the close examination of verbal and visual content disclosed in offline video diaries. This was followed by an interview study to examine the practicalities of using wearable and handheld technologies to facilitate this disclosure. Content was found to vary between sexes and recording device, with wearables facilitating a greater degree of discussion for certain topics. Moreover, the recording of point-of-view video diaries was found to be a useful tool in personal development. The findings from this thesis extend understanding of how gay men and lesbians engage in video-mediated communication. In addition, the findings reveal how wearable and handheld video recording can be used as a beneficial tool both for this group and the wider community.

No description available.

The use of geographic information for mobile applications such as wayfinding has increased rapidly, enabling users to view information on their current position in relation to the neighbouring environment. This is due to the ubiquity of small devices like mobile phones, coupled with location finding devices utilising global positioning system. However, such applications are still not attractive to users because of the difficulties in viewing and identifying the details of the immediate surroundings that help users to follow directions along a route. This results from a lack of presentation techniques to highlight the salient features (such as landmarks) among other unique features. Another problem is that since such applications do not provide any eye-catching distinction between information about the region of interest along the route and the background information, users are not tempted to focus and engage with wayfinding applications. Although several approaches have previously been attempted to solve these deficiencies by developing focus maps, such applications still need to be improved in order to provide users with a visually appealing presentation of information to assist them in wayfinding. The primary goal of this research is to investigate the processes involved in generating a visual representation that allows key features in an area of interest to stand out from the background in focus maps for wayfinding users. In order to achieve this, the automated processes in four key areas - spatial data structuring, spatial data enrichment, automatic map generalization and spatial data mining - have been thoroughly investigated by testing existing algorithms and tools. Having identified the gaps that need to be filled in these processes, the research has developed new algorithms and tools in each area through thorough testing and validation. Thus, a new triangulation data structure is developed to retrieve the adjacency relationship between polygon features required for data enrichment and automatic map generalization. Further, a new hierarchical clustering algorithm is developed to group polygon features under data enrichment required in the automatic generalization process. In addition, two generalization algorithms for polygon merging are developed for generating a generalized background for focus maps, and finally a decision tree algorithm - C4.5 - is customised for deriving salient features, including the development of a new framework to validate derived landmark saliency in order to improve the representation of focus maps.