[go: up one dir, main page]

CN104066072A - A method for determining the parent node of a new node to be connected to the network - Google Patents

A method for determining the parent node of a new node to be connected to the network Download PDF

Info

Publication number
CN104066072A
CN104066072A CN201410325979.XA CN201410325979A CN104066072A CN 104066072 A CN104066072 A CN 104066072A CN 201410325979 A CN201410325979 A CN 201410325979A CN 104066072 A CN104066072 A CN 104066072A
Authority
CN
China
Prior art keywords
node
new node
networked
probe response
live
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
CN201410325979.XA
Other languages
Chinese (zh)
Inventor
杨勇波
陈缨
羊静
常政威
刘刚
徐敏
崔宏
郑永康
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Corp of China SGCC
Electric Power Research Institute of State Grid Sichuan Electric Power Co Ltd
Original Assignee
State Grid Corp of China SGCC
Electric Power Research Institute of State Grid Sichuan Electric Power Co Ltd
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 State Grid Corp of China SGCC, Electric Power Research Institute of State Grid Sichuan Electric Power Co Ltd filed Critical State Grid Corp of China SGCC
Priority to CN201410325979.XA priority Critical patent/CN104066072A/en
Publication of CN104066072A publication Critical patent/CN104066072A/en
Pending legal-status Critical Current

Links

Classifications

    • Y02B60/50

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a method for determining father nodes of new nodes about to have access to a network. The method comprises the steps of initiating a detection request, receiving the detection request, sending out a detection response, calculating energy indexes between the nodes and determining the father modes of the new nodes about to have access to the network according to the energy indexes. The method has the advantages that in the process of determining the father modes of the new nodes about to have access to the network, the optimal father modes of the new nodes about to have access to the network are determined through comparison of the energy indexes, the average energy consumption of the network nodes is reduced, the stability of the network is enhanced, the problem of interruption of data transmission in the data transmission process is solved better, and then the reliability of the network is improved.

Description

一种确定待入网新节点的父节点的方法A method for determining the parent node of a new node to be connected to the network

技术领域 technical field

本发明涉及无线通信网络组网技术领域,特别是一种确定待入网新节点的父节点的方法。 The invention relates to the technical field of wireless communication network networking, in particular to a method for determining the parent node of a new node to be networked.

背景技术 Background technique

在无线网络通信过程中的功耗问题中,网络节点的功耗问题是一个非常重要的问题,如何降低网络节点的功耗,提高网络传输的可靠性是一个亟待解决的问题。无线通信中的组网方法大多集中于达到基本组网和数据通信要求,对于网络节点的功耗问题的研究进展缓慢,实际可操作的更是少之又少。现有技术中还缺乏在新节点入网时合理确定其父节点,以降低网络节点的平均功耗的技术方案。 Among the power consumption problems in the wireless network communication process, the power consumption of network nodes is a very important problem. How to reduce the power consumption of network nodes and improve the reliability of network transmission is an urgent problem to be solved. Most of the networking methods in wireless communication focus on meeting the basic networking and data communication requirements. The research on the power consumption of network nodes is progressing slowly, and there are very few practical ones. The prior art still lacks a technical solution for reasonably determining the parent node of a new node when it enters the network, so as to reduce the average power consumption of the network nodes.

发明内容 Contents of the invention

本发明的目的是提供一种确定待入网新节点的父节点的方法,以降低网络节点的平均功耗。 The purpose of the present invention is to provide a method for determining the parent node of a new node to be connected to the network, so as to reduce the average power consumption of the network nodes.

实现本发明目的的技术方案如下:一种确定待入网新节点的父节点的方法,包括 The technical scheme for realizing the object of the present invention is as follows: a method for determining the parent node of a new node to be connected to the network, comprising

发起探测请求的步骤:新节点发起探测请求分组; Steps of initiating a probe request: the new node initiates a probe request group;

接收探测请求的步骤:每一个活跃节点分别接收探测请求分组,并分别计算探测请求分组信号强度;所述活跃节点是根节点或已加入网络的中继节点; The step of receiving the detection request: each active node receives the detection request packet respectively, and calculates the signal strength of the detection request packet respectively; the active node is a root node or a relay node that has joined the network;

发出探测响应的步骤:探测请求分组信号强度大于或等于指定阈值的那些活跃节点,分别向新节点发出探测响应分组,新节点接收探测响应分组后计算探测响应分组信号强度; The step of sending a probe response: those active nodes whose signal strength of the probe request packet is greater than or equal to the specified threshold value respectively send a probe response packet to the new node, and the new node calculates the signal strength of the probe response packet after receiving the probe response packet;

计算节点间能量指数的步骤:以任意一个已发出探测响应分组的活跃节点与新节点间的探测请求分组信号强度和探测响应分组信号强度的最小值,作为该活跃节点与新节点间的信号强度Rreal,计算能量指数P=Rreal/(H+1);其中H为该活跃节点与根节点之间的跳数;计算每一个已发出探测响应分组的活跃节点与新节点间的能量指数; The steps of calculating the energy index between nodes: take the minimum value of the signal strength of the probe request packet and the signal strength of the probe response packet between any active node that has sent a probe response packet and the new node as the signal strength between the active node and the new node Rreal, calculate the energy index P=Rreal/(H+1); where H is the number of hops between the active node and the root node; calculate the energy index between each active node that has sent a probe response packet and the new node;

根据能量指数确定待入网新节点的父节点的步骤。 The step of determining the parent node of the new node to be connected to the network according to the energy index.

进一步地,所述根据能量指数确定待入网新节点的父节点的步骤为:以能量指数最大的那个已发出探测响应分组的活跃节点作为待入网新节点的父节点。 Further, the step of determining the parent node of the new node to be connected to the network according to the energy index is: taking the active node with the largest energy index that has sent a probe response packet as the parent node of the new node to be connected to the network.

进一步地,所述根据能量指数确定待入网新节点的父节点的步骤,包括: Further, the step of determining the parent node of the new node to be connected to the network according to the energy index includes:

按照能量指数从大到小的顺序,将已发出探测响应分组的活跃节点排序生成邻节点列表; According to the order of energy index from large to small, sort the active nodes that have sent probe response packets to generate a list of neighbor nodes;

按照邻接点列表前后顺序确定一个已发出探测响应分组的活跃节点作为待入网新节点的父节点。 Determine an active node that has sent a probe response packet as the parent node of the new node to be connected to the network according to the sequence of the adjacent point list.

更进一步地,所述计算探测请求分组信号强度和计算探测响应分组信号强度采用RSSI计算方法。 Further, the calculation of the signal strength of the probe request packet and the calculation of the signal strength of the probe response packet adopts an RSSI calculation method.

更进一步地,所述指定阈值等于-80dbm。 Furthermore, the specified threshold is equal to -80dbm.

与现有技术相比,本发明的有益效果是:本发明通过待入网新节点确定其父节点过程中,利用能量指数的对比确定其最佳父节点,降低了网络节点平均能耗,增强了网络的稳定性,更好地解决了数据传输过程中数据传输中断的问题,进而提高了网络可靠性。 Compared with the prior art, the beneficial effect of the present invention is: in the process of determining the parent node of the new node to be connected to the network, the present invention uses the comparison of the energy index to determine the best parent node, which reduces the average energy consumption of the network nodes and enhances the The stability of the network better solves the problem of data transmission interruption during data transmission, thereby improving network reliability.

附图说明 Description of drawings

图1为本发明中待入网新节点与其它节点的示意图。 FIG. 1 is a schematic diagram of a new node to be connected to the network and other nodes in the present invention.

具体实施方式 Detailed ways

以下结合附图,对本发明技术方案进行进一步说明。 The technical solutions of the present invention will be further described below in conjunction with the accompanying drawings.

一般来讲,网络中的节点分为3类,根节点、中继节点和叶节点;其中,根节点负责网络的创建,中继节点负责数据路由转发,叶节点负责数据采集。并且,每个节点只能有一个父节点,根节点、中继节点可以有子节点,而叶节点不能有子节点。这里,我们把根节点和中继节点称为活跃节点。 Generally speaking, the nodes in the network are divided into three categories, root nodes, relay nodes and leaf nodes; among them, the root node is responsible for the creation of the network, the relay nodes are responsible for data routing and forwarding, and the leaf nodes are responsible for data collection. Moreover, each node can only have one parent node, root nodes and relay nodes can have child nodes, but leaf nodes cannot have child nodes. Here, we refer to root nodes and relay nodes as active nodes.

如图1所示,节点0为根节点,节点1、2、3、4和5为已经以节点0为根节点入网的节点,其中节点1为叶节点,2、3、4、5为中继节点;节点6为待入网的新节点。 As shown in Figure 1, node 0 is the root node, and nodes 1, 2, 3, 4, and 5 are nodes that have entered the network with node 0 as the root node, among which node 1 is the leaf node, and nodes 2, 3, 4, and 5 are the middle nodes. successor node; node 6 is a new node to be connected to the network.

首先,新节点6向网络发起探测请求分组,网络中所有的节点0、1、2、3、4和5都接收该探测请求分组。由于节点1是叶节点,它不能有子节点;根节点0,中继节点2、3、4、5接收到探测请求分组后,分别计算探测请求分组信号强度。 First, the new node 6 sends a probe request packet to the network, and all nodes 0, 1, 2, 3, 4 and 5 in the network receive the probe request packet. Since node 1 is a leaf node, it cannot have child nodes; root node 0, relay nodes 2, 3, 4, and 5 respectively calculate the signal strength of the probe request packet after receiving the probe request packet.

然后,活跃节点将根据计算的探测请求分组信号强度来确定是否发出探测相应分组。这里,节点0、2、5计算得到的探测请求分组信号强度大于或等于指定阈值,而节点3、4计算得到的探测请求分组信号强度小于指定阈值。因此,节点0、2、5分别向新节点6发出探测响应分组;新节点接收到探测响应分组后计算探测响应分组信号强度。我们设定指定阈值为-80dbm。 Then, the active node will determine whether to send a probe corresponding packet according to the calculated signal strength of the probe request packet. Here, the signal strengths of the probe request packets calculated by nodes 0, 2, and 5 are greater than or equal to the specified threshold, while the signal strengths of the probe request packets calculated by nodes 3 and 4 are smaller than the specified threshold. Therefore, nodes 0, 2, and 5 respectively send probe response packets to the new node 6; the new node calculates the signal strength of the probe response packets after receiving the probe response packets. We set the specified threshold to -80dbm.

本发明中,计算探测请求分组信号强度和计算探测响应分组信号强度,都采用RSSI(Received Signal Strength Indication,接收信号强度指示)计算方法。 In the present invention, the RSSI (Received Signal Strength Indication, Received Signal Strength Indication) calculation method is used for calculating the signal strength of the probe request packet and for calculating the signal strength of the probe response packet.

之后,将每一个已发出探测响应分组的活跃节点接收的探测请求分组信号强度和新节点接收的探测响应分组信号强度分别进行比较,取最小值作为该活跃节点与新节点间的信号强度Rreal,再计算能量指数P=Rreal/(H+1);其中H为该活跃节点与根节点之间的跳数。本例中,节点0接收的探测请求分组信号强度和新节点接收的探测响应分组信号强度进行比较后,得到探测请求分组信号强度为最小,则以该探测请求分组信号强度作为节点0与新节点6间的信号强度,来计算能量指数P=Rreal/(H+1)。由于节点0本身就是根节点,所以其跳数为0。节点2、5也进行同样的操作,节点2与根节点之间的跳数为1,而节点5与根节点之间的跳数为2。经过上述操作,就得到了节点0、2、5与新节点6间的能量指数。 After that, compare the signal strength of the probe request packet received by each active node that has sent a probe response packet with the signal strength of the probe response packet received by the new node, and take the minimum value as the signal strength Rreal between the active node and the new node, Then calculate the energy index P=Rreal/(H+1); where H is the number of hops between the active node and the root node. In this example, after comparing the signal strength of the probe request packet received by node 0 with the signal strength of the probe response packet received by the new node, it is found that the signal strength of the probe request packet is the smallest, and the signal strength of the probe request packet is used as the The signal strength between 6 is used to calculate the energy index P=Rreal/(H+1). Since node 0 itself is the root node, its hop count is 0. Nodes 2 and 5 also perform the same operation, the number of hops between node 2 and the root node is 1, and the number of hops between node 5 and the root node is 2. After the above operations, the energy indices between nodes 0, 2, 5 and the new node 6 are obtained.

最后,根据能量指数来确定待入网新节点的父节点,有两种方法来进行操作。 Finally, there are two methods to determine the parent node of the new node to be connected to the network according to the energy index.

