Connect public, paid and private patent data with Google Patents Public Datasets

Method and equipment used for anonymous group information transfer in distribution type information transfer system

Info

Publication number
CN100466624C
CN100466624C CN 200610111960 CN200610111960A CN100466624C CN 100466624 C CN100466624 C CN 100466624C CN 200610111960 CN200610111960 CN 200610111960 CN 200610111960 A CN200610111960 A CN 200610111960A CN 100466624 C CN100466624 C CN 100466624C
Authority
CN
Grant status
Grant
Patent type
Prior art keywords
information
transfer
distribution
used
anonymous
Prior art date
Application number
CN 200610111960
Other languages
Chinese (zh)
Other versions
CN1960329A (en )
Inventor
徐平平
澄 曾
韩思恩
Original Assignee
华为技术有限公司;东南大学
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Grant date

Links

Abstract

本发明提供了一种路由方法,包括以下步骤:步骤a,以局部泛洪方式建立起包括了邻节点和当前节点的亲近度的路由表,其中,利用节点之间的距离和节点最大剩余能量来计算亲近度;以及步骤b,根据路由表,将源节点的数据路由到目标节点。 The present invention provides a routing method, comprising the steps of: Step a, to establish local flooding embodiment includes neighbor of the current node and the routing table close, the distance between which nodes using the node, and the maximum residual energy calculating closeness; and a step B, according to the routing table, routes the data source node to the destination node. 本发明还提供了一种路由装置。 The present invention further provides a routing device.

Description

路由方法和装置 Routing method and apparatus

^^发明涉及通4言领域,更具体而言,涉及路由方法和装置。 ^^ invention relates made through 4, and more particularly, to a method and apparatus for routing.

背景技术 Background technique

近年来,由于微电子技术、计算技术和无线通信技术等的发展, In recent years, the development of microelectronics technology, computing and wireless communications technology, etc.,

使得移动自组织(AdHoc)网络成为世界各国科研人员关注的热点之一。 Making mobile ad hoc (AdHoc) network has become one of the hottest countries in the world researchers concerned. 作为移动自组织网络的典型应用的无线传感器网络,它由无数个传感器节点组成,通过无线通信方式组成一个多跳的自组织网络,对数据进行收集处理并将之发送给用户或任务管理者。 As a movement from the wireless sensor network typically application-hoc network, which consists of numerous sensor nodes via wireless communication to form a multi-hop ad hoc network, the data collection process and sends it to the user or task manager. 它具有非常广阔的应用前景:环境监测和预4艮、医疗护理、智能家居、监控、交通、探索、以及物流管理和安全监测等。 It has a very broad application prospects: environmental monitoring and pre-4 Gen, health care, smart home, monitoring, transportation, explore, as well as logistics management and security monitoring.

移动自组织网络在计算能力、能量和内存容量等方面有着4艮大的局限性,而且通常它的应用环境都较为恶劣,无法对发生故障的移动终端节点进行正常维护。 MANET has in terms of computing power, memory capacity and energy Gen 4 big limitations, and usually its application environment are relatively poor, it can not be normal maintenance of the mobile terminal node fails. 它需要重点考虑网络生命期的问题, 传统的路由技术无法适用于移动无线自组织网络,路由技术的研究是移动自组织网络研究的重点之一。 It is important to consider the problem network lifetime, the traditional routing technology can not be applied to mobile wireless ad hoc network routing technology research is one of the mobile ad network research organizations focus.

移动自组织网络路由技术最主要的目的就是在保证数据通信的同时,延长网络生命期,采用具有竟争机制的能量管理方案来减少连接失败。 Since main purpose of the mobile network routing technology is tissue while ensuring data communications network to extend the lifetime, using the energy management scheme having a competitive mechanism to reduce connection failure. 在协议的设计上必须要遵循以下几个基本要求:首先, Must follow the following basic requirements in the design of the protocol: First of all,

由于移动自组织网络的终端节点数目灵活多变,可以从上百到上千甚至上万,所以路由协议必须具有可扩展性;其次,移动自组织网 Since MANET nodes flexible terminal number, from hundreds to thousands or even tens of thousands, the routing protocol must be scalable; secondly, MANET

络节点的分布是动态的,在路由协议的"i殳计上必须考虑其动态分布特点,路由协议必须保证移动情况下的路由稳定性;再次,因为应用环境恶劣,移动终端节点很容易发生故障或者能量耗尽,从而引起网络拓朴结构的变化,因此路由协议要具有较高的容错能力,可以根据实际情况进行路由和传输调整,减少网络能耗,保证网络畅 Distribution network node is dynamic, the dynamic distribution must be considered in the "i Shu meter routing protocols, routing protocols must ensure that the route of the movement of stability; again, because harsh environments, the mobile terminal is prone to failure node or runs out of energy, thereby causing changes in the network topology, the routing protocol to have a high fault tolerance, can be adjusted according to actual routing and transport cases, reduce network energy consumption, to ensure smooth network

通;最后,也是路由算法设计中最重要的一点,在数据处理和传输上要建立能量节省模式,在数据报告的方式上要根据实际需要选择合适的方式,这对网络的能耗和路由的稳、定性都有4艮大的影响。 Tong; Finally, the routing algorithm design is the most important point in the processing and transmission of data to establish energy-saving mode, in the way data is reported to be based on actual needs to choose the right way, which is a network of energy consumption and routing stability, qualitative Gen 4 have a big impact. 当然在某些特殊应用中还需要保证一定的服务质量,在移动自组织网络的大多数应用场景中,能耗问题是需要优先考虑重要因素之一, 这直接影响到网络的生命期。 Of course, in some special applications also need to ensure a certain quality of service, in most scenarios the mobile ad-hoc network, the energy consumption is an important factor priorities, which directly affects the lifetime of the network.

在移动自组织网络路由技术的设计上还需要注意的是,由于应用环境的千差万别和移动节点自身的物理特点,使得路由技术的通用性成为一个难题。 In the design of mobile ad hoc network routing technique further be noted that, due to the vastly different physical characteristics and application environment of the mobile node itself, so that the versatility of the routing becomes a problem. 通常网络设计者不得不针对每一个应用的具体需求,选择与之相适应的路由4几制。 Network designers typically have to address the specific needs of each application, select the route with suitable 4 a few system.

因此需要设计一种能够通过均衡因子自适应,针对不同的应用任务来选取合适路由的能量高效的路由技术。 It is necessary to design a factor adaptation by the equalizer, to select the energy efficient routing techniques suitable for different routes of application tasks.

有鉴于此,在相关4支术中提出了一种EAR (Energy Aware routing,能量公平路由)协i义(C. Rahul, J. Rabaey, "Energy Aware Routing for Low Energy Ad Hoc Sensor Networks," IEEE Wireless Communications and Networking Conference, vol.1, pp. 350-355, March 17-21, 2002.),该协议是从能耗角度考虑网络中的路由选择, 但是它并不是基于能耗最低的原则来选择路由的。 In view of this, a new EAR (Energy Aware routing, routing energy fair) RA i sense (C. Rahul, J. Rabaey four relevant surgery, "Energy Aware Routing for Low Energy Ad Hoc Sensor Networks," IEEE Wireless Communications and Networking Conference, vol.1, pp. 350-355, March 17-21, 2002.), the agreement is from the point of view of energy consumption routing network, but it is not based on the principle of the lowest energy consumption to route selection. 在相关技术的一些依据能耗最低原则来选择路由的协议中,网络在找出了能耗最低的路径之后就一直利用该条路径进行数据传输。 After a number of principles based on energy consumption to the lowest routing protocols related technologies, the network path to find the lowest energy consumption has been the use of the trail for data transmission. 但是这非常容易导致该条路径的能量4皮快速地消耗殆尽,导致最坏的结果就是网络分割,而无法继续正常工作。 But it is very easy to hide the trail leads to 4 energy quickly exhausted, leading to the worst result is that network segmentation, and can not continue to work. 因此EAR协议为了避免这种情况的出 Therefore to avoid this EAR protocol of the

