Distributed formation of degree constrained minimum routing cost tree in wireless ad-hoc networks
Authors:
- Taehong KimTKTaehong Kim
- Seog Chung SeoSSSeog Chung Seo
- Daeyoung KimDKDaeyoung Kim
- 1 September 2015
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 83, 143-158
Abstract
No abstract availableKeywords
Funding Information
- National Research Foundatio (2013064540)
This publication has 19 references indexed in Scilit:
- Efficient power-consumption-based load-sharing topology control protocol for harsh environments in wireless sensor networksIET Communications, 2009
- A fast algorithm for computing minimum routing cost spanning treesComputer Networks, 2008
- Degree Bounded Network Design with Metric Costs2008
- Proposed routing for IEEE 802.11s WLAN mesh networks2006
- An ant-based algorithm for finding degree-constrained minimum spanning tree2006
- Energy-Efficient Deployment of Intelligent Mobile Sensor NetworksIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2004
- Exact algorithms for minimum routing cost treesNetworks, 2002
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree ProblemTransportation Science, 1987
- Complexity of spanning tree problems: Part IEuropean Journal of Operational Research, 1980
- Optimum Communication Spanning TreesSIAM Journal on Computing, 1974