CN100456728C - Construction and operation for wireless self-organizing network - Google Patents

Construction and operation for wireless self-organizing network Download PDF

Info

Publication number
CN100456728C
CN100456728C CN 200610078540 CN200610078540A CN100456728C CN 100456728 C CN100456728 C CN 100456728C CN 200610078540 CN200610078540 CN 200610078540 CN 200610078540 A CN200610078540 A CN 200610078540A CN 100456728 C CN100456728 C CN 100456728C
Authority
CN
Grant status
Grant
Patent type
Prior art keywords
node
message
parent node
hoc network
wireless ad
Prior art date
Application number
CN 200610078540
Other languages
Chinese (zh)
Other versions
CN1984015A (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

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THIR OWN ENERGY USE
    • Y02D70/00Techniques for reducing energy consumption in wireless communication networks
    • Y02D70/20Techniques for reducing energy consumption in wireless communication networks independent of Radio Access Technologies

Abstract

本发明公开了一种无线自组织网络的建立方法,所述无线自组织网络是二层网络,在网络节点上设置父节点列表,在网络建立时由组长节点广播携带自身节点标识的组建立消息,其他节点在收到组建立消息后,根据需要修改自身的父节点列表,以及广播携带自身节点表示和相对距离的组建立消息。 The present invention discloses a method for establishing a wireless ad-hoc network, said wireless ad-hoc network is a Layer 2 network, set the parent node list on the network node, establishing establishing the network carries a group own node identified by the head node broadcasts message, the other nodes after receiving the group establishment message, modifies its parent node list as needed, and a broadcast carries its own node represent and groups relative distance setup message. 本发明还公开了一种无线自组织网络的工作方法,组员节点在无法成功向父节点列表中任一节点发送数据时尝试寻找新的父节点,并且以发送邀请消息的节点标识替换自身的父节点列表。 The present invention also discloses a working method for a wireless ad hoc network, members node attempts to find a new parent node when not successfully any transmission data of one node to the parent node list and to send the invitation message node identity replacement itself parent node list. 组员节点发现其他节点正在尝试寻找新的父节点时,如果能够为其提供中继,则发送邀请消息。 When the crew nodes discover other nodes are trying to find a new parent, if we can provide relay, sending an invitation message. 采用本发明所提供的技术方案,可以降低网络的整体能耗,降低对硬件的要求,提高网络的稳定性。 The technical solution provided by the invention may reduce overall network energy consumption, reduce hardware requirements, improve the stability of the network.

Description

一种无线自组织网络的建立和工作方法

技术领域

本发明涉及无线通信技术,特别是涉及一种无线自组织网络的建立和工作方法。 The present invention relates to wireless communication technologies, particularly to a structure and working method for a wireless ad hoc network.

背景技术 Background technique

无线自组织网络是一种特殊的无线通信网络。 Wireless ad hoc network is a special kind of wireless communication network. 这种网络通常由大量节点组成,这些节点在进入应用现场后,按照协议自动组织成为具有层次结构的网络,协同工作。 Such networks typically by a large number of nodes, these nodes into the application site, according to the protocol automatically organized into a network having a hierarchical structure, work together. 无线自组织网络的节点通常由微处理器、内存、电池和微型无线电收发机以及其他应用模块组成。 Node of a wireless ad-hoc network typically consists of a microprocessor, memory, a battery and miniature radio transceiver, and other application modules.典型的无线自组织网络是无线传感

器网络(Wireless Sensor Network, WSN )。 无线传感器网络被部署在应用现场后能够实时釆集指定监测对象的信息,并对其进行处理,然后将处理结果传送到基站,由基站做进一步处理。 After the wireless sensor network to be deployed in the application field in real time preclude the information specifying the object set, and processed, and then transfers the processing results to the base station, the base station for further processing.

现有的无线自组织网络一般采用基于分组的二层结构来实现,并且采用^f氐能量自适应聚类层次(LEACH, Low Energy Adaptive Clustering Hierarchy ) 算法来实现网络的自组织。 Conventional wireless ad-hoc network is generally used to implement based layer structure of a packet and using ^ f Di energy adaptive clustering hierarchy (LEACH, Low Energy Adaptive Clustering Hierarchy) algorithm to implement the ad hoc network. 所谓二层结构,指的是将无线自组织网络中的所有节点分为组长节点和组员节点, 一个组的组长节点和组员节点之间构成组内层,各个组的组长节点和基站之间构成组间层。 The so-called two-layer structure, means that all nodes in the wireless ad-hoc network into configuration groups between leader nodes and group nodes, a group leader nodes and group nodes inner, leader nodes of the various groups and between the base station between the constituting groups layer. 在LEACH算法中,按周期随机选择组长节点,组长节点广播组建立消息邀请周围的其他节点加入组;除组长节点以外的其他节点在接收到组建立消息后,加入离自己最近的组长节点所建立的组,成为组员节点,以后直接与组长节点通信。 In LEACH algorithm, according to the period random selection head node, the head node multicast group establishment message to invite other nodes to join the group around; node other than head node after receiving a group establishment message, added to the nearest group group leader node is established become members node, after the direct communication with the leader node. 组长节点直接与基站通信,负责压缩转发本组内所有的数据。 Leader node directly communicate with base stations, it is responsible for compression and transfer all data within this group.

由以上对于LEACH算法的描述可以看出,从对节点发射功率的要求来说,首先,被选定的组长节点的无线信号发射功率较大,至少需要保证组长 As can be seen from the above description of LEACH in, from the requirements of the node transmission power, first, the radio signal transmit power is selected leader node is large, at least to ensure that the head of

节点所发射的无线信号能够覆盖整个组;其次组员节点根据到组长节点的i?巨离调整发射功率,需要额外的硬件支持;最后,越靠近組的边缘,組员节点的发射功率就越大,最坏的情况是,组边缘的组员节点的发射半径也需要等于组半径。 Wireless signal node transmitted to cover the whole group; followed members node according to i leader node giant from adjusting transmit power, requires additional hardware support;? Finally, closer to the edge set, the transmit power members node on the larger, the worst case, the transmit radius members node set of edge also needs to be equal groups radius.

在LEACH中,由于大量组员节点的覆盖范围重合,需要采用时分复用(TDMA, Time Division Multiple Access )才支术防止组内节点的冲突,采用码分多址技术防止组和组之间的冲突,从而提高了对硬件的要求。 In LEACH, since the coverage of a large number of members node coincides need to use time division multiplexing (TDMA, Time Division Multiple Access) before performing surgery to prevent conflicts in the group of nodes, code division multiple access technique prevents between Group A and conflict, thereby increasing hardware requirements.

而从网络的稳定性来说,在网络的工作过程中,组员节点只能和一个组长节点通信,如果该组长节点失效,那么只有等到新一轮网络建立的时候, 组员节点才能重新发挥作用,因此网络的稳定性差。 From the stability of the network, in the working process of the network, the crew node only and a leader node communication, if the leader node fails, when you have to wait until a new round of network established crew node to be reactivated, thus poor stability of the network.

发明内容 SUMMARY

有鉴于此,本发明的主要目的在于提供一种无线自组织网络的建立方法,以降低网络的整体能耗,降低对硬件的要求,提高网络的稳定性。 In view of this, the main object of the present invention to provide a method for establishing a wireless ad-hoc network, to reduce the overall energy consumption of the network, reduce hardware requirements, improve the stability of the network.

本发明的主要目的还在于提供一种无线自组织网络的工作方法,以降低网络的整体能耗,降低对硬件的要求,提高网络的稳定性。 The main object of the present invention is to provide a working method for wireless ad-hoc network, to reduce the overall energy consumption of the network, reduce hardware requirements, improve the stability of the network.

为了达到上述目的,本发明提供了一种无线自组织网络的建立方法,其特征在于,所述无线自组织网络是二层无线自组织网络,且在无线自组织网络节点上设置父节点列表,在无线自组织网络建立时首先确定组长节点,由组长节点广播携带自身节点标识的组建立消息,无线自组织网络中除组长节点外的其他节点,接收到与该其他节点直接通信且发送所述组建立消息的节点发送的组建立消息后,将所收到的组建立消息中携带的发送该消息的节点的标识添加到自身的父节点列表,且判断是否需要广播接收到的组建立消息,如果需要,则广播携带自身的节点标识的组建立消息,由下一个要加入组的节点接收该消息;否则,结束当前流程。 To achieve the above object, the present invention provides a method for establishing a wireless ad-hoc network, wherein said wireless ad hoc network is a two wireless ad-hoc network, and set the parent node list on a wireless ad-hoc network node, first determined head node in the network to establish a wireless self-organized by the head node broadcasts carries a group own node identifier establishment message, a wireless ad hoc network to other nodes except the leader node receives the direct communication with the other nodes, and group after establishing message, the establishment of the group node sending the set-up message sent by the group the received identification message in sending the message node carrying added to its parent node list, and determines whether the broadcast received establishment message, if desired, the broadcast carries a group itself node ID setup message, the message is received by the next for a node to join the group; otherwise, end the current process.

其中,预先设定更换组长节点的周期,以及最佳组长概率,所述确定组长节点为: Wherein predetermined replacement head node cycle, and the best head probability, the determined head node is:

在一个周期开始时,各节点根据最佳组长概率、节点已经工作的周期数以 At the beginning of a cycle, the cycle of each node based on the best head of probability, the node has been working hundreds

及连续担任组员节点的周期数,计算标准概率,节点在0到l之间生成随机数, And continuously as the number of cycles members node calculate the standard probability, the node generates a random number between 0 and l, or

若所生成的随机数小于所述标准概率,则本周期内担任组长节点。 If the generated random number is smaller than the standard probability, then this cycle headed node.

其中,所述预先设定最佳组长概率为: 按照以下公式计算最佳组长概率: Wherein said predetermined optimum head probability: calculate the optimum head probability according to the formula:

_<formula>formula see original document page 10</formula> _ <Formula> formula see original document page 10 </ formula>

其中,c^3"、"〜乱d表示基站与网络中所有节点间的平均距 Wherein, c ^ 3 "," ~ chaos d represents the network average among all node base station from

离,A^表示电路能量消耗参数,^表示自由空间模型放大器能量消耗参 From, A ^ represents a circuit power consumption parameters, ^ represents a free space model amplifier power consumption parameters

数,e^表示多路衰减模型放大器能量消耗参数,人是无线自组织网络中节点二维泊松分布的参数。 Number, e ^ represents a multipath fading model amplifier power consumption parameters, who is a parameter wireless ad-hoc network of nodes in a two-dimensional Poisson distribution.

其中,所述各节点根据最佳组长概率,节点已经工作的周期数以及连续担任组员节点的周期数,计算标准概率为: Wherein said each node based on the number cycles best leader probability, the node already working and cycle continuously as members node calculate the standard probability:

判断连续担任组员节点的周期数是否小于^ ,如果小于则令标准 Number is determined continuously as members node cycle is less than ^, is less than the order Standard

概率为0,否则按照下面的公式计算所述标准概率: Probability is 0, otherwise the standard probability calculated according to the following formula:

<formula>formula see original document page 10</formula> <Formula> formula see original document page 10 </ formula>

其中raw"d表示节点已经工作的周期数,p表示所述最佳组长概率。 其中,所述以标准概率担任组长节点为: Where the number of cycles raw "d represents the node has worked, p is indicative of the optimal head probability wherein said standard probability headed node:

在0到1之间生成一个随机数,并比较所生成的随机数是否小于所述标准概率,如果大于则在本周期中担任组员节点。 Generated between 0 and 1. A random number and comparing whether the generated random number is smaller than the standard probability, if greater than as members node week period.

其中,所述将所收到的组建立消息中携带的发送该消息的节点的标识添加到自身的父节点列表之前,该方法进一步包括: Before wherein the establishing the identification message in sending the message node carrying added to its parent node list set received, the method further comprising:

清空自身的父节点列表; Emptied their parent node list;

且所述组建立消息中携带自身的相对距离。 And the message carries its relative distance from the set established.

其中,所述组长节点广播携带自身节点标识的组建立消息为: 组长节点在所广播的组建立消息中进一步携带值为0的相对距离。 Wherein said leader node broadcasts carries a group own node identifier setup message is: Leader node to establish the relative distance message further carries the value 0 in the group broadcast. 其中,无线自组织网络中除组长节点外的其他节点在收到组建立消息后, Wherein, after the wireless ad-hoc network of other nodes except the head node in the received group establishment message,

在步骤Al之前进一步包括: Further comprising prior to the step Al:

判断所收到的组建立消息是否携带相对距离,如果未携带,则令发出所述 Analyzing the received group to establish whether the message carries the relative distance, if it is not carried, the order issuing the

组建立消息的节点的相对距离为0。 The relative distance of the node from the group setup message is 0.

其中,步骤Al所述根据接收到的组建立消息,判断是否需要修改自身的 Wherein the step Al the setup message according to the set of received, determine whether to modify their own

父节点列表为: Parent node list is:

判断自身的父节点的相对距离,是否大于或等于发出所述组建立消息的节点的相对距离,如果是,则认为需要修改自身的父节点列表,否则认为不需要修改自身的父节点列表; Analyzing its parent node relative distance is greater than or equal to emit a relative distance to the set of nodes setup message, if it is, it is considered to modify its parent node list, or that the need to modify its parent node list;

步骤Bl所述根据接收到的组建立消息,判断是否需要广播转发接收到的组建立消息为: Step Bl said setup message according to the set of received, determine the need broadcast forwarding group received setup message is:

判断自身的父节点的相对距离,是否大于发出所述组建立消息的节点的相 Analyzing its parent node relative distance, if the phase node issuing the set-up message is greater than

对距离,如果大于,则认为需要广播转发接收到的组建立消息,否则认为不需 Distance, and if so, then deemed necessary broadcast forwarding group received setup message, or that the need

要广播转发接收到的组建立消息。 To broadcast forwarding group received setup message.

其中,步骤Bl在所述将所收到的组建立消息中携带的节点标识添加到自身 Wherein step Bl in the the group received established node identifier carried in the message is added to itself

的父节点列表中之前进一步包括: Before the parent node list further includes:

判断所收到的组建立消息中携带的节点标识是否已经存在于自身的父节点 Whether the group establishment message determines whether the received carried node identifier already exists in its parent

列表中,如果存在,则结束当前流程,否则将所收到的组建立消息中携带的节 List, if present, the current process ends, otherwise the setup message carried in section group received

点标识添加到自身的父节点列表中。 Point tags around their parent node list.

其中,步骤C1所述根据接收到的组建立消息设置自身的相对距离为: 将接收到的组建立消息中的相对距离加1后作为自身的相对距离。 Wherein said step C1 establishment message sets itself relative distance is in accordance with the set of received: received set to establish the relative distance in the message after adding 1 as their relative distance. 其中,预先设置中继点限制,步骤C1和步骤D1之间进一步包括: 判断自身的相对距离是否超过中继点限制,如果是,则结束当前流程,否 Wherein, the preset relay point limit, between Step C1 and Step D1 further comprising: judging whether the relative distance exceeds the relay point limit, if yes, ending the current process, no

则执行步骤D1。 Performing step D1.

其中,所述无线自组织网络是无线传感器网络。 Wherein said wireless ad-hoc network is a wireless sensor network.

在本发明提供的无线自组织网络的工作方法的第一部分中,该无线自组织 In the first part of the work process wireless ad-hoc network of the present invention provides the wireless ad-hoc

网络是二层无线自组织网络,在组员节点上设置父节点列表,用以保存在与红L 长通信时可以采用的中继节点标识,在组员节点向父节点发送数据时,该方法包括: Network is a two wireless ad-hoc network, set the parent node list on the members node, to save the relay node ID when red L long communication may be used to send data to a parent node members node, the method include:

A2、判断是否能够成功向父节点列表中的任一节点发送数据,如果能够成功发送,则结束当前流程,否则执行步骤B2; A2, determines whether or not successfully transmitted to any parent node list of a node data, if successfully sent, the current process, otherwise, executing step B2;

B2、将未能成功接收数据的父节点标记为无效,向所述父节点列表中的其他父节点发送重组请求消息以尝试寻找新的父节点,并判断是否收到邀请消息, 如果收到则以发送邀请消息的节点标识替换自身的父节点列表,否则将自身的状态设置为等待,结束当前流程。 B2, the parent node of the failed received data marked as invalid, sending recombinant request message in an attempt to find a new parent node of the other parent node of the parent node list, and determines whether or not the invitation message, if received the to send the invitation message node identification replace its parent node list, otherwise its status to wait for the end of the current process.

其中,该方法进一步包括: Wherein the method further comprises:

C2、在组员节点收到除自身以外其它节点的重组请求消息时,判断是否能够为发出重组请求消息的节点提供中继,如果能够,则向发出重组请求消息的节点发送邀请消息,否则结束当前流程。 C2, when the members node receives in addition to restructure itself to other nodes in the request message, determines whether to provide a relay issuing node recombinant request message, if so, then to issue a recombinant requesting node message transmission invitation message, or end The current process.

其中,预先设置响应等待时长,步骤A2所述判断是否能够成功向父节点列表中的任一节点发送数据包括: Wherein the pre-set length of time, in response, if the step of A2 is determined to be successful is transmitted to the parent node list any node data comprises:

A21、以父节点列表中记录的所有节点作为有效父节点; A21, in all parent node list record as an active parent node;

A22、从有效父节点中选择一个作为当前父节点,向当前父节点发送数据并开始计时,然后判断在所述响应等待时长内是否收到当前父节点发送的响应消息,如果收到,则认为能够成功向父节点列表中的任一节点发送数据,否则执行步骤B2; A22, selected from the active parent node a as the current parent node, and start timing transmitting data to the current parent node, and then determines whether or not the response message of the current parent node sends in while waiting for the long response, if received, is considered can successfully send data to a parent node list any node, otherwise, executing step B2;

向所述父节点列表中的其他父节点发送重组请求消息以尝试寻找新的父节点之前,该方法进一步包括: Before sending recombinant request message to the other parent node of the parent node in the list to attempt to find a new parent node, the method further comprising:

判断是否父节点列表中所有节点均已标记为无效,如果是,则认为不能够成功向父节点列表中的任一节点发送数据,否则返回执行步骤A22。 To determine whether a parent node list all nodes are marked as invalid, and if so, be deemed not to be able to successfully send data to the parent node list of any node, otherwise it returns to step A22.

其中,预先设置修复等待时长,步骤B2所述判断是否收到邀请消息为: Wherein the pre-set length of time, repair, whether said step B2 is determined invitation message:

判断从发送重组请求消息开始,是否在修复等待时长内收到邀请消息。 Judgment request message begins sending reorganization, whether to wait for an invitation message for a duration of repair.

其中,所述邀请消息携带发出邀请消息的节点标识和相对距离,步骤B2 所述以发送邀请消息的节点标识替换自身的父节点列表包括: Wherein the Invite message carries the node from identity and relative distance of the invitation message, the step B2 to send the invitation message to the node identified alternative its parent node list comprises:

B21、将发送邀请消息的节点中,相对距离最小的节点作为新的父节点; B22、清空父节点列表,将新的父节点标识添加到父节点列表中。 B21, will send an invitation message node, the relative distance of the smallest node as a new parent; B22, empty the parent node list, the new parent node identifier added to the parent node list. B23、将邀请消息中携带的相对距离加1后作为自身的相对距离。 B23, will be invited to the relative distance carried in the message after adding 1 as their relative distance. 其中,所述重组请求消息携带发送重组请求消息的节点标识,步骤C2所述判断是否能够为发送重组请求消息的节点提供中继为: Wherein said recombinant request message carries the node identifier sending recombinant request message, the step C2 the determining whether the node message providing relay is capable of requesting to transmit recombination:

C21、根据重组请求消息中携带的节点标识,判断发出重组请求消息的节点是否为自身的父节点,如果是,则从父节点列表中删除发出重组请求消息的节点,并且认为不能为发送重组请求消息的节点提供中继,如果不是,则执行步骤C22; Node C21, recombinant request message carries the node identifier, determines issuing recombinant request message whether its parent node, if so, from the parent node list to remove the node from recombinant request message, and that does not request to transmit recombinant node messages provide a relay, if not, step to C22;

C22、判断自身是否处于等待状态,如果是,则认为不能为发送重组请求消息的节点提供中继,否则认为能够为发送重组请求消息的节点提供中继。 C22, determines whether it is in a wait state, if it is, it is considered to provide a relay is not requesting node message is sent recombinant, or that the node can request message is sent recombinant provide a relay.

其中,预先设置中继点限制,在步骤C22中,当节点不处于等待状态时, 进一步包括: Wherein, the preset relay point limit, in step C22, when the node is not in a wait state, further comprising:

判断自身的相对距离是否超过中继点数限制,如果超过,则认为不能为发送重组请求消息的节点提供中继,否则认为能够为发送重组请求消息的节点提供中继。 Judging whether the relative distance exceeds a relay point limit, if exceeded, is considered to provide a relay is not requesting node message is sent recombinant, or that the node can request message is sent recombinant provide a relay.

其中,在步骤C21中,从父节点列表中删除发出重组请求消息的节点后, 进一步包括: After which, in step C21, the issuing node recombinant request message from the parent node list deleted, further comprising:

判断自身的父节点列表是否为空,如果为空,则执行步骤B2,否则结束当前流程。 Determine its own parent node list is empty, if empty, then steps B2, otherwise the current process ends.

其中,预先设置等待时长,所述在父节点列表为空时执行步骤B2为: 从判断出列表为空开始计时,在到达等待时长后执行步骤B2。 Wherein the pre-set length of time, the execution parent node list is empty at step B2 is: from the determination that the list is empty to start timing, after performing step length on the arrival waiting B2. 其中,所述无线自组织网络是无线传感器网络。 Wherein said wireless ad-hoc network is a wireless sensor network.

在本发明提供的无线自组织网络的工作方法的第二部分中,该无线自组织 In the second part of the work process wireless ad-hoc network of the present invention provides the wireless ad-hoc

网络是二层无线自组织网络,在组员节点上设置父节点列表,用以保存在与&L 长通信时可以采用的中继节点标识,组员节点在自身父节点列表中的节点全部失效时发送重组请求消息,所述重组请求消息携带发送重组请求消息的节点标识,其他节点收到重组请求消息时,该方法包括: Network is a two wireless ad-hoc network, set the parent node list on the members node to save relay node long communication L and & can be used to identify, crew nodes in its own parent node list all fail when sending recombinant request message, the recombinant request message carries the node identifier sending recombinant request message, the other node receives a recombinant request message, the method comprising:

A3、 4艮据重组请求消息中携带的节点标识,判断发出重组请求消息的节点是否为自身的父节点,如果是,则判定不能够为发送重組请求消息的节点提供中继,否则,执行步骤A32; A3, 4 Burgundy according recombinant requesting node identifier carried in the message, determines issuing recombinant requesting node messages whether their parent node, if so, it is determined that node can not request message is sent recombinant provide a relay, otherwise, perform step A32;

A32、判断自身是否处于等待状态,如杲是,则认为不能为发送重组请求消息的节点提供中继,否则认为能够为发送重组请求消息的节点提供中继,则向发送重組请求消息的节点发送邀请消息。 A32, to determine their own is in a wait state, such as Gao is considered not to send a reorganization request message node provides relay, otherwise considered able to send reorganization request message node provides relay, then sends 重組 request message sent by the nodes invitation message.

其中,判断发出重组请求消息的节点是否为自身的父节点,如果是,则该方法进一步包括: Wherein, the determination node issuing recombinant request message whether its parent node, if so, the method further comprising:

从父节点列表中删除发出重组请求消息的节点。 Issued recombinant requesting node message from the parent node list is deleted.

其中,预先设置中继点限制,在步骤A32中,当节点不处于等待状态时, 进一步包括: Wherein, the preset relay point limit, in step A32, when a node is not in a wait state, further comprising:

判断自身的相对距离是否超过中继点数限制,如果超过,则认为不能为发送重组请求消息的节点提供中继,否则认为能够为发送重组请求消息的节点提供中继。 Judging whether the relative distance exceeds a relay point limit, if exceeded, is considered to provide a relay is not requesting node message is sent recombinant, or that the node can request message is sent recombinant provide a relay.

其中,所述无线自组织网络是无线传感器网络。 Wherein said wireless ad-hoc network is a wireless sensor network.

采用本发明所提供的技术方案,从对节点发射功率的要求来说,首先所有节点,包括组长节点和组员节点都可以采用相同的发射功率,而不需要根据节点距离进行自适应调整;其次,由于中继节点的存在,使得所有节点的发射功率都不用太大,所要求的覆盖范围远远小于组半径。 The technical solution of the present invention provides, from the requirements of the node transmission power, first of all nodes, including the leader nodes and group nodes can use the same transmission power, without the need for adaptive adjustment based on the node distances; Second, due to the presence of relay node, such that the transmission power of all the nodes are not too much, the required coverage is much smaller than the set radius.

从对硬件的要求来说,由于每个节点的覆盖范围大大减小,降低了大量节点同时发送导致冲突的概率,并且相邻节点之间的通信利用简单的CSMA/CA即可有效防止冲突。 From the hardware requirements, since the coverage of each node is greatly reduced, reducing the number of nodes simultaneously transmit the probability of causing the conflict, and to efficiently prevent the collision of adjacent communication using between nodes simple CSMA / CA.

从网络的穩定性来说,在网络建立过程中,组员节点根据与组长节点的相对距离,形成树型结构,即与组长节点相对距离较近的节点作为与组长节点相对距离较远的节点的父节点, 一个子节点可以有多个父节点, 一个父节点也可以有多个子节点。 From the stability of the network, in the network establishment process, members node according to the relative distance from the head node to form a tree structure, i.e., close to the relative distance from the head of the node relative distance node as a leader node more parent node distant node, a child node can have multiple parents, a parent can have multiple children. 这样在网络工作过程中,对于一个组员节点来i兌, 在多个父节点中的某个父节点失效,或者与该父节点之间的无线信道条4牛恶化后,还可以通过其他父节点继续向组长节点发送数据。 So that the network operation, for one component node i against, a parent node in the plurality of parent node failure or deterioration in radio channel strip 4 Bovine between the parent node, also through other parent node continues to send data to the leader node. 这样就提高了网络 This improves network

的稳定性u Stability u

附图说明 BRIEF DESCRIPTION

图1是本发明提供的无线自组织网络建立方法的流程图; 图2是本发明提供的无线自组织网络工作方法的流程图; 图3是本发明提供的无线自组织网络工作方法的流程图。 1 is a flowchart wireless ad-hoc network of the present invention provides a method for establishing a; FIG. 2 is a flowchart showing an operation method of a network wireless ad-hoc present invention provides; FIG. 3 is a flowchart showing an operation method for wireless ad-hoc network of the present invention provides .

具体实施方式 Detailed ways

本发明的核心思想是:在采用二层结构的无线自组织网络的建立过程中,由组长节点广播组建立消息,除组长节点以外的节点按照与组长节点的相对距离,由近及远的转发组长节点所广播的组建立消息;收到组建立消息的节点,将发送该组建立消息的节点保存在自身的父节点列表中;在需要向组长节点发送数据时,动态的选择多个父节点中的一个作为中继。 The core idea of ​​the invention is: in the process of establishing Layer 2 configuration of a wireless ad-hoc network setup message by the head node multicast group, the node other than head node according to the relative distance from the head node, from near and far forwarding leader node broadcasts a group establishment message; received set to establish node message, and transmits the set to establish node messages stored in its own parent node list; when necessary to transmit data to the head node, dynamic a selected plurality of parent node as a relay.

为使本发明的目的、技术方案和优点更加清楚,下面结合附图及具体实施例对本发明作进一步地详细描述。 To make the objectives, technical solutions, and advantages of the present invention clearer, the following specific embodiments of the present invention will be described in further detail in conjunction with the accompanying drawings and.

首先说明本发明提供的无线自组织网络建立方法中,选择组长节点的方法。 First wireless ad-hoc network of the present invention provides a method of selecting leader nodes method established. 由于在二层网络中组长节点的能耗通常大于组员节点,因此需要按照一定的周期,定期更换组长节点,以维护整个网络的能量均衡。 Since the energy Layer the leader nodes in the network is typically greater than members node, it is necessary according to a certain cycle, regular replacement head node, to maintain the energy of the entire network is balanced. 所述周期是根据需要在节点进入应用现场前设置的。 The period is provided as necessary prior node into the application site. 另外,从原则上说,同一个节点两次担任组长节点之间,应该间隔一定的周期数。 In addition, In principle, between headed nodes in the same node twice, it should be spaced a certain number of cycles.

在本发明中,在每个节点上设置两个计数器:第一计数器和第二计数器。 In the present invention, two counters at each node: the first and second counters.

节点在进入应用现场时,所有节点的第一计数器和第二i+数器的值都为0。 Node when entering the application site, the first counter and the second i + value of the number of all the nodes that are zero. 每经过一个周期,所有节点的第一计数器和第二计数器分别加1。 After every cycle, all the nodes of the first and second counters are incremented by one. 如果节点在某个周期中担任了组长节点,则第二计数器被重置为0。 If the node as a leader node in a cycle, the second counter is reset to zero. 换句话说,网络中一个节点上的第一计数器的值,表示节点已经工作的周期数,而第二计数器值,表示该节点连续担任组员节点的周期数。 In other words, the network a first counter of the node value, represents the number of cycles a node already working, while the second counter value represents the number of the node served continuously panelist node cycle.

在无线自组织网络的节点进入应用现场前,首先计算出针对该无线自组织网络的最佳组长概率,也就是每个周期中担任组长的节点数目占总的节点数目的比例,然后将最佳组长概率存储在每个节点中。 Before node wireless ad hoc network into the application site, first of all calculated for the wireless from the best leader of the probability of an organization's network, that is, the total number of nodes in the head of the number of nodes in the proportion of each cycle as then best leader probability stored in each node. 在每个周期开始的时 At each cycle begins

候,节点首先判断第二计数器的值是否小于ro训ci mod(丄),其中表示 Waiting, the node first determines whether the value of the second counter is smaller than ro training ci mod (Shang), which represents

第一计数器的当前值,p表示所述最佳组长概率。 The current value of the first counter, the optimum head probability p represents the.

若第二计数器的值大于或等于TO回c/ mod(丄),则节点按照下面的公式计 If the value of the second counter is greater than or equal to TO back c / mod (Shang), the node according to the equation meter

算出一个标准概率: Calculate a standard probability:

<formula>formula see original document page 16</formula> <Formula> formula see original document page 16 </ formula>

其中,p表示所述最佳组长概率,round表示所述第一计数器的当前值。 Wherein, p denotes the optimum head probability, round representing the current value of the first counter. 若计数器B的值小于ro,d mod(l),则直接令所述标准概率为0。 If the value of the counter B is smaller than ro, d mod (l), is the direct cause of the standard probability is 0.

然后,节点在0到l之间生成一个随机数,并比较所生成的随机数是否小于所述标准概率,如果小于则在本周期中担任组长节点,否则在本周期中担任组员节点,也就是说,节点以所述标准概率担任组长节点。 Then, the node generated between 0 and l a random number, whether and comparing the generated random number is smaller than the standard probability is less than the headed node in this cycle, or as members node in this cycle, In other words, the node to the standard probability headed node.

由于所生成的随机数必然是大于或等于0的,因此如果以概率o担任组 Due to the generated random number must be greater than or equal to 0, so if the probability o as a group

长就是不担任组长。 Long is not headed.

下面详细叙述所述最佳组长概率的计算方法,最佳组长概率是使得网络 Calculation of the optimal head probability of the following detailed description, the best head probability that the network

的整体能耗最小的组长概率。 The overall energy consumption of the smallest head of probability. 而网络的整体能耗可以表示为: The overall energy consumption of the network can be expressed as:

<formula>formula see original document page 16</formula> 其中,假设节点以二维泊松分布散布在矩形区域内,而X是二维泊松分 <Formula> formula see original document page 16 </ formula> wherein, assume that node a two-dimensional Poisson distribution dispersed in the rectangular area, and X is a two-dimensional Poisson

布的参数,大休上表示节点的密度,X的值是根据应用需要決定的u Fabric parameters, a large break represents the density of the node, the value of X is u based on application needs determined

A表示网络总面积,A的值是由应用场合决定的。 A represents a total network area, the value of A is determined by the applications.

p表示所述最佳组长概率。 p represents the best head of probability.

r表示网络中节点的通信半径。 r represents the communication range of the nodes in the network.

d表示基站与网络中所有节点间的平均距离,它是由应用需要决定的。 d represents a base station in the network the average distance between all nodes, which is determined by the application needs. 表示电路能量消耗参数,的值是由编码方式,调制方式等决定的。 A value representing the circuit power consumption parameters are determined by the coding scheme, the modulation scheme and the like.

〜表示自由空间模型放大器能量消耗参数,~s的值是由可容忍误码率决定的。 ~ Represents the free space model amplifier energy consumption parameter, the value of ~ s is determined by the tolerable error rate.

£呼表示多路衰减模型放大器能量消耗参数,e,的值是由可容忍误码率决定的。 £ call represents a multipath fading model amplifier power consumption parameters, e, the value is determined by the tolerable error rate.

J表示网络中一个组内节点通信所需的中继数,J由以下公式得到: J represents the number of relay network a desired one of the set of node communication, J obtained by the following formula:

其中,MAX表示取最大值。 Wherein, MAX represents the maximum value. 其他参数的意义同前所述。 Meaning other parameters as previously described. 在上述影响网络整体能耗的因素中,三个能量消耗参数受硬件限制;而泊松分布参数入,以及基站与网络中所有节点的平均距离d,都是由应用需要决定的。 Among the factors affecting the overall energy consumption of the network described above, the three energy consumption parameters hardware limits; Poisson distribution parameters into, and a base station in the network average distance d of all nodes, it is determined by the application needs. 因此,对于一个特定的无线自组织网络,可以将这五个参数看作常数。 Thus, for a particular wireless ad-hoc network, can these five parameters considered as constants. 那么在网络整体能耗A x」xpx [J x (2 £e/ec + ^ x,-W xe,十£e/ec)] Then the network overall energy A x "xpx [J x (2 £ e / ec + ^ x, -W xe, ten £ e / ec)]

中,只有网络中的组半径和最佳组长概率是变量。 Only the group radius and best head of probability network is variable. 通过将网络的整体能耗对这两个变量取极值,就可以得到使得网络整体能耗最小的最佳组长概率和最佳节点通信半径取值,如下: By overall network energy consumption of these two variables extreme value, can be obtained such that the minimum optimum head probability and the optimal node communication radius overall network energy consumption values, as follows:

<formula>formula see original document page 17</formula><formula>formula see original document page 17</formula> <Formula> formula see original document page 17 </ formula> <formula> formula see original document page 17 </ formula>

根据以上公式,就可以计算出所述最佳组长概率。 According to the above formula, we can calculate the optimal leader probability.

请参考图1,图1是本发明提供的无线自组织网络建立方法的流程图。 Please refer to FIG. 1, FIG. 1 is a flowchart of wireless ad-hoc network of the present invention provides a method for establishing a.

在网络建立阶段,组长节点选定并广播组建立消息后,本发明包括以下步冬聚: 步骤101:除组长节点外的其他节点接收组建立消息。 After the set-up phase network, the head of the selected nodes and the multicast group establishment message, the present invention includes the following steps Winter polyethylene: Step 101: the other nodes except the leader node receives the group establishment message. 所述组建立消息至少包括发出该消息的节点标识,以及发出该消息的节点的相对距离。 The group establishment message includes at least sent the message a node identifier, and the relative distance issuing the message node. 一个节点的相对距离表示的是该节点与组长节点通信时需要经过的中继数目。 The relative distance of a node indicates the number of hops to go through when the node and the head node communication. 从后面的描述可以看出,所述组建立消息可以是组长节点发出的,也可以是组员节点发出的。 As can be seen from the subsequent description, the group establishment message may be a leader node sends, and may also be members issued by the nodes. 组长节点发出的相对距离为0,直4妄与组长节点通信的组员节点的相对距离为1,通过一次中继与组长节点通j言的组员节点的相对距离为2,依此类推。 The relative distance leader node sends to 0, straight 4 jump relative distance members nodes of nodes communicating head 1, by the relative distance from a relay through the head node j made crew node is 2, by forth. 换句话说, 一个组员节点的相对距离, 等于该组员节点与组长节点通信时所经过的中继数加1;组长节点的相对距离为0。 In other words, the relative distance of one component node is equal to the number of the relay to the crew when the node leader node communication passes plus 1; relative distance leader node is zero.

作为一种替代方案,组长节点所发出的组建立消息中,可以不携带相对距离。 Establishing message as the group an alternative embodiment, the head node issued, may not carry the relative distance. 节点接收到未携带相对距离的组建立消息,则当作接收到了携带了值为0的相对距离的组建立消息进行处理。 Node receiving the setup message does not carry the group relative distance, is deemed received carrying the group of the relative distance is 0 setup message processing.

步骤102:组员节点判断接收到的组建立消息中所携带的相对距离加1 后是否大于自身的相对距离,如果大于,则执行步骤106,否则执行步骤103。 Step 102: members node determines the set of received to establish the relative distance message carried in is greater than its relative distance after adding 1, if more than perform step 106, otherwise step 103 is performed.

节点进入应用现场后,会首先进行自身的初始化。 After the node into the application site, it will first conduct its own initialization. 在初始化过程中,节点会将自身的相对距离设置为最大相对距离。 During initialization, the node will set itself relative distance is set to the maximum relative distance. 例如,如果用一个8位无符号二进制数来表示相对距离,那么在所述初始化过程中,节点就会将自身的相对距离设置为255。 For example, if an 8-bit unsigned binary number to indicate the relative distance, in the initialization process, the node will itself relative distance is set to 255. 因此,在收到第一条组建立消息后,节点必然会执行步骤103。 Thus, after establishing message receives the first set, the node is bound to step 103. 但是,在后续过程中,节点有可能继续收到组建立消息,这时就有可能执行步骤103,也有可能执行步骤106。 However, in a subsequent process, the node may continue to receive the group establishment message, then it is possible to perform step 103, it is also possible to step 106.

步骤103:组员节点判断接收到的组建立消息中携带的相对距离加1后是否等于自身的相对距离,如果等于,则执行步骤104,否则执行步骤107。 Step 103: members node determines the set of received to establish the relative distance message carries is equal to its relative distance increments and, if equal, execute step 104, otherwise step 107.

步骤104:组员节点判断接收到的组建立消息中所携带的节点标识与自身记录的父节点标识是否相同,如果相同,则执行步骤106,否则执行步骤105。 Step 104: members node determines the set of received setup message carried in the node identifier of the parent node to identify itself records are the same, if the same, execute step 106, otherwise step 105 is performed.

在初始化过程中,节点会将父节点标识设置为空,或者设置为节点自身的标识。 During initialization, the node will be the parent node identifier is set to null, or is set to the node's own identifier. 因此,在收到第一条组建立消息后,节点必然会执行步骤105。 Thus, after establishing message receives the first set, the node is bound to step 105. 但是,在后续过程中,节点有可能继续收到组建立消息,这时就有可能执4亍步骤105,也有可能执行步骤106。 However, in a subsequent process, the node may continue to receive the group establishment message, then it is possible to perform four right foot step 105, it is also possible to step 106.

从后面的描述可以看出,组员节点会为自身设置一个父节点列表。 As it can be seen from the subsequent description, members node setting a parent node list for their own. 在列表中有多个父节点的情况下,此处所说的与自身记录的父节点标识相同指的是与父节点列表中任意一个父节点标识相同。 When a plurality of parent nodes in the list, the mentioned herein parent node to identify itself recorded in the same refers to any parent node list in a same parent node identification.

步骤105:组员节点将所述组建立消息中的父节点标识添加到自身的父节点列表中,结束当前流程。 Step 105: panelist node the set of establishing parent node identification message added to its parent node list, the current process ends.

结合步骤103和步骤104所作的判断,组员节点可以确认,发出所述组建立消息的节点,与自身的父节点具有相同的相对距离,并且不在当前的父节点列表中。 Analyzing binding steps 103 and 104 made by the crew node can be confirmed, the node from the set-up message, with its own parent node have the same relative distance, and not in the current parent node list. 因此,可以将发出所述组建立消息的节点作为候选的父节点之 Thus, it is possible to issue the set of established node messages as a parent node candidate of

步骤106:组员节点丢弃所述组建立消息,结束当前流程。 Step 106: members node drops the group establishment message, the current process ends.

步骤107:组员节点将组建立消息中的相对距离加1后作为自身的相对距离。 Step 107: panelist node relative distance message group established after adding 1 as their relative distance.

步骤108:组员节点清空自身的父节点列表,将组建立消息中的父节点标识添加到自身的父节点列表中。 Step 108: panelist node emptying its parent node list, the group to establish the parent node identification message added to its parent node list.

结合步骤102和103所作的判断,只有当所述组建立消息中携带的相对距离加1后小于组员节点自身的相对距离,才会执行步骤107以及108。 Combined with steps 102 and 103 made by the judge, only if the group setup message carried in the relative distance plus 1 after less than crew node itself relative distance, will perform steps 107 and 108. 在这种情况下,说明发出所述組建立消息的节点的相对距离,比组员节点的父节点的相对距离小。 In this case, the description sent the relative distance of the set of nodes setup message is small relative distance parent node than members node. 按照选择最近路径与组长节点通信的原则,组员节点将以发出所述组建立消息的节点作为自己新的父节点,而不再以原父节点列表中的节点作为自己的父节点。 In accordance with the principle of selection latest path node in communication with the leader, panelist node will be the node from the set-up message as its new parent node, rather than the original parent node list of the node as its parent node. 这样,组员节点自身到组长节点的相对距离也 Thus, members of the node itself to the relative distance leader node also

相应的减小。 Is reduced accordingly.

步骤109:组员节点判断自身的相对距离是否超过中继点限制,如果超过,则执行步骤112,否则执行步骤110。 Step 109: panelist node determines whether itself is the relative distance exceeds a relay point limit, if exceeded, then step 112 is performed, otherwise step 110 is performed.

所述中继点限制是为了限制组的规模而预先设置的。 The relay point limit is to limit the size of the group set in advance. 因为如果网络失见模太大,离组长节点近的组员节点,必然会花费大量的能量和处理能力为离组长节点较远的组员节点中继数据,不利于网络能量的均衡,也不利于节点完成自身承担的其他任务。 Because if the network failure see die too, from the crew node leader node near bound to spend a lot of energy and processing power for the crew nodes relay data from the head of the node far, is not conducive to a balanced network of energy, It is not conducive to the node to complete other tasks own commitment.

这里的超过可以设置为大于,也可以设置为大于或等于。 Here over it can be set to be greater than may be set to greater than or equal to.

步骤110:用自身的节点标识替换组建立消息中的节点标识,用自身的相对距离替换组建立消息中的相对距离。 Step 110: with its own node identity replacement group setup message node identifier, with their relative distance from the replacement group setup message relative distance.

步骤111:广播修改后的组建立消息。 Step 111: the group establishment message broadcast modified.

这样,就可以以组长节点为中心,由近及远的完成组的建立。 This makes it possible to group leader node as the center, established from near and far to complete the group. 最先的组建立消息是由组长节点发出的;在组长节点的无线信号覆盖范围内的节点收到組长节点发出的組建立消息后,按照上述流程加入组,然后分别以各自的节点标识替换所收到的组建立消息中的节点标识,并且将组建立消息中的相对距离设为1,然后广播新的组建立消息;不在组长节点的无线信号覆盖范围内,但是在上述已经加入组的组员节点的无线信号覆盖范围内的节点,收到所述新的组建立消息后,又按照上述流程加入组;依次类推直到达到中继点数的限制。 The first group setup message is sent by the head node; succeeding node within the wireless signal coverage leader node receives group leader node sends a setup message according to the above procedure join the group, and respectively of each node group identification replace received established node identifier message, and the group to establish the relative distance message is set to 1, then broadcasts a new group establishment message; not within the head node of the radio signal coverage, but the above has been node within the coverage of the added group members node of a radio signal, receives the new set of post-set-up message, and to join a group according to the above procedure; and so on until the limit is reached the relay points.

在组的建立完成后,以组长节点为根节点,组员节点根据与组长节点的相对距离,形成树形结构,并且同一个节点可能有多个父节点。 After the establishment of the group is completed, in order to head node as a root, members node according to the relative distance from the head node to form a tree structure, and there may be multiple parent nodes in the same node. 特别的,对于处于组交界处的組员节点来说,其多个父节点可能分别属于不同的组。 In particular, for the crew node is borderline group at, its multiple parent nodes may belong to different groups. 另夕卜,由子节点和父节点在与组长通信时的角色可以看出,子节点可以称为被中继节点,父节点可以称为中继节点。 Another Xi Bu, node of child node and the parent with the role when the head of the communication can be seen, the child node may be referred to be a relay node, a parent node may be referred to as relay node.

请参考图2,图2是本发明提供的无线自组织网络工作方法的流程图。 Please refer to FIG. 2, FIG. 2 is a flowchart showing an operation method for wireless ad-hoc network of the present invention is provided. 在网络工作时,采用载波监听多址接入(CSMA/CA: Carrier Sense Multiple Access with Collision Avoidance )技术方式进行通信。 When networking, using carrier sense multiple access (CSMA / CA: Carrier Sense Multiple Access with Collision Avoidance) communicate technical way. 对于组员节点,在需要向组长节点发送数据时,该方法包括: 步骤201:准备发送数据。 For crew node, when the need to send data to the leader node, the method comprising: Step 201: ready to send data.

步骤202:将父节点列表中的所有父节点都标记为有效 Step 202: all the parent node of the parent node list are marked as valid

所述的父节点列表就是在组建立过程中所记录的父节点列表。 The parent node list is a parent node list in the group establishment process recorded.

步骤203:从有效父节点中选取一个作为当前父节点,向当前父节点发送数据,并开始计时。 Step 203: Select from the active parent node a as the current parent node, it transmits the data to the current parent node, and start timing.

在父节点列表中有多个节点的情况下,可以随机选择其中一个作为当前父节点;也可以按照轮换的方式进行选取,例如,按照节点在列表中的位置, 第一次取列表中的第一个节点,第二次取列表中的第二个节点,依此类推。 When a plurality of nodes of the parent node list case, randomly select one of them as the current parent node; may be selected in rotation manner, e.g., according to the position of the node in the list, the first taking of the list a node, a second time to take the list of the second node, and so on.

步骤204:判断是否收到当前父节点返回的响应消息,如果收到,则执行步骤205,否则执行步骤206。 Step 204: determines whether or not the response message of the current parent node is returned, if received, then step 205 is executed, otherwise, step 206 is performed.

由于无线自组织网络往往应用于复杂多变的环境中,其无线信道条件随时可能发生大的变化,甚至于不可用。 Because the wireless self-organizing networks are often used in complex and changing environment, the wireless channel conditions may change much at any time, even unusable. 因此,父节点接收到子节点发送的数据后,需要向子节点发送响应,以告知子节点接收到了子节点发送的数据。 Thus, the parent node after receiving the data sub-node transmission, to send responses to the child node, to inform the child node receives the data sub-transmission node.

步骤205:结束当前流程。 Step 205: end the current process.

如果收到父节点返回的响应消息,说明数据发送成功,则子节点结束本次数据发送流程。 If the response message is received the parent node is returned, indicating the data transmission is successful, the sub-end node of this data transmission process.

步骤206:判断是否到达响应等待时长,如果是则执行步骤207,否则返回执行步骤204。 Step 206: determining whether the arrival long waiting for a response, if step 207 is executed, otherwise step 204 is performed.

所述响应等待时长是节点进入应用现场之前预先设置的。 The response wait duration is set in advance before the node into the application site. 步骤207:将当前父节点标记为无效。 Step 207: the current parent node is marked as invalid.

如果在所述等待时长内没有收到当前父节点返回的响应消息,说明该父节点失效,或者与父节点之间的信道不可用,因此无法继续以该父节点为中继向组长节点发送数据。 If the wait in the not received within the length of the response message of the current parent node is returned, indicating that the parent node failure, or the channel between the parent node is not available, and therefore can not continue to be the parent node is a relay transmission to the head node data.

步骤208:判断父节点列表中的所有节点是否均被标记为无效,如果是则执行步骤209,否则返回执行步骤203。 Step 208: All the nodes is determined parent node list is whether or are marked as invalid, if yes, step 209 is performed, otherwise step 203 is performed.

步骤209:清空父节点列表,发送重组请求消息。 Step 209: Clear parent node list, send recombinant request message.

由于父节点列表中的所有节点都被标记为无放,说明组员节点周围没有可以作为中继的其他组员节点,因此组员节点需要尝试寻找新的父节点4乍为 Since all parent node in the list are marked as no discharge, indicating that the surrounding members node is not possible as the rest of the group node relay, so the crew nodes need to try to find a new parent node 4 at first glance to

中继,或者说是尝试重新加入组。 Relay, or is attempting to rejoin the group. 所述重组请求消息以广播的形式发出,至少包括组员节点自身的节点标识。 The recombinant request message sent in broadcast mode, comprising at least members node's own node ID.

步骤210:判断是否接收到邀请消息,如果接收到,则执行步骤213, 否则执行步骤211。 Step 210: determining whether the received INVITE message, if received, step 213 is performed, otherwise step 211 is performed.

步骤2U:判断是否超过修复等待时长,如果超过,则执行步骤212, 否则返回4丸行步骤210。 Step 2U: determining whether length of time, more than repair, if exceeded, step 212 is performed, otherwise 4 pellet rows step 210.

所述修复等待时长是在节点进入应用现场之前预先设置的。 The repair length is before the node to enter the application site to the preset waiting.

步骤212:结束当前流程,进入等待状态,等待下次网络建立过程。 Step 212: end the current process enters a wait state, waiting for the next network setup process.

在后面对图3的描述中可以看出,组员节点或组长节点接收到所述重组请求消息后,会发送邀请消息。 As can be seen in the description of the face in FIG. 3, after the panelist node or leader node receives the recombinant request message, sends the invitation message. 如果发送重组请求消息的组员节点,在所述修复等待时长内没有收到邀请消息,说明寻找新的作为中继的父节点即重新加入组的尝试失败。 If sending recombinant request message crew nodes, the repair waiting does not receive the invitation message for a duration, described look for the parent node of the new as a relay, i.e., attempt to set re-join fails. 该节点只能等待下次网络建立过程。 The node can only wait for the next network setup process.

步骤213:选择发送邀请消息的节点中,相对距离最小的节点作为自身的父节点,并更新自身的相对距离,然后向新的父节点发送数据。 Step 213: Select the node sending the invitation message, the relative minimum distance node as its parent node, and updates its own relative distance, and then sent to the new parent node data.

在后面对图3的描述中可以看出,所述邀请消息包括发出邀请消息的节点标识和相对距离。 Description of FIG. 3 can be seen after the invitation message includes a node ID and a relative distance invitation message. 如果发送所述重组请求消息的节点收到了多条邀请消息,则按照选择最近路径与组长节点通信的原则,选择发送邀请消息的节点中相对距离最小的节点作为自己的父节点,添加到父节点列表中;并且将所述最小的相对距离加1后作为自身的相对距离。 If sending the node recombinant request message received plurality of invitation message, according to the selection recently principles path node in communication with the leader, select the node sending the invitation message smallest relative distance node as its parent node, to the parent node list; and the minimum relative distance after adding 1 as their relative distance. 这样,发送所述重組请求消息的节点就重新加入了组中,可以向新的父节点发送数据。 Thus, sending the node recombinant request message should be re-added to the group, you can send data to the new parent node. 这里所说的相对距离最小的节点如果有多个,则发送所述重组请求消息的节点将其全部添加到自身的父节点列表中. Here relative minimum distance node, if there are multiple sending the recombinant requesting node message add them all to their parent node list.

作为一种替代方案,也可以在步骤209中不清空父节点列表,而是在步骤213中,以新的父节点标识替换现有的父节点列表,即首先将父节点列表清空,然后将新的父节点标识添加到父节点列表中。 As an alternative, may be at step 209 is not empty parent node list, but at step 213, a new parent identifier replace the existing parent node list, i.e. first parent node list is cleared, and a new the parent node identifier added to the parent node list.

请参考图3,图3是本发明提供的无线自组织网络工作方法的流程图。 Please refer to FIG. 3, FIG. 3 is a flowchart showing an operation method for wireless ad-hoc network of the present invention is provided. 在网络工作时,网络中的节点在收到其他节点所发出的重组请求消息时,该方法包4舌: When networking, the network node upon receipt of the recombinant other nodes request sent message, the method 4 Tongue:

步骤301:接收重组请求消息。 Step 301: Receive a recombinant request message.

步骤302:判断所述重组请求消息是否由自身的父节点发出,如果是则执行步骤305,否则执行步骤303。 Step 302: determining whether the recombinant request message is issued by its own parent node, if step 305 is performed, otherwise step 303 is performed.

步骤303:判断自身是否处于等待状态,如果是则执行步骤308,否则执行步骤304。 Step 303: determine whether it is in a wait state, if step 308 is performed, otherwise step 304 is performed.

步骤302和步骤303所述的判断没有严格的先后顺序要求。 Analyzing the 303 steps 302 and no strict sequence requirements. 也就是说, 可以先判断自身是否处于等待状态;如果不处于等待状态,则继续判断所述重组请求消息是否由自身的父节点发出;如果所述重组请求消息是自身的父节点发出,则执行步骤305,否则执行步骤304。 That is, to determine whether it is in a waiting state; if not in the waiting state, continue to determine whether the recombinant request message is issued by its own parent node; if said recombinant request message is itself a parent node sent, is executed step 305, otherwise step 304.

步骤304:发送邀请消息,携带自身的相对距离和自身的标识,结束当前流程。 Step 304: send an invitation message carrying their relative distance and own identification, the current process ends.

当然,根据在步骤109所述的原因,节点也可以先判断自身的相对距离是否超过预先设置的中继点限制,只有在自身的相对距离未超过预先设置的中继点限制的情况下,才发送邀请消息。 Of course, according to the reason described in step 109, a node may first determine whether their relative distance than the relay point limit set in advance, only in the case the relative distance itself does not exceed a relay point a preset limit, it send an invitation message.

步骤302、步骤303以及此处所述判断可以统称未判断是否能为正在尝试重新加入组的节点提供中继。 Step 302, step 303, and where the determination may be collectively referred has not determined whether to provide a relay for the Trying node to rejoin the group.

步骤305:从自身的父节点列表中删除发出重组请求消息的父节点。 Step 305: issued recombinant parent node a request message from its parent node list is deleted.

如果节点收到的重组请求消息是由节点的父节点发出的,说明该父节点自身都已经无法与组长节点进行通信,因此节点无法继续通过该父节点向组长节点发送数据通信。 If recombinant node receives a request message is sent by the parent of the node, indicating that the parent node itself have been unable to communicate with the head node, the node can not continue to send the data communication to the head node of the parent node.

所述重组请求消息携带有发出节点的节点标识,因此收到重组请求消息的节点,比较该消息携带的节点标识与自身的父节点列表中保存的节点标识,就可以判断所述重组请求消息是否由自身的父节点发出,并进一步从自身的父节点列表中删除发出重组请求消息的父节点。 The recombinant request message carries the node from identifying a node, thus received node recombinant request message, stored with its own parent node list node identifier compares the message carries the node identification, it is judged that the recombinant request message is issued by its own parent node, and further emit a recombinant parent node a request message from its parent node list is deleted. 步骤306:判断自身的父节点列表是否为空,如杲为空,则执杆歩骤307, 否则执行步骤308。 Step 306: Determine its parent node list is empty, as Gao is empty, execution rod ho step 307, otherwise step 308 is performed.

步骤307:发送重组请求消息,节点实际上进入了步骤210到步骤213 的流程中。 Step 307: Send a recombinant request message, the node actually entered the process steps 210 to step 213.

作为一种替代方案,可以预先设置一个緩冲时长。 Long as an alternative, it may be previously provided a buffer. 节点在执行步骤306 所述判断,发现自身的父节点列表为空后,延迟所述緩沖时长后再发送重组请求消息。 Node performing the step of determining the 306 found its parent node list after empty, when the delay of the buffer length before sending recombinant request message. 这样做的目的是,发出步骤301中所述重组消息的父节点,有可能在所述緩冲时长内完成了重新加入组的过程,这样,当节点发出步骤307 所述重组请求消息后,该父节点就可以发送邀请消息。 The purpose of this is to issue a step parent node 301 in the recombinant message, it is possible to complete the process of re-join the group in the long time of the buffer, so that when a node issues said step 307 recombinant request message, the parent can send an invitation message.

另外,也可以不执行步骤306以及步骤307。 Further, it may not perform step 306 and step 307. 因为如果节点的父节点列表为空,则该节点在发送数据时也必然会进入到步骤210到步骤213的流程。 Because if the parent node list node is empty, then the node sending data will inevitably proceeds to step flow 210 to step 213.

步骤308:结束当前流程。 Step 308: end the current process.

根据图2和图3所述的工作过程,组员节点在向组长节点发送数据的过程中,可以从自身保存的父节点列表中选择一个有效的父节点作为中继;如果所有父节点都无效,或者父节点列表为空,节点还可以通过发送重组请求消息尝试寻找新的作为中继的父节点,即尝试重新加入组。 The working process of claim 3 in FIG. 2 and FIG procedure members node transmitting data to leader node may select a valid parent node from its own stored parent node list as a relay; if all parent nodes invalid, or the parent node list is empty, the node may also attempt to find the parent node of the new as a relay, i.e., attempt to rejoin the group request message by sending recombination. 另一方面,正常工作的节点如果发现邻近的节点正在尝试重新加入组,可以向尝试重新加入组的节点发送邀请消息,为其提供中继。 On the other hand, the normal node work if it is found adjacent node is trying to rejoin the group, you can to try to rejoin the node group to send invitation messages, providing relay. 这样,在网络所处的应用环境发生变化的时候,或者在网络生命后期, 一部分节点相继失效,或者由于突发事件导致某些节点失效时,自适应的调整网络的结构,以继续保持网络的连通性,从而提高了网络的稳定性,延长了网络的寿命。 In this way, when the network in which the application environment changes, or if the network later in life, some of the nodes have failed, or because of unexpected events result for some nodes fail, structure adaptive adjustment of the network, in order to continue to maintain the network connectivity, thereby improving the stability of the network, extend the life of the network.

总之,以上所述仅为本发明的较佳实施例而已,并非用于限定本发明的保护范围。 In summary, the above description is only of the present invention, preferred embodiments are not intended to limit the scope of the present invention. 凡在本发明的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本发明的保护范围之内。 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 (27)

  1. 1、一种无线自组织网络的建立方法,其特征在于,所述无线自组织网络是二层无线自组织网络,且在无线自组织网络节点上设置父节点列表,在无线自组织网络建立时首先确定组长节点,由组长节点广播携带自身节点标识的组建立消息,无线自组织网络中除组长节点外的其他节点,接收到与该其他节点直接通信且发送所述组建立消息的节点发送的组建立消息后,将所收到的组建立消息中携带的发送该消息的节点的标识添加到自身的父节点列表,且判断是否需要广播接收到的组建立消息,如果需要,则广播携带自身的节点标识的组建立消息,由下一个要加入组的节点接收该消息;否则,结束当前流程。 1, to establish a method for wireless ad-hoc network, wherein said wireless ad hoc network is a two wireless ad-hoc network, and set the parent node list on a wireless ad-hoc network node, establishing a wireless ad hoc network when first determine the leader node, set its own node identified by the leader node broadcasts carrying establishment message, a wireless ad hoc network to other nodes except the leader node receives the direct communication with the other node, and transmitting the set up message group sent by the node after the setup message, the group received the established identification message in sending the message node carrying added to its parent node list, and determines whether the broadcast group received the setup message, if necessary, broadcasting carries a group itself node ID setup message, the message is received by the node to join the group; otherwise, end the current process.
  2. 2、 根据权利要求1所述的无线自组织网络的建立方法,其特征在于,预先设定更换组长节点的周期,以及最佳组长概率,所述确定组长节点为:在一个周期开始时,各节点根据最佳组长概率、节点已经工作的周期板以及连续担任组员节点的周期数,计算标准概率,节点在0到l之间生成随初4t, 若所生成的随机数小于所述标准概率,则本周期内担任组长节点。 2. The method for establishing the wireless ad-hoc network as claimed in claim, wherein the predetermined replacement head node cycle, and the best head probability, the determined head node is: the beginning of a cycle when each node according to the optimal head probability, the node has already cycle plate work and the number of continuous as members node cycle, calculate the standard probability node generates with First 4t between 0 and l, or if the generated random number is less than the standard probability, then this cycle headed node.
  3. 3、 根据权利要求2所述的无线自组织网络的建立方法,其特征在于,所述预先设定最佳组长概率为:按照以下公式计算最佳组长概率:<formula>formula see original document page 2</formula>其中,c = 3"?% + 、i, d表示基站与网络中所有节点间的平均距离,《'"表示电路能量消耗参数,^表示自由空间模型放大器能量消耗参数,^P表示多路衰减模型放大器能量消耗参数,X是无线自组织网络中节点二维泊松分布的参数。 3. The method for establishing a wireless ad-hoc network of claim 2, characterized in that said predetermined optimum head probability: calculate the optimum head probability according to the formula: <formula> formula see original document page 2 </ formula> where, c = 3 "?% +, i, d represents a base station in the network the average distance between all nodes," ' "shows a circuit power consumption parameters, ^ represents a free space model amplifier power consumption parameters, ^ P represents a multipath fading model amplifier energy consumption parameter, X is the parameter wireless ad-hoc network of nodes in a two-dimensional Poisson distribution.
  4. 4、 根据权利要求2所述的无线自组织网络的建立方法,其特征在于,所述各节点根据最佳组长概率,节点已经工作的周期数以及连续担任组员节点的周期数,计算标准扭尤率为:<formula>formula see original document page 3</formula>判断连续担任组员节点的周期数是否小于^ ,如杲小于则令标准概率为0,否则按照下面的公式计算所述标准概率:<formula>formula see original document page 3</formula>其中raw"c/表示节点已经工作的周期数,p表示所述最佳组长概率。 4, according to claim method for establishing a wireless ad hoc network of claim 2, wherein the number of cycles of said respective nodes according to a preferred head probability, the node already working and cycle continuously as members node, calculating the standard torsional particular rate: <formula> consecutive numbers as members node cycle formula see original document page 3 </ formula> determines whether less than ^, as Gao less than then let the standard probability is 0, otherwise calculating the standard according to the following formula probability: <formula> formula see original document page 3 </ formula> where raw "c / represents the number of cycles node has work, p is indicative of the optimal head probability.
  5. 5、 根据权利要求2所述的无线自组织网络的建立方法,其特征在于,所述以标准概率担任组长节点为:在0到l之间生成一个随机数,并比较所生成的随机数是否小于所述标准概率,如果大于则在本周期中担任组员节点。 5, according to claim method for establishing a wireless ad hoc network of claim 2, wherein said standard probability headed node to: generate a random number between 0 and l, or and comparing the generated random number it is less than the standard probability, if more than served as crew node in this cycle.
  6. 6、 根据权利要求1所述的无线自组织网络的建立方法,其特征在于,将所收到的组建立消息中携带的发送该消息的节点的标识添加到自身的父节点列表之前,该方法进一步包括:清空自身的父节点列表;且所述组建立消息中携带自身的相对距离。 6. The method for establishing the wireless ad-hoc network as claimed in claim, wherein the establishment of the identification message in sending the message node carrying added to its parent node list group received previously, the method further comprising: emptying its parent node list; and the group establishment message carries their relative distance.
  7. 7、 根据权利要求6所述的无线自組织网络的建立方法,其特征在于,所述组长节点广播携带自身节点标识的组建立消息为:组长节点在所广播的组建立消息中进一步携带值为0的相对距离。 7. The method for establishing a wireless ad hoc network of claim 6, characterized in that said leader node broadcasts carries a group own node identifier setup message is: Leader node setup message further carries the group broadcast value of the relative distance of 0.
  8. 8、 冲艮据权利要求6所述的无线自组织网络的建立方法,其特征在于,无线自组织网络中除组长节点外的其他节点在收到组建立消息后,在步骤Al之前进一步包括:判断所收到的组建立消息是否携带相对距离,如果未携带,则令发出所述组建立消息的节点的相对距离为0。 Method for establishing a wireless ad-hoc network 8, punch Gen according to claim 6, characterized in that the wireless ad-hoc network of other nodes except the head node after receiving the group establishment message, further comprising prior to the step Al : group determines whether the received setup message whether it carries a relative distance, if it is not carried, the relative distance of the node issuing the set-up message would result in zero.
  9. 9、 根据权利要求7或8所述的无线自组织网络的建立方法,其特征在于, 步骤Al所述根据接收到的组建立消息,判断是否需要修改自身的父节点列表为: 判断自身的父节点的相对距离,是否大于或等于发出所述组建立消息的节点的相对距离,如果是,则认为需要修改自身的父节点列表,否则认为不需要修改自身的父节点列表;步骤Bl所述根据接收到的组建立消息,判断是否需要广播转发接收到的組建立消息为:判断自身的父节点的相对距离,是否大于发出所述组建立消息的节点的相对距离,如果大于,则认为需要广播转发接收到的组建立消息,否则认为不需要广播转发接收到的组建立消息。 Method for establishing a wireless ad-hoc network 9, according to claim 7 or 8, characterized in that the step Al the setup message according to the set of received, determining whether to modify its parent node list of: determining its parent the relative distance node is greater than or equal to emit a relative distance to the set of nodes setup message, if it is, it is considered to modify its parent node list, or that the need to modify its parent node list; step Bl said according to receiving a group establishment message, judge whether to broadcast forwarding group received setup message is: determining the relative distance itself parent node is greater than issuing a relative distance to the set of nodes setup message, and if so, then considers necessary broadcast forwarding group received setup message, or saw no need to broadcast forwarding group received setup message.
  10. 10、 根据权利要求6所述的无线自组织网络的建立方法,其特征在于,步骤Bl在所述将所收到的组建立消息中携带的节点标识添加到自身的父节点列表中之前进一步包括:判断所收到的组建立消息中携带的节点标识是否已经存在于自身的父节点列表中,如果存在,则结束当前流程,否则将所收到的组建立消息中携带的节点标识添加到自身的父节点列表中。 10. The method for establishing a wireless ad hoc network of claim 6, characterized in that, the step Bl in the the establishment group received further comprises a prior message carries the node identifier added to itself a parent node list : group established to determine the received message carries node identifier already exists in its parent node list, if present, the current process ends, otherwise it will create a node identifier carried in the message added to their group received the parent node list.
  11. 11、 根据权利要求6所述的无线自组织网络的建立方法,其特征在于,步骤Cl所述根据接收到的组建立消息设置自身的相对距离为:将接收到的组建立消息中的相对距离加1后作为自身的相对距离。 11. The method for establishing the 6 wireless ad-hoc network as claimed in claim, wherein the step Cl the setup message sets itself relative distance is in accordance with the set of received: received set to establish the relative distance message after adding 1 as their relative distance.
  12. 12、 根据权利要求6所述的无线自组织网络的建立方法,其特征在于,预先设置中继点限制,步骤C]和步骤D1之间进一步包括:判断自身的相对距离是否超过中继点限制,如果是,则结束当前流程,否则执行步骤D1。 Method for establishing a wireless ad-hoc network 12, according to claim 6, wherein, the preset relay point limit, between steps C], and Step D1 further comprising: judging whether a relative distance than the relay point limit If so, the current process ends, otherwise step D1.
  13. 13、 根据权利要求1所述的无线自组织网络的建立方法,其特征在于,所述无线自组织网络是无线传感器网络。 13. The method for establishing the wireless ad-hoc network as claimed in claim, wherein said wireless ad-hoc network is a wireless sensor network.
  14. 14、 一种无线自组织网络的工作方法,其特征在于,该无线自组织网络是二层无线自组织网络,在组员节点上设置父节点列表,用以保存在与组长通信时可以采用的中继节点标识,在组员节点向父节点发送数据时,该方法包括:A2、判断是否能够成功向父节点列表中的任一节点发送数据,如果能够成功发送,则结束当前流程,否则执行步骤B2;B2、将未能成功接收数据的父节点标记为无效,向所述父节点列表中的其他父节点发送重组请求消息以尝试寻找新的父节点,并判断是否收到邀请消息, 如果收到则以发送邀请消息的节点标识替换自身的父节点列表,否则将自身的状态设置为等待,结束当前流程。 14, the working method for a wireless ad hoc network, wherein the wireless ad hoc network is a two wireless ad-hoc network, set the parent node list on the members node for stored at the head of the communication may employ relay node identifier, when transmitting data members node to the parent node, the method comprising: A2, determines whether or not successful, if successful transmission transmitting data to any of a parent node in the list, the current process ends, otherwise step B2; parent node B2, which did not successfully receive the data marked as invalid, sending recombinant request message in an attempt to find a new parent node of the other parent node of the parent node list, and determines whether or not the invitation message, If you receive places to send an invitation message node identification replace its parent node list, otherwise its status to wait for the end of the current process.
  15. 15、 根据权利要求14所述的无线自组织网络的工作方法,其特征在于,向所述父节点列表中的其他父节点发送重组请求消息以尝试寻找新的父节点后, 该方法进一步包括:C2、在组员节点收到除自身以外其它节点的重组请求消息时,判断是否能够为发出重组请求消息的节点提供中继,如果能够,则向发出重组请求消息的节点发送邀请消息,否则结束当前流程。 Working method of a wireless ad hoc network 15, according to claim 14, wherein the transmission to the other parent node of the parent node list recombinant request message in an attempt to find a new parent node, the method further comprising: C2, when the members node receives in addition to restructure itself to other nodes in the request message, determines whether to provide a relay issuing node recombinant request message, if so, then to issue a recombinant requesting node message transmission invitation message, or end The current process.
  16. 16、 根据权利要求14所述的无线自组织网络的工作方法,其特征在于,预先设置响应等待时长,步骤A2所述判断是否能够成功向父节点列表中的任一节点发送数据包括:A21、以父节点列表中记录的所有节点作为有效父节点; A22、从有效父节点中选择一个作为当前父节点,向当前父节点发送数据并开始计时,然后判断在所述响应等待时长内是否收到当前父节点发送的响应消息,如果收到,则认为能够成功向父节点列表中的任一节点发送数据,否则执行步骤B2;向所述父节点列表中的其他父节点发送重组请求消息以尝试寻找新的父节点之前,该方法进一步包括:判断是否父节点列表中所有节点均已标记为无效,如果是,则认为不能够成功向父节点列表中的任一节点发送数据,否则返回执行步骤A22。 Wireless ad-hoc working method of a network 16, according to claim 14, characterized in that the length of time waiting for a response is set in advance, whether the step of A2 is determined to successfully transmit to any parent node list of a node data comprises: A21, in all parent node list record as an active parent node; the A22, selecting one as the current parent node, transmits the data to the current parent node, and starts counting from the active parent node, and then determines whether or not the time to wait for the long response current response message parent node sent, if received, is considered able to transmit data successfully to a parent node list any node, otherwise, executing step B2; send to other parent node of the parent node list recombinant request message to attempt to before looking for new parent node, the method further comprises: determining whether a parent node list all nodes are marked as invalid, and if so, be deemed not to be able to successfully send data to the parent node list of any node, otherwise it returns to step A22.
  17. 17、 根据权利要求14所述的无线自组织网络的工作方法,其特征在于,预先设置修复等待时长,步骤B2所述判断是否收到邀请消息为:判断从发送重组请求消息开始,是否在修复等待时长内收到邀请消息。 Working method of a wireless ad hoc network 17, according to claim 14, characterized in that the length of repair wait preset, step B2 determines whether or not the invitation message is: determining whether a request message transmitted from recombinant started, whether repair while waiting to receive an invitation message within long.
  18. 18、 根据权利要求14所述的无线自组织网络的工作方法,其特征在于,所述邀请消息携带发出邀请消息的节点标识和相对距离,步骤B2所述以发送邀请消息的节点标识替换自身的父节点列表包括:B21、将发送邀请消息的节点中,相对距离最小的节点作为新的父节点; B22、清空父节点列表,将新的父节点标识添加到父节点列表中。 18, according to the working method of claim 14 wireless ad-hoc network as claimed in claim, wherein the Invite message carries the node from identity and relative distance of the invitation message, the step B2 to send the invitation message node identity replacement itself parent node list comprises: B21, node sends the invitation message, the relative minimum distance node as a new parent node; B22, empty parent node list, adding a new parent node ID to the parent node list. B23、将邀请消息中携带的相对距离加1后作为自身的相对距离。 B23, will be invited to the relative distance carried in the message after adding 1 as their relative distance.
  19. 19、 根据权利要求15所述的无线自组织网络的工作方法,其特征在于,所述重组请求消息携带发送重组请求消息的节点标识,步骤C2所述判断是否能够为发送重組请求消息的节点提供中继为:C21、根据重组请求消息中携带的节点标识,判断发出重组请求消息的节点是否为自身的父节点,如果是,则从父节点列表中删除发出重组请求消息的节点,并且认为不能为发送重组请求消息的节点提供中继,如果不是,则执行步骤C22;C22、判断自身是否处于等待状态,如果是,则认为不能为发送重组请求消息的节点提供中继,否则认为能够为发送重组请求消息的节点提供中继。 19, according to the working method of a wireless ad hoc network of claim 15, characterized in that said recombinant request message carries the transmission recombinant requesting node identifier message, the node whether said step C2 determination can request message is sent recombinant provide the relay is: C21, recombinant request message carries the node identification, determines the node from node recombinant request message whether its parent node, if so, from the parent node list to remove issued recombinant request message, and that can not be providing relay to transmit a recombinant node a request message, if not, step C22; C22, determines whether it is in a wait state, if so, that node can not request message is sent recombinant provide a relay, or that is possible to transmit recombinant requesting node messages provide a relay.
  20. 20、 根据权利要求19所述的无线自组织网络的工作方法,其特征在于,预先设置中继点限制,在步骤C22中,当节点不处于等待状态时,进一步包括:判断自身的相对距离是否超过中继点数限制,如果超过,则认为不能为发送重组请求消息的节点提供中继,否则认为能够为发送重组请求消息的节点提供中继。 20, according to the working method of a wireless ad hoc network according to claim 19, wherein, the preset relay point limit, in step C22, when the node is not in a wait state, further comprising: determining their relative distance is than the relay point limit, if exceeded, it is considered to provide a relay is not requesting node message is sent recombinant, or that the node can request message is sent recombinant provide a relay.
  21. 21、 根据权利要求19所述的无线自组织网络的工作方法,其特征在于,在步骤C21中,从父节点列表中删除发出重组请求消息的节点后,进一步包括:判断自身的父节点列表是否为空,如果为空,则执行步骤B2,否则结束当前流程。 21, according to the working method of a wireless ad hoc network of claim 19, wherein, in step C21, the issuing node recombinant request message from the parent node list deleted, further comprising: determining its parent node list is is empty, if empty, proceed to step B2, otherwise, end the current process.
  22. 22、 根据权利要求21所述的无线自组织网络的工作方法,其特征在于,预先设置等待时长,所述在父节点列表为空时执行步骤B2为:从判断出列表为空开始计时,在到达等待时长后执行步骤B2 。 Working method of a wireless ad hoc network 22, according to claim 21, characterized in that the length of time, is set in advance, execution of the parent node list is empty at step B2 is: from the determination that the list is empty to start timing, the long after step B2 arrival waiting.
  23. 23、 根据权利要求14所述的无线自组织网络的建立方法,其特征在于,所述无线自组织网络是无线传感器网络。 23, according to Claim method for establishing a wireless ad hoc network of claim 14, wherein said wireless ad-hoc network is a wireless sensor network.
  24. 24、 一种无线自组织网络的工作方法,其特征在于,该无线自组织网络是二层无线自组织网络,在组员节点上设置父节点列表,用以保存在与组长通信时可以采用的中继节点标识,组员节点在自身父节点列表中的节点全部失效时发送重组请求消息,所述重组请求消息携带发送重组请求消息的节点标识,其他节点收到重组请求消息时,该方法包括:A3、根据重组请求消息中携带的节点标识,判断发出重组请求消息的节点是否为自身的父节点,如果是,则判定不能够为发送重组请求消息的节点提供中继,否则,执行步骤A32;A32、判断自身是否处于等待状态,如果是,则认为不能为发送重组请求消息的节点提供中继,否则认为能够为发送重组请求消息的节点提供中继,则向发送重组请求消息的节点发送邀请消息。 24, the working method for a wireless ad hoc network, wherein the wireless ad hoc network is a two wireless ad-hoc network, set the parent node list on the members node for stored at the head of the communication may employ when the relay node identifier, sending recombinant request message members node in its own parent node list all fail, the recombinant request message carries the node identification request message transmitted recombination, the other node receives a recombinant request message, the method comprising: A3, recombinant request message carries the node identification, determines the node from recombinant request message whether its parent node, if so, it is determined that node can not request message is sent recombinant provide a relay, otherwise, perform step A32; A32, determining whether it is in a wait state, if so, that node can not request message is sent recombinant provide a relay, or that the node can request message is sent recombinant provide relay node messages then sends a request to recombination send an invitation message.
  25. 25、 根据权利要求24所述的无线自组织网络的工作方法,其特征在于,判断发出重组请求消息的节点是否为自身的父节点,如果是,则该方法进一步包括:从父节点列表中删除发出重组请求消息的节点。 25, according to the working method of a wireless ad hoc network as claimed in claim 24, characterized in that, the determination node issuing recombinant request message whether its parent node, if so, the method further comprising: deleting from the parent node list issued recombinant requesting node messages.
  26. 26、 才艮据权利要求25所述的无线自组织网络的工作方法,其特征在于,预先设置中继点限制,在步骤A32中,当节点不处于等待状态时,进一步包括:判断自身的相对距离是否超过中继点数限制,如果超过,则认为不能为发送重组请求消息的节点提供中继,否则认为能够为发送重组请求消息的节点提供中继。 26, only Gen according to the working method of a wireless ad hoc network of claim 25, wherein, the preset relay point limit, in step A32, when a node is not in a wait state, further comprising: determining their relative if the distance exceeds the relay point limit, if exceeded, it is considered to provide a relay is not requesting node message is sent recombinant, or that the node can request message is sent recombinant provide a relay.
  27. 27、 根据权利要求24所述的无线自组织网络的建立方法,其特征在于,所述无线自组织网络是无线传感器网络。 27. The method for establishing a wireless ad hoc network of claim 24, wherein said wireless ad-hoc network is a wireless sensor network.