现,允许使用次优路径进行数据的传输。 Now allows the use of sub-optimal paths for data transmission. 协议在目标节点和源节点之间找到多条可供数据传输使用的路径,并且i^条路径根据规则分配一个概率值。 Find the path for data transfer protocol used between a plurality of the source node and the destination node, and i ^ path probability value assigned according to a rule. 每次源节点发送数据给目标节点时协议就根据概 Each time data transmission source node to the destination node according to the protocol shall

率值随机地选择一条路径。 Values ​​randomly selected path. 很显然EAR协议中不会一直使用一条路径,这样能使网络能耗较为公平地分布在不同路径上,保证网络能更长时间地正常运作。 Obviously EAR agreements do not always use one path, so make the network a more equitable distribution of energy consumption on a different path, ensure that the network can be more time to normal operation.

图1示出了相关技术的EAR协议的流程图,EA路由协议分为三个阶段: 1 shows a flowchart of FIG EAR protocol related art, EA routing protocol is divided into three stages:

建立阶段S102:采用泛洪的方式来寻找网络中节点到目标节点的路由和路由所花费的能量成本,为数据传输建立路由表; Establishment phase S102: from flooding energy cost way to find the destination node routing and routing nodes in the network takes to establish the routing table for the data transmission;

数据传输阶段S104:根据路由表随M选择路径将数据从源节点发送给目标节点;以及 Data transfer phase S104: transmitting routing table data with the M selected paths from the source node to the target node; and

路由维护阶革殳S106:对建立的路由进4亍维护。 Route maintenance order leather Shu S106: establishing routes into right foot 4 maintenance. 由于协议并不经常采用泛洪的方式来保证路由的可用性,所以路由维护的成本很小。 Since the agreement is not often used in flood routing way to ensure the availability, the cost of routing maintenance is minimal.

然而,EAH协议通过对一组路径进行维护,并且在不同的时间选择不同的路径来保证任何单条路径上的能量都不会消耗得过快, 以达到将网络能耗平均分配、以及延长网络生命周期的目的,因此EAR协议需要收集节点的位置信息,为每个节点分配一个地址,这必然使得协议的建立阶段会非常复杂。 However, EAH protocol by the maintenance of a set of paths, and selects different paths at different times to ensure that the energy of any single path will not be consumed too quickly, in order to achieve the average energy distribution network, and to extend the life of the network the purpose of the cycle, so EAR protocol needs to collect location information of nodes, each node is assigned an address, which necessarily makes the establishment phase of the agreement will be very complicated.

另外,在相关4支术中还提出了一种GBR[2] ( Gradient-Based Routing,基于梯度路由)协i义(C. Schurgers and MB Srivastava, "Energy efficient routing in wireless sensor networks," MILCOM Procedings on Communications for Network-Centric Operations: Further, in the related art 4 also proposes a GBR [2] (Gradient-Based Routing, gradient-based routing) RA i sense (C. Schurgers and MB Srivastava, "Energy efficient routing in wireless sensor networks," MILCOM Procedings on Communications for Network-Centric Operations:

Creating the Information Force, 2001.),试图通过平衡网络中的;克量分布,从而到达均衡网络能耗,延长网络正常运作时间的目的。 Creating the Information Force, 2001.), attempts to Ping Heng network; g weight distribution, so as to achieve a balanced network energy consumption, prolong the time of the normal operation of the network.

图2示出了相关技术的GBR协议的流程图,如图所示,包括以下步骤: 2 shows a flowchart of FIG GBR protocol related art, as shown, comprising the steps of:

首先S202,目标节点向网络广播自己的询问,询问携带了节点到达目标节点的浪t数信息; First S202, the target node to the network broadcasts its own inquiry, asked to carry a number of messages waves t node to the destination node;

其次S204,节点在收到询问后会对跳数倌息进行记录并找出自己到达目标节点的最小跳数。 Secondly S204, after receiving the inquiry node hops groom will record information and find out the minimum number of hops to reach its own target node. 节点和邻节点之间最小跳数之差称为 The difference between the minimum number of hops between the node and the neighbor node is called

二者的梯度; Both gradient;

最后S206,节点在数据传输时就选择和自己有着最大梯度的邻 Finally S206, the nodes at the time of data transmission on the choice of their own neighborhood and has a maximum gradient of

节点作为下一跳。 As the next hop node.

GBR协i义提出了三种不同的流量扩展方案,尽可能平衡分布网络能耗: I GBR Association righteous proposed three different flow expansion program to balance the distribution network energy consumption as much as possible:

方案1:节点在传输数据时,随机选择邻节点作为下一跳。 Scenario 1: When data transfer node randomly choose the next hop neighbor node. 如果节点和两个或两个以上的邻节点之间具有相同的梯度,则协议规定节点从这几个邻节点中随机地选择一个邻节点作为下一跳。 If nodes have the same gradient and between two or more neighboring nodes, the node agreement from several neighboring nodes randomly select a next hop neighbor node.

方案2:如果节点的能量低于设定的下限比例时,节点就会将自己到目标节点的最小跳数提高,并通知邻节点,减少或杜绝其它节点向自己发送数据的机会。 Scenario 2: If the node is lower than the energy ratio limit set, the node will raise their minimum number of hops to the destination node, and notify neighbors, reduce or eliminate the opportunity to send data to other nodes themselves. 当然这必然迫使一些邻节点也改变其最小跳数并通知其它邻节点直至所有节点的梯度保持一致为止。 Of course, this will inevitably force some neighbors also changed the minimum number of hops and notify the other neighbor nodes until all nodes gradient consistent so far. 因为协议要保证离目标节点更远的邻节点的最小跳数大于当前节点。 Because the agreement to ensure that the minimum number of hops from the destination node distant neighbor is greater than the current node.

方案3:如果节点开始从茱个邻节点接收数据,它就会邇知该邻节点之外的其它邻节点自己的最小跳^t提高了。 Scheme 3: If the node starts dogwood neighbor nodes receive data from, it will notify the other near neighbor than the minimum hop neighbor ^ t his improved. 收到通知的邻节点也会^f坎出相应调整以保证所有节点的梯度一致。 Notified neighboring nodes will sill ^ f corresponding adjustment to ensure a consistent gradient all nodes. 这样,新的数据就会选择其它路径进行传输而不影响已有数据的传输。 Thus, the new data will select a different path for transmission without affecting the existing data transmission.

然而,GBR协议虽然采用流量扩展方法比随机的方法能更好地延长网络生命期,但是在采用扩展方法时,必须尽力避免使用网络中的瓶颈节点,而且每个节点都要维护自己和邻节点之间的梯度信每 However, GBR although the use of protocol traffic extension method than random way to better extend the network lifetime, but when using extension methods, must try to avoid bottlenecks in the network nodes, and each node must maintain themselves and their neighbors gradient between each letter

因此,人们需要一种适用于移动自组织网络的自适应路由才支术,能够达到延长网络生命期和平衡网络能量消耗的目的,并解决上述相关技术中的问题。 Therefore, a need exists for adaptive routing for mobile ad hoc network before performing surgery, to achieve the purpose of extending the network lifetime and Ping Heng network energy consumption, and to solve the problems of the related art.

发明内容 SUMMARY

本发明旨在提供用于移动自组织网络的自适应路由方法和装置,以解决相关技术中网络生命期和网络能量消耗的平衡问题。 The present invention aims to provide a mobile self-adaptive routing methods and apparatus for the organization's network, in order to solve the problems of the related art Ping Heng network lifetime and energy consumption of the network.

根据本发明的一个方面,提供了一种路由方法,包括以下步骤: 步骤a,通过局部泛洪的方式建立起包括了邻节点和当前节点的亲近度的路由表,其中,利用节点之间的距离和节点最大剩余能量来计算所述亲近度;以及步骤b,根据路由表,将源节点的数据路由到目标节点。 According to one aspect of the present invention, there is provided a routing method, comprising the steps of: step a, by way of local flooding include establishing and neighbor of the current node close to the routing table, between which, using the node maximum residual energy of the node and the distance calculating the closeness; and a step B, according to the routing table, routes the data source node to the destination node. 还提供了一种路由方法,包括以下步骤:步骤a,以局部泛洪方式建立包括邻节点和当前节点的亲近度的路由表,其中,利用全网生命最长与面向应用的自适应路由准则来计算亲近度;以及步骤b,根据路由表,将源节点的数据路由到目标节点。 Is also provided a routing method, comprising the steps of: step a, the establishment of a localized flooding embodiment comprises a neighbor of the current node and the routing table closeness, wherein the adaptive routing criteria with the longest life for the whole network applications calculating closeness; and a step B, according to the routing table, routes the data source node to the destination node.

根据本发明的另一方面,提供了一种路由装置,包括:路由表建立模块,用于通过局部泛洪的方式建立起包括了邻节点和当前节点的亲近度的路由表,其中,利用节点之间的距离和节点最大剩余能量来计算所述亲近度;以及路由模块,用于根据路由表,将源节点的数据路由到目标节点。 According to another aspect of the present invention, there is provided a routing apparatus, comprising: a routing table creating module, configured by partially flooding the way up, including neighbor and close of the current node routing table, wherein, using the node the maximum distance between the nodes and the calculated remaining energy of the closeness; and a routing module for routing table, the routing data source node to the destination node.

通过上述技术方案,本发明实现了如下技术效果:说明书第6/17页 Through the above technical solution, the present invention achieves the following technical effects: to the description page 6/17

在移动自組织网络中,构建者可以才艮据不同应用的服务质量要求,调整均衡因子,选取合适的路径传送数据,以达到延长网络生命期,平衡网络能量消耗的目的。 In the mobile ad hoc network, it may build service data quality Gen requirements of different applications, balanced adjustment factor, to select the appropriate path for transmitting data, in order to prolong the life of the network, the energy consumption of the balance network. 具体来说,本发明 In particular, the present invention

1) 在选择路由时,综合考虑了节点间距离和节点剩余能量, 1) When routing, considering the distance between nodes and the residual energy of the node,

避免一直使用同一路径导致的该路径上节点能量消耗过快的现象; It has been used to avoid the phenomenon of excessive energy consumption node on the path leading to the same path;

2) 为任务管理者提供了一个方便便捷的调节窗口,通过对路由选择准则函数中均衡因子的调整,可以根据不同应用的具体要求在平均网络能量消耗和延长网络生命期之间找到合适的均衡点; 2) it provides a convenient convenient adjustment window for the task manager, by adjusting the routing criterion function equalizing factor, and energy consumption can prolong the life of the average between the network depending on network requirements of different applications to find the right balance point;

3) 网络对一组路由进行维护,在路由选择时只选择合适的路径而非最优路径,使得网络拓朴尽可能的保持稳定; 3) a set of routing network for maintenance, select only the appropriate path for routing purposes rather than the optimal path, so that the network topology is stable as possible;

4) 减轻了网络设计者不得不为每个应用选择不同路由方案的负担; 4) reduce the burden of network designers had to choose a different routing scheme for each application;

5) 本方案中充分考虑了移动自组织网络的能量限制,既能充分利用有限的能量资源,又能节省不必要的能量消耗; 5) of the present embodiment fully considered mobile ad-hoc network of energy limits can take full advantage of the limited energy resources, but also save unnecessary energy consumption;

6) 本方案具有可扩展性。 6) The present embodiment is scalable. 网络设计者可以根据不同应用的具体需要,在路由选择准则函数中加入其他的影响因素,例如路由跳数、传输迟延、无线链路的通信质量等等;以及在未来不同类型的无线网络融合环境下基于认知无线电模型依照新的路由指标(如信道感知能力,信道切换数,信道切换频率)等端到端重配置路由设计。 Network designers can according to specific needs of different applications, added in the routing criterion function of other factors, such as routing hops, transmission delay, the communication quality of the radio link, and the like; and the integration of different types of environment in future wireless networks cognitive radio model in accordance with the new routing metrics (e.g. perception channel, the number of channel switching, the channel switching frequency) and other end-routing reconfiguration design.

7) 本方案通过周期性地局部泛洪节点信息,能够保证非频繁移动情况下的路由稳定性。 7) The program by periodically flooding the local node information, the routing to ensure stability in the non-movement of frequent.

本发明的其它特征和优点将在随后的说明书中阐述,并且,部分地从i兌明书中变得显而易见,或者通过实施本发明而了解。 Other features and advantages of the invention will be set forth in the description which follows and, in part, become obvious from i against the specification, or learned by practice of the present invention. 本发 Present

明的目的和其他优点可通过在所写的"i兑明书、权利要求书、以及附图中所特别指出的结构来实现和获得。 The objectives and other advantages of the next may be realized and attained by the written "i against SHEET, claims, and drawings of the structure particularly pointed out.

附困说明 Description attached trapped

此处所说明的附图用来提供对本发明的进一步理解,构成本申请的一部分,本发明的示意性实施例及其说明用于解释本发明,并不构成对本发明的不当限定。 The drawings described herein to provide a further understanding of the present invention, constitute a part of this application, exemplary embodiments of the present invention are used to explain the present invention without unduly limiting the present invention. 在附图中: In the drawings:

图1示出了相关技术的EAR协议的流程图; FIG 1 shows a flowchart EAR protocol related art;

图2示出了相关技术的GBR协议的流程图; FIG 2 shows a flowchart GBR protocol related art;

图3示出了根据本发明的移动自组织网络的自适应路由方法的流程图; FIG. 3 shows a flowchart of an adaptive self-routing method of a mobile ad hoc network in accordance with the present invention;

图4示出了根据本发明的移动自组织网络的自适应路由装置的方框图; FIG 4 illustrates a block diagram of an adaptive self-routing apparatus according to the mobile ad hoc network according to the invention;

图5是根据本发明的一个实施例的节点完成路由功能和部分接入功能的状态转移图; FIG 5 is a transition diagram of a node according to an embodiment of the present invention performs routing functions and some functions of the access status;

图6是4艮据该实施例的节点中继状态图; FIG 6 is a state diagram of the relay node 4 embodiment Gen data;

图7是根据该实施例的节点路由维护状态图; FIG 7 is a routing node according to the embodiment of FIG maintenance state;

图8是根据该实施例的节点路由建立状态图;以及 FIG 8 is a state diagram of the establishment of the routing node to the embodiment; and

困9是4艮据该实施例的节点消亡状态图。 9 is trapped node 4 according to the Gen-death state of the embodiment in FIG.

具体实施方式 detailed description

下面将参考附图并结合实施例,来详细说明本发明。 Below with reference to accompanying drawings and embodiments, the present invention will be described in detail.

在相关4支术的EAR协议中,采用的是全局泛洪的方式来建立路由,虽然能够达到将网络能耗平均分配、以及延长网络生命周期的目的,但是导致建立阶段非常复杂。 In four related agreements EAR surgery, the use of a global flood way to build the route, even though it can reach the average energy consumption distribution network, as well as the purpose of extending the network lifecycle, but led to the establishment phase is very complex. 而GBR协议虽然采用流量扩展方法比随机的方法能更好地延长网络生命期,但是在采用扩展方法时,必须尽力避免使用网络中的瓶颈节点,而且每个节点都要维护自己和邻节点之间的梯度信息。 Although the use of GBR traffic and protocol extension method than random way to better extend the network lifetime, but when using extension methods, must try to avoid bottlenecks in the network nodes, and must maintain themselves and their neighbors of each node gradient information between.

有鉴于此,本发明提出了一种局部泛洪的概念,提出在设定亲近度所确定的局部范围内泛洪建立路由。 Accordingly, the present invention proposes a concept of localized flooding, a local range in the proposed set of the determined closeness pan Hongjian Li route. 为了设定亲近度,本发明设计了一种自适应功能模块,该功能模块将网络节点的剩余能量和节点之间的距离纳入一个路由选择准则函数,其考虑了无线自组织网络能量的平均消耗和网络生命期之间的均衡。 In order to set the degree of proximity, the present invention contemplates an adaptive function module, the distance between the function module and the residual energy of the nodes of the network node into a routing criterion function, which takes into account the average energy consumption of the wireless ad hoc network and the balance between network lifetime. 可选地,该路由选择准则函数提供了调整接口:均衡因子,可以通过调节均衡因子来调节能量的平均消耗和网络生命期之间的均衡。 Alternatively, the route selection criterion function provides the interface to adjust: the balancing factor, equilibrium may be adjusted between the average energy consumption and the life of the network by adjusting the balancing factor.

图3示出了根据本发明的移动自组织网络的自适应路由方法的流程图,图4示出了才艮据本发明的移动自组织网络的自适应路由装置的方框图。 FIG 3 shows a flowchart of the present invention since the movement of a tissue adaptive routing network, Figure 4 shows a block diagram of a self-adaptive routing was Gen hoc network apparatus moves, according to the present invention.

如图3所示,祁應本发明的移动自组织网络的自适应路由方法包4舌以下步骤: 3, the present invention Qi should be moved from the adaptive routing methods hoc network packet tongue 4 steps:

步骤S302,路由建立阶段,通过局部泛洪的方式建立起一份包括了邻节点和当前节点的亲近度的路由表作为路由选择的依据。 Step S302, the route establishment phase, by way of local flooding, including the basis for establishing a neighbor and close friend of the current node routing table as routing. 通过依次拓展,网络对一组路由进行维护,建立起网络中每个节点到 , A set of routing network maintained by sequentially expand and establish a network to each node

目标节点的路径。 Path to the destination node. 网络中传输的探测信息主要用于确定节点之间的距离和节点最大剩余能量,以此来计算出亲近度。 Probe information transmitted in the network mainly for the maximum residual energy determining the distance between the node and the node, in order to calculate the degree of closeness.

可选地,节点间的亲近度用fji描述,其计算式由如下的路由选 Alternatively, the closeness between the nodes described with fji, which is calculated by the following formula routing

, 、*a / = K (五,)('—a) ,, * A / = K (five,) ( '- a)

择准则函数完成:"。其中,a为均衡因子,数值范围为[O, l]之间的值;dji为节点间的距离,它在准则函数中承担延长网络生命期的作用;Ei为下一中继备选节点的剩余能量,它在准则函数中承担平均分配网络能量消耗的作用。k在不同的无线传输环境中取值不同, 一般在[2, 4]之间取值。 Optional complete criterion function: "wherein, a is the equilibrium factor, the numerical value in the range between the [O, l]; dji is the distance between nodes, network lifetime extension it bears role in the criterion function; Ei for the next. Alternatively a relay node remaining energy, which bear an average of a distribution network in the energy consumption in the criterion function value .k different effect on different radio transmission environment, the general value between [2, 4].

亲近度是和均衡因子密切相关的量,通过改变均衡因子,可以使亲近度更着重反映不同参考因子的影响。 Closeness factor is closely related to the amount and balance by changing the equalization factor, it can make the closeness more emphasis reflects the influence of different factors of reference. 例如,a趋向于零表示剩余能量作为路由选取的主要标准,此时网络重点考虑将消耗的能量平均分布。 For example, the main criteria A tends to zero as the residual energy represented by the selected route, the average network important consideration at this time will consume energy distribution. 这一点对于要求全网稳定周期较长的应用非常必要。 This is for the whole network requires a longer stabilization period of application is necessary. 而偏向每次任务低能耗的应用则要求a趋向于1。 The bias each mission requires a low-power applications tend to be 1. 这两种任务都可以在全网初始化阶段设定a的初始值来达到要求,而无须改变选取函数的具体形式。 Both tasks can be set to an initial value of a whole network initialization phase to meet the requirements, without changing the function of selecting specific form. 当然,参考因子并不仅仅局限于通信距离和剩余能量,可以根据需要进行替换或增加以适应不同应用的要求。 Of course, the reference factor is not confined to the communication distance and the remaining energy, or can be replaced to accommodate the increasing requirements of different applications as needed. 比如利用全网生命最长与面向应用的自适应路由准则来计算亲近度。 For example the use of adaptive routing criteria with the longest life for the whole network to compute the closeness applications.

步骤S304,数据传输阶段,根据路由表,将源节点的数据路由到目标节点。 Step S304, the data transfer phase, according to the routing table, routes the data source node to the destination node. 具体来说,当源节点需要传输数据时,它就选择路由表中和自己的亲近度最大的邻节点发送数据。 Specifically, when a source node needs to transmit data, it transmits the data to select the routing table and their maximum closeness neighboring nodes. 中继节点在收到数据之后,也会在路由表中选择亲近度最大的邻节点继续发送数据,如此反复,直到数据到达目标节点。 After receiving the data relay node, the routing table will choose the maximum closeness of neighboring nodes continue sending data, and so forth, until the data reaches the destination node.

步猓S306,路由维护阶段,在本方案中路径维护的成本是很小的,只需要周期性地通过局部泛洪方式进行消息传递,对路由表加以更新。 Guo step S306, the route maintenance phase, in this embodiment the path cost of maintenance is very small, only periodically by localized flooding messaging mode, an updating of the routing table. 路由表因为节点存储能力的有限必须限定在一定大小范围 Because the node routing table must be limited to the limited storage capacity of a certain size range

内,这可以在初始化建立路由表的过程中根据特定准则选取部分节点保留。 Inside, which can select some nodes reserved in the initialization process in accordance with certain criteria to establish the routing table.

通过以上描述可以得知,根据本发明的路由方法,包括以下步 May be learned by the foregoing description, according to the routing method of the present invention, comprises the following steps

骤:步骤S302,建立包括邻节点和当前节点的亲近度的路由表;以及步驟S304,根据路由表,将源节点的数据路由到目标节点。 Step: step S302, the establishment of the current node and neighboring nodes including the closeness of the routing table; and step S304, the routing table, routes the data source node to the target node.

可选地,步骤S302包括以下步骤:利用节点之间的距离和节点最大剩余能量来计算亲近度. Alternatively, the step S302 comprises the steps of: a maximum residual energy and the distance between nodes using the node calculating the closeness.

可选地,距离越大,则亲近度越小。 Alternatively, the greater the distance, the smaller the degree of closeness.

可选地,最大剩余能量越大,则亲近度越大。 Alternatively, the greater the maximum residual energy, the greater the degree of closeness.

可选地,亲近度与距离之间存在第一函数关系,亲近度与最大剩余能量之间存在第二函数关系,第一函数关系和第二函数关系中均包括同一个均衡因子。 Alternatively, there is a first functional relationship between the distance and closeness, there is a second functional relationship between residual energy and the maximum closeness, the first function and the second function comprises the same equalizing factors.

丫《 Ah "

