Font Size: a A A

Wireless Sensor Network Topology Control Algorithm And The Complexity Of Network Analysis

Posted on:2012-05-26Degree:MasterType:Thesis
Country:ChinaCandidate:Z X ZhangFull Text:PDF
GTID:2248330395464097Subject:Computational Mathematics
Abstract/Summary:PDF Full Text Request
Wireless sensor network is a new research field of information science, and it combines sensors, embedded computing, communication networks and distributed information processing technology. It is composed of a large number of low-cost micro sensor nodes deployed in the monitoring area, and it becomes a multi-hop ad hoc networks by wireless communication. Wireless sensor network takes the perception into every corner of the world deeply though interconnection of things and objects, and it will change people’s lives and have profound impact on industry. It is a revolution of information of the perception and the acquisition. WSN must become an important part of the next generation Internet.This paper describes the main features of wireless sensor networks and reviews the development status of WSN at home and abroad. WSN has many technologies which are be studied and improved. This paper focuses on network topology control algorithms and analysis of the complexity of establishing a single-hop or multi-hop network based on the slotted ALOHA.This paper is divided into two parts. The first part is the wireless sensor network topology control algorithm. The improved(k,j)-NN algorithm and the ([t,1],k,j)-NN algorithm are proposed in this paper on the basis of the (k,j)-NN. In the(k,j)-NN algorithm, the degree of each node is not more than4.5, which is significantly lower than6~8, which is the existing conclusions. The(k,j)-NN algorithm that can guarantee the network connectivity with high probability can reduce the number of neighbor nodes which are participate in forwarding information. So it reduces message collision and improves the network throughput and it also save energy of neighbor nodes and prolong the life of the node.The improved (k,j)-NN algorithm and the([t,1], k, j)-NN algorithm not only possess above-mentioned characteristic of the (k,j)-NN algorithm, but also has a low degree distribution which is more concentrated, a higher probability of connectivity, a shorter radius of the emission and lower power consumption, and its average maximum degree is lower. Simulation shows these results.In the part Ⅱ, this paper analyzes the complexity of establishing WSN network based on the slotted ALOHA. In single-hop wireless sensor networks, if the network nodes know the network size N, each node sends packets with the probability P, which it can be constantly adjusted. The expectation of time for establishing the network with respect to N drops from increasing exponentially to increasing linearly, and energy consumed with respect to N drops from increasing exponentially to increasing at most N2. In the case of that nodes don’t know the network scale, we offer a rule to finish the establishment and also discuss the probability of the misjudgment.
Keywords/Search Tags:network topology, ([t,1],k,j)-NN algorithm, establishment complexity, energy expectation, misjudgment probability
PDF Full Text Request
Related items