Harri Haanpää

Learn More
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear equations followed by clausification. Schemes for introducing nonlinearity to the instances are developed, making the instances suitable for benchmarking solvers with equivalence(More)
A subset S = {s1; : : : ; sk} of an abelian group G is called an St-set of size k if all sums of t di2erent elements in S are distinct. A function with applications in coding theory, v (k) denotes the order of the smallest cyclic group in which an S2-set of size k exists. A lower bound for v (k) is given in this study, and exact values of v (k) are obtained(More)
A subset S = {s1, . . . , sk} of an Abelian group G is called an St-set of size k if all sums of t different elements in S are distinct. Let s(G) denote the cardinality of the largest S2-set in G. Let v(k) denote the order of the smallest Abelian group for which s(G) ≥ k. We develop bounds for s(G), and we determine v(k) for k ≤ 15 by determining s(G) for(More)
We approach the problem of load balancing for wireless multi-hop networks by distributed optimisation. We implement an approximation algorithm for minimising the maximum network congestion as a modification to the DSR routing protocol. The algorithm is based on shortest-path computations that are integrated into the DSR route discovery and maintenance(More)
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each game two of the players play as partners against the other two. All pairs of players must play in the same game exactly three times during the tournament; of those three times, they(More)
We consider the problem of balancing the traffic load ideally over a wireless multihop network. In previous work, a systematic approach to this task was undertaken, starting with an approximate optimisation method that guarantees a provable congestion performance bound, and then designing a distributed implementation by modifying the DSR protocol. In this(More)
We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor network with stationary nodes and static power assignments. Our algorithm determines the transmission power level inducing the maximum-lifetime spanning subgraph of a network by means of a(More)
We consider the problem of static transmissionpower assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a datagathering scenario. Using a graph-theoretic approach, we propose two distributed algorithms, MLS and BSPAN, that construct spanning trees with minimum maximum (minmax) edge cost. MLS is based on(More)
We consider the fair multicommodity flow problem in multihop wireless networks. We optimize the flow between a number of source-destination pairs to achieve a fair allocation of network resources while satisfying node capacity constraints. To account for the limitations of wireless devices, we use a path-based formulation and allow only a bounded number of(More)