可选地,利用以下函数计算亲近度:"V"」('',其中, a为均衡因子,数值范围为[O, l]之间;dji为距离;Ei最大剩余能量;k根据不同的无线传输环境来取值。 Alternatively, the closeness is calculated using the following function: "V" "( '', wherein, a is the equilibrium factor, is a range of values ​​between [O, l]; dji distance; maximum residual energy Ei; K depending on the wireless transmission environment values.

可选地,步骤S302包括以下步骤:利用全网生命最长与面向应用的自适应路由准则来计算亲近度。 Alternatively, the step S302 comprises the steps of: using a network-wide adaptive routing criteria with the longest life for the application is calculated closeness.

可选地,步骤S302包括通过局部泛洪的方式建立路由表。 Optionally, step S302 includes establishing a routing table by way of local flooding.

可选地,步骤S302包括以下步骤:节点广播信息并等待反馈, 反馈信息中包含邻节点的最大剩余能量信息;以及节点通过反馈信息的接收功率判断邻节点和自己的ji巨离。 Alternatively, the step S302 comprises the steps of: a node waits for the broadcast information and feedback from the maximum residual energy information contained neighbor node; and a power receiving node determines the neighbor nodes and their feedback information from the giant ji.

可选地,步骤S302还包括以下步骤:如果路由表中的前向路由节点集合为空,那么增大发射功率,继续广播信息并等待反馈, 直到发射功率达到上限,如杲发射功率达到上限而前向路由节点仍然为空,那么使节点转入节点消亡状态。 Optionally, the step S302 further includes the step of: if the first routing table to the routing node set is empty, then increasing the transmission power of the broadcast information and continues to wait for feedback until the transmit power reaches the upper limit, such as the transmit power reaches the upper limit Gao forward routing node is still empty, the demise of the node into the node status.

可选地,步骤S304包括以下步骤:源节点选择路由表中和自己的亲近度最大的邻节点作为中继节点,并向其发送数据;以及中继节点在收到数据之后,也在路由表中选择亲近度最大的邻节点继续发送数据,如此反复,直到数据到达目标节点。 Optionally, step S304 includes the following steps: a source node routing table and their maximum closeness neighboring nodes as a relay node, and sends the data; and a relay node after receiving the data, also in the routing table select the closeness largest neighbors continue to send data, and so forth, until the data reaches the destination node.

可选地,根据本发明的路由方法还包括以下步骤:步骤S306, 周期性地通过局部泛洪方式进行消息传递,对路由表加以更新。 Alternatively, the routing method of the present invention further comprises the following steps: step S306, the message transmitted periodically by localized flooding embodiment, an updating of the routing table.

可选地,步骤S306包括以下步骤:首先检查节点的能量水平是否低于下限,如果其低于正常能量水平,则根据接收到的其他节点信息维护路由表,修正其中相应的参数;如果路由表中的前向路由节点集合为空,则节点必须调整发射功率,并重新建立路由表。 Optionally, step S306 includes the following steps: First, the energy level is below the lower limit of the check node, if it is lower than the normal power level, maintain a routing table according to the received information to other nodes, wherein the correction parameters corresponding; If the routing table the former collection to the routing node is empty, the node must adjust transmit power and re-establish the routing table.

如图4所示,根据本发明的用于移动自组织网络的自适应路由装置400包括: 4, according to the present invention, adaptive mobile ad-hoc network routing device 400 comprises:

路由表建立模块402,用于通过局部泛洪的方式建立起包括了邻节点和当前节点的亲近度的路由表作为路由选择的依据;以及 The routing table creating module 402, a routing based on the way by partially flooding include establishing and neighbor of the current node as close to the routing table; and

路由模块404,用于根据路由表,将源节点的数据路由到目标节点。 Routing module 404, according to the routing table, routes the data source node to the destination node.

可选地,路由表建立模块利用节点之间的距离和节点最大剩余能量来计算亲近度。 Alternatively, the routing table creating module calculates the residual energy using the maximum closeness of distance between nodes and node.

可选地,距离越大,则亲近度越小。 Alternatively, the greater the distance, the smaller the degree of closeness.

可选地,最大剩余能量越大,则亲近度越大。 Alternatively, the greater the maximum residual energy, the greater the degree of closeness.

可逸地,亲近度与距离之间存在笫一函数关系,亲近度与最大剩余能量之间存在第二函数关系,第一函数关系和第二函数关系中均包括同一个均衡因子。 Yi can be, and the distance between Zi closeness function, there is a second functional relationship between residual energy and the maximum closeness, the first function and the second function comprises the same equalizing factors.

可选地,利用以下函数计算亲近度:'其中,a 为均衡因子,数值范围为[O, l]之间;dji为距离;Ei最大剩余能量; k根据不同的无线传输环境来取值。 Alternatively, the closeness is calculated using the following function: 'wherein, a is the equilibrium factor, is a range of values ​​between [O, l]; dji distance; the maximum residual energy Ei; K value according to different radio transmission environment.

可选地,k在[2, 4]之间。 Alternatively, k between [2, 4].

可选地,路由表建立模块利用全网生命最长与面向应用的自适应路由准则来计算亲近度。 Alternatively, the routing table creating module using adaptive routing criteria with the longest life for the whole network to compute the closeness applications.

可选地,路由表建立模块包括最大剩余能量信息获取模块(未示出),用于使节点广播信息并等待反馈,反馈信息中包含邻节点的最大剩余能量信息。 Alternatively, the routing table creating module includes a maximum residual energy information acquiring module (not shown), and the broadcast information for the node waits for feedback from the maximum residual energy information contained neighboring nodes.

可选地,路由表建立模块还包括距离判断模块(未示出),用于使节点通过反馈信息的接收功率判断邻节点和自己的距离。 Alternatively, the routing table creating module further comprises a distance determining module (not shown), for determining a power by receiving node feedback information and neighbor their distance.

可选地,路由表建立模块还包括增大功率模块(未示出),用于如果路由表中的前向路由节点集合为空,那么增大发射功率,继续广播信息并等待反馈,直到发射功率达到上限,如果发射功率达到上限而前向路由节点仍然为空,那么使节点转入节点消亡状态。 Alternatively, the routing table creating module further comprises increasing a power module (not shown), for if the first routing table to the routing node set is empty, then increasing the transmission power of the broadcast information and continues to wait for feedback until the emission power reached the upper limit, if the transmit power reaches the upper limit and still empty before the routing node, then the node into the node demise of state.

可选地,路由模块使源节点选择路由表中和自己的亲近度最大的邻节点作为中继节点,并向其发送数据;以及使中继节点在收到 Alternatively, the routing module for routing the source node table and their closest neighbors of the maximum as a relay node, and sends the data; and the relay node receiving the

数据之后,也在路由表中选择亲近度最大的邻节点继续发送数据, 如此反复,直到数据到达目标节点。 After the data, the routing table also select closeness largest neighbors continue to send data, and so forth, until the data reaches the destination node.

可选地,还包括:路由维护模块406,用于周期性地通过局部泛洪方式进行消息传递,对路由表加以更新。 Optionally, further comprising: maintaining routing module 406 for periodically messaging mode by localized flooding, an updating of the routing table.

可选地,路由维护模块首先检查节点的能量水平是否低于下限,如果其低于正常能量水平,则根据接收到的其他节点信息维护路由表,修正其中相应的参数;如果路由表中的前向路由节点集合为空,则节点必须调整发射功率,并重新建立路由表。 Alternatively, route maintenance module first checks the energy level is below the lower limit of the node, if it is lower than the normal power level, maintain a routing table according to the received information to other nodes, wherein the correction parameters corresponding to; * If the routing table collection to the routing node is empty, the node must adjust transmit power and re-establish the routing table.

下面将结合图5至图9来说明根据本发明的一个实施例。 Below with reference to FIGS. 5 to 9 will be described in accordance with one embodiment of the present invention.

图5是根据本发明的一个实施例的节点完成路由功能和部分接入功能的状态转移图。 FIG 5 is a partially complete access and routing node according to a functional embodiment of the present invention is a state transition diagram. 在这里,标示出部分接入功能的目的是尽可能完整地说明算法。 Here, mark the access function part intended to illustrate the algorithm as completely as possible.

在图5的状态图中包括以下步骤:初始化(INI)步骤S502、 路由建立(SETUP )步骤S504、路由维护(MAINTEIN )步骤S506、 等待(WAIT)步骤S508、中继(RELAY)步骤S510、广播(RADIO) 步骤S512、节点消亡(DIE) S514和结束(END)步骤S516。 In the state diagram of Figure 5 includes the following steps: initialization (INI) step S502, the route setup (SETUP) step S504, the route maintenance (MAINTEIN) step S506, the waiting (the WAIT) step S508, the relay (RELAY) step S510, the broadcast (the RADIO) step S512, the node die (dIE) S514 and end (the eND) to step S516. 这些步骤之间的切换流程如图5所示,这里不再赘述。 Handoff process between the steps shown in FIG. 5, is not repeated here.

图6是根据该实施例的节点中继状态图;图7是根据该实施例的节点路由维护状态图;图8是根据该实施例的节点路由建立状态图;图9是根据该实施例的节点消亡状态图。 FIG 6 is a relay node of this embodiment is a state diagram; FIG. 7 is a state diagram of the nodes to maintain routes to the embodiment; FIG. 8 is a state diagram of the establishment of the routing node to the embodiment; FIG. 9 is according to this embodiment node death state of FIG.

根据图5至图9,其具体过程如下: According to FIG. 5 to FIG. 9, the specific process is as follows:

1)初始化(INI) S502和结束(END)步骤S516: 1) Initialization (INI) S502 and end (the END) Step S516:

初始化状态下,节点上电,4艮据需要分配存储单元,并将变量 Initialized state, the power node, Gen 4 needs to be allocated according to a storage unit, and variable

设定为初始值;而节点进入结束状态后,对必要的数据进行保存后, 关闭电源. To an initial value; after the end of the node enters a state of saving the necessary data, turn off the power.

2)路由建立(SETUP)步骤S504 2) routing establishment (SETUP) step S504

在路由建立状态,节点首先要确定通信功率。 Routing setup state, the node must first determine the communication power. 在初始化状态, 节点的通信功率被设定为初始值。 In the initialization state, the power of the communication node is set as the initial value. 节点在通信范围内广播信息并等待反馈。 Nodes within the communication range of the broadcast information and wait for feedback. 反馈信息中包含邻节点的能量信息,当前节点通过反馈信息的接收功率可以判断邻节点和当前节点的il巨离。 Energy feedback information includes neighboring nodes, based on the current node and neighboring nodes of the current node il giant from feedback information received power. 当前节点的路由表通过邻节点的能量和节点间的距离建立。 The routing table of the current node is established by a distance between the neighbor nodes and energy. 如果路由表中的前向路由节点集合为空,那么必须增大发射功率,重新开始前面的建立过程,直到发射功率达到上限。 If the first routing table to the routing node set is empty, it must increase the transmit power, re-establish the beginning of the previous process until the transmission power reaches the upper limit. 如果发射功率达到上限而前向路由节点仍然为空,说明当前节点已经处于孤立状态,那么当前节点转入节点消亡状态。 If the transmission power reaches the upper limit and forward routing node is still empty, indicating that the current node is already in the isolated state, then the current node node into the demise of the state.

3 )路由维护(MAINTEIN )步骤S506 3) route maintenance (MAINTEIN) step S506

路由维护状态首先检查当前节点的能量水平是否低于下限,如果当前节点低于正常能量水平,则需要根据广播信道接收到的其他节点信息维护路由列表,修正列表中相应的参数。 First checks the state route maintenance energy level is below the lower limit of the current node, if the current node is lower than the normal energy level, the need to receive the broadcast channel information of other nodes maintain routing list, a corresponding correction parameter. 如果路由列表中的前向路由节点集合为空,该节点必须调整发射功率,并重新建立路由表。 If the first set of routing list to the routing node is empty, the node must adjust transmit power and re-establish the routing table.

4)中继(RELAY)状态步骤S510 4) The relay (RELAY) state in step S510

当收到中继请求时,节点由等待状态转入中继状态。 Upon receiving the relay request, the relay node into a state waiting state. 节点首先根据选择函数计算路由表中所有前向节点的亲近度,并从中选取亲近度最大的前向路由节点作为下一个中继节点。 Closeness of all nodes before the node routing table is first calculated according to the selected function, and the front maximum closeness to the routing node from which to select as the next relay node. 选择合适的下一个 Next select the appropriate

中继节点后,当前节点从源节点接收数据并传递数据。 After the relay node, the current node receives the data from the source node, and pass data. 如此反复对路由表进行维护。 So again the routing table maintenance.

5) 节点消亡(DIE)状态步骤S514 5) Node die (DIE) state in step S514

当节点能量耗尽或处于孤立状态时,节点进入消亡状态。 When a node runs out of energy, or in an isolated state, node state into the die. 节点将此信息向周围节点广播后,i^结束状态。 After this information to node around the node broadcasts, i ^ end state.

6) 等待(WAIT) S508和广播(RADIO)状态步骤S512 6) wait (WAIT) S508 and broadcast (the RADIO) state in step S512

在这两个状态中,节点周期性监听广播信道的控制信息或邻节点广播的属性信息(包括节点消亡信息、剩余能量属性等)。 In these two states, nodes periodically monitor the control information or attribute information of the neighbor nodes broadcasts the broadcast channel (including the node information die, residual energy properties, etc.). 在收到相应信息后,节点转入相应的处理过程。 Upon receipt of the appropriate information, transferred to the appropriate processing node.

根据以上所述,以路径和能耗进行二维联合优化,并且给出了实施方案和具体的判决准则函数,对于本领域技术人员来说,显然可以对此作些局部修改,但这并不脱离本发明的精神范围。 According to the above, the path for the two-dimensional joint optimization and energy, and gives the embodiments and specific function of decision criteria, the skilled person, this may make some apparent local modification, but this does not departing from the spirit and scope of the present invention.

已有的无线传感器网络路由算法中有部分算法(如标准EAR 算法和能量扩展的GBR算法等)分别考虑了最短路径和剩余能量两方面。 Conventional wireless sensor network routing algorithms some algorithms (e.g., algorithms and standards EAR extended energy algorithm GBR) were considered both shortest path and residual energy. 当网络节点的能量都4艮充足的时候,路由的选择应该倾向于消耗能量最小的路径;而当网络运行一段时间后,路由的选择就会越来越倾向于如何避免使用剩余能量较少的节点了。 When the energy of the network node 4 are Gen sufficient time should be inclined to select the route consumes minimal energy path; and when the period of operation of the network, route selection would be more inclined to use the remaining energy of avoiding less the nodes. 本发明提出的联合优化方案是针对这路径距离和能量两者之间进行权衡。 The proposed joint optimization scheme according to the present invention is a trade-off for the distance between this path and energy.

从以上的描述中,可以看出,本发明实现了在移动自组织网络中,构建者可以根据不同应用的服务质量要求,调整均衡因子,选取合适的路径传送数据,以达到延长网络生命期,平衡网络能量消耗的目的。 From the above description, it can be seen, the present invention is implemented in the mobile ad-hoc network, constructed in accordance with the quality of service may requirements of different applications, balanced adjustment factor, to select the appropriate path for transmitting data, in order to prolong the life of the network, balance network energy consumption. 具体来说,包括如下技术效果:1) 在选择路由时,综合考虑了节点间距离和节点剩余能量, 避免一直使用同一路径导致的该路径上节点能量消耗过快的现象; Specifically, the following technical effects including: 1) when routing, consider a distance between nodes and the residual energy of the nodes, the nodes phenomenon has been used to avoid excessive energy consumption on the path leading to the same path;

2) 为任务管理者提供了一个方便便捷的调节窗口,通过对路由选择准则函数中均衡因子的调整,可以根据不同应用的具体要求在平均网络能量消耗和延长网络生命期之间找到合适的均衡点; 2) it provides a convenient convenient adjustment window for the task manager, by adjusting the routing criterion function equalizing factor, and energy consumption can prolong the life of the average between the network depending on network requirements of different applications to find the right balance point;

3) 网络对一组路由进行维护,在路由选择时只选择合适的路径而非最优路径,使得网络拓朴尽可能的保持稳定; 3) a set of routing network for maintenance, select only the appropriate path for routing purposes rather than the optimal path, so that the network topology is stable as possible;

4) 减轻了网络设计者不得不为每个应用选择不同路由方案的 4) reduce the network designer to choose a different route each application had to the scheme

负担; burden;

5) 本方案中充分考虑了移动自组织网络的能量限制,既能充分利用有限的能量资源,又能节省不必要的能量消耗; 5) of the present embodiment fully considered mobile ad-hoc network of energy limits can take full advantage of the limited energy resources, but also save unnecessary energy consumption;

6) 本方案具有可扩展性。 6) The present embodiment is scalable. 网络设计者可以根据不同应用的具 Network designers can with different applications

体需要,在路由选择准则函数中加入其他的影响因素,例如路由跳 Body needs, but added other factors in the route selection criterion functions, such as routing hops

数、传输迟延、无线链路的通信质量等等;以及在未来不同类型的无线网络融合环境下基于认知无线电模型依照新的路由指标(如信道感知能力,信道切换数,信道切换频率)等端到端重配置路由设计。 Number, transmission delay, the communication quality of the radio link, and the like; and a cognitive radio model in accordance with the new routing metrics (e.g., channel-aware channel switching number, the channel switching frequency) at the next different types of wireless network integration environment to-end routing reconfiguration design.

7) 本方案通过周期性地局部泛洪节点信息,能够保证非频繁移动情况下的路由稳定性。 7) The program by periodically flooding the local node information, the routing to ensure stability in the non-movement of frequent.

