Leader election is a fundamental building block for many applications. Particularly, there have been many methods proposed for solving the leader election problem in the literature. Solving the leader election problem in static networks is easier than in dynamic networks because dynamic behavior of processes must be considered in the latter. A simple way to solve this problem in dynamic networks is attaching a synchronous clock to each process. But doing so violates the assumption of asynchrony. Moreover, a leader had better be a process with the best performance-related characteristic among all nodes within a connected component. In this paper, we present an efficient leader election algorithm with regard to performance-related characteristics for dynamic networks, without any synchronous clock assumption.