Vincent Park

A highly adaptive distributed routing algorithm for mobile wireless networks

We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term link reversal algorithms. The protocols reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed link reversals. The protocol is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks. In these networks, the protocols reaction to link failures typically involves only a localized single pass of the distributed algorithm. This capability is unique among protocols which are stable in the face of network partitions, and results in the protocols high degree of adaptivity. This desirable behavior is achieved through the novel use of a physical or logical clock to establish the temporal order of topological change events which is used to structure (or order) the algorithms reaction to topological changes. We refer to the protocol as the temporally-ordered routing algorithm (TORA).

Anycast routing for mobile networking

This paper considers the problem of locating and forwarding network traffic to any one of a set of distributed servers or service points-primarily in the context of mobile ad hoc networks. The advantages of providing such a capability in mobile networks through the use of anycast routing techniques at the network layer are discussed. The results of a simulation study are highlighted to demonstrate how anycast routing techniques can provide a one-to any communication capability with greater efficiency than traditional unicast based techniques. The simulation results also indicate anycast routing simplifies required configuration and management and reduces connection setup latency and overall message packet delay. Potential applications of anycast routing technology in military networks are presented and related issues are discussed.

Applicability of the temporally-ordered routing algorithm for use in mobile tactical networks

We present a conceptual overview of the temporally-ordered routing algorithm (TORA), discuss the philosophy that shaped its design and consider its applicability for use in forward-deployed mobile tactical networks. The salient characteristics of mobile, multihop, wireless networks differ significantly from those of traditional hardwired networks. Consequently, the routing protocols that have been designed for operation in the Internet are not particularly well-suited for use in mobile tactical environments. TORA, which has been tailored for operation in this highly-dynamic networking environment, represents a significant departure from the traditional shortest-path routing paradigm. We also highlight simulation results of a performance comparison with ideal link-state (ILS) routing. The results show that the relative performance of TORA and ILS is critically dependent on the network size and average rate of topological changes. The results further indicate that the performance of TORA exceeds that of ILS for the conditions expected in relatively large mobile networks, lending credence to the philosophy behind the TORA design.

FlashLinQ: enabling a mobile proximal internet

FlashLinQ is a wireless communications system founded on the realization of a wireless sense-a sense whose embodiment in devices provides Internet application peers with a direct awareness of each others physical proximity and relevance, creating a new form of proximityaware internetworking, and thereby realizing a necessary step towards what we term a Mobile Proximal Internet. The need for such a system arises from the pervasive spread of Internet devices and applications in our daily lives, and the practical limitations of current communications technologies in conveying knowledge of mutual proximity and relevance. In this paper, we introduce a mobile proximity-aware social network use case, and describe the overview of technology and our simulation, prototype implementation and initial field/lab test results.

Internetwork traffic management enhancements: evaluation and experimental results

There has been an increasing reliance on internetworking technology for military communication networks. As more diverse and mission critical applications begin to coexist within this shared infrastructure the need for improved network traffic and bandwidth management becomes apparent. Previous developments within the research community and within commercial products provide numerous candidate technologies that may be applied as solutions. This paper explores a set of such techniques while evaluating their relative merits and performance tradeoffs. A subset of empirical results from an actual testbed environment is also provided and discussed.