Battery-Aware Routing for Streaming Data Transmissions in Wireless Sensor Networks

Recent technological advances have made it possible to support long lifetime and large volume streaming data transmissions in sensor networks. A major challenge is to maximize the lifetime of battery-powered sensors to support such transmissions. Battery, as the power provider of the sensors, therefore emerges as the key factor for achieving high performance in such applications. Recent study in battery technology reveals that the behavior of battery discharging is more complex than we used to think. Battery powered sensors might waste a huge amount of energy if we do not carefully schedule and budget their discharging. In this paper we study the effect of battery behavior on routing for streaming data transmissions in wireless sensor networks. We first give an on-line computable energy model to mathematically model battery discharge behavior. We show that the model can capture and describe battery behavior accurately at low computational complexity and thus is suitable for on-line battery capacity computation. Based on this battery model we then present a battery-aware routing (BAR) protocol to schedule the routing in wireless sensor networks. The routing protocol is sensitive to the battery status of routing nodes and avoids energy loss. We use the battery data from actual sensors to evaluate the performance of our protocol. The results show that the battery-aware protocol proposed in this paper performs well and can save a significant amount of energy compared to existing routing protocols for streaming data transmissions. Network lifetime is also prolonged with maximum data throughput. As far as we know, this is the first work considering battery-awareness with an accurate analytical on-line computable battery model in sensor network routing. We believe the battery model can be used to explore other energy efficient schemes for wireless networks as well.     

VC++实现的串口通讯数据处理

说明了在异步串行通信(RS-232)的工作方式下,对所接收的数据进行接收、处理,丢弃乱码,并进行保存的可靠方法,并给出了相关的VC 语言程序.     

射频识别模块SMC51489在门禁系统中的应用

射频识别系统一般由三部分组成:电子标签(射频卡)、读取器和天线.正确快速的识别电子标签的标签号码,是门禁系统发挥其功能的先决条件.以无源低频射频卡识别模块SMC51489为例,介绍了对射频卡信息读取的原理和方法,并给出了相应的软件编程.实验证明该模块不仅具有较大的读卡距离,而且工作可靠.     

CPLD在雷达伺服轴角编码电路中的应用

介绍一种针对正、余弦旋转变压器—数字转换器(RDC)模块，用复杂可编程逻辑器件(CPLD)技术实现伺服轴角编码电路设计的方案。分析了轴角编码器系统中14XSZ系列旋转变压器—数字转换器的原理、轴角粗精组合原理及轴角纠错原理。详细介绍了CPLD的内部功能电路、CPLD轴角粗精组合和纠错实现电路，以及CPLD的工作时序图。提出了利用CPLD实现轴角粗精组合处理的方案，并通过了实际系统运行的考验，证明该方案可行。     

基于PCI总线的高速多路数据传输卡设计

介绍了一套基于外部设备互连(PCI)总线的高速多路数据传输卡的设计,采用基于PCI内核与PCI用户逻辑相结合的新型设计方案,在顶层通过仿真来验证PCI接口以及用户逻辑设计正确与否.降低了设计的复杂程度,提高了电路的集成度和系统的性能,并根据PCI卡对外部设备驱动能力较弱的特点,在传输卡中加入了长线驱动功能,采用低电压差分信号(LVDS)技术,既降低了系统功耗,又实现长距离的计算机双向通信.     

3G认证和密钥分配协议的形式化分析及改进

介绍了第三代移动通信系统所采用的认证和密钥分配(AKA)协议,网络归属位置寄存器/访问位置寄存器(HLR/VLR)对用户UE(用户设备)的认证过程和用户UE对网络HLR/VLR的认证过程分别采用了两种不同的认证方式,前者采用基于"询问-应答"式的认证过程,后者采用基于"知识证明"式的认证过程.使用BAN形式化逻辑分析方法分别对这两种认证过程进行了分析,指出在假定HLR与VLR之间系统安全的前提下,基于"知识证明"式的认证过程仍然存在安全漏洞.3GPP采取基于顺序号的补充措施;同时,文中指出了另一种改进方案.     

光纤荧光传感器衰减寿命的加权对数拟合法

荧光寿命的检测是荧光光学传感器的核心内容，国际上尝试了多种方法来拟合这种理论上为单指数衰减信号的荧光衰减曲线。这些方法包括非线性函数标准拟合方法。即Levenburg-Marquardt方法，以及Prony方法、FFT方法，对数拟合法等等。为了克服在实际应用中发生的信号退化，需要在测量信号衰减寿命的同时测量信号的初始强度。文章介绍了一种加权的对数拟合法，经计算机仿真及实际数据测试均可以得到和Levenburg-Marquardt方法非常接近的结果，且拟合时间大大缩短，测量稳定性大大提高。仿真测试及具体实验测试结果显示了这种方法的有效性。该方法不仅与Levenburg-Marquardt方法的偏差曲线非常相似，而且实验测得的荧光寿命与Levenburg-Marquardt方法偏差在0．2％以内。     

GPRS业务模型和无线网络的研究

根据GPRS业务及业务发展情况，对GPRS业务模型进行深入研究，并对GPRS无线网络进行了更深入的探讨。     

组合DEA方法与成熟度模型对项目效益的评价

为全面考虑资金、管理决策能力等因素对项目效益的影响，本运用数据包络分析与项目成熟度模型结合的方法来对企业各个项目之间的相对效益进行评价，应用结果表明该评价方法对于企业资源的最优配置、提高总体效益是十分有用的。     

Estimating and eliminating redundant data transfers over the web: a fragment based approach

Redundant data transfers over the Web, can be mainly attributed to the repeated transfers of unchanged data. Web caches and Web proxies are some of the solutions that have been proposed, to deal with the issue of redundant data transfers. In this paper we focus on the efficient estimation and reduction of redundant data transfers over the Web. We first prove that a vast amount of redundant data is transferred in Web pages that are considered to carry fresh data. We show this by following an approach based on Web page fragmentation and manipulation. Web pages are broken down to fragments, based on specific criteria. We then deal with these fragments as independent constructors of the Web page and study their change patterns independently and in the context of the whole Web page. After the fragmentation process, we propose solutions for dealing with redundant data transfers. This paper has been based on our previous work on ‘Web Components’ but also on related work by other researchers. It utilises a proxy based, client/server architecture, and imposes changes to the algorithms executed on the Proxy server and on clients. We show that our proposed solution can considerably reduce the amount of redundant data transferred on the Web. Copyright © 2004 John Wiley & Sons, Ltd.