Font Size: a A A

The Research On WSN Routing Mechanism Based On Dynamic Game

Posted on:2013-09-07Degree:MasterType:Thesis
Country:ChinaCandidate:D R TianFull Text:PDF
GTID:2248330395462138Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
With the development of wireless communication technology,embedded computing technology, micro-electrometrical technology,wireless sensor networks technology has developed rapidly. Manyinstitutions and researchers have done a lot of research about wirelesssensor networks, since the concept of wireless sensor network posed.These researches have not only contributed on build up of thefoundation of wireless sensor network, but also have the positiveeffect on both wireless sensors promotion and application. The wirelesssensor network has limited battery resource. Thereby the key of issue inWSN routing protocol technology is how to reducing and balancing theenergy consumption.This paper propose a hierarchical routing protocol based ondynamic gamer theory in wireless sensor network (DynamicGame-Hierarchical Routing, DGHR).The DGHR protocol is composedof cluster-head election algorithm and the routing algorithm of adjacentclusters by applying the game theory.the main parts of the paperincludes the following three aspects:1. In the cluster-head election phase, combine with the relativedensity of the node distribution and energy consumption, as well as theenergy consumption of node transmission to build a cluster headelection dynamic game model, which based on the Game of thedecision-making process of rational node. That can improve the node tobecome cluster head probability which is Cluster transmission energyconsumption is low, the remaining higher energy and densitydistribution area.2. In the routing algorithm of adjacent clusters, combine with thecluster-head node residual energy and the jump number from Sinkcluster head node to build a cluster routing dynamic game model. Thatoptimized multi-hop routing path between clusters and balanced clusterhead nodes energy consumption. 3. This paper organically combines the cluster head election andthe adjacent cluster game model, forms a unified hierarchical routingalgorithm, altogether, based on dynamic game theory, and analysisprocess.Building upon the OMNET++network simulation platform theproposed DGHR algorithm simulation, and the LEACH protocol,UCEER protocol, under different network environments, network sizeand density of the comparative experiment. Experiments show that thevalidity of DGHR in large-scale high-density Sensor networkenvironment.
Keywords/Search Tags:wireless sensor networks, dynamic game, cluster headsselection, routing algorithm of adjacent clusters
PDF Full Text Request
Related items