容错型令牌总线网性能评价算法

本文对符合ＩＥＥＥ８０２．４和ＭＡＰ标准的令牌总线网的性能指标评估给出了一种新的计算方法。文中重点考虑了具有信包重发机制、令牌最大保留时间和信包缓冲区容量有限的令牌网络的性能指标评估问题，克服了以往不能分析同时具有信包重发机制和令牌最大保留时间令牌网性能的局限。文中给出的方法简单易行、计算迅速、精度颇高。最后，本文通过例题说明了此方法的应用。     

An asynchronous neighbor discovery algorithm for wireless sensor networks

We consider the problem of determining, in a distributed, asynchronous and scalable manner, what nodes are “neighbors” in a wireless network. Neighbor discovery is an important enabler of network connectivity and energy conservation. An asynchronous, probabilistic neighbor discovery algorithm is presented that permits each node in the network to develop a list of its neighbors, which may be incomplete. The algorithm is analyzed and parameter settings are derived which maximize the fraction of neighbors discovered in a fixed running time. A companion distributed algorithm is also described which allows all the nodes in the network to execute that neighbor discovery algorithm without the need to agree on a common start time.     

采用动态令牌的MANET多址接入协议

本文设计了一种采用动态令牌算法的MANET多址接入协议,解决了隐藏终端和入侵终端问题.利用这种算法,不再需要为令牌的传递预先建立虚拟的令牌逻辑环路,而是根据当前的网络拓扑结构自动地形成令牌的传递路由,使得令牌的传递能够适应网络拓扑结构动态的动态变化.同时,通过周期性地产生令牌并严格地限制每个令牌的生存时间,简化了令牌的维护过程,并为时延敏感的业务提供良好的QoS保障.另外,该协议采用一种互同步技术,具有成本低廉、运行可靠的特点,可完全独立于其它系统(如GPS等),且已应用于实际的MANET网络.     

An algorithm for fault-tree probabilities using the factoring theorem

This paper describes an algorithm (and implementation of the algorithm) called FACTOR for determining the probability of the top event in a fault tree. The methodology is exact and does not involve cut sets. It is primarily a top-down recursive approach that judiciously uses “factoring” in the form of the elementary equation P(F) = P(E) P(F|E) + P(E^c) P(F|E^c). While indiscriminate use of conditional probabilities in this form would be very inefficient, examples from the current literature show that the algorithm FACTOR often gives exact results in times comparable to recently published approximation methods implemented on mainframe computers. FACTOR is portable and was implemented and tested on a Macintosh microcomputer.     

基于BP网络的数字电路多故障诊断研究

为了更有效地对数字电路进行多故障诊断,提出了一种利用电路的故障真值表来表征电路在有故障和无故障状态下的特征信息来对电路进行故障诊断的新方法。该方法使用BP型神经网络,运用误差反向传播算法,把从电路中提取的有效特征信息作为样本对网络反复训练,从而实现用单故障对多故障进行诊断的目的。实验表明该方法可以有效、方便地实现电路的故障检测和定位,为多故障诊断的研究提供了一种新思路。     

QoS-based remote control of networked control systems via Profibus token passing protocol

This paper focuses on a quality-of-service (QoS)-based remote control scheme for networked control systems via the Profibus token passing protocol. Typically, token passing experiences random network delay due to uncertainties in token circulation, but the protocol has in-built upper and lower bounds of network delay. Thus, to ensure the control performance of networked control systems via the Profibus token passing protocol, the network delay should be maintained below the allowable delay level. As the network delay is affected by protocol parameters, such as target rotation time, we present here an algorithm for selection of target rotation time using a genetic algorithm to ensure QoS of control information. We also discuss the performance of the QoS-based remote control scheme under conditions of controlled network delay. To evaluate its feasibility, a networked control system for a feedback control system using a servo motor was implemented on a Profibus-FMS network.     

Adhoc-like routing in wired networks with genetic algorithms

