无线传感器网络模型设计_英文文献翻译.

1、Model Design of Wireless Sensor Network based on Scale-Free Network TheoryABSTRACTThe key issue of researches on wireless sensor networks is to balance the energy costs across the whole network and to enhance the robustness in order to extend the survival time of the whole sensor network. As a speci

2、al complex network limited especially by the environment, sensor network is much different from the traditional complex networks, such as Internet network, ecological network, social network and etc. It is necessary to introduce a way of how to study wireless sensor network by complex network theory

3、 and analysis methods, the key of which lies in a successful modeling which is able to make complex network theory and analysis methods more suitable for the application of wireless sensor network in order to achieve the optimization of somecertain network characteristics of wireless sensor network.

4、 Based on generation rules of traditional scale-free networks, this paper added several restrictions to the improved model. The simulation result shows that improvements made in this paper have made the entire network have a better robustness to the random failure and the energy costs are more balan

5、ced and reasonable. This improved model which is based on the complex network theory proves more applicable to the research of wireless sensor network.Key-words: Wireless sensor network; Complex network; Scale-free networkI. INTRODUCTIONIn recent years, wireless sensor networks have attracted more a

6、nd more related researchers for its advantages. Sensor nodes are usually low-power and non-rechargeable. The integrity of the original networks will be destroyed and other nodes will have more business burden for data transmission if the energy of somecertain nodes deplete. The key issue of sensor n

7、etwork research is to balance the energy consumption of all sensor nodes and to minimize the impact of random failure of sensor nodes or random attacks to sensor nodes on the entire network 1.Complex network theory has been for some time since first proposed by Barabasi and Albert in 1998, but compl

8、ex network theory and analysis method applied to wireless sensor networks research is seriously rare and develops in slow progress. As a special complex network limited especially by the environment, sensor network is much different from the traditional complex network, and the existing complex netw

9、ork theory and analysis methods can not be directly applied to analyze sensor networks. Based on scale-free network theory (BA model) 2, (1) this paper added a random damagemechanismto each sensor node when deployed in the generation rule; (2) considering the real statement of wireless sensor networ

10、ks, a minimum and maxinum restriction on sensor communication radius was added to each sensor node; (3) in order to maintain a balanced energy comsuption of the entire network, this paper added a limited degree of saturation value to each sensor node. This improved scale-free model not only has the

11、mentioned improvements above, but also has lots of advantages of traditional scale-free networks, such as the good ability to resist random attacks, so that the existing theory and analysis methods of complex network will be more suitable for the researches of wireless sensor network.II. PROGRESS OF

12、 RELATED RESEARCHHailin Zhu and Hong Luo have proposed two complex networks-based models for wireless sensor networks 3, the first of which named Energy-aware evolution model (EAEM) can organize the networks in an energy-efficient way, and can produce scale-free networks which can improve the networ

13、ks reliance against random failure of the sensor nodes. In the second model named Energy-balanced evolution model (EBEM), the maximumnumber of links for each node is introduced into the algorithm, which can makeenergy consumption more balanced than the previous model (EAEM).CHEN Lijun and MAO Yingch

14、i have proposed a topology control of wireless sensor networks under an average degree constraint 4. In the precondition of the topology connectivity of wireless sensor networks, how to solve the sparseness of the network topology is a very important problem in a large number of sensor nodes deploye

15、d randomly. They proved their proposed scheme can decrease working nodes, guarantee network topology sparseness, predigest routing complexity and prolong network survival period.LEI Ming and LI Deshi have proposed a research on self-organization reliability of wireless sensor network5, which aiming

16、on the two situations: deficiency of WSNnodes and under external attack, analyzes the error tolerance ability of different topologies of WSN, and eventually obtains optimized self organized topological models of WSN and proposes a refined routing algorithm based on WSN.III. IMPROVED SCALE-FREE MODEL

17、 FOR WSNBecause of the limited energy and the evil application environment, wireless sensor networks may easily collapse when some certain sensor nodes are of energy depletion or destruction by the nature, and even some sensor nodes have been damagedwhen deployed. There is also a restriction on maxi

18、num and mininum communication radius of sensor nodes rather than the other known scale-free networks such as Internet network, which has no restriction on communication radius. To have a balanced energy consumption, it is necessary to set up a saturation value limited degree of each sensor node 6.In

19、 response to these points, based on the traditional scale-free model, this paper has made the following improvements in the process of model establishment:(1) A large number of researches have shown that many complex networks in nature are not only the result from internal forces, but also the resul

20、t from external forces which should not be ignored to form an entire complex network. Node failure may not only occour by node energy depletion or random attacks to them when sensor networks are in the working progress, but also occour by external forces, such as by the nature, whendeployed. In this

