CN102395182B - Three-dimensional wireless sensor network topology control method with two-dimensional bounded property - Google Patents

Three-dimensional wireless sensor network topology control method with two-dimensional bounded property Download PDF

Info

Publication number
CN102395182B
CN102395182B CN201110421001.XA CN201110421001A CN102395182B CN 102395182 B CN102395182 B CN 102395182B CN 201110421001 A CN201110421001 A CN 201110421001A CN 102395182 B CN102395182 B CN 102395182B
Authority
CN
China
Prior art keywords
node
3dyao
neighbor node
neighbor
ubg
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.)
Expired - Fee Related
Application number
CN201110421001.XA
Other languages
Chinese (zh)
Other versions
CN102395182A (en
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.)
Beijing Institute of Technology BIT
Original Assignee
Beijing Institute of Technology BIT
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 Beijing Institute of Technology BIT filed Critical Beijing Institute of Technology BIT
Priority to CN201110421001.XA priority Critical patent/CN102395182B/en
Publication of CN102395182A publication Critical patent/CN102395182A/en
Application granted granted Critical
Publication of CN102395182B publication Critical patent/CN102395182B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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 THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

本发明涉及一种双向度有界的三维无线传感器网络拓扑控制方法,包含如下步骤:一、对任意节点u,计算其邻居节点集NUBG(u);二、用3DYAO算法对NUBG(u)进行处理,得到NYG(u);三、把NYG(u)向NUBG(u)广播;四、计算节点u的内向邻居集五、用步骤二中相同的3DYAO算法对

Figure DDA0000120310370000012
进行处理,得到
Figure DDA0000120310370000013
六、把
Figure DDA0000120310370000014
向NUBG(u)中所有邻居广播;七、对于NYG(u)中所有节点v,假如u也在
Figure DDA0000120310370000015
中,那么就把v加入NYYG(u)中;八、输出节点u的双向度有界的三维无线传感器网络拓扑NYYG(u),调整发射功率为可达到NYYG(u)中最远的邻居位置。本发明具有双向度有界和高效节能的特性,能够在本地分布式实现,达到延长网络生命周期,降低网络干扰,提高网络吞吐率的目的。

Figure 201110421001

The invention relates to a two-dimensional bounded three-dimensional wireless sensor network topology control method, comprising the following steps: 1. For any node u, calculate its neighbor node set N UBG (u); 2. Use 3DYAO algorithm to calculate N UBG (u ) to get N YG (u); three, broadcast N YG (u) to N UBG (u); four, calculate the inward neighbor set of node u 5. Use the same 3DYAO algorithm in step 2 to

Figure DDA0000120310370000012
processed, get
Figure DDA0000120310370000013
Six, put
Figure DDA0000120310370000014
Broadcast to all neighbors in N UBG (u); 7. For all nodes v in N YG (u), if u is also
Figure DDA0000120310370000015
, then add v to N YYG (u); 8. Output the two-dimensional bounded three-dimensional wireless sensor network topology N YYG (u) of node u, adjust the transmission power to reach the farthest in N YYG (u) location of neighbors. The present invention has the characteristics of two-dimensional boundedness and high efficiency and energy saving, and can be implemented in local distribution, so as to prolong the network life cycle, reduce network interference, and improve network throughput.

Figure 201110421001

Description

双向度有界的三维无线传感器网络拓扑控制方法Topology control method for 3D wireless sensor networks with bidirectional boundedness

技术领域 technical field

本发明涉及一种三维无线传感器网络拓扑控制方法,具体涉及一种对三维无线传感器网络提出的双向度有界、高效节能、分布式的拓扑控制方法,属于三维无线网络拓扑控制领域,适合用于大规模、自组织、随机部署、环境复杂以及节点能量有限的无线传感器网络。The invention relates to a three-dimensional wireless sensor network topology control method, in particular to a two-dimensional bounded, high-efficiency, energy-saving, and distributed topology control method proposed for a three-dimensional wireless sensor network, which belongs to the field of three-dimensional wireless network topology control and is suitable for use in Wireless sensor networks with large scale, self-organization, random deployment, complex environment and limited node energy.

背景技术 Background technique

无线传感器网络是由大量具有数据采集、处理和无线通信能力的微型低功耗传感器节点通过多跳的方式构成的自组织网络系统,其目的是协作地感知、采集和处理网络覆盖的地理区域中感知对象的信息。无线传感器网络一般具有大规模、自组织、随机部署、环境复杂、传感器节点资源有限、网络拓扑经常发生变化的特点。传感器、感知器和观察者构成了无线传感器网络的三个要素。早期对传感器网络研究,几乎完全集中于理想的二维平面,它的一项基本假设是节点在二维平面分布。然而这种二维假设并不适用于水下网络,因为大多数水下传感器网络系统要求节点分布在不同深度的水域中执行感知任务。The wireless sensor network is an ad hoc network system composed of a large number of miniature low-power sensor nodes with data acquisition, processing and wireless communication capabilities through multi-hop. Perceived object information. Wireless sensor networks generally have the characteristics of large-scale, self-organization, random deployment, complex environment, limited sensor node resources, and frequent changes in network topology. Sensors, perceptrons and observers constitute the three elements of a wireless sensor network. Early research on sensor networks was almost entirely focused on the ideal two-dimensional plane, and one of its basic assumptions was that the nodes were distributed on the two-dimensional plane. However, this two-dimensional assumption is not suitable for underwater networks, because most underwater sensor network systems require nodes to be distributed in waters of different depths to perform sensing tasks.

