Routing in mobile ad hoc networks (MANETs) for groups should aim at providing reliable and robust multicast routes to the group members against link failures, node failures and mobility conditions. The authors propose an agent-based multicast routing scheme in MANET that builds a backbone in the form of a reliable ring and finds multicast routes. The authors use the convex hull algorithm to fin...

1 Chemical transport through human skin can play a significant role in human exposure to toxic 2 chemicals in the workplace, as well as to chemical/biological warfare agents in the battlefield. 3 The viability of transdermal drug delivery also relies on chemical transport processes through the 4 skin. Models of percutaneous absorption are needed for risk-based exposure assessments and drug5 del...

PROBABILISTIC MODELING OF ERRONEOUS HUMAN RESPONSE TO INVEHICLE ROUTE GUIDANCE SYSTEM: A DOMAIN DECOMPOSITION-BASED ALGORITHM Abdullah Al Farooq Old Dominion University, 2013 Director: Dr. ManWo Ng Drivers are generally assumed to follow the shortest route to their destinations prescribed by in-vehicle route navigation systems without mistake. However, it is not uncommon that drivers make mista...

Convective weather is responsible for large delays and widespread disruptions in the U.S. National Airspace System, especially during summer. Although Air Traffic Flow Management algorithms exist to schedule and route traffic in the face of disruptions, they require reliable forecasts of airspace capacity. However, there exists a gap between the spatial and temporal accuracy of aviation weather...

In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or does not keep any route to desired events, such as in query flooding. In this paper, we propose a routing protocol, called hint-based routing by scope decay bloom filter (HR-SDBF), that employs probabilistic hints. In the HR...

in this paper, a new enhanced version of the particle swarm optimization (pso) is presented. an important modification is made by adding probabilistic functions into pso, and it is named probabilistic particle swarm optimization (ppso). since the variation of the velocity of particles in pso constitutes its search engine, it should provide two phases of optimization process which are: explorati...

Many Internet applications are both delay and loss sensitive, and need network performance guarantees that include bandwidth, delay/delay jitter, and packet loss rate. It is very important to quantify and exploit the capabilities of guaranteed service provisioning of communication networks. In this paper, we study the queueing behaviors of non-feedforward networks (a non-feedforward network is ...

This paper introduces GODDeS: a fully distributed self-organizing decision-theoretic routing algorithm designed to effectively exploit high quality paths in lossy ad-hoc wireless environments, typically with a large number of nodes. The routing problem is modeled as an optimal control problem for a decentralized Markov Decision Process, with links characterized by locally known packet drop prob...

We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failures, recovering from multiple failures is not guaranteed. In particular, events such as natural disasters or intentional attacks can lead to multiple correlated failures, for which recovery mechanisms are not well underst...

The Fisher information metric is an important foundation of information geometry, wherein it allows us to approximate the local geometry of a probability distribution. Recurrent neural networks such as the Sequence-to-Sequence (Seq2Seq) networks that have lately been used to yield state-of-the-art performance on speech translation or image captioning have so far ignored the geometry of the late...