Robert Jackson Marks

Learn More
— We consider the problem of maximizing the time-to-first-failure, defined as the time till the first node in the network runs out of battery energy, in energy constrained broadcast wireless networks. We discuss a greedy algorithm and prove that it solves the problem optimally for a broadcast application , in polynomial time, provided the complete power(More)
— Broadcasting in wireless networks, unlike wired networks, inherently reaches several nodes with a single transmission. For omni-directional wireless broadcast to a node, all nodes closer will also be reached. This property can be used to compute routing trees which minimize the sum of the transmitter powers. It has been shown that this problem is(More)
— We consider the problem of minimum power bidi-rectional topology optimization in wireless networks with sectored antennas. We first develop a mixed integer linear programming model for optimal solution of the problem with sectored antennas. Subsequently, we discuss a centralized heuristic algorithm which is based on Kruskal's algorithm for the minimum(More)
—Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in practice some searches appear to outperform others. In consequence, some have questioned the significance of COI to the performance of search algorithms. An underlying foundation(More)
—A common approach to pattern classification problems is to train a bank of layered perceptrons or other classifiers by clustering the input training data and training each classifier with just the data from a specific cluster. There is no provision in such an approach, however, to assure the component layered perceptron is well suited to learn the training(More)
— We consider the problem of minimum power multi-casting in wireless networks with sectored antennas. For omnidi-rectional wireless broadcast to a node, a transmission from node i to node j will also reach all nodes which are closer to i than j. Depending on the network geometry, this strategy can be highly power efficient. In ideal sectored antenna(More)
  • 1