Font Size: a A A

Study On Routing Of Wireless Sensor Networks Based On Data Aggregation

Posted on:2012-10-21Degree:MasterType:Thesis
Country:ChinaCandidate:J DengFull Text:PDF
GTID:2178330338997768Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
Wireless Sensor Network (WSN) is a multi-hop ad hoc network which consists of a large number of spatially distributed autonomous sensors to monitor physical or environmental conditions. Ordinary sensor nodes can carry many types of sensors for field data collection, and send collected data to the sink node hop by hop.Since wireless sensor network node is resource-constrained, how we utilize the technology of topology management, energy efficient routing protocols and power control to extend the network lifetime is the core of the wireless sensor network research. Wireless sensor network routing protocol specifies path for the data transmission, which influences and determines the performance and lifetime of wireless sensor network. Intermediate nodes on the transmission path can reduce the data communication among sensor nodes through data aggregation, thereby extending the network lifetime. The thesis makes use of data aggregation technology to solve the survival isssues caused by energy constraints of wireless sensor network, and explores the network's lifetime performance with the data aggregation-based routing protocol. In wireless networks, the factors which impact routing are service type, topology, node process ability and other aspects. The existing routing algorithms for wireless sensor networks rarely consider a variety of interfering factors, and taking account of that the geometric routing is the best support for the data aggregation in routing protocols, the thesis proposes a potential field-based geometric routing algorithm, transforms the two-dimensional wereless sensor network into three-dimensional network through distance potential field, and addresses the impact of multiple factors on the route by the superposition of different potential fields. Simulation analysis shows that this algorithm can effectively handle a variety of factors which affect the routing path. And this algorithm has a quick convergence.The thesis introduces a energy consumption model to study the influence of the network lifetime by the data aggregation and routing protocol. Obtained by the derivation, network lifetime maximization problem can be transformed into a non-differential optimization problem based on jointly optimizing data aggregation and routing. The thesis also introduces the concept of bottleneck nodes and uses a smooth function approximation method to transform the optimization problem into the maximum value problem of second-order function, and also obtains sufficient conditions when the function is solvable. The thesis proposes a distributed routing algorithm based on the sufficient conditions and geometric routing protocols. Simulation analysis shows that this algorithm can handle a variety of factors which affect the routing path. And this algorithm has a quick convergence.
Keywords/Search Tags:Wireless Sensor Network, Routing, Data aggregation, Potential field, Maximum network lifetime
PDF Full Text Request
Related items