三维无线传感器网络是由部署在三维物理空间中、具有一定感知任务的传感器节点组成的无线网络系统。现在已经有大量三维无线网络的应用,如水下静态传感器网络、移动水下设备网络、空间环境监测、森林火灾预测、部署在建筑物各层的无线网络等。尤其是近年来水下传感器网络研究的兴起,推动了三维传感器网络系统的发展。A three-dimensional wireless sensor network is a wireless network system composed of sensor nodes deployed in three-dimensional physical space with certain sensing tasks. There are already a large number of applications of 3D wireless networks, such as underwater static sensor networks, mobile underwater equipment networks, space environment monitoring, forest fire prediction, and wireless networks deployed on various floors of buildings. Especially in recent years, the rise of underwater sensor network research has promoted the development of 3D sensor network systems.

构成三维无线传感器网络的节点体积微小,计算能力和通信能力相当有限,节点的能量依靠电池提供且不能得到后续补充。所以,传感器节点在工作过程中的能量消耗高低直接关系到整个网络的生存时间。如果每个节点都以最大功率进行通讯,不仅节点能量消耗非常迅速,而且必然会加剧节点之间信号的干扰,降低通讯效率。The nodes that constitute the three-dimensional wireless sensor network are small in size, with limited computing and communication capabilities. The energy of the nodes is provided by batteries and cannot be supplemented later. Therefore, the energy consumption of sensor nodes in the working process is directly related to the survival time of the entire network. If each node communicates with the maximum power, not only the energy consumption of the nodes is very fast, but also the signal interference between nodes will be aggravated and the communication efficiency will be reduced.

拓扑控制方法是一种设置每个节点发射功率即传输范围的方法,其目标是通过控制节点的传输范围,在减少系统能量消耗的前提下,保证整个网络拓扑的连通性和覆盖性。拓扑控制在无线传感器网络研究中具有重要意义:首先,拓扑控制是一种重要的节能技术;其次,拓扑控制保证覆盖质量和连通质量;再次,拓扑控制能够降低通信干扰提高MAC协议和路由协议的效率,为数据融合提供拓扑基础;此外,拓扑控制能够提高网络的可靠性、可扩展性等其他性能。The topology control method is a method of setting the transmission power of each node, that is, the transmission range. Its goal is to ensure the connectivity and coverage of the entire network topology under the premise of reducing system energy consumption by controlling the transmission range of nodes. Topology control is of great significance in the research of wireless sensor networks: firstly, topology control is an important energy-saving technology; secondly, topology control ensures coverage quality and connection quality; thirdly, topology control can reduce communication interference and improve MAC protocol and routing protocol. Efficiency, providing a topology basis for data fusion; in addition, topology control can improve network reliability, scalability and other performance.

拓扑控制在二维平面上有大量的研究结果,但国内外目前对三维空间的拓扑控制研究甚少。与二维无线传感器网络相比,三维无线传感器网络提出了许多新的问题和挑战,如他的问题难度增加;计算复杂度成倍上升;现实物理结构复杂。而且目前三维无线传感器网络的研究主要集中在其覆盖质量、连通质量和路由等问题上。经过对现有技术的文献检索发现,目前适用于三维无线传感器网络的拓扑控制方法有以下几个协议:There are a lot of research results on topological control in two-dimensional plane, but there are few researches on topological control in three-dimensional space at home and abroad. Compared with the two-dimensional wireless sensor network, the three-dimensional wireless sensor network poses many new problems and challenges, such as the difficulty of his problem increases; the computational complexity increases exponentially; the real physical structure is complex. Moreover, the current research on 3D wireless sensor networks mainly focuses on issues such as coverage quality, connectivity quality and routing. After searching the literature of the prior art, it is found that the current topology control methods applicable to the 3D wireless sensor network have the following protocols:

1)LMST(Local Minimum Spanning Tree)协议。文献《Applications of k-localMST for topology control and broadcasting in wireless ad hoc networks》所提的LMST协议能够扩展到三维网络,能够保证所处理后的网络是连通的,但是它有可能会有很大的能量消耗,即它的能量扩展因子没有界。1) LMST (Local Minimum Spanning Tree) protocol. The LMST protocol proposed in the document "Applications of k-localMST for topology control and broadcasting in wireless ad hoc networks" can be extended to three-dimensional networks, which can ensure that the processed network is connected, but it may have a lot of energy Consumption, ie its energy expansion factor is unbounded.

