Analytical efficiency evaluation of a network mobility management protocol for Intelligent Transportation Systems

One of the major concerns in an Intelligent Transportation System (ITS) scenario, such as that which may be found on a long-distance train service, is the provision of efficient communication services, satisfying users' expectations, and fulfilling even highly demanding application requirements, such as safety-oriented services. In an ITS scenario, it is common to have a significant amount of onboard devices that comprise a cluster of nodes (a mobile network) that demand connectivity to the outside networks. This demand has to be satisfied without service disruption. Consequently, the mobility of the mobile network has to be managed. Due to the nature of mobile networks, efficient and lightweight protocols are desired in the ITS context to ensure adequate service performance. However, the security is also a key factor in this scenario. Since the management of the mobility is essential for providing communications, the protocol for managing this mobility has to be protected. Furthermore, there are safety-oriented services in this scenario, so user application data should also be protected. Nevertheless, providing security is expensive in terms of efficiency. Based on this considerations, we have developed a solution for managing the network mobility for ITS scenarios: the NeMHIP protocol. This approach provides a secure management of network mobility in an efficient manner. In this article, we present this protocol and the strategy developed to maintain its security and efficiency in satisfactory levels. We also present the developed analytical models to analyze quantitatively the efficiency of the protocol. More specifically, we have developed models for assessing it in terms of signaling cost, which demonstrates that NeMHIP generates up to 73.47% less signaling compared to other relevant approaches. Therefore, the results obtained demonstrate that NeMHIP is the most efficient and secure solution for providing communications in mobile network scenarios such as in an ITS context.

Travel behaviour applied in freight transportation using intelligent products

The route planning problem for an order in freight transportation involves the selection of the best route for its transportation given a set of options that the network can offer. In its adaptive (or dynamic) version, the problem deals with the planning of a new route for an order while it is actually in transit typically because part or all of its pre-selected route is blocked or disrupted. In the intelligent product approach we are proposing, an order would be capable of identifying and evaluating such new routes in an automated manner and choosing the most preferable one without the intervention of humans. Because such approaches seek to mirror (and then automate) human decision making, in this paper we seek to identify new ways for dynamic route planning in industrial logistics inspired by the way people make similar decisions about their journey when they travel in multi-modal networks. We propose a new simulation game as a methodological tool for capturing their travel behaviour and we use it in this study. The results show that a simulation game can be used for capturing strategies and tactics of travellers and that intelligent products can provide a proper platform for the usage of such strategies in freight logistics. © 2012 IEEE.

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.

A conceptual framework for designing pharmaceutical reverse logistics networks in China

Over latest decade, Reverse Logistics (RL) has gained more and more attention from both industry and academia. In the past, most research on RL has been focused on automobile, electronic waste, computer, paper, package and package material. There is very little research and practice on drug recycling. Nevertheless, it is vital important to properly dispose expired drug because of hazardous contain which may harm to people and environment. In China, public awareness of the harmfulness of expired drugs is still very low and very few efforts have been made to recycle drugs. Therefore, this research aims to build up a conceptual framework to indentify factors of influencing drug recycling in China, from scratch borrowing from existing literature and industry practices in other recycling areas. This framework helps in designing reverse logistic (RL) network and also can provide a useful reference tool for policymakers at the local and national level. Furthermore, a primary research is planed to validate the framework and RL network.

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.

Location-Awareness for Radios and Networks: Part I

The papers in this special issue focus on the topic of location awareness for radio and networks. Localization-awareness using radio signals stands to revolutionize the fields of navigation and communication engineering. It can be utilized to great effect in the next generation of cellular networks, mining applications, health-care monitoring, transportation and intelligent highways, multi-robot applications, first responders operations, military applications, factory automation, building and environmental controls, cognitive wireless networks, commercial and social network applications, and smart spaces. A multitude of technologies can be used in location-aware radios and networks, including GNSS, RFID, cellular, UWB, WLAN, Bluetooth, cooperative localization, indoor GPS, device-free localization, IR, Radar, and UHF. The performances of these technologies are measured by their accuracy, precision, complexity, robustness, scalability, and cost. Given the many application scenarios across different disciplines, there is a clear need for a broad, up-to-date and cogent treatment of radio-based location awareness. This special issue aims to provide a comprehensive overview of the state-of-the-art in technology, regulation, and theory. It also presents a holistic view of research challenges and opportunities in the emerging areas of localization.

Non-parametric bill of quantities estimation of concrete road bridges' superstructure: an artificial neural networks approach

