Homogeneous 2-hop broadcast in 2D

DOI10.1016/j.comgeo.2009.06.005zbMath1173.90448OpenAlexW1964672542MaRDI QIDQ1037783

Subhas C. Nandy, Gautam K. Das, Sandip Das

Publication date: 16 November 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.06.005

zbMATH Keywords

algorithmbroadcastrange assignmentmobile communication

Mathematics Subject Classification ID

Continuous location (90B85) Communication networks in operations research (90B18)

Related Items (4)

Unit disk cover problem in 2D ⋮ AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER ⋮ Discrete unit square cover problem ⋮ The within-strip discrete unit disk cover problem

Cites Work

• Unnamed Item
• Unnamed Item
• Range assignment for energy efficient broadcasting in linear radio networks
• Matrix multiplication via arithmetic progressions
• Fractional cascading. I: A data structuring technique
• The minimum broadcast range assignment problem on linear multi-hop wireless networks.
• Maximum Lifetime Broadcasting in Wireless Networks
• STACS 2004
• Covering Points by Unit Disks of Fixed Location
• Automata, Languages and Programming

This page was built for publication: Homogeneous 2-hop broadcast in 2D