We present a self-stabilizing optimal (in terms of the distance) local routing algorithm (SOLR) for a wireless mobile ad hoc network. The distance may represent various metrics, including the real distance and the number of hops. The optimal routing for any node is computed for t closest nodes (called t-set) where t is an application-dependent parameter and is decided in advance. The locality i...

We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishable power resources, both path length and path energy cost are important metrics affecting sensor lifetime. In this paper, we model the formation of length and energy constrained paths using a game theoretic paradigm. ...

The support of delay-sensitive applications like VoIP, video conferencing, video streaming, etc. on scheduled mesh networks requires careful configuration of routing and scheduling. We formulate a delay-optimal joint routing and scheduling optimization problem that minimizes the maximum average delay perceived by any flow under the physical interference model. Due to the non-convex nature of th...

Interval routing is a space-efficient routing method for point-to-point communication networks. Themethod has drawn considerable attention in recent years because of its being incorporated into the design of a commercially available routing chip. Themethod is based on proper labeling of edges of the graphwith intervals. An optimal labelingwould result in routing of messages through the shortest...

Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however, has been done on determining how the output selection function (routing policy) affects the performance of an adaptive routing algorithm. In this paper, we present a detailed simulation study of various selection functions for a fully adaptive mesh routing algori...

The system optimal routing problem has been widely studied for road network while it is less considered for public transit system. Traditional shortest-path-based multimodal itinerary guidance systems may deteriorate the system performance when the assigned lines become congested. For this issue, we formulate the dynamic system optimal routing model for multimodal transit system. The transit sy...

Wireless mesh networks (WMNs) which mediates the broadband Internet access, have been recently received many attentions by the researchers. In order to increase capacity in these networks, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi-channel WMNs (MRMC WMNs). Therefore, a vital challenge that poses in MRMC WMNs is how to properly assign channels ...

AbstmctThe essence of the basic control decisions implicit in load sharing and routing algorithms is captured in a simple model of heterogeneous queue control. We solve for the optimal control policy and investigate the performance of previously proposed policies in a tractable limit of this model. Using our understanding of this solvable limit, we propose heuristic policies for the general mod...

This paper examines “distribution policies” — that is, combined system inventoryreplenishment, vehicle routing and inventory-allocation policies — designed to minimize total expected purchasing and inventory-management (i.e., inventory-holding and backordering) costs/period for a one-warehouse N-retailer “symmetric” distribution system managed under a periodic-review policy. With respect to dyn...

Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on co...