检索结果-内蒙古大学图书馆

Adaptive probability-based broadcast forwarding in energy-saving sensor networks

ACM TRANSACTIONS ON sensor NETWORKS 2008年第2期4卷 6-6页

作者： Sengul, Cigdem Miller, Matthew J. Gupta, Indranil Univ ZAC Vignes INRIA Saclay F-91893 Orsay France Cisco Syst Inc Res Triangle Pk NC 27709 USA Univ Illinois Dept Comp Sci Siebel Ctr Comp Sci Urbana IL 61801 USA

Networking protocols for multihop wireless sensor networks (WSNs) are required to simultaneously minimize resource usage as well as optimize performance metrics such as latency and reliability. this article explores the energy-latency-reliability tradeoff for broadcast in WSNs by presenting a new protocol called PBBF. Essentially, for a given reliability level, energy and latency are found to be inversely related and our study quantifies this relationship at the reliability boundary. therefore, PBBF offers an application designer considerable flexibility in the choice of desired operation points. Furthermore, we propose an extension to dynamically adjust the PBBF parameters to minimize the input required from the designer.

关键词： design performance sensor network broadcast probabilistic protocols

来源：评论

学校读者我要写书评

暂无评论

A low-cost, low-data-rate rapid structural assessment network: Design, implementation, and experimentation

A low-cost, low-data-rate rapid structural assessment networ...

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： Jren-Chit Chin Jeffrey M. Rautenberg Chris Y. T. Ma Santiago Pujol David K. Y. Yau Computer Science Purdue University West Lafayette IN USA Civil Engineering Purdue University West Lafayette IN USA

We present the design, implementation, and experimental evaluation of a wireless sensor network for near real-time structural health monitoring. We use simple custom-built gages to unequivocally detect cracks in critical structural elements. the main data reports have a low data rate and are naturally resilient to loss. We show how a variety of low-cost, off-the-shelf data acquisition/communication devices can be used to support remote monitoring by a control center. the heterogeneous hardware is accommodated by the use of open technology standards, and a software architecture that is portable, modular, and highly configurable. We present an experimental evaluation of our structural assessment network, using a full-scale three-story reinforced concrete building, subjected to lateral forces emulating forces induced by earthquakes. Our results show that a set of 12 strategically positioned sensors on the three floors achieved a zero false-alarm rate, in the sense that each reported breakage can be traced to cracks exceeding the specified total width, and a 100% detection rate for cracks that are covered by a sensor.

关键词： sensors Radiofrequency identification Monitoring sensor phenomena and characterization Data acquisition Buildings Hardware

来源：评论

学校读者我要写书评

暂无评论

Data gathering capacity of large scale multihop wireless networks

Data gathering capacity of large scale multihop wireless net...

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： Benyuan Liu Don Towsley Ananthram Swami Department of Computer Science University of Massachusetts Lowell Lowell MA USA Department of Computer Science University of Massachusetts Amherst Amherst MA USA Army Research Laboratory Adelphi MD USA

this paper studies the scaling laws of the data gathering capacity of large scale multihop wireless networks. Unlike the data communication paradigms studied in previous research, for example, the many-to-many, many-to-one, broadcast, and multicast paradigms, the data gathering capacity concerns the per source node throughput in a network where a subset of nodes send data to some designated destinations while other nodes serve as relays. this some-to-some communication paradigm is commonplace in many wireless networks, for example, wireless mesh networks and wireless sensor networks, and in some cases perhaps more prevalent than the other paradigms. We first derive the upper and constructive lower bounds for the data gathering capacity, and then examine their design and performance implications. Our results show that the data gathering capacity is constrained by different factors in several different scaling regimes of the number of source and destination nodes, exhibiting distinct scaling laws in those regimes. this work fills a gap in our understanding of the capacity of various communication paradigms, and can lead to better network planning and performance for data gathering wireless network applications.

关键词： Upper bound Wireless networks Wireless sensor networks Wireless communication Relays Receivers Protocols

来源：评论

学校读者我要写书评

暂无评论

A distributed workflow management system utilizing computational intelligence for decision support

A distributed workflow management system utilizing computati...

引用

ieee SSD international Multi-conference on systems, Signals and Devices

作者： Zahra J. Muhsin Ali H. El-Mousa Majid A. Al-Taee Computer Engineering Department University of Jordan Amman Jordan

