1-4 毕业设计外文资料翻译.doc_第1页
1-4 毕业设计外文资料翻译.doc_第2页
1-4 毕业设计外文资料翻译.doc_第3页
1-4 毕业设计外文资料翻译.doc_第4页
1-4 毕业设计外文资料翻译.doc_第5页
已阅读5页,还剩11页未读, 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

毕业设计外文资料翻译学 院: 信息科学与工程学院 专 业: 计算机科学与技术 姓 名: xxx 学 号: xxx (用外文写)外文出处:Zhongyu Cao .A Routing Protocol for Large-scale Wireless Sensor Networks. 2010 Second International Workshop on Education Technology Computer Science p117120 附 件: 1.外文资料翻译译文;2.外文原文。 指导教师评语: 签名: 年 月 日附件1:外文资料翻译译文一种大规模无线传感器路由协议网络 曹中玉 华东计算机所 C张伟 华东计算机所 C卢刚 华东计算机所 China 抽象路由是无线传感器网络的关键技术。为了提高大规模无线传感器网络的路由效率,我们建议使用广播电视协议,一种无线传感器网络路由本文。在广播电视协议中,节点汇总数据并且使用最短路由选择,来实现数据包沿最佳路径传送,每个普通节点没有必要维持一个路由表,而发送节点来代替维护。我们的模拟结果表明,广播电视协议在应用于大规模网络和当网络负载不平衡时节省资源方面是十分实用的。一、简介未来的无线网络将会由一种密集部署且数目庞大传感器节点组成,其中这种网络的一个关键特点是他们是自动更新,因此这些网络设计的一个重要目的是提高网络效率。此外,无线传感器网络可通过优化应用程序和操作系统的通信协议来提高寿命, 1,2。这项工作的重点是无线传感器网络协议。为了降低路由负担,提高路由在大规模无线网络的性能,我们建议使用一种叫做广播电视协议的无线网络通信协议。在广播电视协议,路由通过查询路由表转发数据包,普通路由节点通过最佳路径传送数据。这种方法充分的使用了其强大的计算、记忆、存储功能,可节省路由资源并避免维护普通节点的路由表。这种协议一般适用于大规模无线传感器网络。本文的其余部分组织如下:第二节我们简要讨论相关工作;第三节中我们解释广播电视协议的细节;第四节介绍我们的实验结果;第五节提出我们的结论。二、相关工作A传统路由协议的研究在小规模的无线网络,一个有路由表的路由就可以有正常工作,因为节点可以通过最佳路径来减小延迟,短路径的数据包传送并不需要强大的计算能力和大的储存,而且消耗的路由资源较少。但是,当路由表应用在大规模无线网络中,它是完全不同的。维护和更新大型路由表将严重增加的网络负载,消耗大量的路由资源。辅助定位路由协议4,5没有大规模无线网络的路由表,但他们带来的另一个问题是增加了成本。这种协议规定每个网络节点应该有相应的硬件,比如全球定位系统装置或测量路由距离的装置等。另外传感器节点应该具备强大的计算能力,内存和资源的支持,因此每个单个节点的成本必然增加,在大规模网络中我们不能忽视这个问题。B相关分析通过对这些典型路由协议的分析,我们专注于大规模无线传感器网络的路由算法。为了降低整个网络的成本,我们不建议使用定位模块,而是使用广播电视协议。在广播电视协议中,公共节点维护一个路由表从而避免每个节点都维护各自的路由表,公共节点可以连接普通节点和路由表。每个普通节点记录它的下一跳路由距离,选择其最佳路由到邻居节点。三 、发送节点路由的路由协议在本节中,我们将介绍接收器路由器的路由协议的细节。首先,我们提出这项工作的假设:l 所有的无线传感器网络节点按照位置和功能可分为总节点和普通节点。l 常见的路由节点只有有限资源、计算能力和存储空间,他们可以通过无线网络相互通信。l 接收器是一个像有电源基站的特殊节点,发送节点具有强大的计算能力和存储空间,它可以提高工作效率和迅速。l 所有应用程序数据包在双向传输线路上单向传送:从总节点到一个普通的节点(命令数据包),并从一个普通的节点到总节点(答复数据包)。广播电视协议操作分为设置和稳定状态两个阶段。在设置阶段每个普通节点选择其最佳邻居建立路由表。在相对稳态状态数据传输考虑信息聚集和节省资源意识。详细设计如下:A邻居节点的发现和邻居节点的选择优化每个节点记录其到邻居节点的跳数。在设置过程中,每个普通节点将记录他到邻居节点的跳数(-1代表他们没有初始化),接收节点至它的初始值为0,接收广播的邻居节点数据包,测量他的邻居节点的距离。当一个普通节点收到邻居节点的数据包,它会检查邻居节点的路由表。如果测距加1小于接收器的目的路由,把发送节点的跳数增加1,并设置发送节点为最佳邻居,然后发送广播把更新的路由表发给邻居节点。如果不是,接收器忽略此数据包。在这种路由信息协议中,在理论上每个节点只有一次广播,因为最短的路径是早期的数据包到达,那么第一个节点接收具有最短路径,但考虑到通过发送、传递和处理通道所造成的延误冲突则不再如此。为了确保每节点只会收到一个较小的数据包并且只改变较少的路由表项从而使网络中的流量减少,所以当一个节点收到数据包后会等一会而不是马上发送它的路由表给邻居节点,达到减少数据包的目的11,这种方法证明了一个适当的等待值是有效。当所有的普通节点和初始节点路由表目录中的路径都是最佳路径,他们可以把自己的包传送给最佳邻居,邻居同样这么做,数据包将最终到达接收器,因此报文转发沿最佳路径。B汇路由表的编制通过建立最佳路径来更新普通节点。当每个普通节点选择或改变其最佳的邻居节点,它会提交报告报文,通知邻居的最有路径。表1显示的SRT格式。表一,更新的路由表节点ID优化邻居ABBCC下一跳下一跳路由表应是最短路径,以方便查询接收节点可以连接到任何的节点只要广播电视协议已经建立。例如,考虑案件表1,如果需要接收的数据包发送查询到节点A,那么它得到的最短路径和查询路径数据包可以沿着反向路径发送,因此这是一个最佳路径。C数据聚合和节能意识在路由数据包的过程,为了提高路由性能和延长网络寿命,使用广播电视协议的数据聚合战略,以减少网络负载和资源的消费,另外就是避免一些节点过早的死亡。1)数据汇总:在一般情况下,在稳定状态主要有两种在无线传感器网络的冗余负载种。为了减少负荷,提高了稳定性能,广播电视协议是建议如下:A)过程的原始数据:原始数据是数据项源收集了没有受到处理或其他操作,并且它也被称为主要数据。为了减少冗余负载,我们建议应处理原始数据在发送前。b)积累了重叠的数据:中间节点数据收集传感器最优路径应重叠从更远的节点。为避免重复起见负载,每个中间节点接收到的数据汇总在一个短暂时间t0,然后汇总数据传送到其最佳邻居9。因此对网络性能会显着增加。2)资源的意识:没有节能意识的广播电视协议始终沿着最短路径转发数据包,然后临界指数的位置在节点将无法迅速因缺乏能量6,9。图。 1显示了如何认识能源战略工程:通常,节点(甲,乙,丙,丁,戊,F)集的红色节点最佳的邻居,他们忙于处理节点和转发数据包。为了平衡网络负载,广播电视协议用更少的能源增加节点中的价值。知道中的能源是如下:=+*(1-%)(1)作为能源与知道测距,作为正常测距,作为作为能源的转储直径网络和%节点。在图1,一开始,每个节点能量已满(100),在dist是实际的距离(跳)下沉,然后六个节点上(甲,乙,丙,丁,戊,f)所有提出自己包以红节点的测距是1(= 1+ 1 /100 -1)。随着网络的运行,红色的能量消耗比别人快。当红色消耗的一半以上能源,其测距将大于2(=1 +1 / 50 - 1),然后一些节点(节点F)将另一节点的选择最佳邻居(蓝色节点),其测距等于2(= 2 +1 / 100 - 1)。在这种情况下,网络寿命和能源消耗是平衡的,它实现能源整个网络的效率显着。图1 意识到能源战略的范例如果一个普通节点广播一条只要它钕包改变其测距,该网络将受到广播风暴,因为一个测距变化将导致更多的变化。在为了避免广播风暴,我们建议,共同节点不能启动,直到广播接收器节点启动邻居发现期间的每一次TND指定的时间。四、模拟与分析广播电视协议是旨在改善大规模无线传感器网络的效率。我们的措施是提高网络性能、增加路由表的寿命和节省网络资源的意识。在本节中,我们将从模拟实验中分析结果。我们的研究目的是随着网络规模增大,我们如何知道网络性能变化,所以我们的实验由两部分组成:A大型网络的路由性能在这一部分,我们模拟在四个大小不同的广播电视协议网络。在我们的模拟场景中,节点均匀地分布在网络的中心地区,两个相邻节点彼此之间的距离小于无线链路的最大距离,节点只保留他们直接相邻的邻居。我们措施主要是每个不同规模网络的报文数和每个普通节点用于在设置阶段转发数据包的平均次数。其结果是如图2和图.3所示。图2 包数设置不同的网络规模阶段发送图2是节点在设置阶段发送的数据包的数量,揭示了一个与网络规模和数据包呈线性正相关。在设置阶段,节点有两种类型的数据包发送。少量的数据包交流有利于适应大型无线传感器网络。从图.3,我们可以看到,网络增加负载非常有限,因为网络规模的增长,而上升的趋势是减少。图3 每个节点转发数据包中设置阶段平均次数B. 在方案中发送节点的路由表很快就改变了,这是因为要更多的报文转发和资源的消耗。为了测试与能源意识的广播电视协议的资源消耗能力,我们设置一个能量领域。其实,热区集中在一平方一个与图网络角落。图4 拓扑结构的网络:接收器是在中心和热区集中在一个角落里我们设置120个普通节点和汇聚节点1实验和汇节点只发送数据包发送到查询在热点地区的节点,然后节点接收的数据包查询将发送回复发送节点。其他节点不接收查询包不包。我们测量的数据包数量有当被送到每个节点的首八个月死亡。图5显示具有节能意识和比较的广播电视协议。在图5的比较说明该路由转发效率显着优化能源意识。此外,在我们的模拟,当一个节点中继分组的10倍,将新发布的更新路由表通知邻居节点,从而可以根据特定的应用程序设置参数来控制消息包。图5 广播电视之间的比较节能意识,纯洁的SRT五、结论出于未来传感器网络应用的问题,我们研究了在大规模无线传感器网络的路由算法法。无线网络使用该路由协议可以更新路由表,对于每个路由节点都有能节省资源的消耗。这个策略尝试降低网络负载和平衡能量消耗,从而改善路由性能并为其增加网络的生命周期。仿真结果表明,对于路由节点分布不均匀、最短路径协议适应性强,能够延长网络的生命周期。参考文献1 Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, and ErdalCayirci, “A Survey on Sensor Networks,” IEEE CommunicationsMagazine, vol. 40, pp. 102-114, Aug 2002.2 Kemal Akkaya and Mohamed Younis, “A Survey on Routing Protocolsfor Wireless Sensor Networks,” Ad hoc Network, vol. 3, No. 3, pp. 325-349, May 2005.3 David B. Johnson and David A. Maltz, “Dynamic Souce Routing in AdHoc Wireless Networks,” in Mobile Computing, edited by TomaszImielinski and Hank Korth, Chapter 5, Kluwer Academic Publishers,pages 153-181, 1996.4 Yan Yu, Ramesh Govindan, and Deborah Estrin, “Geographical andEnergy Aware Routing: a recursive data dissemination protocol forwireless sensor networks,” In Seventh Annual ACM/IEEE InternationalConference on Mobile Computing and Networking (MobiCom 00),Aug 2000.5 Brad Karp and H. T. Kung, “GPSR: Greedy Perimter Stateless Routingfor Wireless Networks,” Proceedings of the sixth ACM InternationalConference on Mobile Computing and Networking, Boston,Massachusetts, pp. 243-254, July 2000.6 M. J. Handy, M Haase, and D. Timmermann, “Low Energy AdaptiveClustering Hierarchy with Deterministic Cluster-Head Seletion,” FourthIEEE Conference on Mobile and Wireless Communications Networks,Stockholm, erschienen in Proceedings, IEEE Computer Society, pp.129-136, 2002.7 James Newsome and Dawn Song, “GEM: Graph Embedding forRouting and Data-Centric Storage in Sensor Networks WithoutGeographic Information,” Proceedings of the First internationalconference on Embedded networked sensor system, Los Angeles,California, USA, November 05-07, 2003.8 Qiangfeng J. and Manivannan D. “Routing Protocols for SensorNetworks,” The First Consumer Communications and NetworkingConference, IEEE, pp. 93-98, January 2004.9 Lindsey S and Raghavendra CS, “PEGASIS: Power-Efficient Gatheringin Sensor Information Systems,” Proceedings of the IEEE AerospaceConference, Montana: IEEE Aerospace and Electronic Systems Society,pp. 1125-1130, 2002.10 Shah R C and Rabaey J, “Energy Aware Routing for Low Energy AdHoc Sensor Networks,” Proceedings of the IEEE WirelessCommunications and Networking Conference (WCNC), Orlando, IEEECommunications Society, pp. 350-355, March 2002.11 Zuchang Ma and Yining Sun, “Research on Routing Protocol of a LargeWireless Sensor Network (in Chinese),” Computer Engineering andApplication, pp. 165-168, November 2004.附件2:外文原文A Routing Protocol for Large-scale Wireless Sensor NetworksZhong Yu Cao Dept. of Computer Science &Technology East China Normal University Shanghai, CWei Zhang Dept. of Computer Science &Technology East China Normal University Shanghai, CGang Lu Dept. of Computer Science &Technology East China Normal University Shanghai, China AbstractRouting is a key technique for wireless sensor networks (WSN). In order to improve the efficiency of routing in large-scale WSN, we propose Sink Routing Table (SRT) routing protocol, a routing protocol for WSN, in this paper. In SRT protocol, nodes aggregate data and use energy aware neighbor selection to route packets towards the target along an optimal path, each common node has no need to maintain a routing table,sink node maintain one instead. Our simulation results show that SRT is robust on large-scale networks and works well in the face of uneven network load and energy consumption.Keywords-wireless sensor networks; routing protocol; Sink Routing Table; optimal path; aggregate data; energy awareI.I. INTRODUCTIONFuture wireless sensor networks (WSN) will be composed of a large number of densely deployed sensor nodes, and a key feature of such networks is that their nodes are unattended and powered by batteries. Therefore, energy efficiency is an important design consideration for these networks. Moreover, a higher lifetime of WSN can be accomplished through optimized applications, operating systems, and communication protocols 1, 2. This work focuses on a communication protocol for WSN.In order to reduce energy consumption and improve routing performance in large-scale WSN, we propose Sink Routing Table (SRT) routing protocol, a communication protocol for WSN in this paper. In SRT protocol, sink uses a routing table to forward query packets to common nodes and common nodes route data messages through the optimal neighbor to the sink. This approach makes use of the powerful computation, memory, storage, and replenishable energy resource of the sink and avoids maintaining routing tables in common nodes. Our protocol is generally applicable to large-scale WSN.The rest of the paper is organized as follows. We briefly discuss related work in Section 2. We explain SRT protocol in detail in Section 3, and present our experiment results in Section 4. Section 5 presents our conclusions.II. RELATED WORKA. Research on Typical Routing ProtocolsIn small-scale WSN, routing with routing table can have a thoroughly great performance, because nodes can forward packets along optimal paths with low delay, short routing table does not require powerful computational capacity and large storage, and consume less energy. But when routing table is used in large-scale WSN 8, its completely different. Maintaining and updating large routing tables will increase the network load seriously and consume lots of energy.Location-aided routing protocols 4, 5 work well in large scale WSN without routing tables, but another problem they bring is the increased costs. This type of protocols requires that each node of the networks should have localization hardware, such as a GPS (Global Positioning System) unit or a ranging device. Moreover, sensor nodes should have more computational capacities, memory, and power to support the positioning module. Then the cost of each single node must be increased and we cannot ignore this problem in large-scale networks.B. Related AnalysisThrough the analysis of some typical routing protocols, we focus on routing algorithm for large-scale wireless sensor networks. In order to reduce the cost of entire networks, we do not use positioning modules. Then we propose Sink Routing Table routing protocol. In SRT, sink node maintains a routing table for the sake of avoiding common node routing tables, and sink node can route to common nodes with the routing table. Each common node records its distance to sink node, and selects its optimal neighbor for routing to sink node.III. SINK ROUTING TABLE ROUTING PROTOCOLIn this section, we describe the Sink Routing Table routing protocol in detail. First of all, we state the assumptions of this work:l All the nodes of the WSN can be classified into sink node and common nodes according to location and function.l Common sensor nodes have limited energy source, computational capacities and storage, and they connect with each other using radio communication.l Sink is a special node with a wired power supply like a base station. Sink has powerful computational capacity and storage, and it can work more efficiently and speedily.l All application data packets are transmitted in one of the two directions: from sink to a common node (command packets) and from a common node to sink (reply packets).The operation of SRT consists of a set-up and a steady-state phase. During the set-up phase each common node selects its optimal neighbor and the sink establishes the sink routing table. During the steady-state phase data transfers with data aggregation and energy aware occur. Detailed design is as follows.A. Neighbor Discovery and Optimal Neighbor SelectionEach node maintains its distance to the sink node as DIST (hops). In the set-up phase, each common node sets its DIST to -1 (meaning that they have not initialized. -1 represent of ) and sink node sets its DIST to 0 and broadcasts a ND (Neighbor Discovery) packet to announce the value of its DIST to its neighbors. When a common node receives a ND packet, it checks the DIST of the sender. If the DIST plus 1 is less than receivers DIST, the receiver node sets its DIST as senders DIST plus 1 and sets the sender as its optimal neighbor, then broadcasts a ND packet to announce its DIST to its neighbors as well. If not, the receiver will ignore the ND packet.With this method of neighbor discovery, each node broadcasts only once in theory, because the less the DIST is, the earlier the packet arrives, then the first ND packet each node receives has the minimum DIST. But taking into account the delay caused by sending, relaying, handling and channel conflicting, no longer the case. In order to ensure that each node will only receive a smaller DIST ND packet leading to change its DIST and broadcast another ND packet, and reduce the total number of packets sent in the network, when a common node receives a ND packet with smaller DIST, it waits for a time (T wait) instead of broadcasts its ND packet at once. In 11, it is proved that an appropriate value T wait is effective.When all common nodes have initialized DISTs and selected optimal neighbors, they can forward packets to their optimal neighbors and the optimal neighbors do it the same way, the packets will eventually reach the sink, moreover, packets are forwarded along the optimal paths.B. Sink Routing Table EstablishmentSink establishes the SRT through the collection of report packets of common nodes. Whenever each common node selects or changes its optimal neighbor, it will forward a report packet to notify sink of the optimal neighbor, and sink records it in the SRT. TABLE 1 shows the format of the SRT.TABLE I. SINK ROUTING TABLENode IDOptimal NeighborABBCCSinkSink Routing Table should be sort by Nodes DIST in order to facilitate the querySink can connect to any node in the SRT as long as the SRT has been established. For example, consider the case of TABLE 1, if sink needs to send a query packet to node A, then it get the path (A-B-C-Sink) from the SRT and the query packet can be sent along the reverse path (Sink-C-B-A), moreover, this is an optimal path.C. Data Aggregation and Energy AwarenessIn the process of routing packets, in order to improve routing performance and prolong networks lifetime, SRT uses data aggregation strategy to reduce networks load and energy consumption, and uses energy aware strategy to balance networks load and energy consumption, and then avoid some nodes dying prematurely1) Data Aggregation: In general, during the steady-state phase there are mainly two kinds of redundancy load in WSN. In order to reduce redundancy load and enhanced the performance, SRT is proposed as follow:a) Process raw data: Raw data is a term for data collected on source which has not been subjected to processing or other manipulation, and it is also known as primary data. In order to reduce the redundancy load, we propose that raw data should be processed before it is sent.b) Aggregate overlapping data: Intermediate nodes on optimal paths collect sensor data which should be overlapping from their farther nodes. For the sake of avoiding redundancy load, each intermediate node aggregates the data received during a brief period of time t0 (t0 can be configed as appropriate), and then transfer the aggregated data to its optimal neighbor 9. Therefore the performance of networks will be increased significantly.2) Energy Awareness: SRT without energy awareness always forwards packets along shortest paths, and then the nodes at critial position will fail quickly due to the lack of energy 6, 9. Fig. 1 shows how energy aware strategy works: Normally, nodes (A, B, C, D, E, F) set the RED node as their optimal neighbor, and they force RED node busy processing and forwarding packets. In order to balance networks load, SRT increases the DISTs value of the nodes with less energy. The energy aware DISTs are calcuated as follows:=+*(1-%)(1)withas the energy aware DIST, as the normal DIST, as the diameter of the network and% as the dump energy of the node.In Fig. 1, at the beginning, the energy of each node is full (100%), the DIST is the actual distance (hops) to sink, and then the six nodes in the upper (A, B, C, D, E, F) all forward their packets by the RED node whose DIST is 1=1 + 1/100% - 1). With the network operating, REDs energy is consumed faster than others. When RED consumes more than half of its energy, its DIST will be greater than 2 (=2+ 1/50% - 1), then some nodes (node F) will select another node as their optimal neighbor (the BLUE node) whose DIST equals 2 (=2 + 1/100% - 1). In this case, networks lifetime and energy consumption are balanced, and it achieve energy efficiency for the whole network significantly.Figure 1. Example of energy aware strategyIf a common node broadcasts a ND packet as long as it changes its DIST, the network will be subject to broadcast storms, because one DIST change will lead to more changes. In order to avoid broadcast storms, we propose that common nodes cannot start a broadcast until the sink node starts a neighbor discovery period every specified period of time TND.IV. SIMULATION AND ANALYSISSRT is designed to improve efficiency in large-scal

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论