2)CBTC(Cone-Based Distributed Topology Control)协议。CBTC是一个能够保证网络连通性的基于方向的分布式算法,原来是一个用于二维无线传感器网络的协议。麻省理工大学的Bahramgiri等人在文献《Fault-tolerant and3-dimensional distributed topology control algorithms in wireless multi-hopnetworks》中将其推广到三维空间,提出了容错的CBTC协议。其核心是检查以u为中心的角度为α的每个三维圆锥中是否都存在一个可通信的邻居节点。他们证明了当α≤2π/(3k)时,三维CBTC保持网络图的k-连通性。但是这种方法没有提供能量有界和度有界的证明,而且基于方向的算法需要可靠的方向信息,节点需要配备多个有向天线,因而对传感器节点提出了较高的要求。2) CBTC (Cone-Based Distributed Topology Control) protocol. CBTC is a direction-based distributed algorithm that can guarantee network connectivity. It was originally a protocol for two-dimensional wireless sensor networks. Bahramgiri et al. from the Massachusetts Institute of Technology extended it to three-dimensional space in the document "Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hopnetworks" and proposed a fault-tolerant CBTC protocol. Its core is to check whether there is a communicable neighbor node in every three-dimensional cone with angle α centered on u. They demonstrate that when α ≤ 2π/(3k), 3D CBTC preserves the k-connectivity of the network graph. But this method does not provide a proof of bounded energy and bounded degree, and the direction-based algorithm needs reliable direction information, and the nodes need to be equipped with multiple directional antennas, so higher requirements are put forward for the sensor nodes.

3)XTC协议。Wattenhofer等人在文献《XTC:A practical topology controlalgorithm for ad-hoc networks》中提出一个基于邻居的拓扑控制算法——XTC协议。协议的计算只依赖于局部信息,每个节点只需要和邻居节点交换两次信息。但是他们没有对XTC在三维中的拓扑结构做任何理论和实验分析。3) XTC protocol. In the document "XTC: A practical topology control algorithm for ad-hoc networks", Wattenhofer et al. proposed a neighbor-based topology control algorithm - the XTC protocol. The calculation of the protocol only depends on local information, and each node only needs to exchange information with its neighbor nodes twice. But they did not do any theoretical and experimental analysis of the topology of XTC in 3D.

4)3DRNG、3DGG和3DYAO。RNG、GG、YAO是三种二维无线传感器网络的拓扑控制算法。Yu Wang等人在文献《Energy-efficient topology control forthree-dimensional sensor networks》将其推广到三维空间,并且证明了3DRNG、3DGG和3DYAO的拓扑特性。如3DRNG具有连通性,但不具有能量支撑性;3DGG具有连通性,其能量t-Spanner系数是1;3DYAO具有连通性、能量支撑性和外向度有界性。4) 3DRNG, 3DGG, and 3DYAO. RNG, GG, and YAO are three topological control algorithms for two-dimensional wireless sensor networks. Yu Wang et al. extended it to three-dimensional space in the document "Energy-efficient topology control forthree-dimensional sensor networks", and proved the topological properties of 3DRNG, 3DGG and 3DYAO. For example, 3DRNG has connectivity, but no energy support; 3DGG has connectivity, but its energy t-Spanner coefficient is 1; 3DYAO has connectivity, energy support, and extroversion boundedness.

综上所述,目前所有提出的针对三维无线传感器网络的拓扑结构均没有双向(内向和外向)度有界的性质。节点度数有界是指在生成的拓扑结构中节点的邻居个数小于一个常数k,降低节点的度数可以减少节点转发消息的数量和路由计算的复杂度,这对于节约能量和降低网络干扰具有重要意义。In summary, all currently proposed topologies for 3D WSNs do not have bidirectional (inward and outward) degree-bounded properties. Bounded node degree means that the number of neighbors of nodes in the generated topology is less than a constant k. Reducing the degree of nodes can reduce the number of nodes forwarding messages and the complexity of routing calculations, which is important for saving energy and reducing network interference. significance.

发明内容 Contents of the invention

本发明的目的是针对现有技术的缺陷,提供一种三维无线传感器网络的拓扑控制方法,保证其生成的拓扑结构具有双向度有界和高效节能的特性。The object of the present invention is to provide a topology control method for a three-dimensional wireless sensor network to ensure that the topology structure generated by it has the characteristics of bidirectional boundedness, high efficiency and energy saving.

本发明的目的是通过以下技术方案实现的:The purpose of the present invention is achieved through the following technical solutions:

一种双向度有界的三维无线传感器网络拓扑控制方法,包含如下步骤:A two-dimensional bounded three-dimensional wireless sensor network topology control method, comprising the following steps:

一、针对给定三维无线传感器网络中的任意节点u,计算其邻居节点集NUBG(u),即u的最大通信距离能覆盖的节点集;1. For any node u in a given three-dimensional wireless sensor network, calculate its neighbor node set N UBG (u), that is, the set of nodes that can be covered by the maximum communication distance of u;

二、以节点u的邻居节点集NUBG(u)为输入,使用3DYAO算法对其进行处理,得到u节点处理后的3DYAO邻居节点集NYG(u);2. Taking the neighbor node set N UBG (u) of node u as input, use the 3DYAO algorithm to process it, and obtain the 3DYAO neighbor node set N YG (u) processed by node u;

