New! View global litigation for patent families

CN102833810A - Route addressing method for wireless sensor network - Google Patents

Route addressing method for wireless sensor network Download PDF

Info

Publication number
CN102833810A
CN102833810A CN 201110163628 CN201110163628A CN102833810A CN 102833810 A CN102833810 A CN 102833810A CN 201110163628 CN201110163628 CN 201110163628 CN 201110163628 A CN201110163628 A CN 201110163628A CN 102833810 A CN102833810 A CN 102833810A
Authority
CN
Grant status
Application
Patent type
Prior art keywords
node
value
neighbour
route
quality
Prior art date
Application number
CN 201110163628
Other languages
Chinese (zh)
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

Links

Classifications

    • Y02D70/00
    • Y02D70/32

Abstract

The invention discloses a route addressing method for a wireless sensor network, which comprises the following steps that: at one route updating time interval, each node counts the number of received data packets and the number of lost data packets for each neighbour node so as to calculate a receiving quality characteristic estimated value and a sending quality characteristic estimated value between the node and each neighbour node; and according to the receiving quality characteristic estimated value and the sending quality characteristic estimated value, each node sequentially calculates a link total consumption value between the node and each neighbour node and the neighbour node with the minimum link total consumption value is selected as a father node from the neighbour nodes. According to the invention, the accuracy of searching the optical route can be effectively improved; system resources are consumed a little; the requirement on hardware is low; and the route addressing method is suitable to apply in an embedded system with poor operational capability.

Description

无线传感器网络的路由寻址方法 Wireless sensor network routing method of addressing

技术领域 FIELD

[0001] 本发明涉及ー种无线传感器网络的路由寻址方法。 [0001] The present invention relates to a method of routing addressed ー types of wireless sensor networks.

背景技术 Background technique

[0002] 无线传感器网络(Wireless Sensor Network, WSN),是由部署在监测区域内的大量微型传感器节点组成,通过无线通信方式形成的ー个多跳自组织网络。 [0002] The wireless sensor network (Wireless Sensor Network, WSN), a large number of tiny sensor nodes are deployed in the monitoring region composed ー multi-hop ad hoc network formed by wireless communication. 其以低功耗、低成本、分布式和自组织的特点为我们带来了一场信息感知的变革。 Which is characteristic of low power, low cost, distributed and self-organization of information brought about a perceptible change for us.

[0003] 各种能被传感器感知的物理參量(如温度、湿度、震动、加速度、ニ氧化碳浓度等),以各种多媒体形式的数据(如video、image、audio等),通过WSN节点的自组网,远程采集、传输至监控端。 [0003] The various physical parameters that can be perceived by sensors (such as temperature, humidity, vibration, acceleration, Ni concentration of carbon monoxide, etc.), various forms of multimedia data (e.g., video, image, audio, etc.), by the node WSN MANET, remote collection, transmission to the monitoring terminal. 无线传感器网络作为物联网(Internet of Thing, IOT)的重要组成部分,目前在精准农业、林业监测、智能建筑、智能交通、智能家居等领域正逐渐展开应用。 Wireless sensor networks as an important part of the (Internet of Thing, IOT) of things, is now gradually expand the application in precision agriculture, forestry monitoring, intelligent buildings, intelligent transportation, smart home and other areas.

[0004]目前无线传感器网络技术中涉及路由寻址的方法有很多种,但是都在自组网和自动寻找路由中存在一些缺陷,包括寻找最佳路由不够准确,在计算过程中耗费系统资源比较大,以及在硬件资源比较少的嵌入式系统中使用效果不理想等。 [0004] There are methods in wireless sensor network technology involves addressing a variety of routes, but are more ad hoc network and to automatically find some drawbacks routes, including the search for the best route is not accurate enough, the system resources consumed during the calculation large, and the use of fewer hardware resources in embedded systems are not effective and so on.

发明内容 SUMMARY