distributed workflow management systems are increasingly gaining momentum due to the emergence of virtual and distributed organizations, as well as cross-organizational workflows. this paper presents an effective development process for a distributed workflow management system (WKFMS) which is utilized to automate the management processes related to computer and peripheral repair requests in the Faculty of Engineering and Technology (FET) at the University of Jordan. First, the paper explores the reasoning and motivation behind the choice of the management processes involved in the WKFMS. Phases of the development process that is based on the rapid prototyping paradigm are then described. Particular focus is given to the modeling of business scenarios using the Model-View-Control (MVC) architecture. the distributed network layout and system security measures are also investigated. Reduction of manual human intervention in the decision process is achieved through the implementation of a neuro-fuzzy computational intelligence processor to automate the major decision making process of tasks distribution. It is shown that the application of the proposed development process helped in reducing the overall system development time and effort. the successful deployment and functional testing of the developed industrial prototype has proved that it works smoothly according to the desired features.

关键词： FETs Maintenance engineering Electronic mail Databases Security Prototypes Business

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for uplink scheduling in WiMAX networks

Distributed algorithm for uplink scheduling in WiMAX network...

引用

international conference on Broadband Networks (BroadNets)

作者： Antoni Morell Gonzalo Seco-Granados Jose Lopez Vicario Telecommunications and System Engineering Department (TES) Universitat Autònoma de Barcelona (UAB) Spain Telecommunications and System Engineering Department (TES) Universitat Autònoma de Barcelona (UAB)

this work proposes an algorithm to perform the resource allocation in the uplink of an ieee802.16 standard-based system. the approach is valid for point to multi-point (PMP) and also for tree-deployed mesh networks, already defined for the Worldwide Interoperability for Microwave Access (WiMax). Our solution is based on a proportionally fair distribution of resources and it is formulated using the network utility maximization (NUM) framework. thanks to convex decomposition techniques, we derive a novel way of solving the NUM problem in a distributed manner. the goal is to attain the global optimal scheduling at the subscriber stations (SS) without the need of gathering information at a central node in the network. the results show significant gains in the time required to reach the optimal resource allocation for a given set of demands.

关键词： distributed algorithms WiMAX Portable media players Resource management Physical layer Mesh networks Bandwidth Unicast Quality of service Optimal scheduling

来源：评论

学校读者我要写书评

暂无评论

Robust Localization based on Adjustment of Trilateration Network for Wireless sensor Networks

Robust Localization based on Adjustment of Trilateration Net...

引用

the 4th international conference on Wireless Communications, Networking and Mobile computing(第四届ieee无线通信、网络技术及移动计算国际会议)

作者： Feng Tian Wei Guo Chuanyun Wang Qian Gao School of Computer science Shenyang Institute of Aeronautical Engineering Shenyang China

Localization of sensor nodes is a challenging and crucial issue in wireless sensor networks (WSNs), and high precision and low cost algorithms become the research direction. In this paper, a robust and accurate localization algorithm based on adjustment of trilateration network (LATN) for WSNs is presented. Firstly, uncomplicated distributed algorithm is used for estimating position of the nodes, and the length of sides between neighbor nodes are gotten by RSSI measurement, subsequently, the information of every node is aggregated at sink node, and trilateration network will be constructed. According to the least square principle, localization error of whole network is depressed and precision of each node are estimated by mutual restraints of position error and side measurement error. Simulation results show that LATN is robust and not affected by network topology. In isotropic topology network, while average node degree of 10, reference node ratio is 20% and with side measurement error 0.1, the position error is improved 14% and 5% than DV-hop and DV-distance respectively.

关键词： WSNs localization distributed localization error depression adjustment of trilateration network

来源：评论

学校读者我要写书评

暂无评论

CREAM: A Generic Build-Time Component Framework for distributed Embedded systems

CREAM: A Generic Build-Time Component Framework for Distribu...

引用

ieee international conference on Embedded and Real-Time computing systems and Applications (RTCSA)

作者： Chetan Raj Jiyong Park Jungkeun Park Seongsoo Hong Real-Time Operating Systems Laboratory Seoul National University Seoul South Korea Department of Aerospace Information Engineering Konkuk University Seoul South Korea

ISBN: (纸本)9780769533490

A component framework plays an important role in CBSD as it determines how software components are developed, packaged, assembled and deployed. A desirable component framework for developing diverse cross-domain embedded applications should meet such requirements as (1) lightweight on memory use, (2) integrated task execution model, (3) fast inter-component communication, (4) support for distributed processing, and (5) transparency from underlying communication middleware. Although current embedded system component frameworks address some of the above requirements, they fail to meet all of them taken together. We thus propose a new embedded system component framework called CREAM (component-based remote-communicating embedded application model). It achieves these goals by using build-time code generation, explicit control of task creation and execution in the component framework, static analysis of component composition to generate efficient component binding, and abstraction of the componentpsilas application logic from the communication middleware. We have implemented the CREAM component framework and conducted a series of experiments to compare its performance characteristics to a raw socket-based communication implementation and the lightweight-CCM implementation by MicoCCM.

