Declarative Networking In Wireless Network

Recently there has been an explosive growth both in the number of mobile computing devices and wireless communication technologies. Wireless Ad Hoc network is becoming more and more widely used in the aspects of military, traffic, personal communication and so on. It is one indispensable part of the human society. Because of the dynamic characteristics of the wireless Ad Hoc networks, the query processing technologies in traditional distributed database are not useful in the environment.The use of query languages was proposed to express network communication algorithms such as routing protocols and declarative overlays. This approach, known as declarative networking, is extremely promising to ease the development and the deployment of networking protocols and ensure efficient communication in the network. The declarative programs can also be optimized using database techniques. However, the declarative languages in use are all monotonic in semantics, which can not use to specify the dynamic data process in network, In order to solve the problem, we present a new declarative language derived from the deductive language of last 80's, which is fit for the specifications of mobile Ad Hoc networks protocols and distributed query process.The network organization in wireless Ad Hoc networks and data query process in wireless sensor networks both are important applications of wireless networks. In this paper, we research the declarative networking in these fields. The main contributions of our work include the following aspects:First, we present a new declarative language, NetLog, which is non-monotonic in semantics, and we proved its expressions and the existence of partial fixpoint declarative programs. The main works include:1) We define the syntax and semantics of NetLog. Through the definition of negation operator and consumption operation, NetLog can specify the dynamic data process of wireless networks.2) We proved that the expression of NetLog is equal to FO+PFP.3) We give a sufficient condition of the existence of partial fixpoint of declarative program.Second, we research the network organization of wireless Ad Hoc networks. Adaptation is an important research application of routing protocols. The declarative protocols are different with the tradition ones who can not communicate each other. We present an adaptive composition protocol based on component, in which we use information table of rough set theory to solve the adaptation of different protocols. The main works include:1) We realized the traditional routing protocols in mobile Ad Hoc networks in simulation platform, such as DSDV, DSR, OLSR, AODV.2) We present the adaptive composition protocol based on component which is composed by declarative modules. We can switch one protocol to anther by replacing modules, and we can select a proper protocol by operating the information table.3) We realized simple P2P information system of MANET in simulation platform.Last, we research the query process of wireless sensor networks. The main works include:1) We realized the network organization of WSNET in simulation platform, such as tree, backbone and cluster.2) We realized the distributed minimal spanning tree protocol of weighted WSNET in simulation platform.3) We realized the distributed approximative minimal Steiner tree protocol of weighted WSNET in simulation platform.4) We realized the simple data query and data aggregation protocols of WSNET in simulation platform.