Description

Book Synopsis

This book constitutes the refereed proceedings of the 19th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2023, held in Amsterdam, The Netherlands, during September 7–8, 2023.

The 10 full papers included in this book were carefully reviewed and selected from 22 submissions. They were organized in topical sections as follows: design and analysis of algorithms, models of computation and experimental analysis.



Table of Contents
Segment Visibility for k-transmitters.- Conflict Resolution in Arbitrary Hypergraphs.- Dispatching the Minimum Number of UAVs in Neighborhood IoT Networks.- Mutual Visibility with ASYNC Luminous Robots having Inaccurate Movements.- Minimum Degree and Connectivity in 1-Dimensional Line of Sight Networks.- WUBBLE: Energy Efficient BLE Neighborhood Discovery Leveraging Wake-up Radio.- Byzantine Fault-Tolerant Protocols for $(n, f)$-evacuation from a Circle.- Temporal Reachability Dominating Sets: contagion in temporal graphs.- Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information.- Run for Cover: Dominating Set via Mobile Agents.

Algorithmics of Wireless Networks: 19th

    Product form

    £42.74

    Includes FREE delivery

    RRP £44.99 – you save £2.25 (5%)

    Order before 4pm tomorrow for delivery by Mon 29 Jun 2026.

    A Paperback / softback by Konstantinos Georgiou, Evangelos Kranakis

    1 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Algorithmics of Wireless Networks: 19th by Konstantinos Georgiou

      Publisher: Springer International Publishing AG
      Publication Date: 03/12/2023
      ISBN13: 9783031488818, 978-3031488818
      ISBN10: 3031488814

      Description

      Book Synopsis

      This book constitutes the refereed proceedings of the 19th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2023, held in Amsterdam, The Netherlands, during September 7–8, 2023.

      The 10 full papers included in this book were carefully reviewed and selected from 22 submissions. They were organized in topical sections as follows: design and analysis of algorithms, models of computation and experimental analysis.



      Table of Contents
      Segment Visibility for k-transmitters.- Conflict Resolution in Arbitrary Hypergraphs.- Dispatching the Minimum Number of UAVs in Neighborhood IoT Networks.- Mutual Visibility with ASYNC Luminous Robots having Inaccurate Movements.- Minimum Degree and Connectivity in 1-Dimensional Line of Sight Networks.- WUBBLE: Energy Efficient BLE Neighborhood Discovery Leveraging Wake-up Radio.- Byzantine Fault-Tolerant Protocols for $(n, f)$-evacuation from a Circle.- Temporal Reachability Dominating Sets: contagion in temporal graphs.- Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information.- Run for Cover: Dominating Set via Mobile Agents.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account