12,356 research outputs found

    Minimum power multicasting with delay bound constraints in Ad Hoc wireless networks

    Get PDF
    In this paper, we design a new heuristic for an important extension of the minimum power multicasting problem in ad hoc wireless networks. Assuming that each transmission takes a fixed amount of time, we impose constraints on the number of hops allowed to reach the destination nodes in the multicasting application. This setting would be applicable in time critical or real time applications, and the relative importance of the nodes may be indicated by these delay bounds. We design a filtered beam search procedure for solving this problem. The performance of our algorithm is demonstrated on numerous test cases by benchmarking it against an optimal algorithm in small problem instances, and against a modified version of the well-known Broadcast Incremental Power (BIP) algorithm 20 for relatively large problems

    On the Cryptographic Hardness of Local Search

    Get PDF
    We show new hardness results for the class of Polynomial Local Search problems (PLS): - Hardness of PLS based on a falsifiable assumption on bilinear groups introduced by Kalai, Paneth, and Yang (STOC 2019), and the Exponential Time Hypothesis for randomized algorithms. Previous standard model constructions relied on non-falsifiable and non-standard assumptions. - Hardness of PLS relative to random oracles. The construction is essentially different than previous constructions, and in particular is unconditionally secure. The construction also demonstrates the hardness of parallelizing local search. The core observation behind the results is that the unique proofs property of incrementally-verifiable computations previously used to demonstrate hardness in PLS can be traded with a simple incremental completeness property
    • …
    corecore