传感器论文中英文期刊

节能机制无线传感器网络Bonuccelli毛主管:论文commettee:保罗·Ferraggina,皮耶罗Maestrini外部裁判Basagni,摩尼Srivastava:斯蒂法诺国家commettee:Bugliesi,Panzieri,Meo2005年12月27日起,文摘本文解决这个问题降低能耗的无线传感器网络。我们提出一套技术和进口策略研究领域,可以应用于设计节能协议传感器网络。他们包括时间序列预测,quorums系统的传感器性能和相互作用的协议设计的。我们运用这些技术能有效时间同步问题,从传感器网络数据收集,并确保较强的数据一致性保证在移动网络。我们表现出[1、2、3、4]时间序列预测技术,特别是AR模型,可适用于传感器网络,以节省能源。我们学习一个简单的类型的时间序列模型的构建与短预测的窗口。我们已经选择了这个模式,它很能干预测的数据得到了真实世界的传感器测量的物理现象,它非常容易加工的在modern-generation传感器网络。我们运用这些模式,解决两个有关问题进行传感器网络:问题能有效地收集传感器的数据在水槽,和时间同步的问题。提出了一种节能框架,叫爱相似-通过适应性强的查询框架[1,2]),为近似查询及检测孤立点价值在传感器网络。这个想法是基于“增大化现实”技术结合当地建立在每个节点模型成为一个全球性的模型存储的根源,网络(库),用来大约回答用户的查询。我们的方法使用显著比以前更少的传输采用基于“增大化现实”技术近似方法模型和组织网络集群基于数据之间的相似节点。数据定义基于相似系数模型的地方基于“增大化现实”技术,在水槽储存在技术,降低了能耗直接比较数据值,让我们可以得到有效的聚类算法大概是最佳的,总分组数所形成的网络。我们的集群建设有几个有趣的特点,使适宜也针对移动网络:首先,他们可以捕捉相似性地理相邻节点;二、聚类成员,不需要额外消耗适应节点;三、集群内不需要跟踪加入其他节点在产业集群。此外,大概正确的误差界爱提供并允许用户动态调整回答质量解答疑问在能源和资源有效地进行。此外,我们运用AR模型来解决时间同步问题的一种新的视角生物系的互补时钟同步问题[3,4]。更确切地说,我们分析的案例传感节点决定跳过一个或多个时钟调整,达到节能效果,或是暂时孤立的,但仍需要一个精确计算时间。提出了一种基于大概正确的时钟返回一个模型,是基于“增大化现实”技术一时间估计在一个常数(可调误差概率约束和问题。该方法是高度适应性强,并允许传感器来决定有多少时钟调整它可以跳过同时保持精度,从而节约能源。此外,我们提出一套确定方法,降低了时间估计误差由至少一个因素2。更确切地说,我们提出大概正确的确定性时钟读数方法,叫做DCR方法,利用相关信息时钟偏差的标志,可应用于减少一半时钟周期的频率调整,同时还保持了同样的错误一定[3,4]。该方法的实践和理论两个方面的兴趣。事实上,它导致了一个明显的节能,并详细地说明了较强的现实时钟模型可以导致精化的最优开往最大偏差时钟的定时同步。此外,我们还提出了一种广义版本的DCR方法,以提高其精度取决于稳定的时钟,一个方法的单调性,保证了生产的时间值。第一次我们分析系统技术背景法定传感器网络:我们改造,并向自己的利益能耗方面[6]。法定人数系统有潜力在节约能源方面传感器网络,因为他们可以减少的数量明显的沟通,提高传感器节点之间的负载平衡,提高系统的可扩充性。然而,以前的法定人数系统和法定人数的度量标准,有线网络提出了,不适合传感器网络,因为他们并没有解决它们的性能特点和局限性。这些观察推动了我们重新设计的法定人数系统及相应的度量标准,考虑到限制和特点的感测器(例如,传输成本,有限的能量源、物理的无线电广播),网络拓扑结构。更确切地说,我们重新定义下列法定度量标准:负载均衡、访问成本和法定人数能力,并设计策略的一些特点的基础上,对传感器网络的沟通量减少的人数系统设计时传感器网络。我们运用这些策略设计一个家庭的人数系统节能高弹性。特别是,我们提出一种法定人数减少建设成本,提出了一个访问数据扩散协议建立在节能上面减少能源消费的传输,缩短了碰撞产生的。此外,我们分析的情况下的人数系统高节点移动性。更确切地说,我们学习困难的问题保证在两个quorums十字路口时不断移动路径沿着未知节点[7]。我们解决这个问题,并定义了一小说,提供流动性模型最低约束集推导出足够强劲的经济数据保证在高机动性的网络。在这种情况下,我们会告诉名校以前的法定人数系统,并提供一个条件是必要的,以保证数据的可用性和原子一致性在高节点移动性。我们还提出了一种新的班法定人数的系统,被叫做移动传播(苦咸水淡化,适合于高度quorums移动网络,提出了一种最优建设法定人数方面,大小(例如,通信传输)[7]。然后,我们运用总经理法定人数体系,实行大概正确的原子读/写共享内存移动、稀疏的网络。书目[1],国立台湾Tulone·d·马登上尉。PAQ:时间序列预测为近似查询回答在传感器网络。在第三Proc.欧洲研讨会,第1 - 11页。无线传感器网络21-37 2006年2月。[2],国立台湾Tulone·d·马登上尉。查询框架了节能检测传感器网络中节点相似之处。提交会议。[3]·d·Tulone。全球的可行性评价隔离条件下的无线传感器网络。出现在Algorithmica。[4]·d·Tulone。节约型时间估计的无线传感器网络。在Proc.的第四届车间的原则下,第1 - 11页。52-59移动计算,2004年10月。Tulone >[5]。如何能有效率及准确地得到参考时间之间的过程吗?国际。Symp.分布式计算,10月2003年。简短的声明。25-32页。[6]D。Demaine Tulone > >。重新设计的法定人数系统的无线传感器网络。提交会议。Tulone >[7]。是否有可能确保强劲的经济数据保证在高机动性的网有关吗?提交会议。

《传感器技术》就非常好。

没那么麻烦的，下个《有道词典》然后把你找到的原文复制进去，点翻译一切就O了！这个软件很好很强大哦

推荐《仪表技术与传感器》，核心期刊，以下是杂志的收录情况，希望有所帮助：

《仪表技术与传感器》被以下数据库收录：

SA 科学文摘(英)(2011)

JST 日本科学技术振兴机构数据库(日)(2013)

CSCD 中国科学引文数据库来源期刊（2017-2018年度）（含扩展版）

北京大学《中文核心期刊要目总览》来源期刊：

1992年(第一版),1996年(第二版),2000年版,2004年版,2008年版,2011年版,2014年版;

期刊荣誉：

Caj-cd规范获奖期刊;第二届全国优秀科技期刊;

英文原文呢？

这是一篇 PH.D的论文，谈论有关 无线传感网络 的，你看下，是否符合你需要，如果类型都不一致，那就没必要翻译了。Mechanisms for energy conservation in wireless sensor networksSupervisor: Maurizio BonuccelliThesis commettee: Paolo Ferraggina, Piero MaestriniExternal referees: Stefano Basagni, Mani SrivastavaNational commettee: Bugliesi, Meo, and Panzieri December 27, 2005 AbstractIn this thesis we address the problem of reducing energy consumption in wireless sensor networks. We propose a suit of techniques andstrategies imported from other research areas that can be applied to design energy-efficient protocols in sensor networks. They includetime series forecasting, quorums systems, and the interaction between sensor properties and protocol design. We apply these techniques to the time synchronization problem, to efficiently collecting data from a sensor network, and to ensuring stronger data consistency guarantees in mobile networks.We show in [1,2,3,4] that time series forecasting techniques, and in particular autoregressive (AR) models, can be applied to sensor networks to conserve energy. We study a simple type of time series models with a short prediction window. We have chosen this model because it is capableof predicting data produced by real-world sensors measuring physical phenomena, and it is computationally tractable on modern-generation sensor networks. We apply these models to solve two relevant problems in sensor networks: the problem of efficiently collecting sensor data at the sink, and the time synchronization problem.We propose an energy-efficient framework, called SAF Similarity--based Adaptable query Framework [1,2] ), for approximate querying and detecting outlier values in sensor networks. The idea is to combine local AR models built at each node into a global model stored at the root of the network(the sink) that is used to approximately answer user queries. Our approach uses dramatically fewer transmissions than previous approximate approaches by using AR models and organizing the network into clusters based on data similarity between nodes. Our definition of data similarity is based on the coefficients of the local AR models stored at the sink, which reduces energy consumption over techniques that directly compare data values, and allows us to derive an efficient clustering algorithm that is provably optimal in the number of clusters formed by the network. Our clusters have several interesting features that make them suitable also for mobile networks: first, they can capture similarity between nodes that are not geographically adjacent; second, cluster membership adapts at no additional cost; third, nodes within a cluster are not required to track the membership of other nodes in the cluster. Furthermore, SAF provides provably correct error bounds and allows the user to dynamically tune answer quality to answer queries in an energy and resource efficient manner.In addition, we apply the AR models to solve the time synchronization problem from a novel perspective which is complementary to the well-studied clock synchronization problem [3,4]. More precisely, we analyze the case in which a sensor node decides to skip one or more clock adjustments to save energy, or it is temporarily isolated, but still requires an accurate estimate of the time. We propose a provably correct clock method based on AR models, which returns a time estimate within a constant (tunable) error bound and error probability. This method is highly adaptable and allows the sensor to decide how manyclock adjustments it can skip while maintaining the same time accuracy, thus saving energy. In addition, we propose a suit of deterministic methods that reduce the time estimation error by at least a factor 2. More precisely, we propose a provably correct deterministic clock reading method, called the DCR method, which exploits information regarding the sign of the clock deviation, and can be applied to reduce by half the frequency of the periodic clock adjustments, while maintaining the same error bound [3,4]. This method is of both practical and theoretical interest. In fact, it leads to a noticeable energy saving, and shows that a stronger but realistic clock model can lead to a refinement of the optimality bound for the maximum deviation of a clock that is periodically synchronized. In addition, we propose a generalized version of the DCR method that enhances its accuracy depending on the clock stability, and a method that guarantees the monotonicity of the time values produced.We analyze for the first time quorum system techniques in the context of sensor networks: we redesign them and show their benefits in terms of energy consumption [6]. Quorum systems have the potential to save energy in sensor networks since they can reduce noticeably the amount of communication, improve the load balance among sensor nodes, and enhance the scalability of the system. However, previous quorum systems and quorum metrics, proposed for wired networks, are unsuitable for sensor networks since they do not address their properties and limitations. These observations have motivated us to redesigning quorum systems and their metrics, taking into account the limitations and characteristics of sensors (e.g., transmission costs, limited energysource, physical radio broadcast), and the network topology. More precisely, we redefine the following quorum metrics: load balance, access cost and quorum capacity, and devise some strategies based on some characteristics of sensor networks that reduce the amount of communication when designing quorum systems for sensor networks. We apply these strategies to design a family of energy-efficient quorum systems with high resiliency. In particular, we propose a quorum construction that reduces the quorum access cost, and propose an energy-efficient data diffusion protocol built on top of it that reduces the energy consumption by reducing the amount of transmissions and collisions.In addition, we analyze quorum systems in case of high node mobility. More precisely, we study the difficult problem of guaranteeing the intersection between two quorums in case nodes move continuously along unknown paths [7]. We address this problem by defining a novel mobility model that provides a minimum set of constraints sufficient to derive strong data guarantees in highly mobile networks. Also in this case, we show the unsuitability of previous quorum systems, and provide a condition which is necessary to guarantee data availability and atomic consistency under high node mobility. We propose a new classof quorum systems, called Mobile Dissemination (MD) quorums, suitable for highly mobile networks, and propose a quorum construction which is optimal with respect to the quorum size (i.e., message transmissions) [7]. Then, we apply the MD quorum system to implement a provably correct atomic read/write shared memory for mobile and sparse networks.Bibliography [1] D. Tulone, S. Madden. PAQ: Time series forecasting for approximate query answeringin sensor networks. In Proc. of the 3rd European Workshop on Wireless Sensor Networks, pp. 21-37, Feb 2006.[2] D. Tulone, S. Madden. An energy-efficient querying framework in sensor networks for detecting node similarities.Submitted to conference.[3] D. Tulone. On the feasibility of global time estimation under isolation conditions in wireless sensor networks.To appear in Algorithmica.[4] D. Tulone. A resource-efficient time estimation for wireless sensor networks. In Proc. of the 4th Workshop of Principles of Mobile Computing, pp. 52-59, Oct 2004.[5] D. Tulone. How efficiently and accurately can a process get the reference time? Intl. Symp. on Distributed Computing, Oct2003. Brief announcement, pp. 25-32.[6] D.Tulone, E. D. Demaine. Redesigning quorum systems for wireless sensor networks. Submitted to conference.[7] D. Tulone. Is it possible to ensure strong data guarantees in highly mobile networks? Submitted to conference.