The minimum cost hop-and-root constrained forest in wireless sensor networks

DOI10.1016/J.ENDM.2009.11.024MaRDI QIDQ2840531zbMATH OpenOpenAlexFDO

Authors Carla Bechelane, Alexandre Salles da Cunha, Geraldo Robson Mateus

Publication date 19 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.11.024

zbMATH Keywords

combinatorial optimizationheuristicshop-constrained treesnetwork flows

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
• Principles of cost minimisation in wireless networks
• A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks
• A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks
• Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks

Cites work

• Multicommodity flow models for spanning trees with hop constraints
• Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem

Cited in

(8)

• The p-arborescence star problem: formulations and exact solution approaches
• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
• Heuristic approaches for the optimal wiring in large scale robotic skin design
• An exact approach for the minimum-cost bounded-error calibration tree problem
• Using VNS for the optimal synthesis of the communication tree in wireless sensor networks
• Stronger column generation bounds for the minimum cost hop-and-root constrained forest problem
• Scalability Analysis of a Novel Integer Programming Model to Deal with Energy Consumption in Heterogeneous Wireless Sensor Networks
• Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks

This page was built for publication: The minimum cost hop-and-root constrained forest in wireless sensor networks

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