Bridge construction responds to the need for environmentally friendly design of motorways and facilitates the passage through sensitive natural areas and the bypassing of urban areas. However, according to numerous research studies, bridge construction presents substantial budget overruns. Therefore, it is necessary early in the planning process for the decision makers to have reliable estimates of the final cost based on previously constructed projects. At the same time, the current European financial crisis reduces the available capital for investments and financial institutions are even less willing to finance transportation infrastructure. Consequently, it is even more necessary today to estimate the budget of high-cost construction projects -such as road bridges- with reasonable accuracy, in order for the state funds to be invested with lower risk and the projects to be designed with the highest possible efficiency. In this paper, a Bill-of-Quantities (BoQ) estimation tool for road bridges is developed in order to support the decisions made at the preliminary planning and design stages of highways. Specifically, a Feed-Forward Artificial Neural Network (ANN) with a hidden layer of 10 neurons is trained to predict the superstructure material quantities (concrete, pre-stressed steel and reinforcing steel) using the width of the deck, the adjusted length of span or cantilever and the type of the bridge as input variables. The training dataset includes actual data from 68 recently constructed concrete motorway bridges in Greece. According to the relevant metrics, the developed model captures very well the complex interrelations in the dataset and demonstrates strong generalisation capability. Furthermore, it outperforms the linear regression models developed for the same dataset. Therefore, the proposed cost estimation model stands as a useful and reliable tool for the construction industry as it enables planners to reach informed decisions for technical and economic planning of concrete bridge projects from their early implementation stages.

QoS improvement in TCP/IP-based wireless sensor networks using cross-layer optimization

Dissertação de Mestrado, Engenharia Informática, Faculdade de Ciências e Tecnologia, Universidade do Algarve, 2015

Comprehensive Statewide Transportation Model: Multimodal Investment Analysis Methodology Phase II, CTRE Project 02-126, 2001

The purposes of this report (Phase II of the project) are to specify in mathematical form the individual modules of the conceptual model developed in Phase I, to identify and evaluate sources of data for the model set, and to develop the transport networks necessary to support the models.

MODELING THE EVOLUTION OF COMPLEX NETWORKS THROUGH THE PATH-STAR TRANSFORMATION AND OPTIMAL MULTIVARIATE METHODS

The topology of real-world complex networks, such as in transportation and communication, is always changing with time. Such changes can arise not only as a natural consequence of their growth, but also due to major modi. cations in their intrinsic organization. For instance, the network of transportation routes between cities and towns ( hence locations) of a given country undergo a major change with the progressive implementation of commercial air transportation. While the locations could be originally interconnected through highways ( paths, giving rise to geographical networks), transportation between those sites progressively shifted or was complemented by air transportation, with scale free characteristics. In the present work we introduce the path-star transformation ( in its uniform and preferential versions) as a means to model such network transformations where paths give rise to stars of connectivity. It is also shown, through optimal multivariate statistical methods (i.e. canonical projections and maximum likelihood classification) that while the US highways network adheres closely to a geographical network model, its path-star transformation yields a network whose topological properties closely resembles those of the respective airport transportation network.

Beyond the average: Detecting global singular nodes from local features in complex networks

Deviations from the average can provide valuable insights about the organization of natural systems. The present article extends this important principle to the systematic identification and analysis of singular motifs in complex networks. Six measurements quantifying different and complementary features of the connectivity around each node of a network were calculated, and multivariate statistical methods applied to identify singular nodes. The potential of the presented concepts and methodology was illustrated with respect to different types of complex real-world networks, namely the US air transportation network, the protein-protein interactions of the yeast Saccharomyces cerevisiae and the Roget thesaurus networks. The obtained singular motifs possessed unique functional roles in the networks. Three classic theoretical network models were also investigated, with the Barabasi-Albert model resulting in singular motifs corresponding to hubs, confirming the potential of the approach. Interestingly, the number of different types of singular node motifs as well as the number of their instances were found to be considerably higher in the real-world networks than in any of the benchmark networks. Copyright (C) EPLA, 2009

On the efficiency of transportation systems in large cities

We report an analysis of the accessibility between different locations in big cities, which is illustrated with respect to London and Paris. The effects of the respective underground systems in facilitating more uniform access to diverse places are also quantified and investigated. It is shown that London and Paris have markedly different patterns of accessibility, as a consequence of the number of bridges and large parks of London, and that in both cases the respective underground systems imply in general, thought in distinct manners, an increase of accessibility. Copyright (C) EPLA, 2010