Research On The Technologies Of Ad Hoc Networks For Energy Consumption Restraint

Ad hoc networks is a special wireless mobile communication system, whichcomposed of mobile terminals with wireless communication device. It is typicallycharacterized by its un-center, self-organizing and multi-hop routing mechanisms. Adhoc networks can be widely used in battlefield, emergency disasters and open field forits specialties of strong invulnerability and needless of basic network facilities.Especially the advent of Internet of Things has greatly improved the development ofAd hoc networks. However, the research works still face great challenges, such as theenergy and computation limitation of nodes, the highly changed topology and the lowsecurity of communication.In this paper, we focus our research on routing protocols, data query algorithmsand data aggregation algorithms of Ad hoc networks surrounding the target of energyconsumption restraint. Following are the main points of this paper.(1) On the aspect of routing protocol, we propose a byte level energy consump-tion evaluate method which can accurately compute the energy consumption of Adhoc networks called Becand a routing protocol which can obviously decrease theenergy consumption of the network called SFR. Becis a hierarchical energy consump-tion formula, it uses the Net Simulator-2to assess the energy consumption of thecommunication process based on exploring the packets sent in different layers of theprotocol stacks; SFR introduces a selection forward mechanism based on the nodeconnectivity inorder to limit the group of forward nodes then minimize the number ofredundant messages and reduce the energy consumption of the network, as well as ashortcut find mechanism to optimize the route response path. Simulation results showthat, with56.1%less redundant messages and30.2%less energy consumption thanflooding, SFR performances excellent in route discovery similarly as flooding.(2) On the aspect of data query algorithm, we propose the BFF algorithm basedon bi-filter mechanism and the IVDQP algorithm based on the node interest vector. The BFF algorithm introduces a logical top-filter and a logical bottom-filter to reducethe redundant messages in the network evoked by the using of flooding algorithmduring the data query process. In BFF, only the node who satisfies the demands ofthese two filters forwards the query message. Performance analysis shows that, incomparison with the flooding algorithm, BFF can greatly reduce the message consum-ption while still keeping100%node coverage rate for the distributed resource queryprocessing in any kind of wireless sensor networks. As the resources in Ad hocnetworks often index in interest manner, this paper implements an Interest-Vector-based Distributed Query Processing method called IVDQP. Under the framework ofIVDQP, once a node requests a resource, the request is forwarded node by node in aunicast manner and the indexes of the requested resources returned by the nodes areaccumulated along the forwarding path until they arrives at the source node whocommits the resource request. IVDQP can not only locate the requested resource asmuch as possible but also promise a relatively low message forwarding traffic, whichcan support the construction of mobile applications with high efficiency and prolongthe lifetime of Ad hoc networks.(3) On the aspect of data aggregation algorithm, we propose the Adapting-Treealgorithm which can efficiently create different aggregation trees based on thedifference of query requests and the hierarchical aggregation algorithm AWTDSDwhich used in the clustering wireless sensor networks. In the Adapting-Tree algorithm,the aggregation tree adapts its form through the two procedures “tree tagging” and“father adjusting and operator placement”, so as to optimize the data aggregation byreconstructing adaptively a new aggregation tree in response to each series of senseddata; AWTDSD contains three phases, the time-dimensional aggregation phase, theadaptive weighted aggregation phase and the spatial-dimensional aggregation phase toaggregate the evaluate results. Simulation shows that, AWTDSD can save more than49.74%energy of the networks, obviously prolong the network lifetime, as well asefficiently increase the accuracy of sample results.