A distributed algorithm to constructing weighted minimum connected dominating set for routing in mobile wireless network

Abstract

A mobile ad-hoc network (MANET) which does not use a wired network and base station system is composed of a group of mobile and wireless nodes. In MANET, The device In MANET is not charging in time. Many method based on Connecting dominate set are utilizing to prolong the network lifetime. In this paper we propose a new greedy approach to obtain a stable routing path by integrating three factors such as energy, mobility and degree of nodes. The simulation results show that our approach is superior to other method in terms of prolonging the lifetime of MANET. While the time complexity of our algorithm is O(D), where D is the network diameter.