[0005] 本发明所要解决的技术问题是,克服现有无线传感器网络的路由寻址方法精度较低,耗费系统资源较大,以及在嵌入式设备中使用效果不理想的缺陷,提供一种准确、高效、稳定的无线传感器网络的路由寻址方法。 [0005] The present invention solves the technical problem, overcoming the existing wireless sensor network routing method of addressing accuracy is low, a large consumption of system resources, and the use of embedded devices is not satisfactory defects, provide an accurate routing addressing method efficient and stable wireless sensor network.

[0006] 为解决上述技术问题,本发明提供一种新的无线传感器网络的路由寻址方法,所述方法包括以下步骤: [0006] To solve the above problems, the present invention provides a new wireless sensor network routing address, said method comprising the steps of:

[0007] 在一个路由更新时间间隔内,每个节点统计出对于每个邻居节点的接收数据包个数,和丢失数据包个数,由此计算出所述节点与每个邻居节点之间的接收质量特征估值和发送质量特征估值; [0007] in a route update interval, each node receives a number of data packets statistics for each neighbor node and the number of packets lost, thereby calculating between the node and each neighboring node wherein the reception quality estimation and transmission quality estimates characteristics;

[0008] 根据所述接收质量特征估值和发送质量特征估值,每个节点依次计算出与每个邻居节点之间的链路总消耗值,从中选择链路总消耗值最小的邻居节点作为父节点。 [0008] The valuation of the quality features and wherein said transmission quality estimate received, each node in order to calculate the total value of the link between the consumption of each neighboring node, select the minimum total link consumption value as a neighbor node parent node.

[0009] 进ー步的,在不同实施方式中,其中节点的接收质量特征估值的计算方法为, [0009] step into ー, in various embodiments, wherein the calculated reception quality of valuation feature node,

[0010] RQ = RN/(RN+LN), [0010] RQ = RN / (RN + LN),

[0011] 其中RQ为接收质量特征估值,RN为接收数据包个数,LN为丢失数据包个数。 [0011] wherein RQ characterized estimate reception quality, RN is the number of packets received, LN is a number of packets lost.

[0012] 进ー步的,在不同实施方式中,其中节点的发送质量特征估值为其邻居节点的接收质量特征估值。 [0012] step into ー, in various embodiments, the transmission quality which the reception quality characteristic feature node to its neighboring nodes valuation estimates.

[0013] 进ー步的,在不同实施方式中,其中节点与每个邻居节点之间的链路总消耗值的计算方法为, [0013] step into ー, in various embodiments, wherein the calculated total power consumption value for each link between the node and the neighboring node,

[0014] NodeCost = PCost+PNodeCost, [0014] NodeCost = PCost + PNodeCost,

η η

[0015] PCos t = YjPNode(I)Cost Q = 0,1,2,3......η), [0015] PCos t = YjPNode (I) Cost Q = 0,1,2,3 ...... η),

O[0016] PNodeCost = I/(RQ*SQ), O [0016] PNodeCost = I / (RQ * SQ),

[0017] 其中NodeCost为节点与邻居节点之间的链路总消耗值,PCost为父节点消耗值,PNodeCost为节点与父节点之间的链路消耗值,RQ为接收质量特征估值,SQ为发送质量特征估值。 [0017] wherein NodeCost total consumption value of the link between the node and the neighboring node, PCost consumption value of a parent node, PNodeCost consumption value is a link between the node and the parent node, RQ characterized estimate reception quality, SQ is wherein transmission quality estimates.

[0018] 进ー步的,在不同实施方式中,其中节点定期将接收质量特征估值和发送质量特征估值广播给各个节点和网关。 [0018] step into ー, in various embodiments, wherein the feature node periodically estimates the reception quality and transmission quality estimate is broadcast to the various features and gateway nodes.

[0019] 进ー步的,在不同实施方式中,其中节点的发送数据包中包含ー个固定的16位的整形数序列号,所述序列号每次发送前会递增。 [0019] step into ー, in various embodiments, the node which transmitted the data packet contains ー fixed 16-bit sequence number of integers, the sequence number is incremented before sending each.

[0020] 进ー步的,本发明涉及的另ー个方面,提供了一种存储于处理器可读的存储媒介中的无线传感器网络的路由寻址方法的计算机程序产品,所述无线传感器网络的路由寻址方法程序包括能使处理器执行以下操作的指令: [0020] step into ー, the present invention relates ー another aspect, a computer program product for routing wireless sensor network addressing method is stored in a storage medium readable by the processor, the wireless sensor network addressing method comprising routing program instructions enable the processor to perform the following operations:

