Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Range assignment for energy efficient broadcasting in linear radio networks

From MaRDI portal
Publication:818149
Jump to:navigation, search

DOI10.1016/j.tcs.2005.11.046zbMath1090.90027OpenAlexW2001398426MaRDI QIDQ818149

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

Publication date: 24 March 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.046


zbMATH Keywords

algorithmbroadcastrange assignmentmobile communication


Mathematics Subject Classification ID

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


Related Items

IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS ⋮ The homogeneous broadcast problem in narrow and wide strips. I: Algorithms ⋮ Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem ⋮ Weighted broadcast in linear radio networks ⋮ Homogeneous 2-hop broadcast in 2D



Cites Work

  • Unnamed Item
  • Applications of generalized matrix searching to geometric algorithms
  • The minimum range assignment problem on linear radio networks
  • Power consumption in packet radio networks
  • The minimum broadcast range assignment problem on linear multi-hop wireless networks.
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:818149&oldid=12766000"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 14:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki