Principles of cost minimisation in wireless networks

DOI10.1007/S10732-005-0433-YzbMATH Open1122.90315OpenAlexW2060831714WikidataQ105047194 ScholiaQ105047194MaRDI QIDQ2573007FDOQ2573007

Authors: Vic Grout 

Publication date: 7 November 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://glyndwr.collections.crest.ac.uk/175/1/fulltext.pdf

Recommendations

• Cost minimization in wireless networks with a bounded and unbounded number of interfaces
• Distributed Computing – IWDC 2005
• Optimization in wireless networks
• Cost Minimisation in Multi-interface Networks
• Wireless network optimization by Perron-Frobenius theory
• Approximation schemes for wireless networks
• On cost allocation in communication networks
• Minimum Cost Blocking Problem in Multi-Path Wireless Routing Protocols

zbMATH Keywords

wireless networkspath constraintsadd algorithmdrop algorithmedge constraintsload constraintsminimum connected vertex cover problemnode constraints

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• A note on two problems in connexion with graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Network Optimization Problems: Algorithms, Applications and Complexity

Cited In (4)

• Connected Vertex Covers in Dense Graphs
• Minimum Cost Blocking Problem in Multi-Path Wireless Routing Protocols
• The minimum cost hop-and-root constrained forest in wireless sensor networks
• Cost minimization in wireless networks with a bounded and unbounded number of interfaces

This page was built for publication: Principles of cost minimisation in wireless networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573007)