#### Filter Results:

#### Publication Year

1999

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

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)

A robust control design is proposed for the lane-keeping and obstacle avoidance of semiautonomous ground vehicles. A robust Model Predictive Controller (MPC) is used in order to enforce safety constraints with minimal control intervention. An uncertain driver model is used to obtain sets of predicted vehicle trajectories in closed-loop with the predicted… (More)

This paper presents the design of an active safety system for prevention of unintended roadway departures. In normal driving conditions, the driver fully commands the vehicle while the safety system corrects the driver's steering and braking action in case there's a risk that the vehicle unintentionally departs the road. A model of the driver's nominal… (More)

We consider the problem of maximizing the time-to-first-failure (TTFF), defined as the time till the first node in the network runs out of battery energy, in energy constrained broadcast wireless networks. We show that the TTFF criterion , by itself, fails to provide the " ideally optimum " mul-ticast tree and propose a composite weighted objective function… (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)

In this paper, we address the minimum power broadcast problem in wireless networks. Assuming nodes are equipped with omni-directional antennas, the inherently broadcast nature of wireless networks can be exploited to compute power efficient routing trees. We propose a 2-stage cluster-merge algorithm for computing minimum power broadcast trees. The cluster… (More)

Wireless multicast/broadcast sessions, unlike wired networks , inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all nodes closer will also be reached. An algorithm for constructing the minimum power tree in wireless networks was first proposed by Wieselthier et al.. The broadcast incremental… (More)

Wireless multicast/broadcast sessions, unlike wired networks , inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all nodes closer will also be reached. Heuristics for constructing minimum power trees in wireless networks have been proposed by Wieselthier et al [1] and Stojmenovic et al [2]. In… (More)

- Payman Arabshahi, Andrew Gray, Ioannis Kassabalidis, Arindam Das, Sreeram Narayanan, Mohamed El-Sharkawi
- 2001