| Dynamic networks have been widely used in various applications with the development of wireless communication technology and the emergence of smart devices.The communication between devices by broadcasting message which creates a lot of information redundancy and wastes much energy.In this thesis,we consider two problems of the dynamic networks: one is how to prolong the lifetime of the network;another one is how to save energy.Leader election algorithm is one of the basic algorithms,it can solve these problems.Therefore,it is necessary to design effective and reasonable algorithms.Leader election,i.e.,electing one node controls the whole system or networks.Based on a large amounts of researches and analysis of the present leader election algorithms,first of all,we design the algorithms of VLE,NMDLE and PSMLE in dynamic networks.Nodes in dynamic networks have the mobility,that is,nodes may move at any time,the topology of the network will change.If we want to solve the leader election problem,using the existing knowledge is not enough,we must know the ID and the location information of the nodes.Then,we give the improved leader election algorithm MLE+ES in dynamic networks,we can better use the mobility of nodes.Specifically,we have proved the correctness and the effectiveness of these algorithms respectively from the theoretical and simulation analysis.In details,we first design a distributed leader election algorithm(Voronoi based multi-leader election algorithm,VLE),then we consider the mobility of nodes and sleeping mechanism,we design node moving based distributed multi-leader election algorithm(NMDLE).Finally,we give the periodic sleeping mechanism-based multi-leader election algorithm(PSMLE),which gives the periodic sleeping mechanism,achieving the target of saving energy.We give two algorithms multi-leader election algorithm(MLE)and energy saving algorithm(ES),the state of nodes is changed by sending different messages,resulting in a connected network saving energy. |
PDF Full Text Request