关键词： Middleware Embedded system Generators Software distributed processing Business Real time systems

来源：评论

学校读者我要写书评

暂无评论

Coordinated Locomotion of Mobile sensor Networks

Coordinated Locomotion of Mobile Sensor Networks

引用

ieee Communications Society conference on sensor and Ad Hoc Communications and Networks (SECON)

作者： Seokhoon Yoon Onur Soysal Murat Demirbas Chunming Qiao CSE Department State University of New York University at Buffalo USA

Stationary wireless sensor networks (WSNs) fail to scale when the area to be monitored is open (i.e borderless) and the physical phenomena to be monitored may migrate through a large region. Deploying mobile sensor networks (MSNs) alleviates this problem, as the self-configuring MSN can relocate to follow the phenomena of interest. However, a major challenge here is to maximize the sensing coverage in an unknown, noisy, and dynamic sensing environment while minimizing energy consumption. Another major challenge is to maintain network connectivity for each MSN node during relocations. To address these challenges, we propose a new distributed algorithm, Causataxis 1 , that enables the MSN to relocate toward the interesting regions and adjust its shape and position as the sensing environment changes. Causataxis achieves scalable control of the MSN via a backbone-tree infrastructure maintained over clusterhead nodes, and achieves agility via localized cluster formation and dissolution. Unlike conventional cluster-based systems with backbone networks, a unique feature of our proposed approach is its bio-system inspired growing and rotting behaviors with coordinated locomotion. We compare Causataxis with a custom tuned swarm algorithm, which uses the concept of virtual spring forces to relocate mobile nodes based on local neighborhood information. Our simulation results show that Causataxis can outperform the swarm based algorithm in terms of the sensing coverage, the energy consumption, and the noise tolerance with a slightly high communication overhead.

关键词： sensor phenomena and characterization Wireless sensor networks Condition monitoring Energy consumption Working environment noise distributed algorithms Shape Spine Clustering algorithms Springs

来源：评论

学校读者我要写书评

暂无评论

SVM synthesis by hierarchical structures of learning automata application for handwritten digits recognition

SVM synthesis by hierarchical structures of learning automat...

引用

ieee SSD international Multi-conference on systems, Signals and Devices

作者： Soumaya Ghorbel Maher Ben Jmeaa Mohamed Chtourou Research unit on Intelligent Control design & Optimization of complex Systems (ICOS) Sfax Engineering School University of Sfax Sfax Tunisia Development and Control of Distributed Applications (REDCAD) Sfax Engineering School University of Sfax Sfax Tunisia

In this paper, a new SVM (Support Vector Machines) synthesis method is presented. this method is based essentially on training criterion optimization of this machine by a set of hierarchical structures of learning automata. this methodology is adopted for the development of off-line isolated handwritten digits recognition system. A comparison is taken between this new approach and that of a standard approach for SVM synthesis. these two methodologies are also compared with a neural network based classification method. the obtained results show the performances of the new suggested method for SVM synthesis.

关键词： Support vector machines Automata Learning automata Training Handwriting recognition Kernel Probability distribution

来源：评论

学校读者我要写书评

暂无评论

Minimizing multi-hop wireless routing state under application-based accuracy constraints

Minimizing multi-hop wireless routing state under applicatio...

引用

ieee Internatonal conference on Mobile Adhoc and sensor systems (MASS)

作者： Mustafa Omer Kilavuz Murat Yuksel Computer Science and Engineering Department University of Nevada슠Reno Reno NV USA

Provisioning of rich routing building blocks to mobile ad-hoc networking applications has been of high interest. Several MANET applications need flexibility in describing paths their traffic will follow. To accommodate this need, previous work has proposed several viable routing schemes such as Dynamic Source Routing (DSR) and Trajectory-Based Routing (TBR). However, tradeoffs involved in the interaction of these routing schemes and the application-specific requirements have not been explored. Especially, techniques to help the application to do the right routing choices are much needed. We consider techniques that minimize routing protocol state costs under application-based constraints. We study the constraint of ldquoaccuracyrdquo of the applicationpsilas desired route, as this constraint provides a range of choices to the applications. As a crucial part of this optimization framework, we investigate the tradeoff between the packet header size and the network state. We, then, apply our framework to the case of TBR with application-based accuracy constraints in obeying a given trajectory. We begin with simple discrete models to clarify the tradeoff between packet header size and network state. We show that the problem of accurate representation of a trajectory with the objective of minimizing the cost incurred due to header size and network state is difficult to solve optimally. Finally, we develop heuristics solving this problem and illustrate their performance.

关键词： Trajectory Routing Approximation methods Accuracy Silicon compounds Wireless communication Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：