第一种方法是,直接比较各个节点与新节点间的能量指数的大小,以能量指数最大的那个节点,作为新节点的父节点。例如,节点0、2、5与新节点间的能量指数中,节点5的能量指数最大,则以节点5为待入网新节点6的父节点。 The first method is to directly compare the size of the energy index between each node and the new node, and use the node with the largest energy index as the parent node of the new node. For example, among the energy indices between nodes 0, 2, 5 and the new node, node 5 has the largest energy index, then node 5 is taken as the parent node of the new node 6 to be connected to the network.

第二种方法是,首先按照能量指数从大到小的顺序,将已发出探测响应分组的活跃节点排序生成邻节点列表;然后按照邻接点列表前后顺序确定一个已发出探测响应分组的活跃节点作为待入网新节点的父节点。例如,节点5与新节点间的能量指数最大,节点0次之,而节点2最小,则生成邻接点列表5、0、2,再按这个列表的前后顺序,来选择新节点6的父节点。如果节点5可用,则确定节点5为新节点6的父节点;如果节点5因为其他原因,不能作为新节点6的父节点,则以节点0为新节点6的父节点,依次类推,最终确定新节点6的父节点。 The second method is to first sort the active nodes that have sent probe response packets in order of energy index from large to small to generate a neighbor list; then determine an active node that has sent probe response packets according to the order of the adjacent point list as The parent node of the new node to be connected to the network. For example, if the energy index between node 5 and the new node is the largest, followed by node 0, and node 2 is the smallest, then generate the adjacency list 5, 0, 2, and then select the parent node of the new node 6 according to the order of the list . If node 5 is available, determine node 5 as the parent node of new node 6; if node 5 cannot be the parent node of new node 6 due to other reasons, then use node 0 as the parent node of new node 6, and so on, and finally determine The parent node of the new node 6.

Claims (6)

1. determine a method for the father node of new node to be networked, it is characterized in that, comprise
Initiate the step of probe requests thereby: new node is initiated probe requests thereby grouping;
Receive the step of probe requests thereby: each live-vertex receives respectively probe requests thereby grouping, and calculates respectively probe requests thereby packet signal intensity; Described live-vertex is root node or the via node that has added network;
Send the step of probe response: probe requests thereby packet signal intensity is more than or equal to those live-vertexs of assign thresholds, to new node, send probe response grouping respectively; New node calculates probe response packet signal intensity after receiving probe response grouping;
The step of nergy Index between computing node: sent the live-vertex of probe response grouping and the minimum value of the probe requests thereby packet signal intensity between new node and probe response packet signal intensity with any one, as the signal strength signal intensity Rreal between this live-vertex and new node, calculating energy indices P=Rreal/(H+1); Wherein H is the jumping figure between this live-vertex and root node; Calculate each live-vertex that has sent probe response grouping and the nergy Index between new node;
According to nergy Index, determine the step of the father node of new node to be networked.
2. a kind of method of determining the father node of new node to be networked according to claim 1, it is characterized in that, describedly according to nergy Index, determine that the step of the father node of new node to be networked is: that of nergy Index maximum of usining sent the live-vertex of probe response grouping as the father node of new node to be networked.
3. a kind of method of determining the father node of new node to be networked according to claim 1, is characterized in that, the described step of determining the father node of new node to be networked according to nergy Index, comprising:
According to nergy Index order from big to small, the live-vertex sequence of sending probe response grouping is generated to neighbor node table;
According to order before and after abutment points list, determine that one has been sent the live-vertex of probe response grouping as the father node of new node to be networked.
4. according to a kind of method of determining the father node of new node to be networked described in claim 1 or 2 or 3, it is characterized in that, described calculating probe requests thereby packet signal intensity and calculating probe response packet signal intensity adopt RSSI computational methods.
5. according to a kind of method of determining the father node of new node to be networked described in claim 1 or 2 or 3, it is characterized in that equal-80dbm of described assign thresholds.
6. a kind of method of determining the father node of new node to be networked according to claim 4, is characterized in that equal-80dbm of described assign thresholds.
CN201410325979.XA 2014-07-09 2014-07-09 A method for determining the parent node of a new node to be connected to the network Pending CN104066072A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410325979.XA CN104066072A (en) 2014-07-09 2014-07-09 A method for determining the parent node of a new node to be connected to the network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410325979.XA CN104066072A (en) 2014-07-09 2014-07-09 A method for determining the parent node of a new node to be connected to the network

Publications (1)