[0021] 在一个路由更新时间间隔内,每个节点统计出对于每个邻居节点的接收数据包个数,和丢失数据包个数,由此计算出所述节点与每个邻居节点之间的接收质量特征估值和发送质量特征估值; [0021] in a route update interval, each node receives a number of data packets statistics for each neighbor node and the number of packets lost, thereby calculating between the node and each neighboring node wherein the reception quality estimation and transmission quality estimates characteristics;

[0022] 根据所述接收质量特征估值和发送质量特征估值,每个节点依次计算出与每个邻居节点之间的链路总消耗值,从中选择链路总消耗值最小的邻居节点作为父节点。 [0022] The valuation of the quality features and wherein said transmission quality estimate received, each node in order to calculate the total value of the link between the consumption of each neighboring node, select the minimum total link consumption value as a neighbor node parent node.

[0023] 进ー步的,在不同实施方式中,其中节点的接收质量特征估值的计算方法为, [0023] step into ー, in various embodiments, wherein the calculated reception quality of valuation feature node,

[0024] RQ = RN/ (RN+LN), [0024] RQ = RN / (RN + LN),

[0025] 其中RQ为接收质量特征估值,RN为接收数据包个数,LN为丢失数据包个数。 [0025] wherein RQ characterized estimate reception quality, RN is the number of packets received, LN is a number of packets lost.

[0026] 进ー步的,在不同实施方式中,其中节点与每个邻居节点之间的链路总消耗值的计算方法为, [0026] step into ー, in various embodiments, wherein the calculated total power consumption value for each link between the node and the neighboring node,

[ [

Figure CN102833810AD00051

[0029] PNodeCost = I/(RQ*SQ), [0029] PNodeCost = I / (RQ * SQ),

[0030] 其中NodeCost为节点与邻居节点之间的链路总消耗值,PCost为父节点消耗值,PNodeCost为节点与父节点之间的链路消耗值,RQ为接收质量特征估值,SQ为发送质量特征估值。 [0030] wherein NodeCost total consumption value of the link between the node and the neighboring node, PCost consumption value of a parent node, PNodeCost consumption value is a link between the node and the parent node, RQ characterized estimate reception quality, SQ is wherein transmission quality estimates.

[0031] 进ー步的,在不同实施方式中,其中节点定期将接收质量特征估值和发送质量特征估值广播给各个节点和网关。 [0031] step into ー, in various embodiments, wherein the feature node periodically estimates the reception quality and transmission quality estimate is broadcast to the various features and gateway nodes.

[0032] 与现有技术相比,本发明提供一种新的用于无线传感器网络中各节点之间自动寻找最佳路由的方法,能够有效提高寻找最佳路由的精度,且耗费系统资源较少,对硬件要求较低,大大增加无线传感器网络稳定性,可靠性和高效性。 [0032] Compared with the prior art, the present invention provides a novel method for automatically finding the best route between each node in wireless sensor networks, can effectively improve the accuracy of finding the best route, the system resources and time-consuming than small, low hardware requirements, the wireless sensor network greatly increases the stability, reliability and efficiency. 本发明涉及的路由寻址方法是动态计算,逐步求精,每一次只进行简单的计算,当工作一段时间,对数据进行积累后,会达到高精度的最佳路由寻址,很适合在运算能力不强的嵌入式系统中应用。 Addressing the routing method of the present invention relates to a dynamic calculations, the stepwise refinement, each time only a simple calculation, when working for some time, the data accumulated, the best route to reach high precision addressing, it is suitable for the operation not strong embedded systems applications.

附图说明 BRIEF DESCRIPTION

[0033] 图I为本发明实施例涉及的无线传感器网络路由寻址方法的原理示意图。 [0033] FIG inventive principles I wireless sensor network according to a routing method of addressing a schematic diagram of the present embodiment. 具体实施方式 detailed description

[0034] 无线传感器网络中,每个节点都会定时发送不同种类的广播包,如路由数据包、邻居列表信息包、网络健康信息包等,其中最核心的,必不可少的广播包是路由数据包。 [0034] The wireless sensor network, each node periodically sends different kinds of broadcast packets, such as routing of data packets, the neighbor list information packet, the network packet and other health information, wherein the core, essential data broadcast packet is routed package. 路由数据包包含了本节点的父节点号(如果没有找到父节点,则该处为OxFFFF),路径消耗值,以及本节点的邻居列表信息,而邻居列表信息包括本节点对应的邻居节点的节点号,本节点与此邻居节点之间接收质量特征估值。 Routing packets contain the parent node of the node number (if the parent node is not found, then there is 0xFFFF), path consumption value, the neighbor node list information, and the neighbor list information of neighboring nodes includes nodes corresponding to the node of the present It estimates the reception quality characteristic between the number, the neighbor node with the node. 节点的发送数据包中包含ー个固定的16位的整形数序列号,该序列号每次发数前会递增,这样,在一个路由更新时间间隔内,每个节点都能够统计出接收到邻居节点发送的数据包个数,以及邻居节点已发出,但本节点没有接收到的数据包的个数,也就是丢失数据包个数。 Transmitting packet node contains ー fixed 16-bit sequence number of integers, the sequence number is incremented before each number, so that, in a route update interval, each node capable of receiving a neighbor statistics the number of packets sent by the node, the neighbor node has been issued, but the number of the current node does not receive the data packet, i.e. the number of missing data packets. 由此计算出本节点对于每个邻居节点的接收质量特征估值: Thereby calculating a reception quality for the present node wherein each neighbor node estimates:

[0035] RQ = RN/(RN+LN), (I) [0035] RQ = RN / (RN + LN), (I)

[0036] 其中RQ为接收质量特征估值,RN为接收数据包个数,LN为丢失数据包个数。 [0036] wherein RQ characterized estimate reception quality, RN is the number of packets received, LN is a number of packets lost. 而节点的发送质量特征估值为其邻居节点的接收质量特征估值; [0037] 同时节点定期将这些特征估值通过邻居列表信息广播出去。 The transmission quality feature node estimates its received quality estimate characteristics of neighbor nodes; [0037] These features while node periodically estimates broadcasted by the neighbor list information.

[0038] 每个节点得到本节点与邻居节点之间的接收质量特征估值和发送质量特征估值后,在内存中储存一定数量的邻居列表信息,动态维护与每个邻居节点之间的接收和发送质量信息。 After [0038] Each node obtains reception quality characteristic difference between the present node and the neighboring node estimates and estimates the transmission quality characteristics, a certain number of stored neighbor list information in memory dynamically maintained between the receiving node and each neighbor and sending quality information. 这些信息用来计算当前连接的路径消耗。 This information is used to calculate the consumption current connection path.

[0039] 每个节点会定期更新路由,即寻找最佳父节点。 [0039] Each node will periodically update the routing, namely finding the best parent. 最佳父节点的唯一标准就是整个路由路径的消耗值最小。 The best parent node is the sole criterion for the minimum consumption value of the entire routing path. 节点进行路由更新时,先依次计算与所有邻居节点之间的链路总消耗值,然后选择链路消耗值最小的邻居节点作为父节点。 Update routing node, to sequentially calculate a total value of the link between the consumption of all the neighbor nodes, and then select the minimum consumption value link neighbor node as a parent node.

[0040] 根据所述接收质量特征估值和发送质量特征估值,每个节点依次计算出与每个邻居节点之间的链路总消耗值,从中选择链路总消耗值最小的邻居节点作为父节点。 [0040] The valuation of the quality features and wherein said transmission quality estimate received, each node in order to calculate the total value of the link between the consumption of each neighboring node, select the minimum total link consumption value as a neighbor node parent node. 其中节点与每个邻居节点之间的链路总消耗值的计算方法为, Wherein the total consumption value calculated link between the node and each neighboring node,

[0041] 节点与每个邻居节点之间的链路总消耗值=父节点消耗值+节点与父节点之间的链路消耗值 [0041] The total consumption value of the link between the node and each neighboring node = parent consumption value + the value of the link between the node and consuming the parent node

[0042] NodeCost = PCost+PNodeCost, (2) [0042] NodeCost = PCost + PNodeCost, (2)

[0043] 父节点消耗值=网关到该父节点路由中所有相邻节点之间链路消耗值总知 [0043] consumption value = parent node to the parent node gateway links in the route consumption between the total of all known neighboring nodes

η η

[0044] PCost = YjPNode(I)Cost (i = 0,1,2,3......η), (3) [0044] PCost = YjPNode (I) Cost (i = 0,1,2,3 ...... η), (3)

O O

[0045] 节点与父节点之间的链路消耗值=Iパ接收质量特征估值*发送质量特征估值) [0045] The consumption value of the link between the node and the parent node pa = I * estimates the reception quality of the transmission quality characteristic feature estimates)

[0046] PNodeCos t = I/(RQ*SQ), (4) [0046] PNodeCos t = I / (RQ * SQ), (4)

[0047] 网关节点的消耗值为O。 [0047] The gateway node consumption is O.

[0048] 请參图I所示,节点I为网关节点,节点2,3,4,5互为邻居节点。 [0048] Referring to FIG I, the node is a gateway node I, node 2,3,4,5 nodes are neighbors. 通过各个节点的接收质量特征估值和发送质量特征估值,计算出节点与父节点之间的链路消耗值,如节点2与节点I之间的链路消耗值为20,节点3与节点I之间的链路消耗值为15,节点2与节点3之间的链路消耗值为15,节点4与节点2之间的链路消耗值为18,节点4与节点3之间的链路消耗值为15,节点5与节点3之间的链路消耗值为28,节点5与节点4之间的链路消耗值为10,节点5与节点2之间的链路消耗值为25。 Characterized by receiving the quality estimates and respective nodes wherein transmission quality estimate calculated consumption value link between the node and the parent node, such as the link between the consumption of the node 2 and the node I is 20, the node 3 and the node I is the link between the consumption of 15, the link between the consumption of the node 2 and the node 3 is 15, the node 4 and the link between nodes 2 consumption value of 18, the link between node 4 and node 3 passage 15 is consumed, consumption of the link between node 3 and node 5 is 28, a link between the consumption of the node 4 and node 5 is 10, a link between the consumption value of node 5 to node 2 25 .

[0049] 以节点5为例说明,节点5到网关节点的路由有多条,节点5在路由更新时,依次计算与所有邻居节点之间的链路总消耗值。 [0049] In an example node 5, to the gateway routing node 5 of a plurality of nodes, node 5 updates the routing sequentially calculates the total value of the link between the consumption of all neighbor nodes. 如, Such as,

[0050] 节点5与节点3之间的链路总消耗值=父节点(节点3)消耗值+与节点5与父节点(节点3)之间的链路消耗值=网关到节点3路由中所有相邻节点之间链路消耗值总和=15+28 = 43, (Node 3) consumption value of [0050] the total consumption value of the link between node 3 and node 5 with node = 5 + parent node and the parent node of the link between the consumption value (node ​​3) = gateway routing node 3 the sum of all the link between adjacent nodes consumption value = 15 + 28 = 43,

[0051] 节点5与节点4之间的链路总消耗值=父节点(节点4)消耗值+与节点5与父节点(节点4)之间的链路消耗值=网关到节点4路由中所有相邻节点之间链路消耗值总和=30+10 = 40, (Node 4) consumption value of [0051] the total consumption value of the link between node 4 and node 5 with node = 5 + parent node and the parent node of the link between the consumption value (node ​​4) = gateway routing node 4 the sum of all the link between adjacent nodes consumption value = 30 + 10 = 40,

[0052] 节点5与节点2之间的链路总消耗值=父节点(节点2)消耗值+与节点5与父节点(节点2)之间的链路消耗值=网关到节点2路由中所有相邻节点之间链路消耗值总和=20+25 = 45, (Node 2) consumption value of [0052] the total consumption value of the link between node 5 and node = parent + parent node with the node 5 and the link between the consumption value (node ​​2) = gateway routing node 2 the sum of all the link between adjacent nodes consumption value = 20 + 25 = 45,

[0053] 然后节点5选择链路消耗最小的邻居节点,即节点4作为父节点。 [0053] 4 as a parent node and a node to select a link 5 consume minimal neighbor nodes, i.e. the node. 由此实现节点5到网关节点I传送的最佳路由,即节点5到节点4,再到节点3,最后到网关节点I。 5 thereby achieving the best route to the node I transmits gateway node, i.e., node 5 to node 4, to node 3, and finally to the gateway node I.

[0054] 本发明涉及的无线传感器网络的路由寻址方法,所有节点能够自动寻找最佳路由,加入网络,并且能够在当前路由中的某个父节点出现故障后,自动更换另ー个有效路由,从而保证了最大的数据传输的安全性。 [0054] The addressing method of routing a wireless sensor network according to the present invention, all nodes can automatically find the best route to join the network, and can be a parent node of the current route after a failure, automatically changing the other valid route ー, thus ensuring maximum security of data transmission.

[0055] 以上所述仅为本发明的较佳实施方式,本发明的保护范围并不以上述实施方式为限,但凡本领域普通技术人员根据本发明掲示内容所作的等效修饰或变化,皆应纳入权利要求书中记载的保护范围内。 [0055] The above are only preferred embodiments of the invention, the scope of the present invention is not limited to the above embodiments, those of ordinary skill in the art whenever kei shows an equivalent modification or variation made to the contents of the present invention, are within the scope recited in the claims shall be included.