显然,本领域的技术人员应该明白,上述的本发明的各模块或各步骤可以用通用的计算装置来实现,它们可以集中在单个的计算装置上,或者分布在多个计算装置所组成的网络上,可选地,它们可以用计算装置可执行的程序代码来实现,从而,可以将它们存储在存储装置中由计算装置来执行,或者将它们分别制作成各个集成 Obviously, those skilled in the art will appreciate that the present invention each module or each step may be a general-purpose computing device, they can be integrated in a single computing device or distributed in a network composed of multiple computing devices on, alternatively, they may be implemented by program codes executable by a computing device, so that, to be performed by a computing device stored in a storage device, or they are made into respective integrated

电路模块,或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。 Circuit module, or a plurality of modules are manufactured into a single integrated circuit module. 这样,本发明不限制于任何特定的硬件和软件结合。 Thus, the present invention is not limited to any particular hardware and software combination. 应该明白,这些具体实施中的变化对于本领域的技术人员来说是显而易见的,不脱离本发明的精神保护范围。 It should be understood that variations of these implementations will be apparent to those skilled in the art, without departing from the scope of the present invention.

以上所述仅为本发明的优选实施例而已,并不用于限制本发明,对于本领域的技术人员来说,本发明可以有各种更改和变化。 The above are only preferred embodiments of the present invention, it is not intended to limit the invention to those skilled in the art, the present invention may have various changes and variations. 凡在本发明的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本发明的保护范围之内。 Any modification within the spirit and principle of the present invention, made, equivalent substitutions, improvements, etc., should be included within the scope of the present invention.

Claims (19)

1. 一种路由方法,其特征在于,包括以下步骤:步骤a,以局部泛洪方式建立包括邻节点和当前节点的亲近度的路由表,其中,利用节点之间的距离和节点最大剩余能量来计算所述亲近度,所述亲近度与所述距离之间存在第一函数关系,所述亲近度与所述最大剩余能量之间存在第二函数关系,所述第一函数关系和所述第二函数关系中均包括同一个均衡因子;以及步骤b,根据所述路由表,将源节点的数据路由到目标节点。 A routing method comprising the steps of: step a, a localized flooding embodiment establishing the maximum distance between the remaining energy of the neighboring nodes including the closeness of the current node and the routing table, wherein the nodes using the node, and calculates the degree of closeness, a close relationship exists between the first function of the distance of the close relationship between the presence of the second function and said maximum residual energy of the first function and the the second function comprises the same equalizing factors; and a step B, according to the routing table, routes the data source node to the destination node.
2. 根据权利要求1所述的路由方法,其特征在于,所述距离越大, 则所述亲近度越小。 2. The routing method of claim 1, wherein, the larger the distance, the smaller the closeness.
3. 根据权利要求1所述的路由方法,其特征在于,所述最大剩余能量越大,则所述亲近度越大。 3. The routing method of claim 1, characterized in that, the larger the maximum residual energy, the greater the degree of closeness.
4. 根据权利要求1所述的路由方法,其特征在于,利用以下函数计算所述亲近度:其中,a为所述均衡因子,凝:值范围为[O, l]之间;dji为所述距离;Ei为所述最大剩余能量;k才艮据不同的无线传输环境来取值,范围为[2,4]; i和j为所述距离两端节点的编号。 4. The routing method of claim 1, wherein, using the following calculating the closeness function: where, a is the equilibrium factor, coagulation: values ​​ranging between [O, l]; dji of the said distance; Ei is the maximum residual energy; Gen K was different wireless transmission environment according to the value, in the range [2,4]; i and j are numbers from the end nodes.
5 根据权利要求1所述的路由方法,其特征在于,所述步骤a 包括以下步骤:节点广播信息并等待反馈,反馈信息中包含邻节点的最大剩余能量信息;以及所述节点通过反馈信息的接收功率判断邻节点和自己的距离。 5 routing method of claim 1, wherein said step a comprises the steps of: a node waits for the broadcast information and feedback from the maximum residual energy contained information of neighboring nodes; node and said feedback information Analyzing the received power of its own and neighbor distance.
6. 根据权利要求5所述的路由方法,其特征在于,所述步骤a 还包4舌以下步骤:如果所述路由表中的前向路由节点集合为空,那么增大发射功率,继续广播信息并等待反馈,直到发射功率达到上限, 如果发射功率达到上限而前向路由节点仍然为空,那么使所述节点转入节点消亡状态。 6. The routing method as claimed in claim 5, wherein said step a further step of the tongue 4: if before the routing table to the routing node set is empty, then increasing the transmit power, continue broadcasting feedback information and wait until the transmission power reaches the upper limit, if the transmit power reaches the upper limit is still empty before routing to the node, then the node into the node extinction state.
7. 根据权利要求1所述的路由方法,其特征在于,所述步骤b 包括以下步骤:步骤bl,所述源节点选择所述路由表中和自己的亲近度最大的邻节点作为中继节点,并向其发送数据;以及步骤b2,所述中继节点在收到数据之后,也在所述路由表中选择亲近度最大的邻节点继续发送数据,如此反复,直到数据到达所述目标节点。 The routing method according to claim 1, wherein said step b comprises the following steps: BL, the source node selects the route table of maximum closeness and their neighboring nodes as a relay node , and sends the data; and a step b2, the relay node after receiving the data, the routing table also select the maximum closeness of neighboring nodes continue sending data, and so forth, until the data reaches the target node .
8. 根据权利要求1所述的路由方法,其特征在于,还包括以下步骤:步骤c,周期性地通过局部泛洪方式进行消息传递,对所述路由表力口以更新。 8. The routing method of claim 1, characterized by further comprising the following steps: Step C, periodically messaging mode by localized flooding, the opening force is to update the routing table.
9. 根据权利要求8所述的路由方法,其特征在于,所述步骤c 包4舌以下步骤:首先4企查节点的能量水平是否〗氐于下限,如果其〗氏于所述下限,则根据接收到的其他节点信息维护所述路由表,修正其中相应的参数;如果所述路由表中的前向路由节点集合为空,则所述节点必须调整发射功率,并重新建立所述路由表。 9. The routing method of claim 8, wherein said step c tongue packet 4 following steps: First half energy level 4 check nodes is equal to the lower limit〗 Di, if it's〗 to the lower limit, the maintenance according to another node receives the routing table information, wherein the correction parameters corresponding; if prior to said routing table to the routing node set is empty, then the node must adjust the transmit power, and re-establishing the routing table .
10. 根据权利要求1至8中任一项所述的路由方法,其特征在于, 应用于移动自组织网络中。 10. The routing method of 1 to 8 according to any one of the preceding claims, characterized in that, to mobile ad-hoc network.
11. 一种路由方法,其特4正在于,包4舌以下步骤:步骤a,以局部泛洪方式建立包括邻节点和当前节点的亲近度的路由表,其中,利用全网生命最长与面向应用的自适应路由准则来计算所述亲近度;以及步骤b,根据所述路由表,将源节点的数据路由到目标节点。 11. A method of routing, which is in Laid-4, 4 tongue packet following steps: a, the establishment of a localized flooding embodiment comprises a neighbor of the current node and the routing table closeness, wherein the longest life and the use of the entire network for adaptive routing criteria applied to calculate the degree of closeness; and a step B, according to the routing table, routes the data source node to the destination node.
12. 根据权利要求11所述的路由方法,其特征在于,所述步骤b 包括以下步骤:步骤bl,所述源节点选择所述路由表中和自己的亲近度最大的邻节点作为中继节点,并向其发送数据;以及步骤b2,所述中继节点在收到数据之后,也在所述路由表中选择亲近度最大的邻节点继续发送数据,如此反复,直到数据到达所述目标节点。 12. The routing method of claim 11, wherein said step b comprises the following steps: BL, the source node selects the route table of maximum closeness and their neighboring nodes as a relay node , and sends the data; and a step b2, the relay node after receiving the data, the routing table also select the maximum closeness of neighboring nodes continue sending data, and so forth, until the data reaches the target node .
13. 根据权利要求11所述的路由方法,其特征在于,还包括以下步骤:步骤c,周期性i也通过局部泛洪方式进4亍消息传递,对所述路由表力口以更豸斤。 13. The routing method of claim 11, wherein further comprising the following steps: Step C, i can periodically into the right foot 4 by partially flooding the messaging mode, the routing table to force the mouth more pounds Zhi .
14. 4艮据4又利要求13所述的路由方法,其特征在于,所述步骤c 包括以下步骤:首先检查节点的能量水平是否低于下限,如果其低于所述下限,则根据接收到的其他节点信息维护所述路由表,修正其中相应的参数;如果所述路由表中的前向路由节点集合为空,则所述节点必须调整发射功率,并重新建立所述路由表。 14.4 Gen 4 and routing according to the method of claims 13, wherein said step c comprises the following steps: First, the energy level is below the lower limit of the check node, if it is below the lower limit, the receiver according to maintenance information to other nodes of the routing table, wherein the correction parameters corresponding; if prior to said routing table to the routing node set is empty, then the node must adjust the transmit power, and re-establishing the routing table.
15. 根据权利要求11至14中任一项所述的路由方法,其特征在于, 应用于移动自组织网络中。 14 to 15.11 routing method according to any one of the preceding claims, characterized in that, to mobile ad-hoc network.
16. —种路由装置,其特征在于,包括:路由表建立才莫块,用于以局部泛洪方式建立包^"邻节点和当前节点的亲近度的路由表,其中,所述路由表建立模块利用节点之间的距离和节点最大剩余能量来计算所述亲近度,所述亲近度与所述距离之间存在第一函数关系,所述亲近度与所述最大剩余能量之间存在第二函数关系,所述第一函数关系和所述第二函数关系中均包括同一个均衡因子;以及路由模块,用于根据所述路由表,将源节点的数据路由到目标节点。 16. - species routing apparatus comprising: establishing a routing table only Mo block packet for establishing a localized flooding embodiment ^ "neighbors of the current node and the routing table close, wherein the routing table creating the distance between the module and the node using the node calculates the maximum residual energy of the closeness of the close relationship between the presence of a first function of the distance, the presence of the closeness between the second and the maximum residual energy function, the first function and the second function comprises the same equalizing factors; and a routing module for the routing table, routes the data source node to the destination node.
17. 根据权利要求16所述的路由装置,其特征在于,利用以下函数计算所述亲近度:<formula>formula see original document page 5</formula>其中,a为所述均衡因子,数值范围为[O, l]之间;dji为所述距离;Ei为所述最大剩余能量;k才艮据不同的无线传输环境来取值,范围为[2,4]; i和j为所述距离两端节点的编号。 17. The routing apparatus of claim 16, wherein the closeness function using the calculation: <formula> formula see original document page 5 </ formula> where, a is the equalization factor values ​​ranging between [O, l]; dji to said distance; Ei is the maximum residual energy; Gen K was different wireless transmission environment according to the value, in the range [2,4]; i and j is the distance number of nodes at both ends.
18. 根据权利要求17所述的路由装置,其特征在于,还包括:路由维护模块,用于周期性地通过局部泛洪方式进行消息传递,对所述路由表加以更新。 18. The routing apparatus according to claim 17, characterized in that, further comprising: maintaining routing module for periodically messaging mode by localized flooding, the routing table to be updated.
19. 根据权利要求16至18中任一项所述的路由装置,其特征在于, 应用于移动自ia织网络中。 19. The routing device 16-1 according to any of claims 18, wherein the fabric is applied to the mobile network from ia.
CN 200610111960 2006-08-28 2006-08-28 Method and equipment used for anonymous group information transfer in distribution type information transfer system CN100466624C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 200610111960 CN100466624C (en) 2006-08-28 2006-08-28 Method and equipment used for anonymous group information transfer in distribution type information transfer system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 200610111960 CN100466624C (en) 2006-08-28 2006-08-28 Method and equipment used for anonymous group information transfer in distribution type information transfer system