Routing of packets in networks requires that a path be selected either dynamically while the packets are being forwarded, or statically (in advance) as in source routing from a source node to a destination. Quality of service (QoS) driven routing has been proposed using a protocol called the “Cognitive Packet Network” (CPN) which dynamically selects paths through a store and forward packet network so as to provide best effort QoS to route peer-to-peer connections. CPN operates very much as an adhoc protocol within a wired setting, and uses smart packets to select routes based on QoS requirements. We extend the path discovery process in CPN to include a genetic algorithm which can help discover new paths that may not have been discovered by smart packets. We describe how possible routes can “evolve” from prior knowledge, and then be selected based on “fitness” with respect to QoS. We detail the design of the algorithm and of its implementation, and report on resulting QoS measurements.     

Reliability enhancement by the reversal of token for a basic token ring in the case of a single component failure

The inherent functional property of the unidirectional token movement in a token ring network, is modified in this paper and an algorithm is presented that enables the continuity of operation, in case of a single link component failure, thereby improving the system reliability of a basic conventional token ring network. This phase contributes to the continuity in operation until the maintenance restores the normal ring configuration.     

令牌环网的容错性能

本文讨论了ＩＥＥＥ８０２．５令征环网在故障情况下的自然恢复例程，给出了执行例程所引入的时间估计，评价了环网的容错性能。     

On the relation of errors and its syndrome in signature analysis

This paper deals with fault diagnostics in signature analysis of computer hardware testing. When an incorrect signature is observed, it is often desired to identify the bit locations, within the input data stream, where errors have caused the faulty signature. One method is common use in the exhaustive matching test in which all bit locations of the input sequence are compared sequentially with the expected response. In this paper, an algorithm of fault diagnostics is presented by making use of the information from the faulty signature. The idea is to search the likely error locations before the tests are performed. The method reduces the number of tests required to diagnose the errors with the probability of aliasing. Such probability is always smaller than that of error detection in signature analysis. When matching tests are difficult or impossible, the method provides an estimate of where errors might have occurred that caused the incorrect signature. Also, the case of “don't cares” at the input sequence of signature analysis is discussed.     

Communication-efficient implementation of join in sensor networks

A sensor network is a multi-hop wireless network of sensor nodes cooperatively solving a sensing task. Each sensor node generates data items that are readings obtained from one or more sensors on the node. This makes a sensor network similar to a distributed database system. While this view is somewhat traditional, efficient execution of database (SQL) queries in sensor network remains a challenge, due to the unique characteristics of such networks such as limited memory and battery energy on individual nodes, multi-hop communication, unreliable infrastructure, and dynamic topology. Since the nodes are battery powered, the sensor network relies on energy-efficiency (and hence, communication efficiency) for a longer lifetime of the network.In this article, we have addressed the problem of communication-efficient implementation of the SQL “join” operator in sensor networks. In particular, we design an optimal algorithm for implementation of a join operation in dense sensor networks that provably incurs minimum communication cost under some reasonable assumptions. Based on the optimal algorithm, we design a suboptimal heuristic that empirically delivers a near-optimal join implementation strategy and runs much faster than the optimal algorithm. Through extensive simulations on randomly generated sensor networks, we show that our techniques achieve significant energy savings compared to other simple approaches.     

A Highly Reliable LAN Protocol

As a research project for NASA's Langley Research Center, we developed a variation on MIL-STD-1553B (the military standard for avionics buses) whose goal was increased fault tolerance. The resulting protocol, called implicit token passing (ITP), replaces an explicit token with brief "soundoff" messages from all nodes participating on the LAN. Since every node participates on every "token cycle," bus silence is an error indication and initiates recovery action. By encoding state information in the headers of the transmitted words, nodes are continuously aware of the global state of the network. This local knowledge of the global network state allows the system to continue operation in spite of nodal failures. A station which fails but then recovers can quickly assess the global network state and then safely rejoin the active nodes. ITP features high throughput and bounded message delay, and achieves high reliability through tolerance of failed nodes and automatic resynchronization when failed nodes are revived. The protocol is ideally suited for a bus topology and fiber optic media.     

Reliability of networks of three-state devices

A three-state device is a device that can exhibit two different types of failure mode, an “open” failure and a “shorted” failure. This paper treats networks whose arcs may experience these two failure modes in addition to the normal “success” state. The network is undirected and has two designated nodes as source and sink. Such a network is itself subject to each of the two failure modes, and the reliability problem considered is computation of the probability of each of the three states of the network. Our observation is that such problems are easily reduced to the usual two-state network reliability problem for which common techniques such as the factoring theorem are readily applicable.     

Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach

We address the problem of determining the topology and bridge-capacity assignments for a network connecting a number of token rings via source-routing bridges. The objective is to minimize the cost of bridge installations while meeting the network users' performance requirements. The problem is modeled as a mixed 0–1 integer program. A comparison is given between two solution algorithms: a simulated annealing algorithm using the flow-deviation algorithm for each routing subproblem, and a drop algorithm using the simplex method for the same subproblems to provide benchmark solutions. In the former algorithm, the routing subproblem is formulated as a nonlinear program with penalty functions to model node and link capacity constraints, and in the latter as a multicommodity flow model with the same capacity constraints. Computational results show that the simulated-annealing/flow-deviation algorithm produced substantially better solutions than the LP-based drop algorithm.     

Dual phase probing technique for IC-internal failure analysis

New electron beam probing techniques have been developed which are based on either the subtraction of two stroboscopic phases at two test vectors during the recording of a single image, or the probing of two phases at a single physical point of interest. These are, respectively, the image-based dual phase image, and the point-probing-based dual phase measurement. These new techniques are perfect for IC-internal failure analysis as they enable the detection of “opens” and “stuck-at” errors and can be linked to fault simulation software and a fault dictionary.     

Ad hoc networking with Bluetooth: key metrics and distributed protocols for scatternet formation

Bluetooth is a promising technology for personal/local area wireless communications. A Bluetooth scatternet is composed of simple overlapping piconets, each with a low number of devices sharing the same radio channel. A scatternet may have different topological configurations, depending on the number of composing piconets, the role of the devices involved and the configuration of the links. This paper discusses the scatternet formation issue by analyzing topological characteristics of the scatternet formed. A matrix-based representation of the network topology is used to define metrics that are applied to evaluate the key cost parameters and the scatternet performance. Numerical examples are presented and discussed, highlighting the impact of metric selection on scatternet performance. Then, a distributed algorithm for scatternet topology optimization is introduced, that supports the formation of a “locally optimal” scatternet based on a selected metric. Numerical results obtained by adopting this distributed approach to “optimize” the network topology are shown to be close to the global optimum.     

Performance and parameter region for real-time use in IEEE 802.4token bus network

The upper and lower bounds for the mean cycle time and the mean message transmission time of class six and class four in the IEEE 802.4 token bus network, within which the minimum utilization constraint of class four is guaranteed, are derived. Stability conditions for the token bus network are also derived. These bounds and stability conditions are represented in terms of the high-priority token hold time, the token rotation time, the arrival rate, the total number of stations, etc. A parameter-tuning algorithm in a partially symmetric token bus network with two classes is suggested. This algorithm maximizes the utilization of class four for a given high-priority token hold time and at the same time meets the constraints of the stability condition of the network, the real-time constraint, and the minimum utilization of class four     

一种多信道的分簇式短波令牌协议

传统的短波令牌协议( HFTP)调度方式单一,在没有数据传送时,信道资源会被各节点间的令牌传递所占用,且令牌在通信质量较差时易丢失。基于此,提出一种多信道的分簇式短波令牌协议( CHFTP),通过以通信质量评估为标准的分簇算法和基于预约的动态令牌调度,减小了令牌丢失的概率和令牌传递、处理的开销,并给出了仿真分析。仿真结果表明,该协议的端到端平均时延和网络吞吐量明显优于短波令牌协议, CHFTP 的平均时延最多可减少75%,网络吞吐量最多可增加66.7%,适合在短波通信网络中使用。     

Ultra Wide Band WLANs: A Self-Configuring Resource Control Scheme for Accessing UWB Hot-Spots with QoS Guarantees

