WO2010043086A1 - 一种支持快速网络拓扑变化低协议开销的路由方法 - Google Patents

一种支持快速网络拓扑变化低协议开销的路由方法 Download PDF

Info

Publication number
WO2010043086A1
WO2010043086A1 PCT/CN2008/072736 CN2008072736W WO2010043086A1 WO 2010043086 A1 WO2010043086 A1 WO 2010043086A1 CN 2008072736 W CN2008072736 W CN 2008072736W WO 2010043086 A1 WO2010043086 A1 WO 2010043086A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
protocol
routing
node
protocol information
Prior art date
Application number
PCT/CN2008/072736
Other languages
English (en)
French (fr)
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
Application filed by 智格网信息科技(成都)有限公司, 智格网信息科技(上海)有限公司 filed Critical 智格网信息科技(成都)有限公司
Priority to PCT/CN2008/072736 priority Critical patent/WO2010043086A1/zh
Priority to CN200880014080.9A priority patent/CN102077519B/zh
Publication of WO2010043086A1 publication Critical patent/WO2010043086A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks

Definitions

  • the present invention relates to a communication method, and more particularly to a routing method that supports a low network topology change with low protocol overhead, and belongs to the field of communication technologies. Background technique
  • multi-hop networks the mobility of user terminals is highly random, they can be moved at any time, and they can be turned on and off at any time. Coupled with changes in the transmit power of the wireless transmitter, mutual interference between the wireless channels, and terrain, the topology of the network may change at any time, and such changes are not known in advance. Network topology changes frequently. The movement of nodes makes the network topology constantly changing. For frequent network topology changes, traditional fixed network routing protocols are difficult to accurately reflect the topology of the network in a timely manner, and the control information used to maintain the network topology is continuously distributed to the network. Go, take up a lot of wireless bandwidth.
  • DBF Distributed Bellman Ford
  • LS Link State
  • the object of the present invention is to overcome the deficiencies in the prior art and provide an effective solution and device, which utilizes communication of protocol information (such as protocol frames) to achieve timely adaptation to changes in network topology, and has lower The advantage of routing protocol overhead.
  • protocol information such as protocol frames
  • An embodiment of the present invention provides a communication method for supporting a rapid network topology change.
  • the method includes: transmitting, by using a first sending period, a first protocol information, where the first protocol information is used to establish a relationship between a node and a destination node. a routing information; and transmitting, by a second sending period, a second protocol information, where the second protocol information is used to establish a link information between the node and a neighboring node, where the first sending period is different from the first a second transmission period, and wherein the first protocol information includes a plurality of information segments, and the first transmission period is dynamically adjusted according to a corresponding detail information in the plurality of information segments, thereby reducing the first protocol information and A transmission amount of the second protocol information.
  • the embodiment of the present invention further provides a communication device that supports a rapid network topology change, where the device sends the communication protocol information by: sending a first protocol information in a first transmission period, where the first protocol information is used to establish a a routing information between the node and a destination node; and transmitting, by a second sending period, a second protocol information, where the second protocol information is used to establish a link information between the node and a neighboring node, where the a sending period is different from the second sending period, and wherein the first protocol information includes a plurality of information sections, and the first sending period is dynamically adjusted according to a corresponding detail information in the plurality of information sections, and further The amount of transmission of the first protocol information and the second protocol information is reduced.
  • the present invention is based on various protocol information, such as gradient routing protocol frames (ie, HT).
  • protocol information such as gradient routing protocol frames (ie, HT).
  • Figure 1 is a diagram of gradient routing to which the present invention is applied 2 is a diagram of a relationship between neighbor nodes and gradient routing in a system suitable for use in the present invention.
  • 3 is an exemplary packet of a gradient routing protocol frame of the present invention.
  • FIG. 4 is an exemplary packet of a neighbor node protocol frame of the present invention.
  • FIG. 5 is a series of actions that may be caused after receiving a neighbor node protocol frame according to an embodiment of the present invention.
  • FIG. 6 is a flowchart showing an update process after receiving an update message of a gradient routing protocol frame according to an embodiment of the present invention.
  • Fig. 7 is a diagram for deciding whether or not to perform a freezing step in an embodiment of the present invention.
  • Figure 8 is a diagram showing the effect of the potential of the gradient routing on the network in an embodiment of the present invention. detailed description
  • the present invention can be implemented in a gradient routing manner.
  • a high-level routing is also called a pure destination routing.
  • the basic starting point is to abandon the idea of finding an optimal route in a wireless network, and establish a dynamic change.
  • the gradient pointing to the target point is like the spring point with the source point as the top of the mountain, and the target point as the waterhole at the bottom of the mountain. The data flows down from the top to the bottom of the mountain.
  • the specific flow path is not necessarily the shortest path from the peak to the bottom of the mountain, and its focus is on keeping the water flowing downward.
  • the water flow is at a high level, it does not require changes in the bottom of the mountain to affect its path, because the flow process still causes the water to flow to the bottom of the mountain.
  • the process of establishing a gradient does not establish a route, but rather provides a direction for the route.
  • the local routing table is used for sending and receiving data in the network.
  • Local one hop to the destination point
  • NBR neighbor nodes
  • Send not associated with the gradient. Therefore, in order to implement local routing, fast detection is used between neighboring nodes to detect the transition of links between neighboring nodes in time. Non-local targets are sent through the gradient, so there is no need to update the routing information quickly.
  • the transmit data first queries the Neighbor Routing Table to directly transmit using the local route. If there is no corresponding destination, the data is sent according to the route in the Route Table.
  • Figure 2 shows the relationship between neighbor nodes and the gradient route (Height) in the system.
  • the Neighbor Table contains all neighbor node information, and some of them become Neighbor Routing Tables.
  • the broadcast packet with a short propagation period is small, and the periodic broadcast packet with a large amount of information is required to be transmitted less.
  • the rapidly changing information is not transmitted too far.
  • two kinds of information need to be saved in one node, one is the link status information from the node to the neighbor node, and the other is the routing information from the node to the destination node.
  • the routing information from the node to the destination node is based on the link status information from the node to the neighbor node.
  • the neighbor nodes change rapidly, so the amount of information is small, the broadcast period is also short, and the routing information, the amount of information is large, and the periodic broadcast is less.
  • the present invention utilizes communication of protocol information (e.g., protocol frames) to achieve the advantage of adapting to network topology changes and reducing routing protocol overhead in a timely manner.
  • protocol information e.g., protocol frames
  • the present invention dynamically adjusts the transmission period according to various protocol information, such as the detailed information contained in the gradient routing protocol frame (ie, HT Beacon) and the neighbor node protocol frame (S ⁇ NBR Beacon), thereby achieving timely Adapt to network topology changes and reduce the cost of routing protocols.
  • the present invention can be implemented by a gradient routing protocol frame (ie, HT Beacon) and a neighbor node protocol frame (ie, NBR Beacon), and dynamically adjust the period of sending the two protocol frames according to the detailed information carried by the two protocol frames.
  • a gradient routing protocol frame can be used to establish a routing table (Route) Table), characterized in that the amount of information is large and the update speed is slow, so the broadcast period can be long, and the neighbor node protocol frame is used to establish a Neighbor Routing Table, and the characteristic is that the amount of information is small, so the broadcast The period can be shorter.
  • the two protocol frames are respectively broadcasted in different periods, and the gradient routing protocol frame is used to establish the gradient routing, and the neighbor node protocol is transmitted.
  • Frames establish local routes and neighbor link relationships, which can adapt to network topology changes in time, and reduce routing protocol overhead due to different transmission periods.
  • a gradient routing protocol frame may define a segment, which is responsible for indicating that the protocol frame is a gradient routing protocol frame (ie, HT Bea CO n).
  • the gradient routing protocol frame of the present invention is used to establish a routing table as described above.
  • the gradient routing protocol frame of the present invention may further comprise, for example, three segments to further provide detailed information about the gradient routing protocol frame.
  • the gradient routing protocol frame shown in Figure 3 includes a Query section, a Reply section, and an Update section.
  • the corresponding detail information is filled in each section and transmitted in an appropriate cycle, thereby reducing the number of transmission space messages, thereby reducing the protocol overhead.
  • a gradient routing protocol frame carrying an inquiry and/or replying to detailed information can be sent in a shorter period, while a gradient routing protocol carrying updated detail information can be sent in a longer period.
  • the gradient routing protocol frame can be sent in an event driven manner.
  • the present invention further adjusts the transmission period according to the detailed information carried in the protocol information, thereby reducing unnecessary transmission amount of protocol information.
  • the detail information may be sent in the same gradient routing protocol frame. In another embodiment of the invention, these detail messages may also be sent in different gradient routing protocol frames.
  • the route life cycle can be divided into five states. Therefore, the information contained in the gradient routing protocol frame can also send different information according to the state of the route life cycle:
  • the gradient routing protocol frame of the present invention may send an inquiry message.
  • the gradient routing protocol frame of the present invention may send a reply message.
  • the route is in the available state (Ready) where the reply is finished.
  • a neighbor node protocol frame may include information such as a transport channel ID, a transmission power, an interval, a node type, a neighbor node number, and a neighbor node Triples.
  • the link relationship and the neighbor node relationship can be established by the accepted neighbor node protocol frame.
  • the neighbor node protocol frame is sent, and may include all neighbor information except the special neighbor node (Special NBR) and the neighbor's special neighbor node.
  • the send cycle can also be adjusted to a configurable parameter.
  • the neighbor node protocol frame of the present invention may be required to carry the transmission cycle time and neighbor node type information. Select a certain number of neighbors on the basis of mutual mutual visibility as a neighbor (Close Neighb 0 r). This process can be supplemented by the existing nearby neighbor selection mechanism. Neighbors can also choose the best neighbor (Best Neighbor) pointed to by the existing gradient.
  • the cost value may be defined as a time parameter required by the initiating node to reach the destination node route. This time parameter may vary depending on a wireless state, a network traffic, a packet size, a data transfer rate, or the impact of any combination.
  • Cost value in the gradient table There are records in the neighbor table. For example, the cost value recorded in the neighbor table is the cost value of the node to the neighbor node, and the cost value recorded in the gradient table is the cost value of the node to the destination node.
  • the present invention further introduces a smoothing factor, and adaptively handles the cost, SP, and the new cost value affects the smooth transformation of the original cost forming cost in a weighted average manner, as shown in the following formula.
  • Cost 01d_Cost + A X New Cost (0 ⁇ A ⁇ 1 is a tunable parameter).
  • each of the protocol frames is periodically broadcast and transmitted, and the height table and the neighbor table (Neighbor) can be periodically updated respectively. Table).
  • FIG. 5 an action that may be caused after receiving a neighbor node protocol frame in an embodiment of the present invention is shown.
  • a Neighbor Table change is triggered first.
  • the neighbor routing table will query the cost value of each link to update the routing table information during periodic update.
  • the routing neighbor is selected from the neighbor list for local routing.
  • the cost transformation exceeds a threshold (or threshold)
  • the threshold or (or threshold) can be manually set. Therefore, when the link changes of these local routes exceed a certain range, the cost of the gradient route is affected. Since the gradient route is all optional gradient information, these gradient information are selected according to certain principles (such as the cost optimization principle), and the route for data transmission is selected. Therefore, if the cost of the gradient route changes beyond a certain range, it will inevitably affect the final routing.
  • the link cost change when the link cost change does not exceed the link switching threshold, no link switching is performed. In still another embodiment of the present invention, when the cost change of the neighbor node does not exceed the route switching threshold, the neighbor handover is not performed.
  • a rising value can be calculated based on the cycle time provided in the neighbor node protocol frame, thereby causing the link to time out.
  • the Ramp value of the present invention refers to the recorded one In the neighboring node protocol frame period, the number of packets lost. When the number of lost packets exceeds the specified value, the link is considered to be inoperable.
  • the cost at the neighbor node level is the cost value of the local route, it is not directly equal to the cost value of the optimal link, but is adaptively smoothed. Therefore, in the neighbor node protocol frame, the cost and loss transmission of the link still needs to be carried as a reference for calculating the cost.
  • an update (Update) message eg, neighbor cost to destination, Cnd
  • the cost of the corresponding neighbor node eg, cost to neighbor, Cn
  • the cost of an entry in the gradient table for example, cost to destination, Cd
  • the update process is shown in Figure 6.
  • the establishment of the potential must avoid looping of the routing link.
  • Loopback of a routed link means that in the routing link, when the cost of a link is suddenly changed due to external factors, and other nodes cannot be notified in a short time, according to the route optimization principle, the route will select just The node that has passed, resulting in a loopback of the routing link.
  • the present invention avoids the occurrence of routing link loopback through a freeze mechanism. If there are optional gradients that do not form a routing link loop, then it is not necessary to enter a frozen state.
  • the suboptimal gradient may be selected using any of the following conditions:
  • the opponent's Cnd is a smaller gradient than its own Cd without freezing.
  • the previous cost (Cdf) is recorded at the time of freezing for conditional detection of Unfrozen.
  • Height Routing is to establish a dynamic gradient of the target point, just like the source point as the spring of the mountain, the target point as the bottom of the pool, the data flows down from the top to the bottom of the mountain, water The places that flow through and do not flow have the potential to the pool, as described above.
  • the present invention takes all the potentials, only a part of which can be transformed into a desired potential, and these points having a potential that can be formed form an elliptical area. By limiting this elliptical region, the effect of potential on the network portion can be further reduced.
  • FIG. 8 is a diagram showing the effect of the potential of the gradient routing on the network in an embodiment of the present invention.
  • the area that satisfies this condition is an ellipse area, and the area can be selected. Otherwise, It is not considered, which reduces unnecessary routing information, reduces the overhead of network routing protocols, and adapts to rapid network topology changes.
  • the beneficial effects of the present invention are as follows: 1.
  • the overhead of the protocol in the wireless resource is greatly reduced. 2.
  • 3. It is possible to make large-area networks and support a large number of customers.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Description

一种支持快速网络拓扑变化低协议开销的路由方法 技术领域
本发明涉及的是一种通信方法, 具体地说, 是一种支持快速网络拓扑变 化低协议开销的路由方法, 属于通信技术领域。 背景技术
随着通信技术的发展和移动终端性能的提高, 多跳网络的应用越来越广 泛。 多跳网络中, 用户终端的移动性具有很大的随机性, 它们可以随时移 动, 也可以随时开机和关机。 再加上无线发射装置发送功率的变化、 无线信 道间的相互干扰以及地形等因素的影响, 网络的拓扑结构可能随时发生变 化, 而且这种变化无法预先知晓。 网络拓扑动态变化频繁。 节点的移动使得 网络拓扑不断变化, 对于频繁的网络拓扑变化, 传统的固定网络路由协议很 难及时地准确地反映网络的拓扑结构, 而且为了维护网络拓扑所使用的控制 信息不断地分发到网络中去, 要占用大量的无线带宽。
网络中, 大部分路由协议是基于 DBF (Distributed Bellman Ford) 和 LS (Link State) 设计的。 由于 DBF具有分布式的特点, 因此它简单而且计算 效率较高, 这是它的优势。 但其路由收敛较慢, 而且有形成环形路由的可 能, 因此不适合拓扑高度变化的网络。 虽然有些方案已解决了环形路由问 题, 但到目前为止还没有较好的方案能解决 DBF收敛较慢这一问题。
正是由于 DBF的这些问题, 人们才找到一种全新的方案 LS。 在 LS路 由协议中, 每个节点都维护着一个全局拓扑结构表, 因而很容易避免环形路 由。 而且链路的任何变化都会立即触发链路更新, 这样收敛到新的拓扑结构 所需要的时间远远小于 DBF。 但是 LS依靠泛洪去分发路由更新信息, 可能 会带来过多的带宽开销, 特别是在链路变化频繁的网络中, 大量的更新信息 会占用相当多的宝贵带宽, 增加协议的开销。 发明内容
本发明的目的在于克服现有技术中的不足, 提供一种有效的解决方法及 装置, 其利用协议信息 (例如协议帧)的通讯, 而达成及时的适应网络拓扑的 变化, 以及具有较低的路由协议开销的优势。
本发明实施例提供一种支持快速网络拓扑变化的通信方法, 该方法包 含: 以一第一发送周期, 发送一第一协议信息, 该第一协议信息用以建立一 节点与一目的节点间的一路由信息; 以及以一第二发送周期, 发送一第二协 议信息, 该第二协议信息用以建立该节点与一邻居节点间的一链路信息, 其 中该第一发送周期不同于该第二发送周期, 以及其中该第一协议信息包含复 数个信息区段, 而该第一发送周期根据该复数个信息区段内的一对应细节信 息作动态的调整, 进而减少该第一协议信息与该第二协议信息的一发送量。
本发明实施例还提供一种支持快速网络拓扑变化的通信装置, 该装置通 过以下方法发送通讯协议信息: 以一第一发送周期, 发送一第一协议信息, 该第一协议信息用以建立一节点与一目的节点间的一路由信息; 以及以一第 二发送周期, 发送一第二协议信息, 该第二协议信息用以建立该节点与一邻 居节点间的一链路信息, 其中该第一发送周期不同于该第二发送周期, 以及 其中该第一协议信息包含复数个信息区段, 而该第一发送周期根据该复数个 信息区段内的一对应细节信息作动态的调整, 进而减少该第一协议信息与该 第二协议信息的一发送量。
具体而言, 本发明根据各种协议信息, 如梯度路由协议帧(即 HT
Beacon)与邻居节点协议帧 (S卩 NBR Beacon)内所包含的细节信息, 动态地调 整其发送周期, 进而达到及时适应网络拓扑变化与降低路由协议开销的优 势。 图说明
图 1为本发明所适用的梯度路由的图式 图 2为适用于本发明的系统中邻居节点和梯度路由的关系图。 图 3为本发明的梯度路由协议帧的一范例封包。
图 4为本发明的邻居节点协议帧的一范例封包。
图 5为本发明的一实施例中接收邻居节点协议帧后所可能导致的一系列 动作。
图 6为本发明的一实施例中接收到梯度路由协议帧的更新消息后的更新 流程。
图 7为本发明的一实施例中决定是否进行冻结步骤的图式。
图 8为本发明的一实施例中限制梯度路由的势对网络所产生的影响的图 式。 具体实施方式
本发明可以梯度路由的方式实施, 如图 1 所示, 梯度路由 (Height Routing) 也称为纯目的性路由, 其基本的出发点是放弃在无线网络中寻找 最优路由的思想, 而建立动态变化的指向目标点的梯度, 如同以源点作为山 顶的泉眼, 以目标点为山底的水潭, 数据通过山顶到山底的势 (Height) 流 下来。
在梯度路由的概念中, 具体的流水路径并不一定是山顶到山底的最短路 径, 其重点在于保持水向下流的趋势。 当水流处在高势的水平时, 并不需要 山底势的变化而影响其路径, 因为流动的过程仍使水流在流向山底。 换句话 说, 建立梯度的过程并不是建立路由, 而是为路由提供方向。
然而, 为了在不同的势之间进行选择, 首先要保持对不同的势作记录, 即为梯度表 (Height Table) , 而被选择出来用于数据传输的梯度就成为了 路由表 (Route Table) 。
根据梯度原则, 在网络中数据的收发采用本地路由表。 本地 (到达目标 点一跳) 直接通过邻居节点 (NBR) 之间的链路 (Link) , 进行数据的发 送, 与梯度并无关联。 因此, 为了实现本地路由, 邻居节点间要采用快速检 测, 及时发现邻居节点之间链路的变换情况。 非本地目标通过梯度进行发 送, 则无需快速更新路由信息。
具体来讲, 根据本发明, 发送数据首先查询邻居路由表 (Neighbor Routing Table) , 以直接利用本地路由发送, 如果没有相应的目的地, 则根 据路由表 (Route Table) 中的路由进行数据发送。
图 2显示了系统中邻居节点和梯度路由 (Height ) 的关系。 邻居表 (Neighbor Table ) 包含了所有的邻居节点信息, 其中有一部分成为邻居路 由表 (Neighbor Routing Table) 。
依照本发明的基本原则, 一是, 传播周期短的广播包要小, 再者, 信息 量大的定期广播包要少发, 三是, 迅速改变的信息不要传播的太远。 一般而 言, 在一个节点里需要保存两种信息, 一种是节点到邻居节点的链路状况信 息, 一种是节点到目的节点的路由信息。 节点到目的节点的路由信息, 建立 在节点到邻居节点的链路状况信息的基础上。 当目的节点的数目变大时, 节 点到目的节点的路由信息量也会随之增大, 但是节点到邻居节点的链路状况 信息量, 不会因为目的节点的数目变大而有太大的变化。 因此, 根据本发 明, 邻居节点变化快, 所以信息量要小, 广播周期也要短, 而路由信息, 信 息量大, 定期广播要少发。
本发明是利用协议信息 (如协议帧)的通讯, 而达成及时适应网络拓扑变 化与降低路由协议开销的优势。 具体而言, 本发明根据各种协议信息, 如梯 度路由协议帧 (即 HT Beacon)与邻居节点协议帧 (S卩 NBR Beacon)内所包含的 细节信息, 动态地调整其发送周期, 进而达到及时适应网络拓扑变化与降低 路由协议开销的优势。
本发明可以一梯度路由协议帧 (即 HT Beacon)与一邻居节点协议帧 (即 NBR Beacon)实施, 根据此二协议帧所携带的细节信息, 动态地调整发送此 二协议帧的周期。 具体而言, 梯度路由协议帧可用来建立路由表 (Route Table), 其特性在于, 信息量大, 更新速度慢, 因此广播周期可较长, 而邻 居节点协议帧用来建立邻居路由表 (Neighbor Routing Table) , 其特性则在 于, 信息量小, 因此广播周期可较短。
因此, 在本发明的实施例中, 根据上述二协议帧的细节信息, 以不同的 周期, 分别广播此二协议帧, 即可透过梯度路由协议帧来建立梯度路由, 以 及透过邻居节点协议帧来建立本地路由及邻居链路关系, 进而得以及时适应 网络拓扑变化, 并可因为发送周期不同而降低路由协议开销。
参照图 3与图 4, 其分别绘示本发明的梯度路由协议帧及邻居节节点协 议帧的范例封包。 参照图 3, 在本发明的一实施例中, 梯度路由协议帧内可 定义有一区段, 负责表示此协议帧是一梯度路由协议帧 (即 HT BeaCOn)。 本 发明的梯度路由协议帧用以建立路由表, 已如前述。
具体而言, 本发明的梯度路由协议帧内更可包含例如三个区段, 以进一 步提供有关梯度路由协议帧的细节信息。 举例而言, 图 3所示的梯度路由协 议帧包含询问 (Query)区段、 回复 (Reply)区段、 以及更新 (Update)区段。 根据 本发明, 在每区段填入相对应的细节信息, 并以适当的周期发送, 即可减少 传输空间消息的个数, 进而降低协议开销。
举例而言, 携带询问及 /或回复细节信息的梯度路由协议帧可以较短的 周期发送, 而携带更新细节信息的梯度路由协议则可以较长的周期发送。 换 句话说, 梯度路由协议帧系可以事件导向 (event driven)的方式进行发送。 亦 SP , 当梯度路由协议帧携带的是询问及 /或回复细节信息时, 即以较短的周 期发送, 而当梯度路由协议帧携带的是更新细节信息时, 即以较长的周期发 送。 藉此, 本发明得以进一步的根据协议信息中所携带的细节信息调整其发 送周期, 进而减少不必要的协议信息发送量。
在本发明的一实施例中, 这些细节信息可以通过同一梯度路由协议帧中 进行发送。 在本发明的另一实施例中, 这些细节消息亦可在不同的梯度路由 协议帧中进行发送。 在本发明的一实施例中, 路由生存周期可划分为五种状态, 因此, 梯度 路由协议帧内所包含的信息, 亦可根据路由生存周期的状态而发送不同的信 息:
路由不存在 (No Exist) 。
路由不可用 (Not Ready) 。 在一实施例中, 本发明的梯度路由协议帧 可发送一询问信息。
路由从不可用状态转变成可用状态 (Pre-Ready) 。 在一实施例中, 本 发明的梯度路由协议帧可发送一回复信息。
路由处于结束了回复的可用状态 (Ready) 。
询问超时 (Dead) 。
参照图 4, 在本发明的一实施例中, 邻居节点协议帧内可包含传输信道 ID、 传输功率、 间隔、 节点类型、 邻居节点号、 以及邻居节点 Triples等信 息。 在本发明的一实施例中, 通过接受的邻居节点协议帧可以建立链路关系 和邻居节点关系。 发送邻居节点协议帧, 可包括特殊邻居节点 (Special NBR) 和邻居的特殊邻居节点之外的所有邻居信息。 发送周期亦可调整为可配置参 数。
本发明的邻居节点协议帧可要求携带发送周期时间和邻居节点类型信 息。 在双方相互可见的基础上选择一定量邻居, 作为附近邻居 (Close Neighb0r)。 这个过程可以辅以现有的附近邻居选择机制。 附近邻居亦可将 现有梯度所指向的最佳邻居 (Best Neighbor)也选择进来。
由于路由选择是为了合理的减少时间, 增加无线资源的利用, 因此, 在 本发明中进一步地引入成本值 (Cost)的概念, 来动态地调整协议信息的发送 周期。 在本发明的一实施例中, 成本值可定义为发起节点到达目的节点路由 所需要的一时间参数。 此时间参数可根据一无线状态、 一网络流量、 一封包 大小、 一数据传输率、 或任一结合者的影响而有所改变。 成本值在梯度表与 邻居表中皆有纪录。 举例而言, 邻居表中所纪录的成本值是节点到邻居节点 的成本值, 而梯度表中所纪录的成本值是节点到目的节点的成本值。
本发明进一步引入平滑因子, 对成本做适应性处理, SP, 将新成本值以 加权平均方式影响原有成本形成成本的平稳变换, 如以下公式所示。
Cost = 01d_Cost + A X New Cost (0<A<1 , 为一可调参数) 。
根据本发明, 依照例如梯度路由协议帧及邻居节点协议帧所携带的细节 信息, 分别周期性地广播发送各种协议帧, 即可分别周期性地更新梯度表 (Height Table)与邻居表 (Neighbor Table)。
参照图 5, 其绘示本发明的一实施例中, 接收邻居节点协议帧后所可能 导致的一动作。 如图 5所示, 在本发明的一实施例中, 接收邻居节点协议帧 时, 首先会触发邻居表 (Neighbor Table)出现变化。 根据邻居表的变化, 邻居 路由表会在进行周期更新时, 查询各个链路的成本值, 以将其路由表的信息 进行更新。 并根据路由情况, 从邻居表中, 选择出路由邻居, 以作本地路 由。
在本发明的一实施例中, 如果成本变换超过一门限 (或临界值), 则会影 响梯度路由的成本值, 而此门限或 (或临界值)可以手动的方式设定。 藉此, 当这些本地路由的链路变化超过一定范围后, 会影响梯度路由的成本。 由于 梯度路由为所有可选的梯度信息, 这些梯度信息根据一定的原则 (例如成本 最优原则) , 选择出用于数据发送的路由。 因此, 如果梯度路由的成本变化 超过了一定的范围, 则势必会影响最终路由选择。
在本发明的一实施例中, 当链路成本变化没有超过链路切换门限时, 不 会进行链路切换。 在本发明的又一实施例中, 当邻居节点的成本变化没有超 过路由切换门限时, 不会进行邻居切换。
根据本发明, 在链路级别上, 根据邻居节点协议帧中提供的周期时间, 可以计算一上升值 (Ramp), 从而使链路超时。 本发明的 Ramp值指所纪录一 个邻居节点协议帧周期中, 数据包丢失的个数, 当数据包丢失的个数超过规 定的数值时, 此链路则被视为不能正常工作。
由于邻居节点级别上的成本是本地路由的成本值, 并不直接等于最优链 路的成本值, 而是经过适应性平滑后的值。 因此, 在邻居节点协议帧中, 仍 需要携带链路的成本和损耗发送, 以作为计算成本的参考。
在本发明的一实施例中, 当接收到梯度路由协议帧的更新 (Update)消息 (例如 neighbor cost to destination, Cnd) 、 或着当相应邻居节点的成本 (例 如 cost to neighbor, Cn) 变化超过路由成本门限时, 可能导致梯度表中某一 表项的成本 (例如 cost to destination, Cd) 发生变换, 从而产生路由切换或 路由冻结 (Frozen)机制。 更新流程如图 6所示。
根据本发明, 势的建立必须避免路由链路的回环 (Loop) 发生。 路由 链路的回环是指在路由链路中, 当某一链路的成本由于外界的因素而突然激 变, 而在短时间内不能通知到其它的节点, 根据路由最优原则, 路由会选择 刚刚走过的节点, 从而导致路由链路的回环。 在通常情况下, 只有在当前选 择的最优势的成本增加时, 才会有形成路由链路的回环的可能性。 本发明通 过冻结机制来避免路由链路回环的发生。 如果有可选的其它不会形成路由链 路回环的梯度, 则不必进入冻结状态。
如图 7所示, 当最优梯度 (Best Height)的成本增大时, 就有发生路由链 路回环的可能, 所以需要决定是否进行冻结。 如果当前存在次优 (Sub- optimum) 梯度, 则不必进行冻结, 而可直接切换。
在本发明的一实施例中, 次优梯度可以利用以下任一条件选定: 对方的 Cnd比自身的没有冻结之前的 Cd还要小的梯度。
对方在梯度上的位置比自身低 (Hop < My Hop) 。
在本发明的实施例中, 冻结时要记录之前的成本 (Cdf) , 以用于解除 冻结 (Unfrozen)的条件检测。 梯度路由 (Height Routing) 是建立动态变化的指向目标点的梯度, 如 同以源点作为山顶的泉眼, 以目标点为山底的水潭, 数据通过山顶到山底的 势 (Height) 流下来, 水所流经和没有流经的地方都具有向水潭的势, 已如 上述。
为了减少协议的开销, 适应网络拓扑的快速变化, 本发明采取所有的势 中, 只有一部分是可以转化为需要的势, 这些具有可以被需要的势的点形成 了一个椭圆区。 通过对这个椭圆区的限定, 可以进一步地减少势对网络部分 的影响。
图 8绘示本发明的一实施例中限制梯度路由的势对网络所产生的影响的 图式。 如图 8所示, 通过到可活动节点的跳数 (HOP to Live, 即 HTL) 和 到目的节点的跳数 (Hop to Dest, 即 HTD) 的相互关系, g卩 HTD (Hop to Dest) + HTL (HOP to Live) < =最大跳数 (MAX hop) , 可以做到对机动 梯度 (On-Demand Height) 的影响范围进行限制, 满足此条件的区域为一椭 圆区, 即可选取区域, 否则不予考虑, 进而减少无用的路由信息, 减少网络 路由协议的开销, 适应快速的网络拓扑变化。
本发明的有益效果是: 1、 大大减少了协议在无线资源中的开销。 2.大 大减少了由于需要适应高速移动而增加协议开销对网络的影响。 3.使大面积 部网和支持大量客户成为可能。
本发明已透过以上具体实施例作一详细说明, 惟以上所述者, 仅用以说 明本发明的较佳实施例而已, 并不能限定本发明的实施范围。 即凡依本发明 权利要求所作的均等变化与修饰等, 皆应仍属本发明专利涵盖范围内。

Claims

权利要求书
1,一种支持快速网络拓扑变化的通信方法, 所述的方法包含:
以一第一发送周期, 发送一第一协议信息, 所述的第一协议信息用以建 立一节点与一目的节点间的一路由信息; 以及
以一第二发送周期, 发送一第二协议信息, 所述的第二协议信息用以建 立所述的节点与一邻居节点间的一链路信息,
其中所述的第一发送周期不同于所述的第二发送周期, 以及
其中所述的第一协议信息包含复数个信息区段, 而所述的第一发送周期 根据所述的复数个信息区段内的一对应细节信息作动态的调整, 进而减少所 述的第一协议信息与所述的第二协议信息的一发送量。
2.如权利要求 1所述的方法, 其特征在于, 所述的方法更包含利用一成 本值, 决定是否调整所述的第一发送周期与所述的第二发送周期, 其中所述 的成本值以一时间参数作计算, 其中所述的第一协议信息的所述的成本值是 所述的节点路由到所述的目的节点所需的所述的时间参数, 以及所述的第二 协议信息的所述的成本值是所述的节点到所述的邻居节点所需的所述的时间 参数。
3.如权利要求 2所述的方法, 其特征在于, 所述的成本值是以以下公式 计算: 一成本值 =一现有成本值 +—可调参数 X—新成本值, 其中所述的 可调参数介于 0与 1之间的一数值。
4.如权利要求 2所述的方法, 其特征在于, 所述的时间参数根据一无线 状态、 一网络流量、 一封包大小、 一数据传输率、 或其中任一结合的影响而 有所改变。
5.如权利要求 2所述的方法, 其特征在于, 所述的方法更包含以手动方 式设定一临界值, 当所述的成本值的一改变超过所述的临界值时, 即调整所 述的第一发送周期与所述的第二发送周期。
6.如权利要求 1所述的方法, 其特征在于, 所述的方法更包含设定一最 大跳数, 以限制邻居节点的一范围。
7.如权利要求 2所述的方法, 其特征在于, 所述的方法更包含根据所述 的成本值, 决定进行一冻结或一切换步骤, 以避免一路由链路回环。
8.如权利要求 7所述的方法, 其特征在于, 若有一次优梯度存在, 则进 行所述的切换步骤, 若否, 则进行所述的冻结步骤。
9.如权利要求 1所述的方法, 其特征在于, 所述的方法更包含动态的调 整所述的第二发送周期。
10.如权利要求 1所述的方法, 其特征在于, 所述的对应细节信息包含 一询问信息、 一回复信息、 以及一更新信息的其中之一、 或其结合者。
11.如权利要求 10所述的方法, 其特征在于, 所述的询问信息与所述的 回复信息以一较短周期发送, 以及所述的更新信息以一较长周期发送。
12.如权利要求 1所述的方法, 其特征在于, 所述的第二协议信息包含 邻居节点信息。
13.如权利要求 1所述的方法, 其特征在于, 所述的方法更包含根据所 述的第二协议信息所提供的一周期时间, 计算一上升值, 所述的上升值用以 纪录所述的第二协议信息在所述的第二发送周期内所丢失的一数据包个数, 当所述的上升值超过一既定值时, 则使一链路被视为超时而无法正常工作。
14.如权利要求 1所述的方法, 其特征在于, 所述的第一协议信息是一 梯度路由协议帧。
15.如权利要求 1所述的方法, 其特征在于, 所述的第二协议信息是一 邻居节节点协议帧。
16.如权利要求 1所述的方法, 其特征在于, 所述的第一协议信息是以 一事件导向的方式进行发送。
17.如权利要求 2所述的方法, 其特征在于, 所述的方法更包含将所述 的第一协议信息的所述的成本值与所述的第二协议信息的所述的成本值分别 纪录于所述的路由信息及所述的链路信息。
18.如权利要求 1所述的方法, 其特征在于, 所述的路由信息可为一路 由表, 以及所述的链路信息可为一邻居路由表。
19.如权利要求 1所述的方法, 其特征在于, 所述的方法更包含根据一 路由生存周期状态发送不同的细节信息。
20.如权利要求 6所述的方法, 其特征在于, 所述的最大跳数小于到一 来源的跳数与到一目的地跳数的总和。
21.—种支持快速网络拓扑变化的通信装置, 其特征在于, 所述的装置 以权利要求 1所述的方法发送通讯协议信息。
PCT/CN2008/072736 2008-10-17 2008-10-17 一种支持快速网络拓扑变化低协议开销的路由方法 WO2010043086A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2008/072736 WO2010043086A1 (zh) 2008-10-17 2008-10-17 一种支持快速网络拓扑变化低协议开销的路由方法
CN200880014080.9A CN102077519B (zh) 2008-10-17 2008-10-17 一种支持快速网络拓扑变化低协议开销的路由方法

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2008/072736 WO2010043086A1 (zh) 2008-10-17 2008-10-17 一种支持快速网络拓扑变化低协议开销的路由方法

