Efficient and fair routing for mesh networks (Q2638366): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-010-0356-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2165892151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, Fair, and Efficient Flows in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Exit in Duopoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and fair routing for mesh networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828932 / rank
 
Normal rank

Latest revision as of 05:49, 3 July 2024

scientific article
Language Label Description Also known as
English
Efficient and fair routing for mesh networks
scientific article

    Statements

    Efficient and fair routing for mesh networks (English)
    0 references
    0 references
    0 references
    16 September 2010
    0 references
    wireless network
    0 references
    least-energy routing protocol
    0 references
    fairness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references