21、 paper, a mechanism of small probability of random damage has been added to the formation of sensor networks.(2) Unlike Internet network where two nodes are able to connect directly to each other and their connection are never limited by their real location, sensor network, two nodes in which connec

22、t to each other by the way of multi-hop, so that each node has a maximumof length restriction on their communicationradius. To ensure the sparse of the whole network, there must also be a minimum of length restriction on their communication radius. In this paper, a length restriction on communicatio

23、n radius of sensor nodes has been proposed in the improved model.(3) In sensor network, if there exists a sensor node with a seriously high degree, whose energy consumption is very quickly, it will be seriously bad. The whole sensor network would surely collapse if enough energy were not supported t

24、o the certain node. To avoid this situation, this paper has set up a saturation value limited degree of each sensor node. By adding the mentioned restrictions above to the formation of the scale-free model, the new improved model will be more in line with the real statement of sensor network. Comple

25、x network theory and analysis methods will be more appropriate when used to research and analyze the sensor network.IV. DESCRIPTION OF THE IMPROVED ALGORITHMThe specific algorithm of the improved model formation are described as follows :(1) A given region (assumed to be square) is divided into HS*H

26、Sbig squares (named as BS);(2) Each BS (assumed to be square) is divided into LS*LS small squares (named as SS), and each SS can have only one node in its coverage region;(3) m0backbone nodes are initially generated as a random graph, and then a new node will be added to the network to connect the e

27、xisting m nodes with m edges at each time interval. (m< m0, mis a quantity parameter);(4) The newly generated node v, has a certain probability of Peto be damaged directly so that it will neverbe connected with any existingnodes;(5) The newly generated node vconnects with the existing node i, whi

28、ch obeyes dependent-preference rule and is surely limited by the degree of the certain saturation value .(6) The distance div between the newly generated node v connects andtheexisting node i shall be shorter than the maximum dmax of the communication radius of sensor nodes.Above all, the probabilit

29、y that the existing node i will be connected with the n ewly gen erated node v can be show n as follows:In order to compute it convenien tly, here assumed that few no des had reached the degree of saturation value kimax . That is, N is very minimal in Eqs.(1) so that it can be ignored here. And in E

30、qs.aki-N 一 N=mo t 1 Kjj 1With The vary ing rate with time of ki, we get:kiT miamk2mt mamkim0 t 1 kjj 1When t oo,(t) =m (+ ),tiThe probability that the degree of node I is smaller than k is:con diti on: k i(t J=m, we get the solution:2atm1Pki(t) k Pti ki is a con sta nt parameter:The time in terval w

31、he n each n ewly gen erated node conn ected into then etwork is equal, so that probability den sity of tP(ti)-1/ 3we replace it into Eqs. (5), the n we get:Pki(t) k Ptim1 tk1ml tk1P(ti)ti 1P(k)P(ki (t) k)2m1 t 1P(k) ;兀Tk1When t fg, we get:(8)P(k)2 m2 k r1 2In which =1+=1+ , and the degree distributi

32、on we get and the degreeadistribute n of traditi onal scale-free n etwork are similar. Approximately, it has nothing to do with the time parameter t and the quantity of edges m gen erated at each time in terval.Pd iv dmax could be calculated by the max in um restriction dmax oncom muni cati on radiu

33、s of each sen sor node and the area of the en tire coverage d2regi on S,thatis Pd iv dmax=£ SThen we replace Pd ivd max= Sand a=Pd ivd maxg(1-Pe)i ntoEqs.and eve ntuallywe get:2P(k) 2m k12m2k2S(1-Pe)g d2V. SIMULATIONThis paper used Java GUI modeof BRITE topology generator to generate the topolo

34、gy, and parameter settings were as follows:1) N=5000N means the quantity of the sensor nodes at the end of thetopology generation.2) m=m0 =1M meansthe quantity of the new generated edges by the new generated node at each time interval.3) HS=500HS means the given region was divided into HS*HS big squ

35、ares.4) .LS=50 LS means each big square was divided into LS*LS small squares. d5) dmin =10pldmin is the mininum restriction on communication radius of each sensor node.6) dmax =128max is the max inum restrictio n on com muni cati on radius of each sen sor no de.7) PC=1PC means wether prefere ntial c

36、onn ectivity or not.8) .I G=1IG means wether in creme ntal grouth or not.9) Pe=0.01, m=1This mean sthat any n ewly gen erated node has 1%cha nee to be node failure and the n ewly gen erated node if no rmal only connect with one existi ng node .The n we got each degree of the sen sor n etwork no des

37、from BRITE topologygenerator. To analyze the degree distribution, we use Matlab to calculatedatas and draw graph. As can easily be see n from Fig. 1, the distributi on of degree k subjected approximately to Power-Law distributi on. However, the value of 丫 is no Ion ger betwee n 2 and 3, but a very l