三、把3DYAO邻居节点集NYG(u)向u的邻居节点集NUBG(u)广播;3. Broadcast the 3DYAO neighbor node set N YG (u) to the neighbor node set N UBG (u) of u;

四、计算节点u的内向邻居集如果u∈NYG(v),那么把v加入节点u的内向邻居集

Figure BDA0000120310350000032
中,即
Figure BDA0000120310350000033
4. Calculate the inward neighbor set of node u If u∈N YG (v), then add v to the set of inward neighbors of node u
Figure BDA0000120310350000032
in, namely
Figure BDA0000120310350000033

五、以节点u的内向邻居集

Figure BDA0000120310350000034
为输入,使用与步骤二中相同的3DYAO算法对其进行处理,得到u节点处理后的邻居节点集
Figure BDA0000120310350000035
5. Take the inward neighbor set of node u
Figure BDA0000120310350000034
As input, use the same 3DYAO algorithm as in step 2 to process it, and get the set of neighbor nodes processed by u node
Figure BDA0000120310350000035

六、把节点集

Figure BDA0000120310350000036
向u的邻居节点集NUBG(u)中所有邻居广播;Six, the node set
Figure BDA0000120310350000036
Broadcast to all neighbors in u's neighbor node set N UBG (u);

七、对于NYG(u)中所有节点v,假如u也在中,那么就把v加入NYYG(u)中;7. For all nodes v in N YG (u), if u is also , then add v to N YYG (u);

八、输出节点u的双向度有界的三维无线传感器网络拓扑NYYG(u),调整发射功率为可达到NYYG(u)中最远的邻居位置。8. Output the two-dimensional bounded three-dimensional wireless sensor network topology N YYG (u) of node u, and adjust the transmission power to reach the farthest neighbor position in N YYG (u).

有益效果Beneficial effect

本发明提出的方法是基于3DYAO的三维拓扑控制方法,具有双向度有界和高效节能的特性,能够在本地分布式实现,达到延长网络生命周期,降低网络干扰,提高网络吞吐率的目的。The method proposed in the present invention is a three-dimensional topology control method based on 3DYAO, which has the characteristics of bidirectional boundedness and high efficiency and energy saving, and can be implemented locally, so as to prolong the network life cycle, reduce network interference, and improve network throughput.

目前国内外对三维空间的拓扑控制研究甚少,并且没有一种拓扑结构能够具有双向度有界的性质。降低节点的度数可以减少节点转发消息的数量和路由计算的复杂度,以达到降低网络干扰和节约能量的目的。At present, there are few researches on the topological control of three-dimensional space at home and abroad, and no topological structure can have the property of two-dimensional boundedness. Reducing the degree of nodes can reduce the number of messages forwarded by nodes and the complexity of routing calculations, so as to reduce network interference and save energy.

本发明提出的方法还具有能量支撑因子有界的特性。它集中了度数有界和能量控制两种目前拓扑控制解决方案的优点,更大程度延长了网络的生命周期。The method proposed by the invention also has the property that the energy support factor is bounded. It combines the advantages of two current topology control solutions, degree bounded and energy control, and prolongs the life cycle of the network to a greater extent.

本发明提出的方法考虑到传感器节点有限的计算能力和通讯能力,方法复杂度和通讯次数都比较少,并且是分布式控制,网络中的节点仅仅依靠自己常数跳邻居的信息,不需要全局信息就能够本地构造自己的拓扑结构。The method proposed by the present invention takes into account the limited computing and communication capabilities of sensor nodes, the complexity of the method and the number of communications are relatively small, and it is distributed control. The nodes in the network only rely on their own constant jump neighbor information, and do not need global information. You can build your own topology locally.

附图说明 Description of drawings

图1是双向度有界的三维无线传感器网络拓扑控制方法的具体实现流程。Fig. 1 is a specific implementation process of a two-dimensional bounded three-dimensional wireless sensor network topology control method.

图2是使用固定划分法的3DYAO结构。Figure 2 is a 3DYAO structure using a fixed partition method.

图3是使用灵活划分法的3DYAO结构。Figure 3 is the 3DYAO structure using the flexible partition method.

具体实施方式 Detailed ways

下面结合附图对本发明的实施例做详细说明:本实施例在以本发明技术方案为前提下进行实施,给出了详细的实施方式和具体的操作过程,但本发明的保护范围不限于下属的实施例。Below in conjunction with accompanying drawing the embodiment of the present invention is described in detail: present embodiment implements under the premise of technical scheme of the present invention, has provided detailed implementation mode and concrete operation process, but protection scope of the present invention is not limited to subordinates the embodiment.

图1给出了本发明所述的基于3DYAO的双向度有界的三维传感器网络拓扑控制方法详细的流程,具体的技术实施方案如下:Fig. 1 has provided the detailed process flow of the two-dimensional bounded three-dimensional sensor network topology control method based on 3DYAO according to the present invention, and the specific technical implementation plan is as follows:

步骤一:对于给定无线传感器网络中的任意节点u,计算其邻居节点集NUBG(u)。具体的计算方法如下:Step 1: For any node u in a given wireless sensor network, calculate its neighbor node set N UBG (u). The specific calculation method is as follows:

以节点u为球心,以无线传感器节点发射功率能达到的最大通信距离R为半径,形成一个球体。在给定的三维无线传感器网络中,如果节点v落在球体内,那么v就是u的邻居节点。所有的节点v构成u的邻居节点集NUBG(u)。Take the node u as the center of the sphere, and take the maximum communication distance R that the wireless sensor node transmit power can reach as the radius to form a sphere. In a given 3D wireless sensor network, if a node v falls within a sphere, then v is a neighbor node of u. All nodes v constitute u's neighbor node set N UBG (u).

步骤二:使用3DYAO算法对节点u的邻居节点集NUBG(u)进行处理,得到u节点处理后的邻居节点集NYG(u)。Step 2: Use the 3DYAO algorithm to process the neighbor node set N UBG (u) of node u, and obtain the neighbor node set N YG (u) of node u after processing.

作为本发明的优选实施方式,3DYAO算法采用固定划分法或者灵活划分法。下面具体描述这两种划分法的3DYAO拓扑结构。As a preferred embodiment of the present invention, the 3DYAO algorithm adopts a fixed division method or a flexible division method. The 3DYAO topological structures of these two division methods are described in detail below.

1)固定划分法:1) Fixed division method:

在固定划分法中,对于任意节点,圆锥体的划分方法都相同,并且划分的圆锥体彼此不相交。具体可以有两种划分方法:In the fixed division method, for any node, the division method of the cone is the same, and the divided cones do not intersect each other. Specifically, there are two methods of division:

第一种:对任意节点u,首先使用三个正交平面(xy平面、yz平面和xz平面)把u的传输范围UBG划分成8个区域,每一个区域是1/8个球体;其次,再使用三个平面把每一个区域划分成4个锥体,如图2(a)所示,图中所示的c1、c2和c3分别是所在圆弧的中点。如此则把u的传输范围划分成了32个彼此不相交的锥体。最后,在任意椎体内,对于u的邻居节点集NUBG(u),节点u只选择锥体内长度最短的边uv保留,这些有向边uv形成了3DYAO拓扑结构NYG(u)。这种划分法形成的3DYAO结构的度数最大为32。The first one: For any node u, first use three orthogonal planes (xy plane, yz plane and xz plane) to divide the transmission range UBG of u into 8 areas, each area is 1/8 of a sphere; secondly, Then use three planes to divide each region into four cones, as shown in Figure 2(a), where c1, c2 and c3 shown in the figure are the midpoints of the arcs they are in respectively. In this way, the transmission range of u is divided into 32 cones that do not intersect each other. Finally, in any cone, for u’s neighbor node set N UBG (u), node u only selects the edge uv with the shortest length in the cone to keep, and these directed edges uv form the 3DYAO topology N YG (u). The maximum degree of the 3DYAO structure formed by this division method is 32.

第二种:对任意节点u,首先使用三个正交平面(xy平面、yz平面和xz平面)把u的传输范围UBG划分成8个区域,每一个区域是1/8个球体;其次,使用6个平面把每一个区域划分成7个锥体,如图2(b)所示,其中,ci和ci’(i=1,2,3)分别是所在圆弧的三等分点。如此则把u的传输范围划分成了56个锥体。最后,在任意椎体内,对于u的邻居节点集NUBG(u),节点u只选择锥体内长度最短的边uv保留,这些有向边uv形成了3DYAO拓扑结构NYG(u)。这种划分法形成的3DYAO结构的度数最大为56。The second type: For any node u, first use three orthogonal planes (xy plane, yz plane and xz plane) to divide the transmission range UBG of u into 8 areas, each area is 1/8 of a sphere; secondly, Use 6 planes to divide each region into 7 cones, as shown in Fig. 2(b), where ci and ci' (i=1, 2, 3) are the trisection points of the arc respectively. In this way, the transmission range of u is divided into 56 cones. Finally, in any cone, for u’s neighbor node set N UBG (u), node u only selects the edge uv with the shortest length in the cone to keep, and these directed edges uv form the 3DYAO topology N YG (u). The maximum degree of the 3DYAO structure formed by this division method is 56.

2)灵活划分法:2) Flexible division method:

在这种划分法中,对于不同节点来说,锥体的划分方法不同,划分的圆锥体可以彼此相交。具体有两种划分方法:In this division method, for different nodes, the cones are divided in different ways, and the divided cones can intersect each other. Specifically, there are two division methods:

第一种:The first:

1a)对任意节点u,首先计算其邻居节点集;1a) For any node u, first calculate its neighbor node set;

1b)对节点u的邻居节点集中的任一邻居节点v,设PROCESSED(v)=0;1b) For any neighbor node v in the neighbor node set of node u, set PROCESSED(v)=0;

1c)对任一邻居节点v,且有PROCESSED(v)=0,执行以下步骤:1c) For any neighbor node v, and PROCESSED(v)=0, perform the following steps:

①以uv为轴,以一个小于π/3的角度θ为顶角,构建一个锥体;①Construct a cone with uv as the axis and an angle θ less than π/3 as the apex angle;

②节点u选择锥体内最短的边uw保留,且对锥体内所有邻居节点x,设PROCESSED(x)=1;②The node u selects the shortest edge uw in the cone to keep, and for all the neighbor nodes x in the cone, set PROCESSED(x)=1;

1d)这些有向边uw形成了3DYAO拓扑结构NYG(u)。1d) These directed edges uw form the 3DYAO topology N YG (u).

如图3(a)所示。As shown in Figure 3(a).

第二种:The second type:

2a)对任意节点u,首先计算其邻居节点集;2a) For any node u, first calculate its neighbor node set;

2b)根据节点u到邻居节点vi的长度由小到大对u vi进行排序,即||u vi||≤||uvi+1||(i由1到m,m为邻居节点个数));2b) Sort u v i according to the length from node u to neighbor node v i from small to large, that is ||u v i ||≤||uv i+1 ||(i from 1 to m, m is the number of neighbor nodes number));

2c)对所有邻居节点vi(i由1到m),设PROCESSED(vi)=0;2c) For all neighbor nodes v i (i from 1 to m), set PROCESSED(v i )=0;

2d)对邻居节点vi(i由1到m),假如PROCESSED(vi)=0,执行以下步骤:2d) For neighbor node v i (i from 1 to m), if PROCESSED(v i )=0, perform the following steps:

①以u vi为轴,以一个小于2π/3的角度θ为顶角,构建一个锥体;① Construct a cone with u v i as the axis and an angle θ less than 2π/3 as the apex angle;

②节点u选择边u vi保留,且对锥体内所有邻居节点w,设PROCESSED(w)=1;② Node u chooses edge u v i to keep, and for all neighbor nodes w in the cone, set PROCESSED(w) = 1;

2e)这些有向边u vi形成了3DYAO拓扑结构NYG(u)。2e) These directed edges u v i form the 3DYAO topology N YG (u).

如图3(b)所示。As shown in Figure 3(b).

步骤二处理之后,能够保证处理后的网络外向度数为一个常数。After the processing in step 2, it can be guaranteed that the processed network outgoing degree is a constant.

步骤三:把3DYAO邻居节点集NYG(u)向u的邻居节点集NUBG(u)中所有邻居广播。Step 3: Broadcast the 3DYAO neighbor node set N YG (u) to all neighbors in u's neighbor node set N UBG (u).

步骤四:计算节点u的内向邻居集

Figure BDA0000120310350000061
如果u∈NYG(v),那么把v加入节点u的内向邻居集
Figure BDA0000120310350000062
中,即
Figure BDA0000120310350000063
Step 4: Calculate the inward neighbor set of node u
Figure BDA0000120310350000061
If u∈N YG (v), then add v to the set of inward neighbors of node u
Figure BDA0000120310350000062
in, namely
Figure BDA0000120310350000063

步骤五:以节点u的内向邻居集

Figure BDA0000120310350000064
为输入,选取和步骤二中相同的3DYAO算法对其进行处理,得到u节点处理后的邻居节点集
Figure BDA0000120310350000065
Step 5: Take the inward neighbor set of node u
Figure BDA0000120310350000064
As the input, select the same 3DYAO algorithm as in step 2 to process it, and obtain the neighbor node set processed by u node
Figure BDA0000120310350000065

步骤五处理之后,能够保证处理后的网络内向度数为一个常数。After step five is processed, it can be guaranteed that the processed network introversion degree is a constant.

步骤六:把节点集

Figure BDA0000120310350000066
向u的邻居节点集NUBG(u)中所有邻居广播。Step 6: Put the node set
Figure BDA0000120310350000066
Broadcast to all neighbors in u's neighbor node set N UBG (u).

步骤七:对于NYG(u)中所有节点v,假如u也在

Figure BDA0000120310350000067
中,那么就把v加入NYYG(u)中。Step 7: For all nodes v in N YG (u), if u is also
Figure BDA0000120310350000067
, then add v to N YYG (u).

步骤八:输出节点u的双向度有界的三维无线传感器网络拓扑NYYG(u),调整发射功率为可达到NYYG(u)中最远的邻居位置。Step 8: Output the two-dimensional bounded three-dimensional wireless sensor network topology N YYG (u) of node u, and adjust the transmission power to reach the farthest neighbor position in N YYG (u).

本发明对于邻居节点集和内向邻居集分别采用3DYAO算法进行处理。由于3DYAO算法具有连通性、能量支撑性和外向度有界性,因此本发明构造的三维无线传感器网络拓扑结构具有双向度有界的特性。降低节点的度数可以减少节点转发消息的数量和路由计算的复杂度,以达到降低网络干扰和节约能量的目的。The present invention uses the 3DYAO algorithm to process the neighbor node set and the inward neighbor set respectively. Since the 3DYAO algorithm has connectivity, energy support, and extroversion boundedness, the topology structure of the three-dimensional wireless sensor network constructed by the present invention has the characteristic of bidirectional boundedness. Reducing the degree of nodes can reduce the number of messages forwarded by nodes and the complexity of routing calculations, so as to reduce network interference and save energy.