In the framework of wireless access networks the Hot-Spot concept is attracting several operators. In a Hot-Spot near stationary terminals may reach one or more Radio Access Points (RAP) offering wireless access to the fixed network. Mobile terminals should be able to register to the network, associate to a RAP and activate a wireless communication supporting given bit rates and Quality of Service (QoS) features. Several mobile users, requiring different services, enter and exit the Hot-Spot. In this scenario network operators should have the opportunity to configure quickly radio resources to serve the mobile terminals and to handle efficiently the network resources in order to maximize the income. Among the different technologies emerging in this field, we investigate the feasibility of a wireless access based on Ultra Wide Band (UWB) radio, combined with a flexible admission control scheme based on transmission power selection. We employ UWB in unlicensed mode, i.e., we operate in accordance to the limits imposed by the regulatory bodies (e.g., US Federal Communications Commission). The flexibility of the admission control depends mainly on the capability of a mobile terminal of “measuring” the environment it is entering and thus supporting the RAP in the selection of the appropriate transmission parameters. The proposed approach provides an admission policy based on the Maximum Extra Interference (MEI) and selects the power level through a simple interaction among the involved mobile terminals. The information for basing the decision on is collected through measurements and signaling. In order to increase the system efficiency, transmission parameters are selected in accordance to a “balancing” criterion (thus Balanced-MEI, B-MEI). The B-MEI approach keeps quite simple the admission of new mobile terminals in a RAP’s area but contemporarily satisfies the trade-off between fair resource assignment and system efficiency. This is a key trade-off in wireless access systems where interference effects determine the upper limit of the number of users that can be admitted in the network.Francesca Cuomo received her “Laurea” degree in Electrical and Electronic Engineering in 1993, magna cum laude, from the University of Rome “La Sapienza”, Italy. She earned the Ph.D. degree in Information and Communications Engineering in 1998, also from the University of Rome “La Sapienza.” Since 1996 she is an Assistant Professor at the INFOCOM Department of this University. Her main research interests focus on broadband integrated networks, Intelligent Networks, architectures and protocol for wireless networks, mobile and personal communications, Quality of Service guarantees and real time service support in the wired and wireless Internet.She participated in: (I) the European ACTS INSIGNIA project dedicated to the definition of an Integrated IN and B-ISDN network; (III) IST WHYLESS.COM project focusing on adoption of the Ultra Wide Band radio technology for the definition of an Open Mobile Access Network; (III) RAMON project, funded by the Italian Public Education Ministry, focused on the definition of a reconfigurable access module for mobile computing applications. She is now participating to the European IST ePerSpace Project focusing on the support of personalized audio/video services at home and everywhere. She is also involved in FIRB project VIRTUAL IMMERSIVE COMMUNICATIONS (VICOM) where she is responsible of the research activities on the BAN and PAN networks.Dr. Cuomo is in the editorial board of the Elsevier Computer Networks journal and she has served on technical program committees and reviewer in several international conferences and journals including ACM Wireless Mobile Internet Workshop, IEEE ICC and GLOBECOM, IEEE Trans. on Wireless Communications and IEEE Journal on Selected Areas on Communications.Cristina Martello received her Laurea degree in Electronic Engineering (magna cum laude) in July 2000 from Università di Roma “La Sapienza”. She earned the PhD degree in Information and Communications Engineering in February 2004 (Università di Roma “La Sapienza”).Since January 2001 she has been working in the IST European HYPERLINK “/” “_blank” Whyless.com project on an open mobile access network based on the Ultra Wide Band radio technology. She collaborated with HYPERLINK “http://www.coritel.it/” “_blank” Co.Ri.Tel. (a research consortium on Telecommunications) as a fellowship holder in 2000/2001 for the project SWAP on the feasibility of a re-configurable software module for the dynamic Radio Resource Control in the 3G of mobile wireless systems, and in 2002 for the project PRESTO.Her main research interests regard the developing of flexible and distributed Radio Resource Control techniques for “ad-hoc like” networking paradigms.     

On Reversible Skeletonization Using Anchor-Points from Distance Transforms

In many applications thinning of objects is of great interest. We here present a skeletonization algorithm that is based on the idea of iteratively thinning the distance transform of an object layer by layer until either an anchor-point is reached or the connectivity breaks. Our algorithm is general in the sense that any metric and any connectivity can be used. Also, it is based on ideas that are not specific for 2D. The properties of the resulting skeletons are evaluated according to the “Lee–Lam–Suen properties.”