Publications (1)

Publication Number Publication Date
WO2010043086A1 true WO2010043086A1 (zh) 2010-04-22

Family

ID=42106201

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/072736 WO2010043086A1 (zh) 2008-10-17 2008-10-17 一种支持快速网络拓扑变化低协议开销的路由方法

Country Status (2)

Country Link
CN (1) CN102077519B (zh)
WO (1) WO2010043086A1 (zh)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040170130A1 (en) * 2003-02-27 2004-09-02 Pankaj Mehra Spontaneous topology discovery in a multi-node computer system
US20070127503A1 (en) * 2005-12-01 2007-06-07 Azalea Networks Method and system for an adaptive wireless routing protocol in a mesh network
CN101005422A (zh) * 2006-12-07 2007-07-25 中国科学院计算技术研究所 一种基于路由邻居表建立无线传感器网络路由的方法
CN101102272A (zh) * 2007-07-13 2008-01-09 北京航空航天大学 一种路由更新方法
CN101159689A (zh) * 2007-11-08 2008-04-09 北京科技大学 基于区域梯度更新的移动传感器网络路由方法
WO2008055539A1 (en) * 2006-11-06 2008-05-15 Telefonaktiebolaget Lm Ericsson (Publ) Multi-domain network and method for multi-domain network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101277264A (zh) * 2008-05-13 2008-10-01 武汉理工大学 无线传感器网络中基于蚁群算法的定向扩散方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040170130A1 (en) * 2003-02-27 2004-09-02 Pankaj Mehra Spontaneous topology discovery in a multi-node computer system
US20070127503A1 (en) * 2005-12-01 2007-06-07 Azalea Networks Method and system for an adaptive wireless routing protocol in a mesh network
WO2008055539A1 (en) * 2006-11-06 2008-05-15 Telefonaktiebolaget Lm Ericsson (Publ) Multi-domain network and method for multi-domain network
CN101005422A (zh) * 2006-12-07 2007-07-25 中国科学院计算技术研究所 一种基于路由邻居表建立无线传感器网络路由的方法
CN101102272A (zh) * 2007-07-13 2008-01-09 北京航空航天大学 一种路由更新方法
CN101159689A (zh) * 2007-11-08 2008-04-09 北京科技大学 基于区域梯度更新的移动传感器网络路由方法