38、arge value,which iscaused by the ran dom damageprobabilityFe to n ewge nerated no des whe ndeployedand the max in um of com muni cati on radius d max of each sen sor no de. It can be easily seen that the slope of P(k) is very steep and P(k) rears up becausesensor node has a limited degree of saturat

39、ion value by. The existence of 0 degree :nodes is result from the ran dom damage to new gen erated no des whe n deployed©-a-T-5Fig. 1 Degree distribute n of Improved ModelComparedwith the degree distribution produced by traditional scale-free network as is shown in Fig. 2, the generation rule p

40、roposed in this paper has produced a degree distribution in a relatively low value as is shown in Fig.1; there are some no des of 0 degree as is show n in Fig. 1 on the left for theran dom damage rule; as is show n on the right in Fig. 1, there are no no des with higher degree tha n the qua ntity of

41、 while there are some no des whosedegree are of higher degree tha n the qua ntity of.Fig. 2 Degree distribution of traditional Scale-free ModelVI. CONCLUSIONThis paper has added a random damageto newgenerated nodes whendeployed; considering multi-hop transmission of sensor network, this paper has pr

42、oposed a maximumrestriction on the communication radius of each sensor node; in order to improve the efficiency of energy comsumption and maintain the sparsity of the entire network, this paper has also added a minimum restriction on the communication radius of each sensor node to the improved model

43、; to balance the energy comsuption of the entire network, this paper has proposed a limited degree of saturation value on each sensor node.In this paper, an improved scale-free network model was proposed to introduce the theory of traditional scale-free network and analysis methods into the research

44、es of wireless sensor networks more appropriately, which would be more approximate to the real statement of wireless sensor networks.REFERENCES1 R. Albert, H. Jeong and A.-L. Barabasi. Error and attack tolerance of complex networks. Nature, 2000; 406: 378-382.2 Albert R, Barabasi A. Statistical mech

45、anics of complex networks. Rev Mod Phys 2002; 74: 47 - 97.3 Zhu HL, Luo H. Complex networks-based energy-efficient evolution model for wireless sensor networks. Chaos, Solitons and Fractals; 2008: 1-4.4 Chen LJ, MaoYC. Topology Control of Wireless Sensor Networks Under an Average Degree Constraint.

46、Chinese Journal of computers 2007; 30: 1-4.5 Lei M, Li DS. Research on Self-Organization Reliability of Wireless Sensor Network . Complex system and complexity science ; 2005, 2: 1-4. Chen LJ, Chen DX. Evolution of wireless sensor network . WCNC 2007; 556: 3003- 7.7 Peng J, Li Z. An Improved Evoluti

47、on Model of Scale-Free Network . Computer application. 2008 , 2; 1: 1-4.基于无围网络理论的无线传感器网络模型设计戌源通信工程部通信与信息工程学院上海，中国摘要无线传感器网络的研究的关键问题是是平衡整个网络中的能源成本并且为了延 长整个传感器网络的生存时间要增强鲁棒性。 作为一个特殊的复杂网络特别是由于环 境的限制，传感器网络很不同于传统的复杂的网络， 例如 Internet 网络，生态网络， 社交网络等。这就有必要来介绍一种通过复杂网络理论和分析方法如何研究无线传感 器网络的方式， 其中的关键在于能够作出一个成功的建模，

48、它能够使复杂网络理论和 分析方法更适合无线传感器网络的应用， 以达到根据某些特定无线传感器网络的特点 进行优化。基于传统的无尺度的网络生成规则， 本文对改进后的模型增加了一些限制。 仿真结果表明， 在本文中进行的改进， 使整个网络对随机故障有一个更好的鲁棒性并 且能源成本更平衡和合理。 这种基于复杂网络理论的改进模型证明更适用于无线传感 器网络的研究。关键词：无线传感器网络，复杂网络，无尺度网络引言近年来，由于无线传感器网络的优点，吸引了越来越多的相关研究人员 。传感 器节点通常是低功率和非可再充电的。 如果某些节点的能量消耗完， 原来网络的完整 性将被破坏并且其他 进行数据传输的节点， 会有

49、更多的业务负担。 传感器网络的研 究的关键问题是是平衡所有的传感器节点能源消耗和把传感器节点随机错误影响或 者是对整个网络的传感器节点随机攻击降到最低。复杂网络理论，自从 Barabasi 和 Albert 在 1998 年提出已经有一段时间了，但 应用于无线传感器网络的复杂网络理论和分析方法研究严重稀缺并且开发进展缓慢。 作为一个尤其是环境的限制特殊的复杂的网络， 传感器网络是远远不同于传统的复杂 网络并且现有的复杂网络理论和分析法不能直接应用到分析传感器网络上。 基于无标 度网络理论(BA模型)2 , (1)本文中当部署在生成规则时添加到每个传感器节点 随机损伤机制 (2)考虑到无线传感器