Publications (2)

Publication Number Publication Date
CN1960329A true CN1960329A (en) 2007-05-09
CN100466624C true CN100466624C (en) 2009-03-04

Family

ID=38071827

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200610111960 CN100466624C (en) 2006-08-28 2006-08-28 Method and equipment used for anonymous group information transfer in distribution type information transfer system

Country Status (1)

Country Link
CN (1) CN100466624C (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101119303B (en) 2007-08-30 2010-08-11 浙江工业大学 Dynamic cluster based multi-objective programming wireless sensing network routing algorithm
CN101959279B (en) 2009-07-13 2013-01-30 华为技术有限公司 Route establishing method and device, and data transmission method
CN102036335B (en) * 2009-09-27 2015-07-01 北京邮电大学 Route cognizing protocol for wireless network
CN101888682B (en) * 2010-04-21 2012-12-19 东南大学 Method for realizing wireless personal area network routing protocol based on ultra-wide band positioning assist
CN102045088B (en) * 2011-01-26 2013-05-08 长沙威胜信息技术有限公司 Low-voltage power line narrowband carrier communication routing method

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1691619A (en) 2004-04-27 2005-11-02 国家数字交换系统工程技术研究中心 Method for implementing self-organizing network
CN1764171A (en) 2004-10-22 2006-04-26 微软公司 Rendezvousing resource requests with corresponding resources

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1691619A (en) 2004-04-27 2005-11-02 国家数字交换系统工程技术研究中心 Method for implementing self-organizing network
CN1764171A (en) 2004-10-22 2006-04-26 微软公司 Rendezvousing resource requests with corresponding resources

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
传感器网络中基于角度域的洪泛路由算法. 张锦,林亚平,李超,彭静.计算机工程与科学,第27卷第11期. 2005
在ad hoc网络中一种新的节能路由维护模型. 欧冬秀,董德存,张树京.铁道学报,第25卷第4期. 2003
超宽带传感网的节能路由协议研究. 徐娟.计算机工程与应用,第33期. 2005

Also Published As

Publication number Publication date Type
CN1960329A (en) 2007-05-09 application

Similar Documents

Publication Publication Date Title
Ming Lu et al. An energy‐efficient multipath routing protocol for wireless sensor networks
Mueller et al. Multipath routing in mobile ad hoc networks: Issues and challenges
Younis et al. Energy-aware routing in cluster-based sensor networks
Chinara et al. A survey on one-hop clustering algorithms in mobile ad hoc networks
Youssef et al. A constrained shortest-path energy-aware routing algorithm for wireless sensor networks
Ehsan et al. Performance comparison of ad hoc wireless network routing protocols
US7068600B2 (en) Traffic policing in a mobile ad hoc network
US7007102B2 (en) Admission control in a mobile ad hoc network
Jain et al. Geographical routing using partial information for wireless ad hoc networks
US20030204587A1 (en) Tracking traffic in a mobile Ad Hoc network
Shah et al. Energy aware routing for low energy ad hoc sensor networks
US6954435B2 (en) Determining quality of service (QoS) routing for mobile ad hoc networks
US20040203820A1 (en) Allocating channels in a mobile ad hoc network
Agarwal et al. Survey of clustering algorithms for MANET
US20050111428A1 (en) Power and delay sensitive ad-hoc communication networks
Zhou et al. Load-balanced wireless ad hoc routing
US20090296704A1 (en) Method for multi-path source routing in sensor network
CN101355517A (en) Method for balancing network load based on wireless sensor energy information
Thepvilojanapong et al. Har: Hierarchy-based anycast routing protocol for wireless sensor networks
Asokan A review of Quality of Service (QoS) routing protocols for mobile Ad hoc networks
Chen et al. Energy-balancing multipath routing protocol for wireless sensor networks
Roy et al. Ant colony based routing for mobile ad-hoc networks towards improved quality of services
Ivascu et al. QoS routing with traffic distribution in mobile ad hoc networks
Chaudhuri et al. TreeCast: A stateless addressing and routing architecture for sensor networks
CN101562861A (en) Cross-layer and bi-directional routing method based on hop number and energy in wireless sensor network

Legal Events

Date Code Title Description
C06 Publication
C10 Request of examination as to substance
C14 Granted