Also Published As

Publication number Publication date
CN102077519B (zh) 2013-05-15
CN102077519A (zh) 2011-05-25

Similar Documents

Publication Publication Date Title
Dely et al. Openflow for wireless mesh networks
JP6045503B2 (ja) 無線メッシュネットワークのノードへのデータ伝送を最適化するためのシステム及び方法
CN111479306B (zh) 一种基于Q-learning的飞行自组网QoS路由方法
KR100671526B1 (ko) 무선 메시 네트워크들에서의 어드레싱 및 라우팅을 위한 방법 및 장치
US20060007882A1 (en) System and method for selecting stable routes in wireless networks
JP2008519531A (ja) 無線通信ネットワークにおいて経路収束時間を短縮し、且つ最適な経路を探索するためのシステム及び方法
WO2007048309A1 (fr) Méthode de routage de mn dans un réseau maillé sans fil et système de communication correspondant
TWI398126B (zh) 一種支援快速網路拓樸變化低協定開銷的路由方法
CN110087268B (zh) 一种基于无线局域网的路由切换方法
Raju et al. ZRP versus aodv and dsr: A comprehensive study on zrp performance on manets
Othmen et al. Power and delay-aware routing protocol for ad hoc networks
Chinara et al. Topology control by transmission range adjustment protocol for clustered mobile ad hoc networks
Ali et al. An efficient link management algorithm for high mobility mesh networks
Hwang et al. Link stability, loading balance and power control based multi-path routing (SBPMR) algorithm in ad hoc wireless networks
WO2010043086A1 (zh) 一种支持快速网络拓扑变化低协议开销的路由方法
Sethi et al. An effective and scalable AODV for wireless ad hoc sensor networks
Dhiviya et al. Enhancing the network lifetime using on demand tree based routing protocol for MANET
Gupta et al. Node-disjoint on-demand multipath routing with route utilization in ad-hoc networks
Zhou et al. Velocity based adaptive zone routing protocol
Kolipaka et al. Joint admission control and vertical handoff between WLAN and WIMAX in wireless mesh networks for QoS
SreeRangaRaju et al. ZRP versus AODV and DSR: a comprehensive study on ZRP performance using QualNet simulator
Saini et al. Analysis of routing protocols using UDP traffic under dynamic network topology
Jiang et al. Load balancing routing algorithm for ad hoc networks
SreeRangaRaju et al. Performance evaluation of ZRP in adhoc mobile wireless network using Qualnet simulator
Patel et al. Graph theoretic routing algorithm (GTRA) for mobile ad-hoc networks (MANET)

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200880014080.9

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08877363

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08877363

Country of ref document: EP

Kind code of ref document: A1