基于能量变化的无线传感器网络覆盖算法

设计了一种基于能量变化的无线传感器网络覆盖算法.通常网络节点连接的通信范围应该大于两倍的感应范围,但这将导致网络能耗的增加.提出的算法采用最少数量的节点来解决传感器网络的覆盖率和网络的连通性问题.测量结果表明,提出的覆盖算法可以满足传感器节点的通信范围小于两倍的感应范围.这将降低传感器网络的能量损耗.算法通过使用不同能量水平的活跃节点来降低能量损耗,并且可以延长系统的使用寿命.     

P2P环境下基于WSN和RFID的供应链管理语义监控平台

提出了一种基于语义P2P的无线传感器网络应用架构,在此架构下融合了RFID技术提出了供应链管理的语义监控平台.该平台采用语义P2P技术解决了信息过载通信瓶颈问题,方便了传感器节点部署、使得传感器网络易于扩展,同时采用本体技术实现了供应链管理中的信息语义交互和共享,为供应链中信息的及时、无歧义理解提供了便利.     

多无线WMN中干扰最小化信道分配算法研究

为了提高无线迈适网的通信容量,网络中的每个路由节点均配备有多个无线网卡,并提供多个可用的无线信道.如何将这些信道合理地分配到网络的各个通信链路上,使得整个网络的干扰最小是一个至关重要问题.分析了基于禁忌搜索的信道分配算法,并针对该算法存在的问题,提出了初步的改进算法.     

数学三个世界的理论简介

建构主义认为学习即发展,教学的作用在于根据学生实际需要帮助其发展.2004年英国Warwick大学教授David Tall以建构主义理论为基础,结合当代认知科学、信息科学、新皮亚杰主义等研究成果创立了数学的三个世界理论.该理论主要以中学生和大学生为研究对象,重新划分了认知层次,更加合理地解释了人的认知发展过程.本文旨在阐述该理论在促进学生发展过程中的作用.1 数学的三个世界理论结构概念—具体化世界:以对世界的感知为基础,通过反思利用语言形成精致的意义.不仅包括对外部世界的认识,也包括对主体内部世界的感知.在这个世界中数学学习的对象是具体的、形象的、可见的,简称具体化世界.     

Sink移动的无线传感网中高连通性密钥预分配方案研究

在Sink移动的无线传感器网络中,安全性和连通性是密钥预分配方案研究中的两个难点.根据节点间安全通信的设计原理,移动Sink节点与传感器节点按一定概率进行安全通信,当网络规模较大时存在大量节点无法与移动Sink节点进行通信,从而降低整个网络的数据收集率.针对这一问题,基于算法N-PGPS为网络提供安全通信的前提下,提出了一种基于树的密钥预分配方案IN-PGPS.该方案以移动Sink节点为根节点,与其通信范围内的传感器节点构成一颗局部树,以此提高传感器节点与移动Sink节点连通的概率、提高网络连通性.分析结果表明,与已有的密钥预分配方案相比,IN-PGPS方案有效提高了网络的连通性.     

基于北斗的装备保障指挥系统设计

针对战时武器装备保障指挥特点,利用北斗系统作为保障指挥系统的定位和通信平台,设计北斗系统的应用结构方式和定位通信分层模型,开发传输层通信协议,构建基于北斗的装备保障指挥系统及保障指挥中心软件体系结构,能够有效的为战时装备保障指挥提供决策支持.     

VANET中基于非时隙CSMA/CA机制的IEEE802.15.4性能评估

IEEE 802.15.4是一个潜在的标准,可以在基于无线传感器网络的车载自组织网络(VANET)应用中提供高效和高质量的车辆到基础设施通信.在本研究中,提出了一种基于非时隙载波侦听多路访问和冲突避免机制的IEEE 802.15.4的数学模型,以研究介质访问协议在车载通信场景中的性能,该通信过程通过采用伯努利反馈重试的M/G/1排队系统建模,来分析其可靠性、受冲突影响的数据包延时和物理层中的数据丢失.模型分析结果与蒙特卡罗模拟的结果一致,适用于交通流量大和冲突概率高的情况.     

谈谈直观性原则在数学教学中的应用

所谓直观性原则,是指教师在教学中善于采用多种方式和手段,让学生通过直接的感知,形成丰富的表象,掌握感性认识,使概念的形成过程以事实、实物和表象为基础.由于教学过程中,很多知识比较抽象,让学生难以理解,因此,我们有必要借助生动的直观予以弥补.……     

基于云计算的智慧教室系统设计

云计算在信息时代开启了崭新的一页,目前是计算机领域研究热点,因其强大的计算能力和灵活的服务能力而备受关注.但它在教育领域的应用还处于初级研究阶段,缺少成熟的设计和应用模式.以云计算与物联网技术为基础,提出了一个智慧教室系统的建构模型,并总结了其对传统教育模式的改进.     

基于罚函数方法的Leach协议

为延长无线传感器网络生存时长、减少网络能量消耗,首先将自适应粒子群优化算法应用于Leach协议,获得每一轮的最优簇头集;再基于罚函数方法,对集合中处于边缘位置的感知节点以及基站附近能量较低的感知节点进行惩罚,降低其当选为簇头的概率.通过大量仿真实验表明,协议对网络中簇头节点的选取更加合理,死亡节点分布由外而内,使节点能量负载更加均衡.     

Data association based on optimization in graphical models with application to sensor networks

We propose techniques based on graphical models for efficiently solving data association problems arising in multiple target tracking with distributed sensor networks. Graphical models provide a powerful framework for representing the statistical dependencies among a collection of random variables, and are widely used in many applications (e.g., computer vision, error-correcting codes). We consider two different types of data association problems, corresponding to whether or not it is known a priori which targets are within the surveillance range of each sensor. We first demonstrate how to transform these two problems to inference problems on graphical models. With this transformation, both problems can be solved efficiently by local message-passing algorithms for graphical models, which solve optimization problems in a distributed manner by exchange of information among neighboring nodes on the graph. Moreover, a suitably reweighted version of the max–product algorithm yields provably optimal data associations. These approaches scale well with the number of sensors in the network, and moreover are well suited to being realized in a distributed fashion. So as to address trade-offs between performance and communication costs, we propose a communication-sensitive form of message-passing that is capable of achieving near-optimal performance using far less communication. We demonstrate the effectiveness of our approach with experiments on simulated data.     

Teaching communication in an MBA operations research/management science course

This paper discusses the inclusion of a writing requirement within a first-year Operations Research/Management Science (OR) course of a Masters of Business Administration (MBA) curriculum. The inclusion of a writing requirement addresses the importance of communication in OR. It is the authors’ supposition that many of the recent criticisms of OR teaching have their roots in poor OR communication. Although OR faculty members can well argue relative values, we have failed to adequately prepare our students to communicate relevant insights from OR studies. The integration of a writing requirement, consisting of short executive summary-style reports and a major term project, within an MBA OR course can do much in promoting further OR study and OR work. This paper describes our experience in instituting a writing requirement within a first-year MBA course in OR.     

南极中山站周边水环境冰情监测系统的设计与研究

系统实现对南极中山站周边冰、水环境的长期连续实时监测,可以为分析南极环境变化是否对全球气候异常变化造成影响提供最基本的科学数据.利用空气,冰与水介质的电导率不同的原理用微控制器控制冰情检测传感器来实现冰水环境的自动化监测,设计了可以实现冰厚度、水深度、温度的定点连续冰情监测系统,监测数据可以存储在系统内嵌的SD存储卡中,方便观测人员进行调用.通过卫星实现数据无线传输.     

Topology design for on-demand dual-path routing in wireless networks

