Research On Framework And Routing Algorithm In Non-cable Self-positioning Seismic Instrument Network

The existing problem of seimic explotation cable system is the construction of of low efficiency, high cost and poor flexibility under complex geological conditions. As the development of semiconductor manufacturing and wireless communications technology, a miniature sensor with wireless device would satisfy the current development trend of seismic exploration instrument based on large-scale, all-digital and high real-time, which made sound economic sense. Consequently, the integration of wireless communication technology and seismic exploration instrument has become the main direction of development of seismic exploration equipment. In future, it would be a completely new investigation in the geological exploration industry.Seismic exploration instrument researchers concern themselves on consumption efficiency and routing technology for wireless data transmission of seismic exploration instrument, since the wireless network technology combined with seismic exploration techniques. In this thesis, we specially propose Non-cable Self-positioning Seismic Instrument Network(NSSIN) for seismic exploration based on cable-free seismometers as wireless network transmission nodes, which independently developed by National Engineering Research Centre of Geophysics Exploration Instruments Jilin University, and further research on topology and routing technology of wireless seismic data transmission from the attitude of energy consumption and network lifetime. The key task of the NSSIN is to collect seismic data from seismometer nodes in an effective way. Currently, due to large number of seismometers were deployed in the wild seismic area, some seismometers spend much more energy on relaying others' seismic data in a long-range, wide-scale wireless data transmission, thereby increasing the data transmission energy of seismometer, reducing the network time of NSSIN. It greatly decreases the integrity of wireless network and the efficiency of seismic exploration.Taken into account of the above mentioned considerations, Generation Algorithm(GA) is proposed for global optimization of the agent functions. It is due to establish the agent of,ultivariable function in the NSSIN, which obtained the optimal solution of seismic data flow rate and the network lifetime depending on Wi-Fi technology. Next, we propose an optimal multiple base station deployment algorithm, this work is not only to reduce the relay seismic data for seismometers, but also to decrease wireless transmission energy, so that the network lifetime can be enhanced. Besides, an energy-balanced dynamic routing algorithm is designed, and it also effectively in reducing the average multi-hop data transmission delay, improving the energy efficiency of the NSSIN. The major research are studied in this thesis:(1) According to the seismic exploration system requirements for the communication network, a geophysics exploration instruments network based on all-wireless communications is provided. Clustering topology is used in sub-area of communication, and the Wi-Fi broadband technology is adopted to ensure the requirement of data bandwidth. In order to a reliable transmission of seismic data, the problem of seismic exploration instrument wiring difficult under the complex and harsh environments is directly addressed.(2) In order to ensure the integrity of the NSSIN, the function mapping among the seismic data collection flow rate, the flow rate of seismic data transmission and the network lifetime is established by using a Kriging model. Meanwhile, the agent functions of network network lifetime are optimized by GA. Considering the constructed NSSIN, the theoretical model of wireless seismic data transmission are established by the numerical analysis software Matlab/Simulink. The effect of wireless seismic data transmission is also verified by simulation.(3) To reduce the energy consumption and improve the network lifetime of seismometer in wireless data transmission. A distributed optimal base station deployment algorithm is proposed in this thesis. The mathematical model of seismometer number, base station transmission range and number of base station is built by graph theory approach, so that resulting out an optimal number of base station to be deployed. Meanwhile, it is also satisfy the requirement of optimal number and location of base station placement according to maximize the network lifetime. The simulation analysis shows that comparing the proposed algorithm to single base station deployment, it has a greatly exaltation, in particularly on network lifetime and the algorithm running time.(4) Aim to ensure the integrity of wireless networks, reduce the energy consumption, and address the constraints of wild environments. We make an intensive study of known number k base stations deployment in the NSSIN, and two novel algorithms are proposed, namely polynomial time optimization algorithm and (2-(?)) approximation optimization algorithm respectively. According to the Voronoi diagram mothed, the whole seismic network would be portioned into k disjoint clusters, so that reducing the energy consumption with the minimized total data transmission hops. Furthermore, we present a heuristic algorithm for balancing clusters of seismometers based on the characteristics of independent and dominate sets, and repeatedly moves a seismometer from a cluster with a large total hop distance to a neighboring cluster with a smaller total hop distance until clusters become balanced. The proposed heuristic algorithm further decreases the power consumption of the NSSIN.(5) By analyzing the features of cluster routing protocol, and studying the exchange information between seismometers. In this thesis, we propose an energy-balanced clustering algorithm for the NSSIN, which selects the cluster head dynamically, and a new competition radius of cluster heads is designed, through residual energy and base station location. In order to relieve the problem of excessive energy consumption, the numerical aspect of dynamic clustering size is designed. Additionally, through the TSP problem study, the formation of inter-cluster routing expression are deduced based on random geometric graph theory. The pareto-candidate set is generated by the formation, which uses Hamming distance to update the initial pareto-candidate set, and meets the requirement of minimizing the average multi-hop delay in routing algorithm. The simulation further proves the positive performance of our routing protocol in the average multi-hop delay and transmission time.