Claims (10)

  1. 1. 一种无线传感器网络的路由寻址方法,其特征在于:所述方法包括以下步骤: 在一个路由更新时间间隔内,每个节点统计出对于每个邻居节点的接收数据包个数,和丢失数据包个数,由此计算出所述节点与每个邻居节点之间的接收质量特征估值和发送质量特征估值; 根据所述接收质量特征估值和发送质量特征估值,每个节点依次计算出与每个邻居节点之间的链路总消耗值,从中选择链路总消耗值最小的邻居节点作为父节点。 1. A method of addressing routing wireless sensor network, wherein: said method comprising the steps of: in a routing update interval, each node receives a number of data packets statistics for each neighbor node, and the number of packets lost, thereby calculating a reception quality estimation and transmission quality characteristic features between the node and each neighboring node estimates; estimates reception quality according to the characteristics and quality of transmission characteristics valuation, each node sequentially calculate the total value of the link between the consumption of each neighbor node, select the minimum total link consumption value neighboring node as a parent node.
  2. 2.根据权利要求I所述的无线传感器网络的路由寻址方法,其特征在于:所述节点的接收质量特征估值的计算方法为, RQ = RN/(RN+LN), 其中RQ为接收质量特征估值,RN为接收数据包个数,LN为丢失数据包个数。 The addressing method I routing the wireless sensor network of claim, wherein: the reception quality calculating method wherein the node is valuation, RQ = RN / (RN + LN), wherein RQ is received wherein the quality estimate, RN is the number of packets received, LN is a number of packets lost.
  3. 3.根据权利要求I所述的无线传感器网络的路由寻址方法,其特征在于:所述节点的发送质量特征估值为其邻居节点的接收质量特征估值。 The addressing method I routing wireless sensor network according to claim, wherein: the transmission quality characterized in node estimates its received quality estimate characteristics of neighbor nodes.
  4. 4.根据权利要求I或2或3所述的无线传感器网络的路由寻址方法,其特征在于:所述节点与每个邻居节点之间的链路总消耗值的计算方法为, The routing addressing method I or wireless sensor network of claim 2 or claim 3, wherein: the total consumption value calculated link between the node and each neighboring node,
    Figure CN102833810AC00021
    其中NodeCost为节点与邻居节点之间的链路总消耗值,PCost为父节点消耗值,PNodeCost为节点与父节点之间的链路消耗值,RQ为接收质量特征估值,SQ为发送质量特征估值。 Wherein NodeCost node and the neighboring node between the total consumption value of the link, PCost consumption value of a parent node, PNodeCost consumption value is a link between the node and the parent node, RQ characterized estimate reception quality, SQ is the transmission quality characterized valuation.
  5. 5.根据权利要求I所述的无线传感器网络的路由寻址方法,其特征在于:所述节点定期将接收质量特征估值和发送质量特征估值广播给各个节点和网关。 The addressing method I routing wireless sensor network according to claim, wherein: said feature node periodically estimates the reception quality and transmission quality estimate is broadcast to the various features and gateway nodes.
  6. 6.根据权利要求I所述的无线传感器网络的路由寻址方法,其特征在于:所述节点的发送数据包中包含一个固定的16位的整形数序列号,所述序列号每次发送前会递增。 The addressing method I routing wireless sensor network according to claim, wherein: the node sending the data packet contains a fixed number of 16-bit integer sequence number, the sequence number for each transmission before incremented.
  7. 7. 一种存储于处理器可读的存储媒介中的无线传感器网络的路由寻址方法的计算机程序产品,其特征在于:所述无线传感器网络的路由寻址方法程序包括能使处理器执行以下操作的指令: 在一个路由更新时间间隔内,每个节点统计出对于每个邻居节点的接收数据包个数,和丢失数据包个数,由此计算出所述节点与每个邻居节点之间的接收质量特征估值和发送质量特征估值; 根据所述接收质量特征估值和发送质量特征估值,每个节点依次计算出与每个邻居节点之间的链路总消耗值,从中选择链路总消耗值最小的邻居节点作为父节点。 7. A wireless sensor network is stored in a storage medium readable by the processor addressing method of routing a computer program product, characterized in that: said wireless sensor network comprising a routing program addressing method enables the processor to perform instructions for: in a routing update interval, each node receives a number of data packets statistics for each neighbor node, and the number of packets lost, thereby calculating between the node and each neighboring node reception feature estimates and estimates the quality of transmission quality characteristics; according to the reception quality estimation and transmission quality characteristic feature estimates, each node sequentially calculate the total value of the link between the consumption of each neighboring node, select the total consumption value of the minimum link neighbor node as a parent node.
  8. 8.根据权利要求7所述的存储于处理器可读的存储媒介中的无线传感器网络的路由寻址方法的计算机程序产品,其特征在于:所述节点的接收质量特征估值的计算方法为, RQ = RN/(RN+LN), 其中RQ为接收质量特征估值,RN为接收数据包个数,LN为丢失数据包个数。 The stored computer program product of claim 7 in a wireless sensor network routing method of addressing a processor readable storage medium of claim, wherein: the reception quality calculating method wherein the node is valuation , RQ = RN / (RN + LN), characterized wherein RQ reception quality estimate, RN to receive a number of packets, LN is a number of packets lost.
  9. 9.根据权利要求7所述的存储于处理器可读的存储媒介中的无线传感器网络的路由寻址方法的计算机程序产品,其特征在于:所述节点与每个邻居节点之间的链路总消耗值的计算方法为, Wireless sensor network according to claim 9. A storage medium storing the claims 7 readable by the processor addressing method of routing in a computer program product, comprising: a link between the node and each neighboring node calculated as the total consumption value,
    Figure CN102833810AC00031
    其中NodeCost为节点与邻居节点之间的链路总消耗值,PCost为父节点消耗值,PNodeCost为节点与父节点之间的链路消耗值,RQ为接收质量特征估值,SQ为发送质量特征估值。 Wherein NodeCost node and the neighboring node between the total consumption value of the link, PCost consumption value of a parent node, PNodeCost consumption value is a link between the node and the parent node, RQ characterized estimate reception quality, SQ is the transmission quality characterized valuation.
  10. 10.根据权利要求7所述的存储于处理器可读的存储媒介中的无线传感器网络的路由寻址方法的计算机程序产品,其特征在于:所述节点定期将接收质量特征估值和发送质量特征估值广播给各个节点和网关。 Wireless sensor network according to claim 10. A storage medium storing the claims 7 readable by the processor addressing method of routing in a computer program product, characterized in that: said node periodically estimates the reception quality characteristics and transmission quality wherein valuation broadcast to each node, and gateways.