50、网络的实际声明， 传感器通信半径参数最大和 最小限制 添加到每个传感器节点 ;( 3)为了维持整个网络平衡的的能源消耗率， 本文每个传感器节点加入了和度值的限度。这对无尺度模型改善不仅提到是以上的改 善，而且还具有传统的无标度网络大量的优点， 如很好的抵抗随机的攻击的能力， 从 而使现有的复杂网络的理论和分析方法，将是更适合于无线传感器网络的研究。相关的研究进展海林朱和香罗提出了两种复杂的基于网络的无线传感器网络模型 3 ，第一个名 叫能量感知的演化模型（EAEM可以以高效节能的方式组织网络， 并能产生无尺度网 络，它可以提高网络抵御传感器节点随机失误的可靠性。 第二个模型命名为能量均衡 演化

51、模型（EBEM,为每个节点的最大数被引入算法，它可以使能源消费比以前的型 号更均衡（ EAEM）。立军和毛驰提出了拓扑无线传感器网络控制下平均程度约束条件 4 。在无线传 感器网络拓扑连通性的前提下， 在大量的随机部署的传感器节点中， 如何解决稀疏性 网络的拓扑结构是一个非常重要的问题。他们证明了自己的方案可以减少工作节点， 保证网络拓扑稀疏，简化路由的复杂性和延长网络的生存期。雷鸣和德氏提出了自组织无线传感器网络的可靠性的研究 5 ，这针对两种情况： 缺乏wsr节点和外部的攻击下，分析了不同拓扑结构的无线传感器网络错误的耐受能 力，并最终获得优化自组织的无线传感器网络的拓扑模型， 并提出了基

52、于无线传感器 网络的精制路由算法。改进的无标度模型的 WSN由于能量有限和恶劣的应用环境，某些传感器节点的能量耗尽或被自然力损坏， 无线传感器网络会很容易遭到破坏， 甚至还有一些传感器节点被部署时已经损坏。 还 设有一个限制最大限度和最低限度的传感器节点的通信半径， 而不是其它已知的无标 度网络，如互联网络，它没有限制通信半径。为了有一个平衡的能源消耗，有必要设 置一个传感器的有限度的饱和度值 6 。为了回答这些要点， 根据传统的无标度模型， 模型建立的过程中本文已做出以 下改进：（1）大量的研究表明，许多在本质上是复杂的网络不仅是力，也是外部势力的 结果。形成一个完整的复杂网络时，这不应被忽

53、略。在传感器网络工作的进展中，节 点故障不仅可能出现在节点的能量消耗或他们遭受随机攻击时，也出现在外力情况 下，如当部署时的自然力。 本文一种小概率的随机损伤机制已被添加到传感器网络的 形成中。（2）不同于互联网网络，其中能够直接连接到彼此两个节点，它们的连接永远 不会受到真实位置的限制，无线传感器网络，两个相连的节点由多跳（ multi-hop ） 的方式彼此连接， 使每个节点在通信半径上都有一个最大长度的限制。 为了确保全网 络的稀疏性， 还必须是有一个最小长度的通信半径限制。 在本文中，改进后的模型中。 传感器节点的通信半径长度的限制，已经提出来了。（3）在无线传感器网络，如果存在一个传

54、感器很高的节点，其能源消耗是非常 快，它会严重不利。如果没有足够的能量支持某个节点， 整个传感器网络一定会崩溃， 。 为了避免这种情况， 本文在每个传感器节点建立了一个饱和值限度。 通过加入上述提 到的限制形成无尺度的模式， 改进后的新模型将更加符合传感器网络的真实述。 复杂 网络理论和分析方法将更加适合用来研究和分析传感器网络。改进算法说明具体算法改进模型形成描述如下：给定的区域（假设是正方形）（1）分为HS* HS正方形（命名为BS ；（2）每个BS （假设是正方形）分为LS* LS小正方形（命名为SS,并且每个 SS中在其覆盖区域只能有一个节点；（3）M0骨干节点最初作为一个随机产生的图形，然后一个新的节点将被添加到 网络以每次有m条边连接现有的m个节点的时间间隔。（MO M m是一个量参数）；（4） 对新生成的节点v，具有一定的直接被损坏概率 P，这样它会永远不与任何 现有的节点连接；（5）新生成的节点v与现有的连接节点i连接，服从依赖优先规则，肯定是被 确定的目标饱和度值k限制；（6） d和新生成的节点V连接并且与现存的节点I之间的距离将比传感器通信 半径最大距离dmax更短。总之，现有节点的概率，我将连接与新生成