One way to achieve reliability with low-latency is through multi-path routing and transport protocols that build redundant delivery channels (or data paths) to reduce end-to-end packet losses and retransmissions. However, the applicability and effectiveness of such protocols are limited by the topological constraints of the underlying communication infrastructure. Multiple data delivery paths can only be constructed over networks that are capable of supporting multiple paths. In mission-critical wireless networks, the underlying network topology is directly affected by the terrain, location and environmental interferences, however the settings of the wireless radios at each node can be properly configured to compensate for these effects for multi-path support. In this work we investigate optimization models for topology designs that enable end-to-end dual-path support on a distributed wireless sensor network. We consider the case of a fixed sensor network with isotropic antennas, where the control variable for topology management is the transmission power on network nodes. For optimization modeling, the network metrics of relevance are coverage, robustness and power utilization. The optimization models proposed in this work eliminate some of the typical assumptions made in the pertinent network design literature that are too strong in this application context.     

A distributed approximation algorithm for the bottleneck connected dominating set problem

Some of the most popular routing protocols for wireless sensor networks require a virtual backbone for efficient communication between the sensors. Connected dominating sets (CDS) have been studied as a method of choosing nodes to be in the backbone. The traditional approach is to assume that the transmission range of each node is given and to minimize the number of nodes in the CDS representing the backbone. A recently introduced alternative strategy is based on the concept of k-bottleneck connected dominating set (k-BCDS), which, given a positive integer k, minimizes the transmission range of the nodes that ensures a CDS of size k exists in the network. This paper provides a 6-approximate distributed algorithm for the k-BCDS problem. The results of empirical evaluation of the proposed algorithm are also included.     

光电跟踪仪多传感器数据采集研究

光电跟踪仪数据采集是利用DSP处理技术及多总线结构,实现电视跟踪通道、红外跟踪通道、激光测距机、光纤陀螺仪等多传感器数据的提取,并采用CPCI总线技术结合双端口存储器（双端口RAM）实现系统中信息的快速传输,为光电跟踪仪伺服控制系统提供可靠的数据信息。介绍数据采集系统的设计思想及工作原理,重点研究系统中各传感器的控制方式和接口设计等,并简要说明各系统之间的信息传输方式。     

Review of methodology and design of broadband wireless networks with linear topology

Creation of a modern infrastructure for multimedia data (voice, data, video) transmission along the long transport routes is one of the most important problems while designing and building up the new highways and exploiting the existing ones. The solution of this problem is especially relevant for countries with a vast territory, like the Russian Federation. Creation of such communication infrastructure allows to provide (i) the operating control over the technical parameters of a route by the means of high-speed data transfer from sensors and data units to the control center (ii) the security control over the route sections and strategically important objects using data from the video surveillance systems and (iii) the voice communication (IP-telephony) and transmission of multimedia information between the stationary and mobile objects on long highways as well as communication with the control center etc.     

Queues with Equally Heavy Sojourn Time and Service Requirement Distributions

For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time distribution is heavier than the tail of the service requirement distribution when the latter has a regularly varying tail. In contrast, for the M/G/1 queue with Processor Sharing, Zwart and Boxma [26] showed that under the same assumptions on the service requirement distribution, the two tails are equally heavy. By means of a probabilistic analysis we provide a new insightful proof of this result, allowing for the slightly weaker assumption of service requirement distributions with a tail of intermediate regular variation. The new approach allows us to also establish the tail equivalence for two other service disciplines: Foreground–Background Processor Sharing and Shortest Remaining Processing Time. The method can also be applied to more complicated models, for which no explicit formulas exist for (transforms of) the sojourn time distribution. One such model is the M/G/1 Processor Sharing queue with service that is subject to random interruptions. The latter model is of particular interest for the performance analysis of communication networks.     

于改进UGF算法的线性拓扑WSN系统可靠性评估

提出了面向感知数据融合的通用发生函数(UGF)改进算法,并使用该算法对线性拓扑结构的无线传感网络(WSN)可靠性进行了评估。首先对PEGASIS协议下WSN的线性拓扑结构及数据传输过程进行抽象,建立了双向连续k/n:F系统模型。然后根据WSN感知数据传输及融合方式,在改进算法中重新定义了传感节点的UGF表达式和组合算子。最后对双向连续k/n:F模型进行单向化分解,根据得到的单向模型可靠性推导出双向模型的可靠性表达式。通过具体实例对提出的改进算法进行了验证,计算结果显示改进的算法可有效解决传感网络线性拓扑结构可靠性评估问题。