Capacitated Minimum Forest Problem In Wireless Sensor Networks

Due to wireless and decentralized nature, multi-hop wireless networks are attractive for variety of applications. These properties also pose significant challenges to their developers and so require new types of algorithms. In cases where traditional wired networks usually rely on some kind of centralized entity, in multihop wireless networks nodes have to cooperate in a distributed and self organizing manner. Additional side constraints, such as energy consumption, have to be taken into account as well. Therefore, the design of efficient network control mechanisms for optimizing the capabilities of complex networks is becoming an increasingly critical aspect in networking. This paper addresses constrained optimization problems. To utilize the critical WSN resources precisely, the development of approximation algorithms with quality guaranteed solutions in WSNs is desperately needed. In this paper it is shown that optimal approximation algorithms achieve highest optimization goal which minimize Cost of network resource consumption. This architecture helps to crystallize the Capacitated Minimum Forest (CMF) problem. The design progresses from for the decision version with NP completeness through devising approximation algorithms and providing upper bounds for their approximation ratios by evaluating the performance of the proposed algorithms through experimental simulation. Approximation ratio of the proposed algorithms is nearly equal to one.