New! View global litigation for patent families

CN104066142B - A method for determining data transmission in a wireless sensor network path and means - Google Patents

A method for determining data transmission in a wireless sensor network path and means Download PDF

Info

Publication number
CN104066142B
CN104066142B CN 201310094365 CN201310094365A CN104066142B CN 104066142 B CN104066142 B CN 104066142B CN 201310094365 CN201310094365 CN 201310094365 CN 201310094365 A CN201310094365 A CN 201310094365A CN 104066142 B CN104066142 B CN 104066142B
Authority
CN
Grant status
Grant
Patent type
Application number
CN 201310094365
Other languages
Chinese (zh)
Other versions
CN104066142A (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

    • Y02D70/00

Abstract

本发明公开了一种确定无线传感器网络中数据传输路径的方法及装置,能够根据功率分配确定数据传输路径,平衡协作节点的能量消耗,进而延长网络的生命周期,该方法包括:S1:确定WSN中包含的数据传输的源节点对应的加权功率分配值;S2:针对WSN除源节点之外的其他任一子节点,根据加权功率分配值,确定数据从源节点传输至子节点的第一传输代价;S3:在全部子节点中,选择第一传输代价最小的子节点加入到源节点集合中;S4:对新加入到源节点集合中的子节点和未加入到源节点集合的全部子节点做松弛操作,将新加入到返回执行源节点集合中的子节点作为源节点,返回执行步骤S2,直至将数据传输的目的节点加入到源节点集合为止。 The present invention discloses a method and apparatus for determining a wireless sensor network data transmission path, data transmission path can be determined based on the power distribution, the energy consumption balance cooperating nodes, and thus extend the life cycle of the network, the method comprising: S1: determining WSN the first transmissions for any child nodes other than the source node WSN in addition, according to the power allocation weighting value, determines the data transmission from the source node to the child node: S2; source node included in the data transmission power allocation corresponding weighting value consideration; S3: all child nodes, selects the first transmission minimum cost child node is added to the source node set; S4: new child node is added to the source node and all the sub-set of nodes are not added to the source node set do relaxation operation, a new node is added to the return to the source node to perform sub-set as the source node returns to perform step S2, the destination node until the data transfer is added to the source node set up.

Description

一种确定无线传感器网络中数据传输路径的方法及装置 A method for determining data transmission in a wireless sensor network path and means

技术领域 FIELD

[0001] 本发明涉及无线传感器网络(WSN,Wireless Sensor Network)技术领域,尤其是涉及一种确定无线传感器网络中数据传输路径的方法及装置。 [0001] The technical field relates to a wireless sensor network (WSN, Wireless Sensor Network) according to the present invention, in particular, to a wireless sensor network determines the data transmission path method and apparatus.

背景技术 Background technique

[0002] 无线信道的多径衰落阻碍了信道容量的增加和服务质量的改善。 [0002] multipath fading radio channel increases and hinders the improvement of the quality of service channel capacity. 其中多输入多输出(MIMO,Multiple_Input Multiple-〇ut-put)技术通过在接收端和发射端同时安置多根天线,既可有效对抗衰落,又能充分利用空域资源,大幅度提高信道容量。 Wherein the multiple input multiple output (MIMO, Multiple_Input Multiple-〇ut-put) technique at a receiving end and a transmitting end is disposed a plurality of antennas simultaneously, can effectively combat fading, and can make full use of airspace resources, greatly increase the channel capacity. MIMO技术已经成为无线通信领域的关键技术之一。 MIMO technology has become one of the key technologies in the field of wireless communications. 但是理想状态下的MMO多天线系统要求相邻天线之间的距离远大于载波波长,并且多个收发天线之间的传输信道必须是独立的。 However MMO multi-antenna system required in the ideal state is much larger than the distance between adjacent antenna carrier wavelength, and the transmission channel between a plurality of transmitting and receiving antennas must be independent. 然而移动终端的体积、质量和能耗都受到限制,根本无法安装多根天线。 However volume, mass, and energy consumption of the mobile terminal are limited, you can not install a plurality of antennas. 因此,虽然MBTO技术可以在蜂窝基站上运行,但是MMO技术无法应用于普通的包含多个移动终端的无线通信网络,例如由部署在监测区域内大量的廉价微型传感器节点组成无线传感器网络。 Thus, although the technique can be run on MBTO cellular base station, but the technique can not be applied MMO common wireless communication network comprising a plurality of mobile terminals, for example deployed in the monitoring region a large number of cheap micro sensor nodes of wireless sensor networks. 无线传感器网络是通过无线通信方式形成的一个多跳的自组织的网络系统,其目的是协作地感知、采集和处理网络覆盖区域中被感知对象的信息,并发送给观察者。 Wireless sensor network is a multi-hop ad hoc network system formed by the radio communication system, which is cooperatively sensing object, the information collection and processing of network coverage area of ​​the sensing target, and sent to the viewer. 由于传感节点一般数目比较庞大,部署的环境也比较复杂,人工很难随时补充或更换电池补充能量。 Because the number of sensing nodes are generally relatively large, relatively complex deployment environment, doing so is difficult to supplement or replace the battery with energy. 因此,采用有效的能量管理策略,延长网络生存周期,是无线传感器网络设计和实现的核心问题。 Therefore, effective energy management strategies, to extend the network life cycle is the core problem of wireless sensor network design and implementation.

[0003] 协作通信技术作为一种多天线技术的扩展,是利用无线广播的优势,通过共享网络中其他用户的天线,形成虚拟的MIMO天线阵列来实现发送或接收,获得增益,从而减少信息传送的能量开销。 [0003] cooperative communication technology as an extension of a multi-antenna techniques, is to take advantage of the radio, is achieved transmitted or received over a network of other users sharing the antenna, form a virtual MIMO antenna array gain is obtained, thereby reducing the information transmission energy costs. 协作路由是联合物理层的协作通信技术和网络层的路由选择技术的跨层路由方案。 Cooperative routing scheme is the cross-layer routing, and routes the network layer cooperative communication technology jointly selected physical layer technology. 协作路由可以有效的节约网络中节点的能量消耗,特别是在无线传感器网络中,由于传感节点一般数目比较庞大,部署的环境也比较复杂,人工很难随时补充或更换电池补充能量。 Collaboration can effectively save network routing node energy consumption, especially in wireless sensor networks, since the number of the sensor nodes are generally relatively large, relatively complex deployment environment, doing so is difficult to supplement or replace the battery with energy. 因此,采用有效的能量管理策略,延长网络生存周期,是无线传感器网络设计和实现的核心问题。 Therefore, effective energy management strategies, to extend the network life cycle is the core problem of wireless sensor network design and implementation.

[0004] 确定无线传感器网络中数据传输路径的方法可以是能量有效(En er gy -efficient)的协作路由算法,该算法是以最小化端到端传输总能量为目标的协作路由算法,如累加协作(PC,PrOgressive Cooperation)、基于最短路径的协作算法(CAN, Cooperation Along the Non-Cooperative)、最短路径协作(CSP,Cooperative Shortest Path)、最小功率协作(MPCR,Minimum Power Cooperative Routing)、一般最短路径算法(GSPRA,Generalized Shortest Path Routing Algorithm)等协作路由算法。 [0004] The method of determining a data transmission path in the network may be a wireless sensor cooperating energy efficient routing algorithm (En er gy -efficient), the algorithm is based on minimizing the total energy transmission end goal of cooperative routing algorithm, such as the accumulation collaboration (PC, PrOgressive cooperation), in collaboration algorithm shortest path (CAN, cooperation Along the Non-cooperative) based on the shortest path collaboration (CSP, cooperative shortest path), minimum power cooperation (MPCR, minimum power cooperative Routing), generally the shortest path algorithm (GSPRA, Generalized Shortest path routing algorithm) and other cooperative routing algorithm. 其中,PLC协作路由算法与CAN协作路由算法的基本思想是一致的,首先确定出传统传输下的数据传输的最短路径,再基于此路径选择中继从而实现协作传输。 Wherein, PLC algorithm for the basic idea of ​​cooperative routing CAN cooperative routing algorithm is the same, first determine the shortest path for data transmission at a conventional transmission, and then selecting a relay based on this path in order to achieve cooperative transmission. 二者区别在于PLC协作路由算法的比CAN协作路由算法更节省能量,但算法的复杂度高很多。 The difference is that the two cooperative routing algorithm than CAN PLC cooperative routing algorithms save more energy, but a lot of high complexity algorithm. CSP协作路由算法是以迪杰斯特拉(Di jkstra)最短路径算法作为路由算法的基本架构,并把协作传输的特性引到松弛阶段而重新设计的协作路由算法。 CSP cooperative routing algorithm is Dijkstra's (Di jkstra) as the shortest path routing algorithm Algorithm basic structure, the characteristics of the coordinated transmission and lead to relaxation phase redesigned cooperative routing algorithm. MPCR协作路由算法是一种保证一定吞吐量下的单中继选择的分布式协作路由算法。 MPCR cooperative routing algorithm is a single routing algorithm to ensure distributed cooperative relay selection under constant throughput. GSPRA是基于M頂0的分布式多跳协作路由算法。 GSPRA is based on a distributed multi-hop 0 M top cooperative routing algorithm. 无线传感网络的生存周期取决于第一个能量损耗完全的节点,因此该种方法的缺陷在于总能量的节省并不意味着能够延长无线传感网络的生存周期。 Lifetime wireless sensor network depends on the energy loss of a full node, so that the disadvantage of this method is the total energy saving is not meant to extend the lifetime of wireless sensor networks.

[0005] 下面以一具体实例来分析该种协作路由算法的缺陷:如图1所示,图1中的数字表示每传输单位数据需要消耗多少单位的电量。 [0005] In the following a specific example of the kind of defect to analyze collaboration routing algorithm: As shown, the numeral 1 shows a transmission unit of data per unit how much power consumption. 例如,数字2表示每传输单位数据需要消耗2 单位的电量,数字12表示每传输单位数据需要消耗12单位的电量。 For example, numeral 2 denotes a transmission unit of data per unit of electricity consumed 2, numeral 12 denotes a transmission unit of data per 12 units of electricity consumed. 数据需要从源节点s传输至IJ目的节点d。 Data to be transmitted from the source node s to the destination node IJ d. 其中两节点之间的边表示两节点间直接传输单位数据需要消耗的能量。 Wherein the edge between two nodes represent a direct transmission of energy between the two nodes need to consume data unit. 除节点b外的其他三个节点都是满电量的节点。 The other three nodes except node node b are full of electricity. 若选取传统多跳路由算法确定数据传输路径,数据将延传输路径{s->a,a->b,b->d}传输,且每传输单位数据需要消耗6单位的电量。 If selected, the conventional multi-hop routing algorithm determines a data transmission path, the transmission path delay data {s-> a, a-> b, b-> d} transmission, and each data transmission unit 6 units of electricity consumed. 节点b 也会因电量较少,最先耗尽电量造成整个无线传感器网络作废。 Also because less power node b, the first charge depleted causing the whole wireless sensor network void. 若采取上述协作路由算法(如CAN、PLC、CSP)来确定数据传输路径,数据将沿路径{s->a,(s,a) _>b,(a,b) ->d}传输,且将消耗5单位的电量。 When taking the above cooperative routing algorithm (e.g., CAN, PLC, CSP) to determine the data transmission path, the data along the path {s-> a, (s, a) _> b, (a, b) -> d} transmission, and 5 units of electricity will be consumed. 因此相比传统传输,协作路由算法确定出的数据传输路径,会使得传输时消耗的能量大幅降低,在一定程度上使得整个无线传感器网络的生存周期得以延长。 As compared to the conventional transmission, cooperative routing algorithm determines the data transmission path, so that energy consumption will significantly reduce the transmission, to a certain extent so that the lifetime of the entire wireless sensor network is extended.

[0006] 但是该种协作路由算法确定出的数据传输路径,未能考虑到功率分配对整个无线传感器网络的生存周期的影响。 [0006] However, this type of cooperative routing algorithm determines the data transmission path, it failed to consider the impact on the power distribution throughout the life cycle of the wireless sensor network. 例如在(a,b)_>d这一跳时,还可以适当增加节点a的传输功率,减小节点b的传输功率。 For example, in the (a, b) _> d of the jump, may also be appropriate to increase the transmission power of the node a, node b decreases transmission power. 虽然总的能量开销相比CSP协作路由算法将会增加,但能量负载均衡了,整个无线传感器网络的生存周期也将延长。 While the overall cost of energy compared to CSP cooperative routing algorithm will increase, but the energy load balancing, and the entire life cycle of wireless sensor network will be extended. 因此,现有技术中提出的协作路由算法确定出的数据传输路径并不能使整个无线传感器网络的生存周期达到最大化。 Thus, cooperative routing algorithm proposed in the prior art determines the data transmission path does not make the entire life cycle of the wireless sensor network is maximized.

发明内容 SUMMARY

[0007] 本发明实施例提供了一种确定无线传感器网络中数据传输路径的方法及装置,能够根据功率分配确定数据传输路径,平衡协作节点的能量消耗,进而延长无线传感器网络的生命周期。 Example embodiments provide a method and apparatus for determining a wireless sensor network data transmission path [0007] of the present invention, a data transmission path can be determined based on the power distribution, the energy consumption balance cooperating nodes, and thus prolong the lifetime of the wireless sensor network.

[0008] 一种确定无线传感器网络中数据传输路径的方法,包括:步骤si:确定无线传感器网络中包含的数据传输的源节点对应的加权功率分配值,其中所述加权功率分配值是源节点的初始能量和剩余能量之间的比值;步骤S2:针对无线传感器网络中除源节点之外的其他任一子节点,根据所述加权功率分配值,确定数据从源节点传输至所述子节点的第一传输代价,其中所述第一传输代价是数据在从源节点传输至该子节点之间的传输代价;步骤S3:根据确定出的第一传输代价,在全部子节点中,选择第一传输代价最小的子节点加入到源节点集合中;步骤S4:对新加入到源节点集合中的子节点和未加入到源节点集合的全部子节点做松弛操作,将新加入到返回执行源节点集合中的子节点作为源节点,返回执行步骤S2,直至将数据传输的目的节点加入到源节点集合为止,所述 [0008] A method for wireless sensor network determines the data transmission path, comprising the steps of: si: determining a weighted value of the source node power allocation data transmission in a wireless sensor network comprising a corresponding, wherein the weighting value is a power distribution source node the ratio between the initial energy and the residual energy; step S2: for any sub-wireless sensor networks other nodes other than the source node, according to the power allocation weighting value, determines that the data transmitted from the source node to the child node the cost of the first transmission, wherein the first transmission of data in the cost of transmission from the source node to the cost of transmission between the sub-node; step S3: according to the determined cost of the first transmission, all child nodes, selection a transmission minimum cost child node to the source node set; step S4: new added to the child node of the source node set and all the sub-node is not added to the source node set do relaxation operation, the newly added to the return perform source sub-set of nodes as the source node returns to perform step S2, the destination node until the data transmission is added up to a source node set, the 源节点集合中包含的所有元素组成的数据传输路径作为协作传输模式下的数据传输路径。 A data transmission path set in the source node contains all the elements of a data transmission path as the cooperation mode.

[0009] —种确定无线传感器网络中数据传输路径的装置,包括:加权功率分配值确定模块,用于确定无线传感器网络中包含的数据传输的源节点对应的加权功率分配值,其中所述加权功率分配值是源节点的初始能量和剩余能量之间的比值;第一传输代价确定模块, 用于针对无线传感器网络中除源节点之外的其他任一子节点,根据所述加权功率分配值, 确定数据从源节点传输至所述子节点的第一传输代价,其中所述第一传输代价是数据在从源节点传输至该子节点之间的传输代价;选取模块,用于根据确定出的第一传输代价,在全部子节点中,选择第一传输代价最小的子节点加入到源节点集合中;松弛操作模块,用于对新加入到源节点集合中的子节点和未加入到源节点集合的全部子节点做松弛操作,将新加入到返回执行源节点集合中的子节点作为源节点, [0009] - determining the kind of apparatus for wireless sensor networks data transmission path, comprising: a power allocation weighting value determining means for determining a weighted value of the source node power allocation data transmission in a wireless sensor network comprising a corresponding, wherein the weight power allocation value is the ratio between the initial energy source node and a residual energy; cost determining a first transmission means for wireless sensor networks other any child nodes other than the source node, according to the power allocation weighting value determining the data transmitted from the source node to the first child node of the cost of transmission, wherein the first transmission of data at the expense of transmission from the source node to the cost of transmission between the sub-node; selection means for determining in accordance with the the cost of the first transmission, all child nodes, selects the first transmission minimum cost child node is added to the source node set; relaxation operation module for the new child node is added to the set of the source node to the source and not added all the sub-set of nodes do relaxation operation, a new node is added to the return to the source node to perform sub-set of nodes as the source, 触发第一传输代价确定模块,直至将数据传输的目的节点加入到源节点集合为止,所述源节点集合中包含的所有元素组成的数据传输路径作为协作传输模式下的数据传输路径。 Triggering a first transmission cost determination module, until the destination node is added to the data transmission until the source node set, the source node set contains all the elements of the data transfer path as a data transmission path in cooperation transmission mode.

[0010] 采用上述技术方案,通过步骤一确定无线传感器网络中包含的数据传输的源节点对应的加权功率分配值,以及步骤二针对无线传感器网络中除源节点之外的其他任一子节点,根据所述加权功率分配值,确定数据从源节点传输至所述子节点的第一传输代价;然后在全部子节点中,选择第一传输代价最小的子节点加入到源节点集合中,最后对新加入到源节点集合中的子节点和未加入到源节点集合的全部子节点做松弛操作,将新加入到返回执行源节点集合中的子节点作为源节点,返回执行步骤二,直至将数据传输的目的节点加入到源节点集合为止,所述源节点集合中包含的所有元素组成的数据传输路径作为协作传输模式下的数据传输路径。 [0010] With the above technical solution, the weighted value of the source node power allocation transmission data included in the wireless sensor network is determined by a corresponding step, as well as any sub-step two other nodes in the wireless sensor networks other than the source node, the power allocation value to the weighted determining the data transmitted from the source node to the first child node cost of transmission; then all the child nodes, selects the first transmission minimum cost child node is added to the source node set, finally newly added to the child node of the source node set and all the sub-node is not added to the source node set do relaxation operation, the newly added to the return to execution child node of the source node set as the source node returns to step two, until the data is the transmission destination node until a source node set is added, the data transmission path to the source node of the set of all the elements contained in the data transmission path as the cooperation mode. 相比现有技术,本发明上述提出的技术方案,引入加权功率分配值,在现有技术中提出的基于最短路径算法确定数据传输路径上,进行扩展,使得协作通信中,协作传输过程中功率分配方式更加合理,使得路由路径的选择更加适合于协作传输。 Compared with the prior art, the technical solution of the present invention set forth above, the introduction of a weighted power allocation value proposed in the prior art based on a shortest path algorithm determines a data transmission path, extended, so that cooperative communication, the cooperating power transmission process more rational distribution, so that more routing paths suitable for cooperative transmission. 能够根据功率分配确定数据传输路径,平衡协作节点的能量消耗,进而延长无线传感器网络的生命周期。 Power allocation can be determined according to a data transmission path, the energy consumption balance of cooperating nodes, and thus prolong the lifetime of the wireless sensor network.

附图说明 BRIEF DESCRIPTION

[0011] 图1为现有技术中,提出的简单无线传感器网络拓扑结构示意图; [0011] FIG. 1 is a schematic diagram of a simple wireless sensor network topology in the prior art, is proposed;

[0012] 图2为本发明实施例一中,提出的确定无线传感器网络中数据传输路径的方法流程图; [0012] In an embodiment of FIG. 2 embodiment of the present invention, a method for determining data transmission in wireless sensor networks proposed flowchart path;

[0013]图3a为本发明实施例一中,提出的点对点传输模式不意图; [0013] FIG. 3a in an embodiment of the present invention, point to point transmission mode is not intended to set forth;

[0014] 图3b为本发明实施例一中,提出的广播传输模式示意图; [0014] FIG. 3b in an embodiment of the present invention, a schematic diagram of the proposed broadcast transmission mode;

[0015] 图3c为本发明实施例一中,提出的多对点传输模式示意图; [0015] FIG. 3c embodiment of the present invention in a schematic view of the proposed multi-point transmission mode;

[0016] 图3d为本发明实施例一中,提出的协作广播传输模式示意图; [0016] FIG. 3d in an embodiment of the present invention, a schematic diagram of the proposed mode of cooperative broadcast transmission;

[0017] 图4为本发明实施例一中,提出的WSN中传输节点拓扑示意图; WSN transmission node topology diagram of a proposed embodiment in the embodiment [0017] of the present invention, FIG. 4,;

[0018] 图5为本发明实施例一中,提出的MNLCR不同场景性能对比示意图; [0018] In FIG 5 an embodiment of the present invention, the performance of different scenarios presented MNLCR schematic comparison;

[0019] 图6为本发明实施例一中,提出的不同节点密度MNLCR性能对比示意图; [0019] FIG. 6 in an embodiment of the present invention, various properties of the proposed node density MNLCR schematic comparison;

[0020] 图7为本发明实施例一中,提出的算法性能对比示意图; [0020] In Figure 7 an embodiment of the present invention, the performance of the proposed algorithm is a schematic comparison;

[0021] 图8为本发明实施例二中,提出的确定无线传感器网络中数据传输路径的装置结构示意图。 It means a schematic configuration of the wireless sensor network determines the data transmission path of the second embodiment of the proposed [0021] FIG. 8 of the present invention.

具体实施方式 detailed description

[0022] 针对现有技术中提出的协作路由算法确定出的数据传输路径并不能使整个无线传感器网络的生存周期达到最大化的问题,本发明实施例这里提出的技术方案,引入加权功率分配值,在现有技术中提出的基于最短路径算法确定数据传输路径上,进行扩展,使得协作通信中,协作传输过程中功率分配方式更加合理,使得路由路径的选择更加适合于协作传输,从而能够根据功率分配确定数据传输路径,平衡协作节点的能量消耗,进而延长无线传感器网络的生命周期。 [0022] determined for cooperative routing algorithm proposed in the prior art does not make the data transmission path throughout the life cycle of the wireless sensor network to achieve maximization problem, technical solutions of embodiments of the invention set forth herein, the introduction of a weighted power allocation value proposed in the prior art based on a shortest path algorithm determines a data transmission path, extended, so that cooperative communication, cooperative transmission power allocation process more rational manner so as to select the routing path more suitable for coordinated transmission, it is possible according to the power distribution determining a data transmission path, the energy consumption balance of cooperating nodes, and thus prolong the lifetime of the wireless sensor network.

[0023]下面将结合各个附图对本发明实施例技术方案的主要实现原理、具体实施方式及其对应能够达到的有益效果进行详细地阐述。 [0023] The main implementation principle below with reference to the various figures of the technical solution of the embodiments of the present invention, the specific embodiments and the corresponding beneficial effects that can be achieved are set forth in detail.

[0024] 实施例一 [0024] Example a

[0025] 本发明实施例一这里提出一种确定无线传感器网络中数据传输路径的方法,本发明实施例一这里提出的技术方案中,首先权衡考虑节点初始能量、剩余能量和协作传输的能量开销等因素,提出一种加权的协作传输功率分配方式,即提出加权功率分配值也就是说,加权功率分配值是源节点的初始能量和剩余能量之间的比值,然后在得到的加权功率分配值的基础上,提出一种最大化网络生存周期的协作路由算法(MNLCR,Cooperative Routing Algorithm for Maximizing Network Lifetime),来确定无线传感器网络中的数据传输路径。 Embodiment [0025] The present invention herein provides a method for determining a wireless sensor network data transmission path, the embodiment of the present invention of an embodiment presented herein, first consider nodes weighed initial energy, the energy cost and the remaining energy of the coordinated transmission and other factors, presents a weighted distribution cooperative transmission power, i.e. power allocation weighting value that is proposed, is a weighted value of the power allocation ratio between the initial energy of a source node and a residual energy, and the weighted power allocation value obtained in the proposed based on maximizing network routing algorithm cooperative life cycle (MNLCR, cooperative routing algorithm for maximizing network Lifetime), to determine the data transmission path of the wireless sensor network. 如图2所示,主要包括下述四个步骤: 2, mainly includes the following four steps:

[0026] 步骤SI,确定无线传感器网络中包含的数据传输的源节点对应的加权功率分配值。 [0026] Step SI, determining a weighted value of the source node power allocation data transmission in a wireless sensor network comprising a corresponding.

[0027] 步骤S2,针对无线传感器网络中除源节点之外的其他任一子节点,根据步骤Sl中确定出的加权功率分配值,确定数据从源节点传输至所述子节点的第一传输代价。 [0027] Step S2, the other wireless sensor networks other than any child node of the source node, according to the determined power allocation in step Sl weighted value, determines that the data transmitted from the source node to the child node of the first transmission cost.

[0028] 步骤S3,根据确定出的第一传输代价,在全部子节点中,选择第一传输代价最小的子节点加入到源节点集合中。 [0028] Step S3, the first transmission according to the determined cost of all child nodes, selects the first transmission minimum cost child node is added to the source node collection.

[0029] 步骤S4:对新加入到源节点集合中的子节点和未加入到源节点集合的全部子节点做松弛操作,将新加入到返回执行源节点集合中的子节点作为源节点,返回执行步骤S2,直至将数据传输的目的节点加入到源节点集合为止,所述源节点集合中包含的所有元素组成的数据传输路径作为协作传输模式下的数据传输路径。 [0029] Step S4: The new added to the child node of the source node set and all the sub-node is not added to the source node set do relaxation operation, the newly added to the return to execution child node of the source node set as the source node, returns performing step S2, the destination node until the data transmission until the source node is added to the set, the data transmission path to the source node set consisting of all elements contained in a data transmission path as the cooperation mode.

[0030] 下面对本发明实施例这里提出的技术方案作出进一步详细说明。 Technical Solution [0030] Hereinafter, embodiments of the present invention set forth herein to be described in further detail.

[0031] 实施例一 [0031] Example a

[0032] 步骤一,确定无线传感器网络中包含的数据传输的源节点对应的加权功率分配值。 [0032] a step of determining the data transmission in a wireless sensor network comprising a source node corresponding weighting power allocation value.

[0033] 加权功率分配值是源节点的初始能量和剩余能量之间的比值。 [0033] The power allocation weighting value is the ratio between the initial energy source node and a residual energy. 无线传感器网络中,数据传输一般包含多跳。 Wireless sensor networks generally comprise a multi-hop data transmission. 其中在多跳协作传输过程中,数据传输的每一跳都可以包含四种不同传输的形式,具体可以参见图3a〜3d所示,不同的传输形式对应不同的功率分配方式与能量损耗。 Wherein the multi-hop cooperative transmission, each data transmission can hop contains four different forms of transport, see Fig 3a~3d specifically shown, different forms corresponding to different transmission power allocation and the energy loss. 因此不同的协作传输方式进行数据传输对无线传感器网络的生存周期也有不同的影响。 Thus, different coordinated transmission mode for data transmission lifetime for wireless sensor networks have different effects. 具体为: Specifically:

[0034]第一种数据传输模式:如图3a所;^,属于点对点的数据传输模式,该种传输模式也可以称之为传统模式,该种传输模式下,源节点集合为S= {si},目的节点集合为T= {tl}。 [0034] The first data transmission mode: As shown in FIG. 3a; ^, belonging to point data transmission mode of the transmission modes can also be called conventional mode, the transmission modes, a source node set is S = {si }, the destination node is set T = {tl}. [0035]第二种数据传输模式:如图3b所示,属于广播模式,该种数据传输模式也归属于点对多的数据传输,该种传输模式下,源节点集合为S= {si},目的节点集合为T= {tl,t2,···, tm}。 [0035] The second data transmission mode: As shown in FIG. 3b, belonging to the broadcast mode, the kinds of data transmission mode is also attributable to the multi-point data transmission, this transmission modes, a source node set is S = {si} , the destination node is set T = {tl, t2, ···, tm}. 广播模式中,数据传输利用了无线传输的广播特性,在信号覆盖范围内的各节点都能够的接收到信号。 In broadcast mode, the data transmission using the broadcast nature of radio transmissions, each node in the coverage area of ​​the signal can be received. 因此,在广播模式下,点对多传输过程中,链路代价以链路开销最大的传输节点为准,链路开销小于最大节点的都能不耗费能量的接收到信号。 Thus, in a broadcast mode, the point to multipoint transmission, the link cost of the link to the transit node whichever is the most expensive, the link cost is less than the maximum node can not consume energy received signal.

[0036]第三种数据传输模式:如图3c所不,属于协作模式,该种数据传输模式也属于多对点传输,如源节点集合为S= {si,s2, ,目的节点集合为T= {tl}。 [0036] The third data transfer modes: FIG. 3c do not belong cooperative mode, the kinds of data transmission modes belong to multiple point transmission, such as the source node for the set S = {si, s2,, T set is the destination node = {tl}.

[0037]第四种数据传输模式:如图3d所示,属于协作广播传输模式,该种传输模式也属于多对多的数据传输,源节点集合为S= {sl,s2,H_,sm},目的节点集合为T= {ΐ1,ΐ2,···,ΐπι}。 [0037] A fourth data transfer modes: shown in Figure 3d, is cooperative broadcast transmission mode, the transmission modes belong to-many data transmission, a source node set is S = {sl, s2, H_, sm} , the destination node is set T = {ΐ1, ΐ2, ···, ΐπι}.

[0038] 上述在无线传感器网络中的四种数据传输模式,不同的数据传输模式有其不同的优缺点。 [0038] The four data transmission mode in a wireless sensor network, different data transfer modes which have different advantages and disadvantages. 其中,协作广播传输模式下,数据传输的源节点和目的节点都是多个,因此数据传输过程中信令成本、时间同步开销、干扰范围等都大幅增加。 Wherein, in collaboration with the broadcast transmission mode, the source node and the destination node are a plurality of data transmission, and therefore the cost of data transmission of signaling, synchronization overhead time, and so a substantial increase in the interference range. 因此本发明实施例一这里提出的技术方案中,主要是基于协作模式的数据传输,即图3c所示的协作模式。 Thus, the present invention is a technical solutions according to embodiments herein proposed, is primarily based collaboration data transmission mode, i.e., as shown in FIG. 3c cooperative mode.

[0039] 在无线传感器网络中,数据传输过程中,由于参与数据传输的多个源节点在初始能量Ei和剩余能量Ri上是有差别的,所以在确定数据传输路径时,则希望剩余能量不足的源节点不需要消耗较多的能量。 [0039] In wireless sensor networks, the data transmission process, since multiple source nodes involved in data transmission on the initial energy Ei and Ri the residual energy there is a difference, it is determined at the time of data transmission path, the residual energy is less than desirable the source node does not need to consume more energy. 因此,本发明实施例一这里提出的技术方案中,在协作传输通信中,结合考虑源节点的初始能量与剩余能量的比值Ei :Ri来确定数据传输路径。 Accordingly, a technical solution according to embodiments of the invention presented herein, in cooperative communication transmission, the binding ratio of the initial energy Ei consider the source node and the remaining energy: Ri determines the data transmission path. 例如在数据传输过程中,当两个节点消耗同样能量时,比值大的节点需要比比值小的传输节点付出更多的传输代价。 For example, in data transmission, when two nodes consume the same power, the ratio is greater than the ratio of the smaller node needs to pay more transit node transmission costs. 因此,在无线传感器网络中,确定无线传感器网络中包含的数据传输的源节点的初始能量值和剩余能量值,根据初始能量值和剩余能量值,确定源节点对应的加权功率分配值。 Thus, in the wireless sensor network, to determine the initial and residual energy value energy value of the transmission source node of the data contained in the wireless sensor network, according to the initial energy value and residual energy values, determining a weighted value of the power allocation corresponding to the source node.

[0040] 具体地,可以按照下述公式1来确定源节点对应的加权功率分配值: [0040] Specifically, a power allocation value to determine the weighting corresponding to the source node according to the following equation:

Figure CN104066142BD00111

[0042] 其中,P1是加权功率分配值,E1是源节点i的初始能量值,心是源节点i的剩余能量值,X是加权参数。 [0042] wherein, Pl is the weighted power allocation value, the energy value E1 is the initial source node i, the heart is the residual energy value of the source node i, X is a weighting parameter. X是定义了在功率分配中,节点初始能量Ei和剩余能量Ri的比值与节点需消耗能量之间的权重关系。 X is defined in the power distribution, the initial energy Ei Ri node remaining energy ratio and the node consumes a heavy weight relationship between the energy. 加权参数X的取值越大,表示在协作传输模式下,功率分配方案更注重该传输节点的剩余能量百分比,反之,加权参数X的取值越小,表示在协作传输模式下,功率分配方案更注重完成数据传输需要消耗的能量。 The larger the value of the weighting parameter X, represented in the cooperation mode, power allocation scheme is more emphasis on the percentage of the residual energy of the transit node, on the contrary, the smaller the value of the weighting parameter X, represented in the cooperation mode, power allocation scheme pay more attention to the completion of energy consumed by data transfer needs. 当X = O时,表示在协作传输模式下,功率分配方案仅考虑数据传输需要消耗的能量,而不考虑该传输节点的剩余能量百分比。 When X = O, it means that in the cooperation mode, power allocation transmission scheme needs to consider only the energy consumption data, regardless of the residual energy of the transit node percentage.

[0043] 步骤二,针对无线传感器网络中除源节点之外的其他任一子节点,根据步骤一确定出的加权功率分配值,确定数据从源节点传输至该子节点的第一传输代价。 [0043] Step two, other wireless sensor networks other than any child node of the source node, according to step a determined power allocation weighting value, determines a data transmission from a source node to a first child node of the transmission expense.

[0044] 其中第一传输代价是数据在从源节点传输至该子节点之间的传输代价。 [0044] wherein the first transmission of data in the cost of transmission from a source node to a transmission cost between the child node. 针对任一子节点,首先确定该子节点是否是源节点的相邻节点,如果判断结果为是,则确定源节点的发送功率值,将确定出的加权功率分配值和发送功率值相乘,得到的乘积作为数据从源节点传输至该子节点的第一传输代价。 For any child node, the child node first determines whether the neighboring node is the source node, if the determination result is yes, the source node transmit power value is determined, multiplied by the determined weighting value and power allocation transmission power value, to give the product as a data transmission from a source node to a first child node of the transmission expense. 反之,如果判断结果为否,则确定该子节点的第一传输代价为无穷大。 Conversely, if the determination result is NO, the cost of transmitting a first child node is determined to infinity.

[0045]步骤三,根据确定出的第一传输代价,在全部子节点中,选择第一传输代价最小的子节点加入到源节点集合中。 [0045] Step three, according to the determined first transmission cost in all sub-nodes, selects the first transmission minimum cost child node is added to the source node collection.

[0046] 步骤四,对新加入到源节点集合中的子节点和未加入到源节点集合的全部子节点做松弛操作,将新加入到返回执行源节点集合中的子节点作为源节点,返回执行步骤二,直至将数据传输的目的节点加入到源节点集合为止,源节点集合中包含的所有元素组成的数据传输路径作为协作传输模式下的数据传输路径。 [0046] Step 4 of the new added to the child node of the source node set and all the sub-node is not added to the source node set do relaxation operation, the newly added to the child node of the source node sets Returns executed as a source node, returns step two, until the destination node is added to the data transmission until the source node set, the data transmission path source node set contains all the elements of a data transmission path as the cooperation mode.

[0047] 其中,确定第二传输代价,其中第二传输代价是数据在从源节点传输至新加入到源节点集合中的子节点之间的传输代价; [0047] wherein determining the cost of a second transmission, wherein the second transmission at the expense of the cost of transmission between the sub-nodes in the data transmitted from the source node to the source node is added to the new set;

[0048] 在确定出第二传输代价之后,针对任一未加入到源节点集合的子节点,执行下述操作: [0048] After determining the second transmission cost for any one set is not added to the source node of the child node, performs the following operations:

[0049] 分别确定第三传输代价和加权代价,其中第三传输代价是数据在从源节点传输至该未加入到源节点集合中的子节点之间的传输代价,加权代价是数据在从新加入到源节点集合中的子节点与之前加入到的源节点集合中的子节点之间通过协作通信,协作传输到该未加入到源节点集合中的子节点之间的传输代价; [0049] The third transmission costs and are weighted to determine the price, the cost of transport wherein the third transport cost between the child node is not added to data transmitted from the source node to the source node in the set of weighting in the cost of the new data was added set between the sub-node to the source node of the sub-set before being added to the source node via cooperative communication, collaboration to the transmission cost between the child node is added to the source node is not set;

[0050] 若确定出的第三传输代价大于第二传输代价和加权传输代价的和值; [0050] If it is determined that the third transmission costs and cost of transport is greater than the second weighting value and the cost of the transmission;

[0051] 则将新加入到源节点集合的子节点设置为排列在该未加入到源节点集合中的子节点的前节点。 [0051] will be added to the new source node to the set of child nodes arranged in front of the node is not the source node is added to the set of child nodes.

[0052] 其中,加权代价,可以按照下述方式确定: [0052] wherein weighting the cost may be determined in the following manner:

[0053] 确定源节点集合中包含的各子节点之间通过协作通信,协作传输到新加入到源节点集合中的子节点的最短传输路径,获得最短传输路径包含的子节点数量信息;判断该获得的子节点数量信息是否大于等于预先设定的协作子节点数量信息;如果是,则以待加入到源节点结合的子节点作为目的节点,按照功率分配函数,将预先设定的协作子节点数量信息的子节点,协作传输到该目的节点的传输代价作为加权代价,如果否,则以待加入到源节点集合的子节点作为目的节点,按照功率分配函数,将包含新加入到源节点集合中的子节点的最短传输路径中的所有子节点,协作传输到该目的节点的传输代价作为加权代价。 [0053] The determination between the sub-node of the source node included in the set to the shortest transmission path to the newly added child node of the source node set, information on the number of child nodes to obtain the shortest transmission path includes cooperative communication, through cooperative transmission; Analyzing the whether the number of child nodes is greater than the amount of information obtained cooperating child node information equal to a preset; if so, places the child nodes to be added to the combination of the source node as a destination node, in accordance with the power distribution function, the predetermined child nodes cooperative child node number information to the transmission cost of coordination for the destination node as the weighted consideration, if not, the places to be added to the set of child nodes of the source node as a destination node, in accordance with the power distribution function, comprising a source node to a newly added set all child nodes of the child node of the shortest transmission path in the collaboration to the transmission destination node as a consideration for the weighted costs.

[0054] 其中,功率分配函数可以按照下述方式确定: [0054] wherein the power distribution function may be determined in the following manner:

[0055] 首先根据源节点对应的加权功率分配值,确定符合下述约束条件的目标函数。 [0055] First, according to the weighted value of the power distribution corresponding to the source node, determining the objective function subject to the following constraints.

[0056] 第一约束条件:接收端联合接收的信噪比大于预设门限值。 [0056] The first constraint: the joint terminal receiving the received SNR greater than a predetermined threshold.

[0057] 第二约束条件:源节点发送数据时对应的信号幅值的绝对值小于等于额定功率值开平方。 [0057] The second constraint: the absolute value of the amplitude of the signal corresponding to the transmission data source node equal to the rated power value is smaller than the square root.

[0058] 其次,基于拉格朗日乘值法对所述目标函数求解,确定出功率分配函数。 [0058] Next, based on the value of the Lagrange multiplier method for solving the objective function, it is determined that the power distribution function.

[0059] 具体地,目标函数可以采用下述公式2表示: [0059] Specifically, the objective function can be expressed using the following equation 2:

Figure CN104066142BD00121

[0061] 其中 [0061] in which

Figure CN104066142BD00122

是源节点对应的加权功率分配值,Ei是源节点i的初始能量值,Ri是源节点i的剩余能量值,X是加权参数,I ω, I2是源节点i发送数据时的发送功率。 Is the weighted power allocation value source corresponding node, Ei is the initial energy value of the source node i, Ri is the remaining energy value of the source node i, X is a weighting parameter, I ω, I2 is the transmission power of source node i to transmit data.

[0062] 具体地,第一约束条件采用下述公式3表示: [0062] Specifically, the first constraint expressed using the following equation 3:

Figure CN104066142BD00123

[0064] 其中,SNRmin是预设门限值 [0064] wherein, SNRmin is the preset threshold value

Figure CN104066142BD00124

.是接收端联合接收的信噪比,η⑴是接收到的噪声,Pn是噪声η⑴所对应的功率,an表示发送节点i到接收节点t的功率衰减系数的开平方。 . Joint receiving terminal received SNR, η⑴ is the received noise, Pn is the noise power corresponding η⑴, an denotes a transmission power of node i to receiving node t of the square root attenuation coefficient.

[0065] 第二约束条件采用下述公式4表示: [0065] The second constraint using the following equation (4):

Figure CN104066142BD00131

[0067] 其中,I ω , I是源节点发送数据时对应的信号幅值的绝对值, [0067] wherein, I ω, I is the absolute value of the signal amplitude of the transmission data corresponding to the source node,

Figure CN104066142BD00132

是源节点额定功率值开平方。 The source node is the square root of the rated power value.

[0068] 具体地,确定出的功率分配函数可以采用下述公式5来表示: [0068] In particular, the power allocation determined using the following function can be expressed by Equation 5:

Figure CN104066142BD00133

[0070] 其中,SNRmin是预设门限值 [0070] wherein, SNRmin is the preset threshold value

Figure CN104066142BD00134

是源节点对应的加权功率分配值,源节点i 的初始能量值,1^是源节点i的剩余能量值,X是加权参数,NM2是源节点i发送数据时的发送功率,η⑴是接收到的噪声,Pn是噪声η⑴所对应的功率,Ctil2表示发送节点i到接收节点ti的功率衰减系数。 The source node corresponding weighting power allocation value, the initial energy value of the source node i, 1 ^ is the remaining energy value of the source node i, X is a weighting parameter, NM2 are a transmission power when transmitting data source node i, η⑴ is received noise, Pn is the noise power corresponding η⑴, Ctil2 represents the sending node to the receiving node i ti power attenuation coefficient.

[0071] 具体实施中,为便于阐述,本发明实施例一这里将基于图3c所示的协作传输模式, 以数据传输过程中一跳为例来详细阐述最大化网络生命周期的功率分配方式,即确定功率分配函数的具体处理过程。 [0071] In particular embodiments, for the purposes of illustration, embodiments of the invention herein will be based on a coordinated transmission mode shown in FIG 3c, the data transmission hops in detail an example power distribution network to maximize the life cycle, That specific process power allocation determination function.

[0072] 在协作传输模式下,如图3d所示,接收端(即目的节点)T接收的信号可以采用下述公式6表不: [0072] In the coordinated transmission mode, shown in Figure 3d, the receiving end (i.e., destination node) T signal can be received using the following equation in Table 6 are not:

Figure CN104066142BD00135

[0074] 其中,r⑴是接收端T接收到的信号(相当于目的节点接收到的数据),I ω i I是源节点i发送数据时的发送功率开平方后的绝对值,n (t)是接收到的噪声,an是发送节点i到接收节点ti的功率衰减系数的开平方,Φ (t)表示单位功率发送的信号。 [0074] wherein, r⑴ T is the received signal received by the terminal (corresponding to the data received by the destination), I ω i I is the transmission power of source node i to transmit data after the absolute value of the square root, n (t) is the received noise, an i is the transmitting node to the receiving node ti power square root attenuation coefficient, Φ (t) represents a unit power transmitted signal.

[0075] 假设发送端(源节点)和接收端(目的节点)接收同步,则当接收端联合接收的信噪比大于门限值SNRmin,接收端可以将接收到的数据进行正确解码。 [0075] Suppose the transmission side (source) and the receiver (destination node) receives the synchronization, the receiving end when the joint reception SNR SNRmin greater than the threshold, the receiving end may be received correctly decode the data. 此时,源节点传输的总能量(也可以是总功率)是〇. At this time, the source node transmits the total energy (which may be the total power) is square.

[0076] 在无线传感器网络中,数据传输过程中,由于参与数据传输的多个源节点在初始能量Ei和剩余能量Ri上是有差别的,所以在确定数据传输路径时,则希望剩余能量不足的源节点不需要消耗较多的能量。 [0076] In wireless sensor networks, the data transmission process, since multiple source nodes involved in data transmission on the initial energy Ei and Ri the residual energy there is a difference, it is determined at the time of data transmission path, the residual energy is less than desirable the source node does not need to consume more energy. 因此,根据上述公式2〜公式4可知,协作通信中,协作传输模式下,单跳数据传输时目标优化函数为: Thus optimization objective function, the above equation 2 ~ 4 seen from the formula, in cooperative communication, the cooperation mode, single-hop data transmission:

Figure CN104066142BD00136

Figure CN104066142BD00141

[0080]确定出目标优化函数和约束条件之后,可以通过拉格朗日乘值法求解对目标优化函数进行求解,得到下述公式: After [0080] the determined objective function and optimization constraints may be solved optimization target function is solved by multiplying the value of the Lagrange method, to obtain the following formula:

Figure CN104066142BD00142

[0082] 然后对得到的上述公式进行求导得到: [0082] Then the above formula is obtained derivative obtained:

Figure CN104066142BD00143

[0085] 联合上述两个公式,求解可得公式5中的功率分配函数: [0085] Combined the above two equations, solving power distribution function of Equation 5 can be obtained:

Figure CN104066142BD00144

[0087] 上述公式即是在协作通信中,在单跳协作传输中,数据传输结合(源节点集合)S的发送功率的最佳分配方式。 [0087] That is, in the above formula cooperative communication, in a single-hop cooperative transmission, the data transmission by the best allocation of transmission power (source node set) S is.

[0088] 在协作通信中,采用加权的功率分配方式,能够平衡参与协作传输节点的负载,从而延长该无线传感器网络的生命周期。 [0088] In cooperative communication, power distribution weighted, participate in load balancing can be coordinated transmission node, thus extending the life cycle of the wireless sensor network. 并且由于考虑到源节点的初始能量与剩余能量的选路方式,能使得在基于路由算法确定数据传输路径时,避免选择能量不足的节点参与协作传输。 Taking into account the routing and mode initiation energy source node with the remaining energy can be such that when it is determined based on the data transmission path routing algorithm, the nodes avoid the shortage of energy involved in the choice of the coordinated transmission.

[0089] 下面以一具体实例来详细阐述上述步骤一〜步骤四的具体实施方式。 [0089] In the following a specific example of the above-described steps to elaborate a specific manner to Step fourth embodiment. 本发明实施例一上述提出的在协作传输模式下,基于丽LCR (X)算法来确定数据传输路径,该算法基本思想是: Example One embodiment of the present invention set forth above in the cooperative transmission mode to determine the data transmission path Li LCR (X) algorithm, the basic idea of ​​the algorithm is:

[0090] 将无线传感器网络表示为一张带权重的能量衰耗图G= (V,E),其中V表示传输节点集合,E表示传输链路集合,Ei与Ri分别表示传输节点i的初始能量与剩余能量,Pi j表示传输节点i到传输节点j在传统模式下(即点对点传输模式下)传输时的最小发送功率。 [0090] The wireless sensor network is represented as a weight weighted FIG energy attenuation G = (V, E), where V represents the set of transit nodes, E is the set of transmission link, Ei and Ri, respectively, represent initial transmission node i energy and the remaining energy, Pi j represents the transmission transit node i to node j at the minimum transmission power is transmitted in the conventional mode (i.e., the point to point transmission mode). 其中,在上述程序中,需要设定传输链路eije E的初始权重为 Wherein, in the above-described procedure, it is necessary to set the initial weight of transmission link weight eije E

Figure CN104066142BD00145

Coop (u,v)表示数据通过传输节点U与其前k-1个传输节点协作传输到传输节点V的加权代价,Coop (u,V)值可表示为 Coop (u, v) represents the data transmission node U k-1 before its transmission to the nodes through cooperative transmission weighting of the cost of the transit nodes V, Coop (u, V) values ​​can be expressed as

Figure CN104066142BD00151

则是路径选取的权重值。 Is selected path weight value. Cost [V]是数据在源节点到节点V的传输链路上的传输代价。 Cost [V] is the cost of transmission over the transmission link data at the source node to the node V. Cost [u]是数据从源节点到传输节点V的前续传输节点u的传输链路上的传输代价。 Cost [u] is the cost of transmission on the data from the source node u to node transmissions Continued transmission V node transmission links. 把图G顶点集合V分成两组,第一组为已求出最短路径的顶点集合(用S表示, 初始时S中只有一个源点,以后每求得一条最短路径,就将加入到集合S中,直到全部顶点都加入到S中,算法就结束了),第二组为其余未确定最短路径的顶点集合(用U表示),按最短路径长度的递增次序依次把第二组的顶点加入S中。 The set V of vertices of graph G into two groups, a first group was determined set of vertices has the shortest path (represented by S, initially only a source S, each obtained after a shortest path, it will be added to the set S until all of the vertices are added to the S, the algorithm is finished), a second set of group of vertices for the remaining undetermined shortest path (indicated by the U-), ascending order of the shortest path length are sequentially added to the apex of the second group S in. 则可以通过执行下述程序来执行步骤一〜步骤四: May be performed by executing the following procedure steps a ~ Step Four:

[0091] Stepl:初始化S= {s} ;U = V-{s}; [0091] Stepl: Initialization S = {s}; U = V- {s};

[0092] 对于所有传输节点ieu [0092] For all transmission nodes ieu

[0093] 若传输节点i是源节点的邻节点,Cost[i] = (;Es/Rs) xPsi; [0093] When the transmission source node i is a neighbor node, Cost [i] = (; Es / Rs) xPsi;

[0094] 若传输节点i不是源节点的邻节点,Cost [i] [0094] If the neighbor node i is not the transmission source node, Cost [i]

[0095] Step2:在集合U中选取一个其Cost [u]最小的顶点u,且不在S中,加入S; [0095] Step2: select one of its Cost [u] minimum vertex u, and not in S, S is added to the set U;

[0096] 贝阳=5+{11};11 = 1]-{11}; [0096] male shell 11} = {5 +; 1 = 11] - {11};

[0097] Step3:对于U中其他节点V进行松弛操作。 [0097] Step3: For other nodes V U relaxation operation.

[0098] Relax (u, v); [0098] Relax (u, v);

[0099] 重复上述Step2、Step3,直到S中包含所有顶点,S卩S = V,U={}为止。 [0099] Repeat the above Step2, Step3, until all vertices contained in S, S Jie S = V, U = {} far.

[0100] 其中,松弛操作调用函数可以通过执行下述程序来实现: [0100] wherein the relaxation operation may be implemented by calling the function performed by the following procedure:

Figure CN104066142BD00152

[0102]协作代价函数可以通过执行下述程序来实现: [0102] collaboration cost function may be realized by executing the following procedure:

Figure CN104066142BD00153

Figure CN104066142BD00161

[0105] 下面通过模拟实验来对本发明实施例一这里提出的技术方案进行分析,并将本发明实施例这里提出的基于MNLCR算法确定数据传输路径和基于现有技术中提出的算法确定数据传输路径对无线传感器网络的生命周期的影响。 [0105] The following simulation experiment was a technical solutions proposed herein analyzed to embodiments of the present invention, and determining the data transmission path determination algorithm based on the prior art proposed algorithm based on a data transmission path MNLCR embodiment set forth herein and embodiments of the present invention impact on the life cycle of wireless sensor networks. 即不同技术方案下,无线传感器网络的生命周期的比较。 I.e. under different technical solutions, comparative lifetime wireless sensor network.

[0106] 如图4所示,假设在80*80的区域内随机分布N个传输节点(为便于阐述,后文简称为节点),设置功率衰减因子λ = 2,设定每跳参与协作的节点的个数为2个,节点的最大非协作传输半径dmax = 25,各个节点都可以动态调整发送功率,把任意节点i向邻节点以传统方式传输单位数据需要耗费的能源的归一化值为ei=(R/400) 2,设定节点的初始能量为1。 [0106] 4, assuming a random distribution of the N transmission nodes in the region of 80 * 80 (for the purposes of illustration, hereinafter abbreviated as node), the attenuation factor of the power set λ = 2, setting each hop cooperative participation the number of nodes is 2, the maximum radius of the non-coordinated transmission dmax = 25 nodes, each node can dynamically adjust the transmission power, normalized value of i to any node in the neighbor data transmission unit in a conventional manner it takes the energy is ei = (R / 400) 2, an initial energy setting for node 1. 在进行模拟实验时,本发明实施例这里提出的技术方案中,给出了两种网络场景。 During simulation, technical solutions of embodiments of the invention presented herein, gives two network scenario. 场景一是模拟固定源节点和目的节点的数据传输直至网络中有一个节点能量耗尽而网络死亡,本发明实施例这里称这种场景为单一数据流场景(简称单一流)。 First, scene data transmission until the network is fixed analog source node and destination node in a network node energy depletion death, embodiments of the present invention referred to herein as a single data stream which scene scene (referred to as a single stream). 场景二是每次均在N个节点中随机选取源节点与目的节点模拟数据传输,每完成一次传输再重新选择节点直至网络死亡, 本发明实施例这里称这种场景为随机数据流场景(简称单一流)。 Scene II is chosen randomly each time the source and destination nodes N analog data transmission nodes, each complete a re-transmission until the network node to select death, embodiments herein refer to this embodiment of the present invention is a random data stream scene scene (referred to as single stream). 显然单一流不利于节点能量的平均使用,因而同等条件下,单一流会使得无线传感器网络先死亡。 Obviously not conducive to the use of single-class average energy of nodes, so under the same conditions, a single stream will make wireless sensor networks to death.

[0107] 图5是MNLCR路由算法在单一流与随机流的两种场景下的网络生存周期曲线图(N = 25)。 [0107] FIG. 5 is a MNLCR routing algorithm in two scenarios with a single stream of random network lifetime flow graph (N = 25). 图6的纵坐标是归一化的网络生存周期,横坐标则是MNLCR(x)算法中X的取值。 The ordinate of FIG. 6 is normalized network lifetime, the abscissa is MNLCR (x) algorithm X values. 对比图5和图6,随机流的场景下的网络生存周期是远大于单一流场景的。 Compare FIGS. 5 and 6, the lifetime of network scenarios is much greater than the random flow of a single stream of a scene. 当X = O时,MNLCR(x)路由算法是不考虑节点初始能量和剩余能量。 When when X = O, MNLCR (x) routing algorithm is not considered node remaining energy and the initial energy. 此时,MNLCR (X)算法就退化成了CSP算法,也使得网络的生存周期少于x#〇时。 At this point, MNLCR (X) algorithm is devolved into a CSP algorithm, but also makes the network life cycle when x # billion less. X的增大表示算法在选择路由节点时将更加偏重选择节点剩余能量多而信道不那么优的节点。 X represents an increase when the routing algorithm to be more emphasis on the node selection and the residual energy multi-channel less preferred node.

[0108] 从图中可以看出:在随机流的场景下,x = 2时网络生存周期最长;在单一流的场景下,x = 5时网络生存周期最长。 [0108] As can be seen from the figure: random stream in scene, x = 2 when the maximum network lifetime; scene in a single stream, x = the longest lifetime. 5 to the network. 图6则是在不同的节点密度下(随机分布15、25、35、45、55个节点),x取值与网络生存周期关系。 FIG 6 is (randomly distributed nodes 15,25,35,45,55) of nodes at different densities, x value relationship with the network lifetime. 图6的纵坐标是归一化的网络生存周期,横坐标则是MNLCR (X)算法中X的取值。 The ordinate of FIG. 6 is normalized network lifetime, the abscissa is MNLCR (X) X value of the algorithm. 从实验可得出:在不同节点密度下,网络生存周期在不同X取值下的变化趋势是基本一致的;当x = 2时,不同节点密度的网络生存周期均是最长的;节点密度越高,MNLCR⑵比CSP (即MNLCR (O))算法的生命周期延长得越明显。 It can be derived from experiments: density at different nodes, the network lifetime trends at different X values ​​are substantially identical; and when x = 2, different densities of the network nodes are the longest lifetime; node density the higher, MNLCR⑵ than CSP (ie MNLCR (O)) algorithms to extend the life cycle of the more obvious. 另外,节点的增多会使得网络生存周期延长(55个节点的生命周期大于35个节点),但在MNLCR(x)算法下生命周期延长的速度是略高于节点增加的速度。 Further, the node so that the network will increase the lifetime extension (55 lifecycle node is greater than 35 nodes), but the speed at MNLCR (x) algorithm extend the life cycle is increased slightly higher than the speed of the node. 鉴于以上两组对比实验,在此种理想网络环境下,X =2是此类算法中表现最佳的。 In view of the above comparison experiment two groups, in such an ideal network environment, X = 2 is the best performing such algorithms.

[0109] 因此,如图7所示,在单一流场景下,本发明实施例这里提出的基于MNLCR算法确定数据传输路径的技术方案,网络生存周期分别是多跳等路由算法的1209 %、281 %、732 %、 393%、122%;在随机流场景下,本发明实施例这里提出的基于MNLCR算法确定数据传输路径的技术方案,网络生存周期分别是多跳等路由算法的292%、178%、193%、148%、127%。 [0109] Thus, as shown, in the single-class scenario, based on the data transmission path determination algorithm MNLCR technical solutions of the present invention presented herein 7, the network lifetime are multi-hop routing algorithm 1209%, 281 %, 732%, 393%, 122%; in the random stream scenario, embodiment 292 percent routing algorithm determines a data transmission path based MNLCR algorithm technical solutions proposed herein, network lifetime are multi-hop according to the present invention, 178 %, 193%, 148%, 127%. 多跳、CSP、CAN算法的设计初衷并不是为了最大化网络生存周期,因此性能表现比较差。 Multihop, designed CSP, CAN algorithm is not to maximize the network lifetime, and therefore relatively poor performance. FA 算法虽是经典的最大化网络周期算法,但因没有协作机制使得在随机流的场景下表现还不如CSP算法。 Although the FA algorithm is a classical algorithm to maximize network cycle, but there is no coordination mechanism so that in the scene not as random flow performance CSP algorithm. 对比真正意义上的最大化网络生存周期的协作路由算法FACR,MNLCR (2)也有25%左右的生存周期增长。 Contrast cooperative routing algorithm FACR maximize network lifetime in the true sense, MNLCR (2) there are about 25% of the life cycle of growth.

[0110] 综上所述,采用本发明实施例一上述提出的技术方案,引入加权功率分配值,在现有技术中提出的基于最短路径算法确定数据传输路径上,进行扩展,使得协作通信中,协作传输过程中功率分配方式更加合理,使得路由路径的选择更加适合于协作传输。 [0110] In summary, the technical solution of the embodiment set forth above an embodiment of the present invention, the introduction of weighted power allocation value proposed in the prior art based on a shortest path algorithm determines a data transmission path, extended, so that cooperative communications , cooperative transmission power allocation process is more reasonable manner, such that the path routing is more suitable for cooperative transmission. 能够根据功率分配确定数据传输路径,平衡协作节点的能量消耗,进而延长无线传感器网络的生命周期。 Power allocation can be determined according to a data transmission path, the energy consumption balance of cooperating nodes, and thus prolong the lifetime of the wireless sensor network.

[0111] 实施例二 [0111] Second Embodiment

[0112] 本发明实施例二这里提出一种确定无线传感器网络中数据传输路径的装置,如图8所示,包括: [0112] according to a second embodiment of the present invention herein provides a means of wireless sensor networks data transmission path determination, 8, comprising:

[0113] 加权功率分配值确定模块801,用于确定无线传感器网络中包含的数据传输的源节点对应的加权功率分配值。 [0113] weighted power allocation determination module 801, a power allocation value for determining the weighted data transmission source node of the wireless sensor network comprising the corresponding.

[0114] 具体地,上述加权功率分配值确定模块801,具体用于确定无线传感器网络中包含的数据传输的源节点的初始能量值和剩余能量值;根据所述初始能量值和剩余能量值,确定源节点对应的加权功率分配值。 [0114] Specifically, the weighting value determining power allocation module 801, and the specific energy values ​​for the initial value of the residual energy of the source node determines the data transmission in a wireless sensor network comprising; according to the initial energy value and residual energy values, determining a weighted value of the power distribution corresponding to the source node.

[0115] 具体地,上述加权功率分配值确定模块801,具体用于按照公式 [0115] Specifically, the weighting value of the power allocation determination module 801, configured according to the formula

Figure CN104066142BD00171

,确定源节点对应的加权功率分配值,其中所述加权功率分配值是源节点的初始能量和剩余能量之间的比值; Determining source weights corresponding to the node power allocation values, wherein the weighting value is a power allocation ratio between the initial energy of a source node and a residual energy;

[0116] 其中,源节点i的初始能量值,心是源节点i的剩余能量值,X是加权参数。 [0116] wherein the initial value of the energy source node i, the heart is the residual energy value of the source node i, X is a weighting parameter.

[0117] 第一传输代价确定模块802,用于针对无线传感器网络中除源节点之外的其他任一子节点,根据所述加权功率分配值,确定数据从源节点传输至所述子节点的第一传输代价,其中所述第一传输代价是数据在从源节点传输至该子节点之间的传输代价。 [0117] first transmission cost determination module 802, a wireless sensor network for any child nodes other than the other source node, according to the power allocation weighting value, determines that the data transmitted from the source node to the child node the cost of the first transmission, wherein the first transmission of data in the cost of transmission from a source node to a transmission cost between the child node.

[0118] 具体地,上述第一传输代价确定模块802,具体用于确定所述子节点是否是源节点的相邻节点;如果是,确定源节点的发送功率值,将所述加权功率分配值和所述发送功率值相乘,得到的乘积作为数据从源节点传输至所述子节点的第一传输代价;如果否,确定所述子节点的第一传输代价为无穷大。 [0118] Specifically, the first transmission cost determination module 802 for determining whether the specific sub-node is a source node of the neighboring node; if yes, determines the transmission power value of the source node, the weighted power allocation value and the transmission power value is multiplied, to give the product as a data transmission from a source node to a first child node of the cost of the transmission; if not, determining the cost of transmitting the first child node is infinite.

[0119] 选取模块803,用于根据确定出的第一传输代价,在全部子节点中,选择第一传输代价最小的子节点加入到源节点集合中。 [0119] selection module 803, according to the determined cost of the first transmission, all child nodes, selects the first transmission minimum cost child node is added to the source node collection.

[0120] 松弛操作模块804,用于对新加入到源节点集合中的子节点和未加入到源节点集合的全部子节点做松弛操作,将新加入到返回执行源节点集合中的子节点作为源节点,并触发第一传输代价确定模块,直至将数据传输的目的节点加入到源节点集合为止,所述源节点集合中包含的所有元素组成的数据传输路径作为协作传输模式下的数据传输路径。 [0120] relaxation operation module 804, relaxation operation used to make the new child node is added to the set of the source node and all child nodes are not added to the source node set, return a new child node is added to the source node as the set of execution the source node, determining the cost of transmission and trigger the first module until the destination node is added to the data transmission set up the source node, the source node of the set of all the elements contained in the data transfer path as a data transmission path in cooperation modes .

[0121] 具体地,上述松弛操作模块804,具体用于确定第二传输代价,其中所述第二传输代价是数据在从源节点传输至新加入到源节点集合中的子节点之间的传输代价;针对任一未加入到源节点集合的子节点,执行下述操作:分别确定第三传输代价和加权代价,其中所述第三传输代价是数据在从源节点传输至该未加入到源节点集合中的子节点之间的传输代价,所述加权代价是数据在从新加入到源节点集合中的子节点与之前加入到的源节点集合中的子节点之间通过协作通信,协作传输到该未加入到源节点集合中的子节点之间的传输代价;若所述第三传输代价大于第二传输代价和加权传输代价的和值;则将新加入到源节点集合的子节点设置为排列在该未加入到源节点集合中的子节点的前节点。 [0121] In particular, the slack operation module 804, particularly for determining the cost of a second transmission, wherein the second transmission at the cost of data transmission between the sub-set of node the source node from the source node to the new transmission is added to consideration; for any one of the child nodes are not added to the set of the source node, performing the following: determining the respective weighted third transmission costs and the cost, wherein the cost is the third transmission data is not added to the transmission from the source node to the source cost of transmission between the sub-set of nodes, the weighting between the cost of the child node to the source node before the aggregate data from the new child node is added to the source node set in the cooperative communication through the cooperative transmission to this does not add to the transport cost between the source node of the child node set; and when the value of the third transmission costs and the cost of transmission is greater than a second weighted transmission cost; then added to a new child node of the source node to the set of in this arrangement the source node is not added to the set of child nodes of the current node.

[0122] 具体地,上述松弛操作模块804,具体用于按照下述方式确定所述加权代价:确定源节点集合中包含的各子节点之间通过协作通信,协作传输到新加入到源节点集合中的子节点的最短传输路径;获得所述最短传输路径包含的子节点数量信息;判断所述子节点数量信息是否大于等于预先设定的协作子节点数量信息;如果是,则以待加入到源节点结合的子节点作为目的节点,按照功率分配函数,将预先设定的协作子节点数量信息的子节点, 协作传输到该目的节点的传输代价作为加权代价;如果否,则以待加入到源节点集合的子节点作为目的节点,按照功率分配函数,将包含新加入到源节点集合中的子节点的最短传输路径中的所有子节点,协作传输到该目的节点的传输代价作为加权代价。 [0122] In particular, the slack operation module 804, particularly for determining the cost of the weighting in the following manner: among the said sub-set of nodes included in a source node to a new node is added to the source cooperative communication, by a set of coordinated transmission minimum transmission path child node; obtaining the shortest path includes the transmission information of the number of child nodes; determining whether the node number of sub information is greater than the number of child nodes is equal cooperative information set in advance; if so, places to be added to child node of the source node as a destination node binding, according to the power distribution function, the preset number information of child nodes cooperating child nodes, the cost of transmitting a cooperative transmission to the destination node as the weighted consideration; if not, the places to be added to child node of the source node set as destination nodes, in accordance with a power distribution function, including all child nodes newly added to the set of child nodes of the source node the shortest transmission path, cooperate to the transmission cost of the destination node as the weighted price.

[0123] 具体地,上述松弛操作模块804,具体用于按照下述方式确定所述功率分配函数: 根据源节点对应的加权功率分配值,确定符合下述约束条件的目标函数:第一约束条件:接收端联合接收的信噪比大于预设门限值;第二约束条件:源节点发送数据时对应的信号幅值的绝对值小于等于额定功率值开平方;基于拉格朗日乘值法对所述目标函数求解,确定出功率分配函数。 [0123] In particular, the slack operation module 804, particularly for determining the power distribution function in the following manner: The weighted power allocation value corresponding to the source node, subject to the following constraints to determine the objective function: a first constraint : joint terminal receiving the received SNR greater than a predetermined threshold; second constraints: the absolute value of the amplitude of the signal corresponding to the transmission data source node equal to the rated power value is smaller than the square root; method based on Lagrange multiplier values solving for the objective function to determine the power distribution function.

[0124] 所述目标函数为: [0124] The objective function is:

Figure CN104066142BD00181

[0126] 其中, [0126] wherein,

Figure CN104066142BD00182

是源节点对应的加权功率分配值,Ei是源节点i的初始能量值,Ri是源节点i的剩余能量值,X是加权参数,I ω, I2是源节点i发送数据时的发送功率。 Is the weighted power allocation value source corresponding node, Ei is the initial energy value of the source node i, Ri is the remaining energy value of the source node i, X is a weighting parameter, I ω, I2 is the transmission power of source node i to transmit data.

[0127] 所述第一约束条件采用下述公式表示: [0127] The first constraint using the following equation:

Figure CN104066142BD00183

[0129] 其中,SNRmin是预设门限值, [0129] wherein, SNRmin is a preset threshold,

Figure CN104066142BD00191

是接收端联合接收的信噪比,η⑴是接收到的噪声,Pn是噪声η⑴所对应的功率,an表示发送节点i到接收节点t的功率衰减系数的开平方。 Receiving end joint reception SNR, η⑴ is the received noise, Pn is the noise power corresponding η⑴, an denotes a transmission power of node i to receiving node t of the square root attenuation coefficient.

[0130] 所述第二约束条件采用下述公式表示: [0130] The second constraint using the following equation:

Figure CN104066142BD00192

[0132] 其中,I ω , I是源节点发送数据时对应的信号幅值的绝对值 [0132] wherein, I ω, I is the absolute value of the corresponding source node transmitting a data signal amplitude

Figure CN104066142BD00193

是源节点额定功率值开平方。 The source node is the square root of the rated power value.

[0133] 所述功率分配函数采用下述公式表示: [0133] The power distribution function using the following formula:

Figure CN104066142BD00194

[0135] 其中,SNRmin是预设门限值, [0135] wherein, SNRmin is a preset threshold,

Figure CN104066142BD00195

是源节点对应的加权功率分配值,源节点i 的初始能量值,1^是源节点i的剩余能量值,X是加权参数,唤F是源节点i发送数据时的发送功率,η⑴是接收到的噪声,Pn是噪声η⑴所对应的功率,Ctil2表示发送节点i到接收节点t的功率衰减系数。 The source node corresponding weighting power allocation value, the initial energy value of the source node i, 1 ^ is the remaining energy value of the source node i, X is a weighting parameter, the wake-F is the transmission power when transmitting data source node i, η⑴ receiving to noise, Pn is the noise power corresponding η⑴, Ctil2 represents the power transmitting node i to receiving node t of the attenuation coefficient.

[0136] 本领域的技术人员应明白,本发明的实施例可提供为方法、装置(设备)、或计算机程序产品。 [0136] Those skilled in the art will appreciate, embodiments of the present invention may be provided as methods, apparatus (equipment), or computer program product. 因此,本发明可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。 Thus, embodiments of the present invention may be employed entirely hardware embodiment, an entirely software embodiment, or an embodiment in conjunction with the form of software and hardware aspects. 而且,本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。 Further, the present invention may take the form of a computer program product embodied in one or more of which comprises a computer usable storage medium having computer-usable program code (including but not limited to, disk storage, CD-ROM, optical memory, etc.).

[0137] 本发明是参照根据本发明实施例的方法、装置(设备)和计算机程序产品的流程图和/或方框图来描述的。 [0137] The present invention has been described in accordance with the method of Example of the present invention, a flowchart of means (devices) and computer program products and / or block diagrams described. 应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。 It should be understood and implemented by computer program instructions and block, and the flowchart / or block diagrams each process and / or flowchart illustrations and / or block diagrams of processes and / or blocks. 可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器,使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。 These computer program instructions may be provided to a processor a general purpose computer, special purpose computer, embedded processor or other programmable data processing apparatus to produce a machine, such that the instructions executed by the processor of the computer or other programmable data processing apparatus generating in a device for implementing the flow chart or more flows and / or block diagram block or blocks in a specified functions.

[0138] 这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中,使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品,该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。 [0138] These computer program instructions may also be stored in a computer can direct a computer or other programmable data processing apparatus to function in a particular manner readable memory produce an article of manufacture such that the storage instruction means comprises a memory in the computer-readable instructions the instruction means implemented in a flowchart or more flows and / or block diagram block or blocks in a specified function.

[0139] 这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上,使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理,从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。 [0139] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps on the computer or other programmable apparatus to produce a computer implemented so that the computer or other programmable apparatus execute instructions to provide processes for implementing a process or flows and / or block diagram block or blocks a function specified step.

[0140] 尽管已描述了本发明的优选实施例,但本领域内的技术人员一旦得知了基本创造性概念,则可对这些实施例作出另外的变更和修改。 [0140] While the present invention has been described with preferred embodiments, but those skilled in the art from the underlying inventive concept can make other modifications and variations to these embodiments. 所以,所附权利要求意欲解释为包括优选实施例以及落入本发明范围的所有变更和修改。 Therefore, the appended claims are intended to explain embodiments including the preferred embodiment as fall within the scope of the invention and all changes and modifications.

[0141] 显然,本领域的技术人员可以对本发明进行各种改动和变型而不脱离本发明的精神和范围。 [0141] Obviously, those skilled in the art can make various modifications and variations to the invention without departing from the spirit and scope of the invention. 这样,倘若本发明的这些修改和变型属于本发明权利要求及其等同技术的范围之内,则本发明也意图包含这些改动和变型在内。 Thus, if these modifications and variations of the present invention fall within the claims of the invention and the scope of equivalents thereof, the present invention intends to include these modifications and variations.

Claims (18)

1. 一种确定无线传感器网络中数据传输路径的方法,其特征在于,包括: 步骤SI:确定无线传感器网络中包含的数据传输的源节点对应的加权功率分配值,其中所述加权功率分配值是源节点的初始能量和剩余能量之间的比值; 步骤S2:针对无线传感器网络中除源节点之外的其他任一子节点,根据所述加权功率分配值,确定所述子节点是否是源节点的相邻节点;如果是,确定源节点的发送功率值,将所述加权功率分配值和所述发送功率值相乘,得到的乘积作为数据从源节点传输至所述子节点的第一传输代价;如果否,确定所述子节点的第一传输代价为无穷大; 步骤S3:根据确定出的第一传输代价,在全部子节点中,选择第一传输代价最小的子节点加入到源节点集合中; 步骤S4:对新加入到源节点集合中的子节点和未加入到源节点集合的全部子节点做松弛操 1. A method for network data transmission path determination wireless sensor, characterized by comprising: the step of the SI: determining a weighted value of the source node power allocation data transmission in a wireless sensor network comprising a corresponding power allocation values ​​wherein the weights is the ratio between the initial energy source node and a residual energy; step S2: for any sub-wireless sensor networks other nodes other than the source node, according to the power allocation weighting value, determining whether the child node is a source the neighboring node; if yes, determines the transmission power value of the source node, the weighting value and multiplying said power allocation transmission power value, obtained as the product of the data transmitted from the source node to the first child node cost of transmission; if not, determining the cost of transmitting the first child node is infinite; step S3: according to the determined cost of the first transmission, all child nodes, selects the first transmission minimum cost is added to the source node subnode set; step S4: Add the new source node to a child node and all the sub-set of nodes are not added to the source node set do relaxation exercise ,将新加入到返回执行所述源节点集合中的子节点作为源节点,返回执行步骤S2,直至将数据传输的目的节点加入到源节点集合为止,所述源节点集合中包含的所有元素组成的数据传输路径作为协作传输模式下的数据传输路径。 , A new child node is added to the return to execution of the source set of nodes as the source node returns to perform step S2, the destination node until the data transfer is added to the set until the source node, the source node set contains all the elements data transfer path as a data transmission path in cooperation transmission mode.
2. 如权利要求1所述的方法,其特征在于,确定无线传感器网络中包含的数据传输的源节点对应的加权功率分配值,包括: 确定无线传感器网络中包含的数据传输的源节点的初始能量值和剩余能量值; 根据所述初始能量值和剩余能量值,确定源节点对应的加权功率分配值。 2. The method according to claim 1, wherein determining a weighted value of the power allocation for data transmission source node in wireless sensor network includes corresponding, comprising: determining an initial data transmission source node of the wireless sensor network comprising residual energy value and an energy value; according to the initial energy value and residual energy values, determining a weighted value of the power allocation corresponding to the source node.
3. 如权利要求2所述的方法,其特征在于,根据所述初始能量值和剩余能量值,确定源节点对应的加权功率分配值,包括: 3. The method according to claim 2, characterized in that, according to the initial energy value and residual energy values, determining a weighted value of the power allocation corresponding to the source node, comprising:
Figure CN104066142BC00021
按照公式确定源节点对应的加权功率分配值; , 其中,源节点i的初始能量值,心是源节点i的剩余能量值,X是加权参数。 Determining power allocation value weighted according to the formula corresponding to the source node; wherein the initial value of the energy source node i, the heart is the residual energy value of the source node i, X is a weighting parameter.
4. 如权利要求1所述的方法,其特征在于,对新加入到源节点集合中的子节点和未加入到源节点集合的全部子节点做松弛操作,将新加入到返回执行所述源节点集合中的子节点作为源节点,包括: 确定第二传输代价,其中所述第二传输代价是数据在从源节点传输至新加入到源节点集合中的子节点之间的传输代价; 针对任一未加入到源节点集合的子节点,执行下述操作: 分别确定第三传输代价和加权代价,其中所述第三传输代价是数据在从源节点传输至该未加入到源节点集合中的子节点之间的传输代价,所述加权代价是数据在从新加入到源节点集合中的子节点与之前加入到的源节点集合中的子节点之间通过协作通信,协作传输到该未加入到源节点集合中的子节点之间的传输代价; 若所述第三传输代价大于第二传输代价和加权传输代价的和值; 则将 4. The method according to claim 1, wherein the new node is added to the sub-set of the source node and all child nodes are not added to the source node set do relaxation operation, a new source is added to the return to execution sub-set of nodes as the source node, comprising: determining the cost of a second transmission, wherein the second transmission at the expense of the cost of transmission between the sub-nodes in the data transmitted from the source node to the source node is added to the new set; for are not joined to any of a child node of the source node set, perform the following operations: determining the respective weighted third transmission costs and the cost, wherein the cost is the third transmission data is not added to the transmission source node from the source node to the set transmission cost between child nodes, the weighting between the cost of the child node to the source node before the aggregate data from the new child node is added to the source node set in the cooperative communication, to the cooperative transmission by not added the cost of transmission between the sub-set of source nodes; if the third transmission costs and cost of transport is greater than the second weighting value and the cost of transmission; will 加入到源节点集合的子节点设置为排列在该未加入到源节点集合中的子节点的前节点。 Added to the source node to the set of child nodes arranged in front of the node is not added to the source node in the set of child nodes.
5. 如权利要求4所述的方法,其特征在于,所述加权代价,按照下述方式确定: 确定源节点集合中包含的各子节点之间通过协作通信,协作传输到新加入到源节点集合中的子节点的最短传输路径; 获得所述最短传输路径包含的子节点数量信息; 判断所述子节点数量信息是否大于等于预先设定的协作子节点数量信息; 如果是,则以待加入到源节点结合的子节点作为目的节点,按照功率分配函数,将预先设定的协作子节点数量信息的子节点,协作传输到该目的节点的传输代价作为加权代价; 如果否,则以待加入到源节点集合的子节点作为目的节点,按照功率分配函数,将包含新加入到源节点集合中的子节点的最短传输路径中的所有子节点,协作传输到该目的节点的传输代价作为加权代价。 5. The method according to claim 4, wherein the weighting cost is determined in the following manner: among the said sub-set of nodes included in a source node to a new node is added to the source cooperative communication, by cooperative transmission minimum transmission path of the sub-set of nodes; obtaining the shortest path includes the transmission information of the number of child nodes; determining whether the node number of sub information is greater than the number of child nodes is equal cooperative information set in advance; if so, places to be added the number of child nodes to a child node information cooperative child node of the source node as a destination node in combination, in accordance with a power distribution function, the preset transmission cooperative transmission to the destination node of the cost of the cost as a weight; if not, the places to be added to a child node of the source node set as destination nodes, in accordance with a power distribution function, including all child nodes of the shortest transmission path child node newly added to the source node set in the transmission cost of cooperative transmission to the destination node as the weighted cost of .
6. 如权利要求5所述的方法,其特征在于,所述功率分配函数按照下述方式确定: 根据源节点对应的加权功率分配值,确定符合下述约束条件的目标函数: 第一约束条件:接收端联合接收的信噪比大于预设门限值; 第二约束条件:源节点发送数据时对应的信号幅值的绝对值小于等于额定功率值开平方; 基于拉格朗日乘值法对所述目标函数求解,确定出功率分配函数。 The first constraint: 6. A method as claimed in claim 5, wherein said power distribution function is determined in the following manner: The weighted power allocation value corresponding to the source node, in line with the objective function is determined by the following constraint condition : joint terminal receiving the received SNR greater than a predetermined threshold; second constraints: the absolute value of the amplitude of the signal corresponding to the transmission data source node equal to the rated power value is smaller than the square root; method based on Lagrange multiplier values solving for the objective function to determine the power distribution function.
7. 如权利要求6所述的方法,其特征在于,所述目标函数为: 7. The method according to claim 6, characterized in that the objective function is:
Figure CN104066142BC00031
其中, among them,
Figure CN104066142BC00032
是源节点对应的加权功率分配值,Ei是源节点i的初始能量值,Ri是源节点i 的剩余能量值,X是加权参数,I ω, I2是源节点i发送数据时的发送功率。 Is the weighted power allocation value source corresponding node, Ei is the initial energy value of the source node i, Ri is the remaining energy value of the source node i, X is a weighting parameter, I ω, I2 is the transmission power of source node i to transmit data.
8. 如权利要求6所述的方法,其特征在于, 所述第一约束条件采用下述公式表示: 8. The method according to claim 6, characterized in that said first constraint using the following equation:
Figure CN104066142BC00033
其中,SNRmin是预设门限值, Which, SNRmin is preset threshold,
Figure CN104066142BC00034
.是接收端联合接收的信噪比,η⑴是接收到的噪声,Pn是噪声η⑴所对应的功率,an表示发送节点i到接收节点七的功率衰减系数的开平方; 所述第二约束条件采用下述公式表示: . Joint receiving terminal received SNR, η⑴ is the received noise, Pn is the noise power corresponding η⑴, an i represents the sending node to the receiving node seven power attenuation coefficient of the square root; the second constraint using the following formula:
Figure CN104066142BC00035
其中,I Co11是源节点发送数据时对应的信号幅值的绝对值, Wherein, I Co11 absolute value of the amplitude of the signal corresponding to the source node sends data,
Figure CN104066142BC00036
是源节点额定功率值开平方。 The source node is the square root of the rated power value.
9. 如权利要求6所述的方法,其特征在于,所述功率分配函数采用下述公式表示: 9. The method according to claim 6, wherein the power distribution function using the following formula:
Figure CN104066142BC00041
其中,SNRmin是预设门限值, Which, SNRmin is preset threshold,
Figure CN104066142BC00042
是源节点对应的加权功率分配值,源节点i的初始能量值,1^是源节点i的剩余能量值,X是加权参数, The source node corresponding weighting power allocation value, the initial value of the energy source node i, 1 ^ a residual energy value of the source node i, X is a weighting parameter,
Figure CN104066142BC00043
是源节点i发送数据时的发送功率,η⑴是接收到的噪声,Pn是噪声η⑴所对应的功率,Ctil2表示发送节点i到接收节点11的功率衰减系数。 Is the transmission power of the data transmission source node i, η⑴ is the received noise, Pn is the noise power corresponding η⑴, Ctil2 denotes a transmission node i to node 11 receiving power attenuation coefficient.
10. —种确定无线传感器网络中数据传输路径的装置,其特征在于,包括: 加权功率分配值确定模块,用于确定无线传感器网络中包含的数据传输的源节点对应的加权功率分配值,其中所述加权功率分配值是源节点的初始能量和剩余能量之间的比值; 第一传输代价确定模块,用于针对无线传感器网络中除源节点之外的其他任一子节点,确定所述子节点是否是源节点的相邻节点;如果是,确定源节点的发送功率值,将所述加权功率分配值和所述发送功率值相乘,得到的乘积作为数据从源节点传输至所述子节点的第一传输代价;如果否,确定所述子节点的第一传输代价为无穷大; 选取模块,用于根据确定出的第一传输代价,在全部子节点中,选择第一传输代价最小的子节点加入到源节点集合中; 松弛操作模块,用于对新加入到源节点集合中的子节点和 10. - kind of wireless sensor network means determines a data transmission path, characterized by comprising: a power allocation weighting value determining means for determining a weighted value of the source node power allocation data transmission in a wireless sensor network comprising a corresponding, wherein the power allocation weighting value is the ratio between the initial and residual energy energy source node; a first transmission cost determining means for any child nodes for other wireless sensor networks other than the source node, determining a sub- neighboring node whether the node is the source node; if yes, determines the transmission power value of the source node, multiplying the weighting value and the power allocation transmission power value, obtained as the product of the data transmitted from the source node to the sub- a first transmission cost of the node; if not, determining the cost of transmitting the first child node is infinite; selection module for determining the cost of a first transmission, all child nodes, selects the first transmission minimum cost child node to the source node set; relaxation operation module for the new child node is added to the source node and the set of 加入到源节点集合的全部子节点做松弛操作,将新加入到返回执行所述源节点集合中的子节点作为源节点,并触发第一传输代价确定模块,直至将数据传输的目的节点加入到源节点集合为止,所述源节点集合中包含的所有元素组成的数据传输路径作为协作传输模式下的数据传输路径。 Was added to all child node of the source node sets do relaxation operation, a new child node is added to the return to execution of the source set of nodes as the source node, determining the cost of transmission and trigger the first module until the destination node is added to the data transmission source node set up, the data transmission path to the source node of the set of all the elements contained in the data transmission path as the cooperation mode.
11. 如权利要求10所述的装置,其特征在于,所述加权功率分配值确定模块,具体用于确定无线传感器网络中包含的数据传输的源节点的初始能量值和剩余能量值;根据所述初始能量值和剩余能量值,确定源节点对应的加权功率分配值。 11. The apparatus according to claim 10, wherein the weighting value determining power distribution module, particularly the initial value of the energy value and the residual energy of the source node determines the data transmission in a wireless sensor network comprising; according to the said initial residual energy value and an energy value, determining a weighted value of the power allocation corresponding to the source node.
12. 如权利要求11所述的装置,其特征在于,所述加权功率分配值确定模块,具体用于按照公式 12. The apparatus of claim 11, wherein the power allocation weighting value determining module is configured according to the formula
Figure CN104066142BC00044
确定源节点对应的加权功率分配值; 其中,源节点i的初始能量值,心是源节点i的剩余能量值,X是加权参数。 Determining a weighted value of the power distribution corresponding to the source node; wherein the initial value of the energy source node i, the heart is the residual energy value of the source node i, X is a weighting parameter.
13. 如权利要求10所述的装置,其特征在于,所述松弛操作模块,具体用于确定第二传输代价,其中所述第二传输代价是数据在从源节点传输至新加入到源节点集合中的子节点之间的传输代价;针对任一未加入到源节点集合的子节点,执行下述操作:分别确定第三传输代价和加权代价,其中所述第三传输代价是数据在从源节点传输至该未加入到源节点集合中的子节点之间的传输代价,所述加权代价是数据在从新加入到源节点集合中的子节点与之前加入到的源节点集合中的子节点之间通过协作通信,协作传输到该未加入到源节点集合中的子节点之间的传输代价;若所述第三传输代价大于第二传输代价和加权传输代价的和值;则将新加入到源节点集合的子节点设置为排列在该未加入到源节点集合中的子节点的前节点。 13. The apparatus according to claim 10, characterized in that the relaxation operation module is configured to determine the cost of a second transmission, wherein the second data transmission at the expense of transmission from the source node to the new node is added to the source cost of transmission between the sub-set of nodes; for any one of the child nodes are not added to the set of the source node, performing the following: determining the respective weighted third transmission costs and the cost, wherein the cost is the third transmission data from transmitted to the source node does not add to the transport cost between the source node of the child node in the set, the weighted cost of the child node is added to the previous data from the new child node is added to the source node set of nodes in the set of source between cooperative communication, collaboration is not transmitted through to the added expense to the transmission source node among child nodes in the set; said third transfer if the cost is greater than the second transmission costs and the cost of transmission and the weighted values; then newly added child node is provided to the source node set is arranged in front of the node is not the source node is added to the set of child nodes.
14. 如权利要求13所述的装置,其特征在于,所述松弛操作模块,具体用于按照下述方式确定所述加权代价:确定源节点集合中包含的各子节点之间通过协作通信,协作传输到新加入到源节点集合中的子节点的最短传输路径;获得所述最短传输路径包含的子节点数量信息;判断所述子节点数量信息是否大于等于预先设定的协作子节点数量信息;如果是, 则以待加入到源节点结合的子节点作为目的节点,按照功率分配函数,将预先设定的协作子节点数量信息的子节点,协作传输到该目的节点的传输代价作为加权代价;如果否,则以待加入到源节点集合的子节点作为目的节点,按照功率分配函数,将包含新加入到源节点集合中的子节点的最短传输路径中的所有子节点,协作传输到该目的节点的传输代价作为加权代价。 14. The apparatus according to claim 13, characterized in that the relaxation operation module is configured to determine the cost of the weighting in the following manner: among the said sub-set of nodes included in a source node via cooperative communication, coordinated transmission to the new route is added to the minimum transmission source node of the child node set; obtaining information of the number of child nodes of the shortest transmission path comprises; determining whether the node number of sub information is greater than the number of child nodes is equal cooperative information set in advance ; if it is, the amount of information places the child nodes to be added to the child node cooperative child node of the source node as a destination node binding, according to the power distribution function, the preset transmission cooperative transmission to the destination node of the cost of the cost as a weight ; if not, the places to be added to the set of child nodes of the source node as a destination node, in accordance with the power allocation function, including all child nodes of the new node is added to the sub-set of the transmission source node the shortest path, to the cooperative transmission as the cost of the transmission destination node weighting price.
15. 如权利要求14所述的装置,其特征在于,所述松弛操作模块,具体用于按照下述方式确定所述功率分配函数:根据源节点对应的加权功率分配值,确定符合下述约束条件的目标函数:第一约束条件:接收端联合接收的信噪比大于预设门限值;第二约束条件:源节点发送数据时对应的信号幅值的绝对值小于等于额定功率值开平方;基于拉格朗日乘值法对所述目标函数求解,确定出功率分配函数。 15. The apparatus according to claim 14, characterized in that the relaxation operation module is a function for determining the power distribution in the following manner: The weighted power allocation value corresponding to the source node, subject to the following constraints to determine conditions of the objective function: a first constraint: the joint terminal receiving the received SNR greater than a predetermined threshold; second constraints: the absolute value of the amplitude of the signal corresponding to the transmission data source node equal to the rated power value is smaller than the square root ; value based on Lagrange multiplier method for solving the objective function, it is determined that the power distribution function.
16. 如权利要求15所述的装置,其特征在于,所述目标函数为: 16. The apparatus according to claim 15, wherein the objective function is:
Figure CN104066142BC00051
其中 among them
Figure CN104066142BC00052
是源节点对应的加权功率分配值,Ei是源节点i的初始能量值,Ri是源节点i 的剩余能量值,X是加权参数,I ω, I2是源节点i发送数据时的发送功率。 Is the weighted power allocation value source corresponding node, Ei is the initial energy value of the source node i, Ri is the remaining energy value of the source node i, X is a weighting parameter, I ω, I2 is the transmission power of source node i to transmit data.
17. 如权利要求15所述的装置,其特征在于, 所述第一约束条件采用下述公式表示: 17. The apparatus according to claim 15, characterized in that said first constraint using the following equation:
Figure CN104066142BC00053
其中,SNRmin是预设门限值, Which, SNRmin is preset threshold,
Figure CN104066142BC00054
_是接收端联合接收的信噪比,η⑴是接收到的噪声,Pn是噪声η⑴所对应的功率,an表示发送节点i到接收节点七的功率衰减系数的开平方; 所述第二约束条件采用下述公式表示: _ Receiving end joint reception SNR, η⑴ is the received noise, Pn is the noise power corresponding η⑴, an i represents the sending node to the receiving node seven power attenuation coefficient of the square root; the second constraint using the following formula:
Figure CN104066142BC00055
Figure CN104066142BC00056
其中,I Co11是源节点发送数据时对应的信号幅值的绝对值, 是源节点额定功率值开平方。 Wherein, I Co11 absolute value of the amplitude of the signal corresponding to the source node sends data, the source node is the square root of the rated power value.
18.如权利要求15所述的装置,其特征在于,所述功率分配函数采用下述公式表示: 18. The apparatus according to claim 15, wherein the power distribution function using the following formula:
Figure CN104066142BC00061
其中,SNRmin是预设门限值, Which, SNRmin is preset threshold,
Figure CN104066142BC00062
是源节点对应的加权功率分配值,源节点i的初始能量值,1^是源节点i的剩余能量值,X是加权参数, The source node corresponding weighting power allocation value, the initial value of the energy source node i, 1 ^ a residual energy value of the source node i, X is a weighting parameter,
Figure CN104066142BC00063
^是源节点i发送数据时的发送功率,η⑴是接收到的噪声,Pn是噪声η⑴所对应的功率,Ctil2表示发送节点i到接收节点七的功率衰减系数。 ^ Is the transmission power of the data transmission source node i, η⑴ is the received noise, Pn is the noise power corresponding η⑴, Ctil2 represents the power transmitting node i to receiving node seven attenuation coefficient.
CN 201310094365 2013-03-22 2013-03-22 A method for determining data transmission in a wireless sensor network path and means CN104066142B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201310094365 CN104066142B (en) 2013-03-22 2013-03-22 A method for determining data transmission in a wireless sensor network path and means

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201310094365 CN104066142B (en) 2013-03-22 2013-03-22 A method for determining data transmission in a wireless sensor network path and means

Publications (2)

Publication Number Publication Date
CN104066142A true CN104066142A (en) 2014-09-24
CN104066142B true CN104066142B (en) 2017-11-21

Family

ID=51553623

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201310094365 CN104066142B (en) 2013-03-22 2013-03-22 A method for determining data transmission in a wireless sensor network path and means

Country Status (1)

Country Link
CN (1) CN104066142B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101098373A (en) * 2006-06-30 2008-01-02 中国科学院软件研究所 Mobile decision approach for data gathering set in wireless sensor network
CN101577956A (en) * 2009-06-15 2009-11-11 北京邮电大学 Method and system for selecting collaboration relay node
CN102325041A (en) * 2011-07-18 2012-01-18 南京邮电大学 Complex network theory-based wireless sensor network group management method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7486627B2 (en) * 2003-06-03 2009-02-03 Palo Alto Research Center Incorporated Time-aware strategy for message-initiated constraint-based routing

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101098373A (en) * 2006-06-30 2008-01-02 中国科学院软件研究所 Mobile decision approach for data gathering set in wireless sensor network
CN101577956A (en) * 2009-06-15 2009-11-11 北京邮电大学 Method and system for selecting collaboration relay node
CN102325041A (en) * 2011-07-18 2012-01-18 南京邮电大学 Complex network theory-based wireless sensor network group management method

Also Published As

Publication number Publication date Type
CN104066142A (en) 2014-09-24 application

Similar Documents

Publication Publication Date Title
Yang et al. Broadcasting with an energy harvesting rechargeable transmitter
Jiang et al. Collaborative multi-hop routing in cognitive wireless networks
Goyal et al. Full duplex cellular systems: will doubling interference prevent doubling capacity?
Ding et al. Distributed beamforming and power allocation for cooperative networks
ElBatt et al. Joint scheduling and power control for wireless ad hoc networks
Aslam et al. A multi-criterion optimization technique for energy efficient cluster formation in wireless sensor networks
Chen et al. Distributed power splitting for SWIPT in relay interference channels using game theory
US20080225774A1 (en) Optimal resource allocation in a multi-hop ofdma wireless network with cooperative relaying
Shu et al. Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
Jo et al. A survey of converging solutions for heterogeneous mobile networks
Mishra et al. Smart RF energy harvesting communications: Challenges and opportunities
Das et al. WLC30-4: static channel assignment in multi-radio multi-channel 802.11 wireless mesh networks: issues, metrics and algorithms
Saad et al. A distributed merge and split algorithm for fair cooperation in wireless networks
Patel et al. Energy and throughput analysis of hierarchical routing protocol (LEACH) for wireless sensor network
Lu et al. Resource allocation in wireless networks with RF energy harvesting and transfer
Chen et al. Energy-efficient itinerary planning for mobile agents in wireless sensor networks
Han et al. Distributed strategies for channel allocation and scheduling in software-defined radio networks
Rizvi et al. A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks
Hussain et al. Energy efficient virtual MIMO communication for wireless sensor networks
Kong Energy efficient cooperative LEACH protocol for wireless sensor networks
Aderohunmu et al. A deterministic energy-efficient clustering protocol for wireless sensor networks
Halder et al. Enhancement of wireless sensor network lifetime by deploying heterogeneous nodes
Ji et al. Capacity of dual-radio multi-channel wireless sensor networks for continuous data collection
Jung et al. Residual-energy-activated cooperative transmission (REACT) to avoid the energy hole
Sabet et al. A decentralized energy efficient hierarchical cluster-based routing algorithm for wireless sensor networks

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination
GR01