CN 200610078540 2006-05-10 2006-05-10 Construction and operation for wireless self-organizing network CN100456728C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 200610078540 CN100456728C (en) 2006-05-10 2006-05-10 Construction and operation for wireless self-organizing network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 200610078540 CN100456728C (en) 2006-05-10 2006-05-10 Construction and operation for wireless self-organizing network

Publications (2)

Publication Number Publication Date
CN1984015A true CN1984015A (en) 2007-06-20
CN100456728C true CN100456728C (en) 2009-01-28

Family

ID=38166265

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200610078540 CN100456728C (en) 2006-05-10 2006-05-10 Construction and operation for wireless self-organizing network

Country Status (1)

Country Link
CN (1) CN100456728C (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103108387A (en) * 2013-01-31 2013-05-15 中国科学院上海微系统与信息技术研究所 Establishment method of multi-hop wireless self-organization network applied to agriculture

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101442482B (en) 2007-11-13 2011-02-16 北京大学 Method and system for building distributed computing network based on feedback propagation
CN101272166B (en) 2008-05-15 2012-09-26 北京航空航天大学 Method for sensor network coverage control
CN101394410B (en) 2008-10-29 2012-01-04 北京邮电大学 A communication method used in mobile Ad hoc network
CN103581893A (en) * 2012-08-10 2014-02-12 北京百度网讯科技有限公司 Distributed wireless network self-organizing method, device and system

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6330229B1 (en) 1998-11-09 2001-12-11 3Com Corporation Spanning tree with rapid forwarding database updates
CN1579066A (en) 2001-03-09 2005-02-09 摩托罗拉公司 A protocol for a self-organizing network using a logical spanning tree backbone
CN1642129A (en) 2004-01-14 2005-07-20 电子科技大学 Nucleus tree self-organizing dynamic route algorithm

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6330229B1 (en) 1998-11-09 2001-12-11 3Com Corporation Spanning tree with rapid forwarding database updates
CN1579066A (en) 2001-03-09 2005-02-09 摩托罗拉公司 A protocol for a self-organizing network using a logical spanning tree backbone
CN1642129A (en) 2004-01-14 2005-07-20 电子科技大学 Nucleus tree self-organizing dynamic route algorithm

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103108387A (en) * 2013-01-31 2013-05-15 中国科学院上海微系统与信息技术研究所 Establishment method of multi-hop wireless self-organization network applied to agriculture
CN103108387B (en) * 2013-01-31 2016-09-28 中国科学院上海微系统与信息技术研究所 One kind used in agriculture method for establishing multi-hop wireless ad hoc networks

Also Published As

Publication number Publication date Type
CN1984015A (en) 2007-06-20 application

Similar Documents

Publication Publication Date Title
Gallais et al. Localized sensor area coverage with low communication overhead
Wang et al. Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks
Kulkarni et al. MNP: Multihop network reprogramming service for sensor networks
Kredo II et al. Medium access control in wireless sensor networks
US6928061B1 (en) Transmission-scheduling coordination among collocated internet radios
Rajendran et al. Energy-efficient, collision-free medium access control for wireless sensor networks
US7321580B1 (en) Directional carrier sense medium access for wireless nodes
US6829222B2 (en) Clusterhead selection in wireless ad hoc networks
US20070133448A1 (en) Method and apparatus for optimal atim size setup for 802.11 networks in an ad hoc mode
US7366113B1 (en) Adaptive topology discovery in communication networks
US20070211681A1 (en) Method and System for Frequency Agility in a Wireless Sensor Network
US20020044549A1 (en) Efficient scatternet forming
US20060198353A1 (en) Method for media access controlling and system and method for channel time reservation in distributed wireless personal area network
Petrioli et al. Configuring BlueStars: Multihop scatternet formation for Bluetooth networks
US7969914B1 (en) Method for establishing and operating a mobile Ad-Hoc network
US20100097969A1 (en) Low-power wireless multi-hop networks
US6876643B1 (en) Clustering in wireless ad hoc networks
Lee et al. FlexiTP: a flexible-schedule-based TDMA protocol for fault-tolerant and energy-efficient wireless sensor networks
US7729285B2 (en) Energy-efficient network protocol and node device for sensor networks
Van Hoesel et al. Advantages of a TDMA based, energy-efficient, self-organizing MAC protocol for WSNs
US20080240078A1 (en) Path shortening in a wireless mesh network
Busch et al. Contention-free MAC protocols for wireless sensor networks
US20090207769A1 (en) Method and apparatus for scheduling timing for communication between sensor nodes in wireless sensor network
US20100046426A1 (en) Methods for providing an ad hoc mobile communication network and systems thereof
Li et al. A cone-based distributed topology-control algorithm for wireless multi-hop networks

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination
C14 Grant of patent or utility model