以上所述仅是本发明的优选实施方式,应当指出,本发明提出这种双向度有界的三维无线传感器网络拓扑控制方法能够通过对任意满足3DYAO结构的不同算法进行两次操作达到节约能量,双向度有界,延长网络的生存时间,降低网络干扰的目的。对于本技术领域的普通技术人员来说,在不脱离本发明原理的前提下,还可以做出若干改进,或者对其中部分技术特征进行等同替换,这些改进和替换也应视为本发明的保护范围。The above is only a preferred embodiment of the present invention. It should be pointed out that the two-dimensional bounded three-dimensional wireless sensor network topology control method proposed by the present invention can save energy by performing two operations on any different algorithm that satisfies the 3DYAO structure. The two-way dimension is bounded, prolonging the survival time of the network and reducing network interference. For those of ordinary skill in the art, without departing from the principle of the present invention, some improvements can be made, or equivalent replacements can be made to some of the technical features, and these improvements and replacements should also be regarded as protection of the present invention scope.

Claims (7)

1. a 3-D wireless sensor network topology control method for two-way degree bounded, comprises following steps:
One,, for the arbitrary node u in given 3-D wireless sensor network, calculate its neighbor node collection N uBG(u) set of node that, the maximum communication distance of u can cover;
Two, with the neighbor node collection N of node u uBG(u) be input, use 3DYAO algorithm to process it, obtain the 3DYAO neighbor node collection N after u node processing yG(u);
Three, 3DYAO neighbor node collection N yG(u) to the neighbor node collection N of u uBG(u) broadcast;
Four, the interior of computing node u collects to neighbours
Figure FDA0000409838710000011
if u ∈ is N yG(v), so v being added to the interior of ingress u collects to neighbours in,
Figure FDA0000409838710000013
n wherein yG(v) refer to the 3DYAO neighbor node collection after v node processing;
Five, with the interior of node u, to neighbours, collect
Figure FDA0000409838710000014
for input, use and with 3DYAO algorithm identical in step 2, it is processed, obtain the neighbor node collection after u node processing
Figure FDA0000409838710000015
Six, set of node
Figure FDA0000409838710000016
neighbor node collection N to u uBG(u) all neighbours' broadcast in;
Seven, for N yG(u) all node v in, if u also exists
Figure FDA0000409838710000017
in, so just v is added to N yYG(u) in; Wherein
Figure FDA0000409838710000018
refer to the neighbor node collection after v node processing;
Eight, the 3-D wireless sensor network topology N of the two-way degree bounded of output node u yYG(u), adjust transmitting power for can reach N yYG(u) neighbor location farthest in.
2. a kind of network topology control method according to claim 1, is characterized in that, the 3DYAO algorithm adopting in step 2 is fixed partition method.
3. a kind of network topology control method according to claim 2, is characterized in that, described fixed partition method is: to arbitrary node u, first use three orthogonal planes that the transmission range UBG of u is divided into 8 regions, each region is 1/8 spheroid; Secondly, re-use three each regions of bundle of planes and be divided into 4 cones, like this transmission range of u has been divided into 32 cones that mutually disjoint; Finally, in any centrum, for the neighbor node collection N of u uBG(u), node u only selects the shortest limit uv of length in cone to retain; These directed edges uv has formed 3DYAO topological structure N yG(u) number of degrees of the 3DYAO structure that, this partitioning forms are 32 to the maximum.
4. a kind of network topology control method according to claim 2, is characterized in that, described fixed partition method is: to arbitrary node u, first use three orthogonal planes that the transmission range UBG of u is divided into 8 regions, each region is 1/8 spheroid; Secondly, use 6 each regions of bundle of planes to be divided into 7 cones, like this transmission range of u has been divided into 56 cones; Finally, in any centrum, for the neighbor node collection N of u uBG(u), node u only selects the shortest limit uv of length in cone to retain, and these directed edges uv has formed 3DYAO topological structure N yG(u) number of degrees of the 3DYAO structure that, this partitioning forms are 56 to the maximum.
5. a kind of network topology control method according to claim 1, is characterized in that, the 3DYAO algorithm adopting in step 2 is flexible partitioning.
6. a kind of network topology control method according to claim 5, is characterized in that, described flexible partitioning is:
1a) to arbitrary node u, first calculate its neighbor node collection;
Arbitrary neighbor node v 1b) neighbor node of node u being concentrated, establishes PROCESSED (v)=0;
1c) to arbitrary neighbor node v, and there is PROCESSED (v)=0, carry out following steps:
1. take uv as axle, the angle θ who is less than π/3 of take is drift angle, builds a cone;
2. node u selects limit uw the shortest in cone to retain, and to all neighbor node x in cone, establishes PROCESSED (x)=1;
1d) these directed edges uw has formed 3DYAO topological structure N yG(u).
7. a kind of network topology control method according to claim 5, is characterized in that, described flexible partitioning is:
2a) to arbitrary node u, first calculate its neighbor node collection;
2b) according to node u to neighbor node v ilength ascending to u v isort, || uv i||≤|| uv i+1||, i is by 1 to m, and m is neighbor node number;
2c) to all neighbor node v i, i to m, establishes PROCESSED (v by 1 i)=0;
2d) to neighbor node v i, i by 1 to m, if PROCESSED (v i)=0, carry out following steps:
1. with uv ifor axle, the angle θ who is less than 2 π/3 of take is drift angle, builds a cone;
2. node u selects limit uv iretain, and to all neighbor node w in cone, establish PROCESSED (w)=1;
2e) these directed edges u v iformed 3DYAO topological structure N yG(u).
CN201110421001.XA 2011-12-15 2011-12-15 Three-dimensional wireless sensor network topology control method with two-dimensional bounded property Expired - Fee Related CN102395182B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110421001.XA CN102395182B (en) 2011-12-15 2011-12-15 Three-dimensional wireless sensor network topology control method with two-dimensional bounded property

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110421001.XA CN102395182B (en) 2011-12-15 2011-12-15 Three-dimensional wireless sensor network topology control method with two-dimensional bounded property

