Optimal link constructions of network topology design using partitioning method in Ad Hoc environments

DOI10.1080/02522667.2007.10699751MaRDI QIDQ5455037zbMATH OpenOpenAlexFDO

Authors R. C. Chen, Wei-Tsong Lee, Jim-Min Lin

Publication date 3 April 2008

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.2007.10699751

zbMATH Keywords

bipartite graph

Mathematics Subject Classification ID

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

Recommendations

• Optimal cost estimation with efficient link topology design based onN-partite graph method in ad-hoc networks
• Geometric partitioning and robust ad-hoc network design
• A near-optimal optimization algorithm for link assignment in wireless ad-hoc networks
• Publication:4728133
• The optimal partitioning of networks
• Ad hoc networks: optimization problems and solution methods
• Optimization of a topologically tree-based local area network

Cites work

• Channel identification for high speed digital communications
• The capacity of wireless networks

Cited in

(2)

• Generic link cost estimation for large number of moving mobiles by using two-array method based onN-partite mechanism in ad-hoc networks
• Optimal cost estimation with efficient link topology design based onN-partite graph method in ad-hoc networks

This page was built for publication: Optimal link constructions of network topology design using partitioning method in Ad Hoc environments

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