Wireless sensor networks offer a wide range of challenges to networking research, including unconstrained network scale, limited computing, memory and energy resources, and wireless channel errors. In this paper, we study the problem of delivering messages from any sensor to an interested client user along the minimum-cost path in a large sensor network. We propose a new cost field based approa...

Routing real-time traffic with good Quality of Service (QoS) is a challenging task in Mobile Ad-Hoc Networks (MANETs). Energy Aware Fuzzy based Multi Constrained Single path QoS Routing (E-FMSQR) protocol which is an extension of AODV is proposed to find an optimal path by considering multiple QoS metrics. Considering Multiconstraints like Bandwidth, Delay, Number of Hops and Energy, a single f...

This paper investigates minimum time and minimum cost path problems in street networks regulated by periodic traffic lights. We show that the minimum time path problem is polynomially solvable. On the other hand, minimum cost path problems are generally NP-hard. Special, realistic, cases which are polynomially solvable are discussed. Dynamic shortest path problems often arise in transportation ...

Given a complete graph on n nodes with metric edge costs, the minimum-cost khop spanning tree (kHMST) problem asks for a spanning tree of minimum total cost such that the longest root-leaf-path in the tree has at most k edges. We present an algorithm that computes such a tree of total expected cost O(log n) times that of a minimum-cost k-hop spanning-tree.

The Rooted Distance-Constrained Minimum Spanning Tree Problem (RDMSTP) is defined as follows: given a graph G = (V,E) with node set V = {0,1,...,n} and edge set E, two integer weights, a cost ce and a delay we associated with each edge e of E, and a natural (time limit) number H, we wish to find a spanning tree T of the graph with minimum total cost and such that the unique path from a specifie...

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimum-delay tree, and then iteratively uses a k-shortest-path (KSP) algorithm to search for a ...

This work studies conflict avoidance between moving, non-communicating agents with minimum sensing information. While safety can be provided by reactive obstacle avoidance methods for holonomic systems, deadlock avoidance requires reasoning over different homotopic paths in cluttered scenes. A method to compute the “interaction cost” of a path is proposed, which considers only the neighboring a...