Ionut D. Aron

Learn More
Mobile ad hoc networks may exhibit unidirectional links due to the nature of wireless communication. Presence of unidirectional links interferes with the control ow of many existing unicast routing protocols for such networks, which adversely eeects their performance and limits their applicability. In this paper, we present a new protocol designed to(More)
Robust optimization is one of the fundamen­ tal approaches to deal with uncertainty in combinatorial optimization. This paper con­ siders the robust spanning tree problem with interval data, which arises in a variety of telecommunication applications. It proposes a constraint satisfaction approach using a combinatorial lower bound, a pruning com­ ponent(More)
In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and solve combinatorial optimization problems. These advantages include a more versatile mod-eling framework and the ability to combine complementary strengths of the two solution technologies.(More)
<italic>In this paper we investigate the effect of local error recovery vs. end-to-end error recovery in reactive protocols. For this purpose, we analyze and compare the performance of two protocols: the Dynamic Source Routing protocol (DSR[2]), which does end-to-end error recovery when a route fails and the Witness Aided Routing protocol (WAR[1]), which(More)
One of the central trends in the optimization community over the past several years has been the steady improvement of general-purpose solvers. A logical next step in this evolution is to combine mixed integer linear programming, constraint programming, and global optimization in a single system. Recent research in the area of integrated problem solving(More)
Wireless systems, and mobile ad hoc networks in particular, are more likely to experience transmission and routing errors than their wired counterpart. Factors li ke the lack of infrastructure, node mobility, and random radio link quality can contribute to significantly higher error rates in these networks. In addition, errors have a more serious impact on(More)
We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consistent value polytope and give a linear programming description that is provably tighter than a recently studied formulation. We then provide an experimental study that shows that, despite the(More)
This paper studies the complexity of the robust spanning tree problem with interval data (RSTID). It shows that the problem is NP-complete, settling the conjecture of Kouvelis and Yu, and that it remains so for complete graphs or when the intervals are all [0; 1]. These results indicate that the diiculty of RSTID stems from both the graph topology and the(More)
  • 1