A Study On Routing Algorithms For Mobile Sensor Networks Based On Game

Mobile Sensor Networks are a complex network model, which have both topology structure of opportunity networks and characteristics of Wireless Sensor Networks, widely used in fileds of wildlife tracking, inspecting of environmental quality, monitoring of circulating virus, and vehicle-mounted sensor system. The feature of discontinuous or partlial connection leads to the tolerant delay for network transmission from source to destination collected by nodes. For restricted of energy or cache space, sensors may be “selfishness” when encounter others which reduces the performance of networks, an incentive mechanism designed appropriately for mobile sensor network, is a key of designing routing.Firstly, the background and current research of routing algorithms for mobile sensor network based on game are given, also based on classification of the current routing algorithms used for mobile sensor network by game theory, some typical algorithms are presented.Secondly, in reference to the solution of “Prisoner’s dilemma”, a low-power and high efficient routing algorithm based on game for mobile sensor networks is proposed. This algorithm try to solve the problem of choosing a next hop with only one factor of reputation and ignoring of remaining energy, the inaccurate of reputation results from non-selfish behavior, the large overhead of control information in the layer of network, and the invalid energy costs of nodes, by piggybacking information of residual energy through the credibility matrix, judgement mechanism of transmitting data based on residual energy, and unicasting control information by credibility matrix. Above all improve the performance of networks in terms of energy consumption, success rate of data transmission and throughput of networks.Thirdly, by taking thought of battering in account, a new algorithm of routing named low overhead and high-throughput routing algorithm based on virtual currency for mobile sensor networks is proposed, based on mechanism of virtual currency this algorithm solves the problem of earlier death happened in high efficient nodes; Based on copy number of data, reducing some control messages between nodes and sinks; By accepting data based on DLAM(delete list ack message), avoiding nodes receive information that have been accepted by sinks. To a certain extent, the new algorithm reduces redundancy of control information, and improves the efficiency of data in the networks and makes better of network performance.Finally, a summary of this thesis is presented, and some directions deserved to have a further study for routing algorithms of mobile sensor networks based on game are given.