Publications (2)

Publication Number Publication Date
CN102395182A CN102395182A (en) 2012-03-28
CN102395182B true CN102395182B (en) 2014-04-09

Family

ID=45862365

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110421001.XA Expired - Fee Related CN102395182B (en) 2011-12-15 2011-12-15 Three-dimensional wireless sensor network topology control method with two-dimensional bounded property

Country Status (1)

Country Link
CN (1) CN102395182B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103916262B (en) * 2013-12-17 2017-09-01 哈尔滨安天科技股份有限公司 A kind of network topology layout method and system based on three dimensions
CN113630837B (en) * 2021-09-01 2023-10-13 哈尔滨工程大学 Mountain forest fire prevention oriented three-dimensional wireless sensor network data route fusion method
CN114039683A (en) * 2021-09-07 2022-02-11 西安理工大学 Anti-jamming and fault-tolerant method of wireless ultraviolet light communication network for drone swarm

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101286910A (en) * 2008-03-05 2008-10-15 中科院嘉兴中心微系统所分中心 Task oriented wireless sensing network topology constructing method
CN102256327A (en) * 2011-07-04 2011-11-23 南京邮电大学 Self-adaptive topology control method for wireless sensor network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9031571B2 (en) * 2008-04-11 2015-05-12 Alcatel Lucent Methods and apparatus for coverage verification in a wireless sensor network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101286910A (en) * 2008-03-05 2008-10-15 中科院嘉兴中心微系统所分中心 Task oriented wireless sensing network topology constructing method
CN102256327A (en) * 2011-07-04 2011-11-23 南京邮电大学 Self-adaptive topology control method for wireless sensor network

Also Published As

Publication number Publication date
CN102395182A (en) 2012-03-28

Similar Documents

Publication Publication Date Title
Bhatia et al. A genetic algorithm based distance-aware routing protocol for wireless sensor networks
Israr et al. Multihop clustering algorithm for load balancing in wireless sensor networks
CN103347288B (en) A kind of wireless sensor network does not wait width hierarchical routing protocol method
CN105554835A (en) Toxic gas tracking method based on virtual node migration in wireless sensor network
Zhang et al. Performance analysis of cluster-based and tree-based routing protocols for wireless sensor networks
CN102395182B (en) Three-dimensional wireless sensor network topology control method with two-dimensional bounded property
Miah et al. Performance analysis of ILEACH and LEACH protocols for wireless sensor networks
SB et al. Sector based multi-hop clustering protocol for wireless sensor networks
Mishra et al. A comparative study of existing cluster-based routing protocols in wireless sensor networks
Shu et al. An optimized multi-hop routing algorithm based on clonal selection strategy for energy-efficient management in wireless sensor networks
Wang et al. An energy efficient and load balancing routing algorithm for wireless sensor networks
Durresi et al. Clustering protocol for sensor networks
Garg et al. Parametric Comparative Analysis of Underwater Wireless Sensor Networks Routing Protocols
Tchendji et al. Virtual architecture and energy-efficient routing protocols for 3D wireless sensor networks
Dhurandher et al. Optimizing energy through parabola based routing in underwater sensor networks
Gupta et al. Estimated New Routing Scheme in MANETs
CN110167095A (en) A kind of mobile Ad-Hoc algorithm network routing based on Fermat point
Gang et al. Research and realization on improved manet distance broadcast algorithm based on percolation theory
Bhat et al. Effective cluster head selection based on EDM for WSN
Li et al. Localized topologies with bounded node degree for three dimensional wireless sensor networks
Mesleh et al. AODV and DSR energy-aware routing algorithms: a comparative study
Liu et al. Research on the energy hole problem based on non-uniform node distribution for wireless sensor networks
Yadav et al. Cluster based routing schemes in wireless sensor networks: A comparative study
Santhi et al. A self-organized location aware energy efficient protocol for wireless sensor networks
Huang et al. A hexagonal grid based sink relocation method in wireless sensor networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20140409

Termination date: 20141215

EXPY Termination of patent right or utility model