The minimum broadcast range assignment problem on linear multi-hop wireless networks.

DOI10.1016/S0304-3975(02)00538-8zbMath1051.90007OpenAlexW2142389389MaRDI QIDQ1874421

Riccardo Silvestri, Andrea E. F. Clementi, Miriam Di Ianni

Publication date: 25 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00538-8

zbMATH Keywords

Dynamic programmingAd hoc wireless networksEnergy consumption

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items (13)

Range assignment for energy efficient broadcasting in linear radio networks ⋮ IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS ⋮ On the Bounded-Hop Range Assignment Problem ⋮ Sharing the cost of multicast transmissions in wireless networks ⋮ The online broadcast range-assignment problem ⋮ Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem ⋮ On the hardness of range assignment problems ⋮ The Online Broadcast Range-Assignment Problem ⋮ Bounded-hop communication networks ⋮ Weighted broadcast in linear radio networks ⋮ Bounded-hops power assignment in ad hoc wireless networks ⋮ Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks ⋮ Homogeneous 2-hop broadcast in 2D

Cites Work

• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Power consumption in packet radio networks
• Efficient management of transient station failures in linear radio communication networks with bases
• Multiple Communication in Multihop Radio Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The minimum broadcast range assignment problem on linear multi-hop wireless networks.