The main problem studied in this paper is how to design an efficient method for information brokerage in sensor networks that do not use an overlay layer to organize the network and when geo-coordinates are not provided. We present a method for the solution of this problem using Directional Random Walks (DRWs) which main purpose is to construct a straight path of relaying nodes in the network. ...

The Shortest Path Problem with Resource Constraints is a common subproblem in many Branch-Cut-and-Price algorithms (BCP), e.g., routing and scheduling problems. This paper presents a general label-setting algorithm for solving various shortest path problems. An integration of the ‘Shortest Path Problem with Resource Constraints and k-cycle elimination’ with the ‘Partial Elementarity’ is introdu...

And-or graphs and theorem-proving graphs determine the same kind of search space and differ only in the direction of search: from axioms to goals, in the case of theorem-proving graphs, and in the opposite direction, from goals to axioms, in the case of and-or graphs. Bi-directional search strategies combine both directions of search. We investigate the construction of a single general algorith...

INTRODUCTION Since almost all industrial scale columns are round, the side downcomers present unique challenges for liquid distribution both to and from the downcomers. Liquid leaving these downcomers needs to spread outwardly, away from the flow path centerline, in order to evenly feed the diverging tray active area. Also, one of the characteristics of side downcomers is that they naturally te...

In this paper, we study the channel allocation in multi-channel wireless ad hoc networks with directional antennas. In particular, we investigate the problem: given a set of wireless nodes equipped with directional antennas, how many channels are needed to ensure collision-free communications? We derive the upper bounds on the number of channels, which heavily depend on the node density and the...

We propose bi-directional face traversal algorithm 2FACE to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best singledirection traversal algorithms with the worst case message complexity of O(|E|), where E is the number of network edges. We apply 2FACE to a variety of geometric routing algorithms. Our simulation ...

We propose bi-directional face traversal algorithm 2FACE to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best singledirection traversal algorithms with the worst case message complexity of O(|E|), where E is the number of network edges. We apply 2FACE to a variety of geometric routing algorithms. Our simulation ...