We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

Statistics for Spatial Data.

https://www.science.smith.edu/~jcardell/Courses/EGR328/Readings/WSNSurvey2.pdf

Wireless sensor network survey

The purpose of this paper is to provide a comprehensive presentation and interpretation of the Ensemble Kalman Filter (EnKF) and its numerical implementation. The EnKF has a large user group, and numerous publications have discussed applications and theoretical aspects of it. This paper reviews the important results from these studies and also presents new ideas and alternative interpretations which further explain the success of the EnKF. In addition to providing the theoretical framework needed for using the EnKF, there is also a focus on the algorithmic formulation and optimal numerical implementation. A program listing is given for some of the key subroutines. The paper also touches upon specific issues such as the use of nonlinear measurements, in situ profiles of temperature and salinity, and data which are available with high frequency in time. An ensemble based optimal interpolation (EnOI) scheme is presented as a cost-effective approach which may serve as an alternative to the EnKF in some applications. A fairly extensive discussion is devoted to the use of time correlated model errors and the estimation of model bias.

The Ensemble Kalman Filter: Theoretical formulation and practical implementation

As we are moving towards the Internet of Things (IoT), the number of sensors deployed around the world is growing at a rapid pace. Market research has shown a significant growth of sensor deployments over the past decade and has predicted a significant increment of the growth rate in the future. These sensors continuously generate enormous amounts of data. However, in order to add value to raw sensor data we need to understand it. Collection, modelling, reasoning, and distribution of context in relation to sensor data plays critical role in this challenge. Context-aware computing has proven to be successful in understanding sensor data. In this paper, we survey context awareness from an IoT perspective. We present the necessary background by introducing the IoT paradigm and context-aware fundamentals at the beginning. Then we provide an in-depth analysis of context life cycle. We evaluate a subset of projects (50) which represent the majority of research and commercial solutions proposed in the field of context-aware computing conducted over the last decade (2001-2011) based on our own taxonomy. Finally, based on our evaluation, we highlight the lessons to be learnt from the past and some possible directions for future research. The survey addresses a broad range of techniques, methods, models, functionalities, systems, applications, and middleware solutions related to context awareness and IoT. Our goal is not only to analyse, compare and consolidate past research work but also to appreciate their findings and discuss their applicability towards the IoT.

/pdf/context-aware-computing-for-the-internet-of-things-a-survey-3nibvvc921.pdf

Context Aware Computing for The Internet of Things: A Survey

In recent years, location-based services have become very popular, mainly driven by the availability of modern mobile devices with integrated position sensors. Prominent examples are points of interest finders or geo-social networks such as Facebook Places, Qype, and Loopt. However, providing such services with private user positions may raise serious privacy concerns if these positions are not protected adequately. Therefore, location privacy concepts become mandatory to ensure the user's acceptance of location-based services. Many different concepts and approaches for the protection of location privacy have been described in the literature. These approaches differ with respect to the protected information and their effectiveness against different attacks. The goal of this paper is to assess the applicability and effectiveness of location privacy approaches systematically. We first identify different protection goals, namely personal information (user identity), spatial information (user position), and temporal information (identity/position + time). Secondly, we give an overview of basic principles and existing approaches to protect these privacy goals. In a third step, we classify possible attacks. Finally, we analyze existing approaches with respect to their protection goals and their ability to resist the introduced attacks.

A classification of location privacy attacks and approaches

Due to its salient properties, mobile agent technology has received a rapidly growing attention over the last few years. Many developments of mobile agent systems are under way in both academic and industrial environments. In addition, there are already various efforts to standardize mobile agent facilities and architectures. Mole is the first mobile agent system that has been developed in the Java language. The first version was finished in 1995, and since then Mole has been constantly improved. Mole provides a stable environment for the development and usage of mobile agents in the area of distributed applications. In this paper we describe the basic concepts of a mobile agent system, i.e., mobility, communication and security, discuss different implementation techniques, present the decisions made in Mole and give an overview of the system services implemented in Mole.

Mole – Concepts of a mobile agent system

Choosing appropriate information dissemination strategies is crucial in mobile ad hoc networks (MANET) due to the frequent topology changes Flooding-based approaches like diffusion have a strong similarity with epidemic spreading of diseases Applying epidemiological models to information diffusion allows the evaluation of such strategies depending on the MANET characteristics, eg the node density In order to choose appropriate strategies at run time, the model should be easily evaluatedIn this paper, an epidemic model is developed for a simple information diffusion algorithm based on simulation results We analytically investigate the impact of node density on information diffusion The analytical model allows the evaluation at runtime, even on devices with restricted resources, and thus enables mobile nodes to dynamically adapt their diffusion strategies depending on the local node density

/pdf/an-epidemic-model-for-information-diffusion-in-manets-4tyfht3f1c.pdf

An epidemic model for information diffusion in MANETs

Imagine a world where people constantly try to pass through walls and cars suddenly leave the roads and drive into rivers. Although this is unrealistic, most simulations for mobile ad hoc networks so far are based on the so called "random walk" of mobile objects, which are not constrained by their surrounding spatial environments. In this paper we propose a novel graph-based mobility model, which provides a more realistic movement than the random walk model by reflecting the spatial constraints in the real world. We analyzed three commonly used ad hoc network routing protocols, DSDV, DSR and AODV with both a random walk-based and our graph-based mobility model. Our simulation results show that the spatial constraints have a strong impact on the performance of ad hoc routing protocols.

Graph-based mobility model for mobile ad hoc network simulation

The telecommunications environment is changing its face towards an open market of information services where the vision is "information any time, at any place, in any form". Within this electronic market the aspects of service customization and instant service provision are of fundamental importance. In this context a new paradigm is gaining momentum referred to as "intelligent agents". This paper provides an overview of the emerging field of intelligent agents (IAs) by identifying their basic properties. Focusing on mobile agents, which could be considered as a specific class of intelligent agents, we identify the chances of agent technology in the context of telecommunications. We look at their potential impacts on open service architectures, intelligent communications and network management.

Kurt Rothermel

Papers

A classification of location privacy attacks and approaches

Mole – Concepts of a mobile agent system

An epidemic model for information diffusion in MANETs

Graph-based mobility model for mobile ad hoc network simulation

Intelligent agents: an emerging technology for next generation telecommunications?