Publication Number Publication Date
CN104066072A true CN104066072A (en) 2014-09-24

Family

ID=51553561

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410325979.XA Pending CN104066072A (en) 2014-07-09 2014-07-09 A method for determining the parent node of a new node to be connected to the network

Country Status (1)

Country Link
CN (1) CN104066072A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106297221A (en) * 2016-08-19 2017-01-04 广东司南物联股份有限公司 An agricultural irrigation security alarm method based on Internet of Things technology
CN108156644A (en) * 2017-12-29 2018-06-12 乐鑫信息科技(上海)有限公司 The selection method of father node in a kind of mesh networks
CN109691183A (en) * 2016-08-02 2019-04-26 昕诺飞控股有限公司 Secure report in wireless mesh network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102223734A (en) * 2011-06-14 2011-10-19 广州从兴电子开发有限公司 Wireless communication network and communication method of same
CN102946649A (en) * 2012-10-30 2013-02-27 浙江理工大学 Wireless sensor network topology construction method based on spanning tree
CN103733654A (en) * 2011-08-05 2014-04-16 日本电气株式会社 Sensor network system, sensor network control method, sensor node, sensor node control method, and sensor node control program

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102223734A (en) * 2011-06-14 2011-10-19 广州从兴电子开发有限公司 Wireless communication network and communication method of same
CN103733654A (en) * 2011-08-05 2014-04-16 日本电气株式会社 Sensor network system, sensor network control method, sensor node, sensor node control method, and sensor node control program
CN102946649A (en) * 2012-10-30 2013-02-27 浙江理工大学 Wireless sensor network topology construction method based on spanning tree

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109691183A (en) * 2016-08-02 2019-04-26 昕诺飞控股有限公司 Secure report in wireless mesh network
CN106297221A (en) * 2016-08-19 2017-01-04 广东司南物联股份有限公司 An agricultural irrigation security alarm method based on Internet of Things technology
CN108156644A (en) * 2017-12-29 2018-06-12 乐鑫信息科技(上海)有限公司 The selection method of father node in a kind of mesh networks
WO2019128635A1 (en) * 2017-12-29 2019-07-04 乐鑫信息科技(上海)股份有限公司 Method for selecting parent node in mesh network
US11363519B2 (en) 2017-12-29 2022-06-14 Espressif Systems (Shanghai) Co., Ltd. Method for selecting parent node in mesh network

Similar Documents

Publication Publication Date Title
CN103716137A (en) Method and system for identifying reasons of ZigBee sensor network packet loss
CN103929782B (en) A kind of resources balance multi-path route method suitable for industrial wireless sensor network
CN110881173B (en) An environment monitoring system based on internet of things
CN103338494A (en) Heterogenous cluster routing method of wireless sensor network based on energy collection
CN109618383B (en) Robust opportunistic routing protocol for ambient backscatter wireless sensor networks
JP2017518681A5 (en)
CN104869604A (en) RPL-based layer type route establishment method of wireless sensor network
CN103227777B (en) A kind of dpd of preventing detects the method unsuccessfully causing ipsec tunnel to shake
CN109996310A (en) A kind of cluster head selection method and device
US20160006814A1 (en) Method for propagating network management data for energy-efficient iot network management and energy-efficient iot node apparatus
CN104066072A (en) A method for determining the parent node of a new node to be connected to the network
CN105188084B (en) A kind of wireless sensor network routing optimization method based on congestion control
CN104009916B (en) Delay Tolerant Network energy-efficient routing scheme based on social property forwarding
CN102076053B (en) Method for quickly repairing Zigbee wireless sensor network
CN103179655B (en) Distributed node Poewr control method in mobile ad-hoc network
CN108495351A (en) A kind of data transmission method and system
CN110881178B (en) A branch-walk-based IoT data aggregation method
CN105704222B (en) A kind of mobile agency meeting network data delivery optimization method
CN105246123B (en) A kind of improved CARP Routing Protocols
CN104053207B (en) A kind of wireless sensor network spacing query method
CN105979564B (en) Method and device for sending data
CN103747480B (en) Data pack transmission method and communication node
US9900234B2 (en) Direct link quality monitoring method, communications device, and system
CN103024858A (en) Low power consumption directional broadcasting method aiming at wireless sensor network
CN111836385A (en) Method and device for processing network beacon in wireless sensor network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20140924

WD01 Invention patent application deemed withdrawn after publication