CN 201110163628 2011-06-17 2011-06-17 Route addressing method for wireless sensor network CN102833810A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110163628 CN102833810A (en) 2011-06-17 2011-06-17 Route addressing method for wireless sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110163628 CN102833810A (en) 2011-06-17 2011-06-17 Route addressing method for wireless sensor network

Publications (1)

Publication Number Publication Date
CN102833810A true true CN102833810A (en) 2012-12-19

Family

ID=47336714

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110163628 CN102833810A (en) 2011-06-17 2011-06-17 Route addressing method for wireless sensor network

Country Status (1)

Country Link
CN (1) CN102833810A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017118383A1 (en) * 2016-01-07 2017-07-13 Huawei Technologies Co., Ltd. Device and method for balanced ad-hoc network formation

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090168653A1 (en) * 2007-12-31 2009-07-02 St Pierre Robert P Method and Apparatus for Mesh Routing
CN101645829A (en) * 2008-08-07 2010-02-10 中国科学院计算技术研究所 Method and system for forwarding network data by wireless sensor
CN101754319A (en) * 2008-12-10 2010-06-23 华为技术有限公司;清华大学 Routing method, routing device and routing system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090168653A1 (en) * 2007-12-31 2009-07-02 St Pierre Robert P Method and Apparatus for Mesh Routing
CN101645829A (en) * 2008-08-07 2010-02-10 中国科学院计算技术研究所 Method and system for forwarding network data by wireless sensor
CN101754319A (en) * 2008-12-10 2010-06-23 华为技术有限公司;清华大学 Routing method, routing device and routing system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
NOUHA BACCOUR: "F-LQE A Fuzzy Link Quality Estimator for Wireless Sensor Networks", 《THE 7TH EUROPEAN CONFERENCE ON WIRELESS SENSOR NETWORKS (EWSN 2010)》, 31 December 2010 (2010-12-31) *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017118383A1 (en) * 2016-01-07 2017-07-13 Huawei Technologies Co., Ltd. Device and method for balanced ad-hoc network formation

Similar Documents

Publication Publication Date Title
Chen et al. Clustering algorithms for ad hoc wireless networks
Jain et al. Geographical routing using partial information for wireless ad hoc networks
Villas et al. DRINA: A lightweight and reliable routing approach for in-network aggregation in wireless sensor networks
Ko et al. Evaluating the Performance of RPL and 6LoWPAN in TinyOS
Zhu et al. Model and protocol for energy-efficient routing over mobile ad hoc networks
Liu et al. A distributed energy-efficient clustering algorithm with improved coverage in wireless sensor networks
Zhang et al. Dynamic proxy tree-based data dissemination schemes for wireless sensor networks
Khanna et al. Fault tolerant energy aware data dissemination protocol in sensor networks
US20110002251A1 (en) Time synchronization and routing method in wireless sensor network, and apparatus for enabling the method
Biradar et al. Link stability based multicast routing scheme in MANET
Abusaimeh et al. Dynamic cluster head for lifetime efficiency in WSN
Kim et al. An intelligent agent-based routing structure for mobile sinks in WSNs
US20130279409A1 (en) Establishing a Mesh Network
Haillot et al. A protocol for content-based communication in disconnected mobile ad hoc networks
El Korbi et al. Mobility enhanced rpl for wireless sensor networks
da Hora et al. Enhancing peer-to-peer content discovery techniques over mobile ad hoc networks
US20090122797A1 (en) Routing operations using sensor data
CN102158983A (en) Method for constructing 6LoWPAN wireless sensor network
Li et al. Zoner: A zone-based sensor relocation protocol for mobile sensor networks
Rehena et al. A modified SPIN for wireless sensor networks
US20130208583A1 (en) Avoiding Broken Links in Smart Meter Networks for Loop-Free Routing of Packets
WO2009008681A2 (en) Time synchronization and routing method in wireless sensor network, and apparatus for enabling the method
CN101945460A (en) Energy-saving AODV routing method used in Ad Hoc network environment
CN101241177A (en) Wireless sensor network positioning system facing to three dimensional space
CN101895954A (en) Opportunistic network routing method based on incremental transmission of packet index

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination
C12 Rejection of a patent application after its publication