Algorithmics of wireless networks : 19th international symposium, ALGOWIN 2023, Amsterdam, the Netherlands, September 7-8, 2023, revised selected papers / Konstantinos Georgiou, Evangelos Kranakis, editors.
2023
TK7872.D48
Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Algorithmics of wireless networks : 19th international symposium, ALGOWIN 2023, Amsterdam, the Netherlands, September 7-8, 2023, revised selected papers / Konstantinos Georgiou, Evangelos Kranakis, editors.
Meeting Name
International Symposium on Algorithmics of Wireless Networks (19th : 2023 : Amsterdam, Netherlands).
ISBN
9783031488825 (electronic bk.)
3031488822 (electronic bk.)
9783031488818
3031488822 (electronic bk.)
9783031488818
Published
Cham : Springer, [2023]
Copyright
©2023
Language
English
Description
1 online resource (ix, 151 pages) : illustrations (some color).
Other Standard Identifiers
10.1007/978-3-031-48882-5 doi
Call Number
TK7872.D48
Dewey Decimal Classification
005.1
Summary
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.
Note
International conference proceedings.
Includes author index.
Includes author index.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed December 6, 2023).
Series
Lecture notes in computer science ; 14061. 1611-3349
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources
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.
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.