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

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Liang Liu Anlong Ming Huadong Ma Xi Zhang Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing University슠of Posts and슠Telecommunications Beijing China Networking and Information System Laboratory Department of Electrical and Computer Engineering Texas A and M University College Station TX USA

ISBN: (纸本)9781467307734;9781467307758

With rapid improvements and miniaturization in hardware, sensor nodes equipped with acoustic and visual information collection modules promise an unprecedented opportunity for target surveillance applications. This paper investigates a critical task of target surveillance, multi-class classification, in distributed multimedia sensor networks. We first analyze the procedure of target classification utilizing the acoustic and visual information. Then, we propose a binary classification tree based framework for distributed target classification in multimedia sensor networks. The proposed framework includes three main components: Generation of binary classification tree, Division of binary classification tree, and Selection of multimedia sensor nodes. Finally, we conduct an experimental application of target classification and extensive simulations to validate and evaluate our proposed framework and related schemes.

关键词： Multimedia communication Feature extraction Acoustics Visualization Support vector machines Training Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Physarum optimization: A biology-inspired algorithm for minimal exposure path problem in wireless sensor networks

Physarum optimization: A biology-inspired algorithm for mini...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Liang Liu Yuning Song Huadong Ma Xi Zhang Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing University슠of Posts and슠Telecommunications Beijing China Networking and Information System Laboratory Department of Electrical and Computer Engineering Texas A and M University College Station TX USA

ISBN: (纸本)9781467307734;9781467307758

Using insights from biological processes could help to design new optimization techniques for long-standing computational problems. This paper exploits a cellular computing model in the slime mold physarum polycephalum to solve the minimal exposure path problem which is a fundamental problem corresponding to the worst-case coverage in wireless sensor networks. We first formulate the minimal exposure path problem, and then convert it into the shortest path problem by discretizing the monitoring field to a large-scale weighted grid. Inspired by the path-finding capability of physarum, we develop a new optimization algorithm, named as the physarum optimization, for solving the shortest path problem. Our proposed algorithm is with low-complexity and high-parallelism. Moreover, the core mechanism of our physarum optimization is also helpful for designing new graph algorithms and improving routing protocols and topology control in self-organized networks.

关键词： Mathematical model Electron tubes Optimization Computational modeling Equations Organisms

来源：评论

学校读者我要写书评

暂无评论

Distributed multi-agent Q-learning for joint channel allocation and power control in cognitive radio networks

引用

Journal of Computational information systems 2012年第17期8卷 7071-7078页

作者： Boumediene, Latifa Gao, Zhenguo Liu, Sheng College of Automation Harbin Engineering University Harbin 150001 China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai 200240 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

This paper deals with the resource allocation in completely distributed cognitive radio network. We propose a form of real-time multi-agent distributed reinforcement learning, which is known as Q-learning, to allow the cognitive radio to predict its transmit power and channel, in order for achieving a high quality of service without affecting the primary users. Simulation results reveal that the proposed approach is able to significantly reduce the interference to the licensed users while maintaining a high probability of successful transmission in a cognitive radio ad-hoc network. © 2012 Binary information Press.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

Exploiting constructive interference for scalable flooding in wireless networks

Exploiting constructive interference for scalable flooding i...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Yin Wang Yuan He Xufei Mao Yunhao Liu Zhiyu Huang Xiangyang Li MOE Key Laboratory for Information System Security School of Software TNLIST Tsinghua University China Department of Computer Science and Engineering HKUST Hong Kong China Institute of Software Chinese Academy of Sciences China Department of Computer Science Illinois Institute of Technology USA

ISBN: (纸本)9781467307734;9781467307758

Exploiting constructive interference in wireless networks is an emerging trend for it allows multiple senders transmit an identical packet simultaneously. Constructive interference based flooding can realize millisecond network flooding latency and sub-microsecond time synchronization accuracy, require no network state information and adapt to topology changes. However, constructive interference has a precondition to function, namely, the maximum temporal displacement Δ of concurrent packet transmissions should be less than a given hardware constrained threshold. We disclose that constructive interference based flooding suffers the scalability problem. The packet reception performances of intermediate nodes degrade significantly as the density or the size of the network increases. We theoretically show that constructive interference based flooding has a packet reception ratio (PRR) lower bound (95:4%) in the grid topology. For a general topology, we propose the spine constructive interference based flooding (SCIF) protocol. With little overhead, SCIF floods the entire network much more reliably than Glossy [1] in high density or large-scale networks. Extensive simulations illustrate that the PRR of SCIF keeps stable above 96% as the network size grows from 400 to 4000 while the PRR of Glossy is only 26% when the size of the network is 4000. We also propose to use waveform analysis to explain the root cause of constructive interference, which is mainly examined in simulations and experiments. We further derive the closed-form PRR formula and define interference gain factor (IGF) to quantitatively measure constructive interference.

关键词： constructive interference Wireless networks Flood NECTIN1 gene ATP6AP2 gene PULSE REPETITION RATE stem cell inhibitory factor Glossy

来源：评论

学校读者我要写书评

暂无评论

Scaling Laws of Multicast Capacity for Power-Constrained Wireless Networks under Gaussian Channel Model

引用

IEEE Transactions on Computers 2012年第5期61卷 713-725页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Shaojie Tang Yuan He Xufei Mao Yunhao Liu Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering Building of Electronics and Information Engineering University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA Tsinghua National Laboratory for Information Science and Technology (TNLIST) Tsinghua University Beijing China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Hong Kong University of Science and Technology Kowloon Hong Kong China Tsinghua National Laboratory for Information Science and Technology (TNLIST) School of Software Tsinghua University Beijing China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing China

We study the asymptotic networking-theoretic multicast capacity bounds for random extended networks (REN) under Gaussian channel model, in which all wireless nodes are individually power-constrained. During the transmission, the power decays along path with attenuation exponent α >; 2. In REN, n nodes are randomly distributed in the square region of side length √n. There are n s randomly and independently chosen multicast sessions. Each multicast session has n d + 1 randomly chosen terminals, including one source and n d destinations. By effectively combining two types of routing and scheduling strategies, we analyze the asymptotic achievable throughput for all n s = ω(1) and nd. As a special case of our results, we show that for n s = Θ(n), the per-session multicast capacity for REN is of order Θ(1/√n d n) when nd = O(n/(log n) a+1 ) and is of order Θ(1/n d · (log n) -n/2 ) when n d = Ω(n/log n).

关键词： Lattices Throughput Upper bound Road transportation Receivers Interference Routing

来源：评论

学校读者我要写书评

暂无评论

CitySee: Urban CO2 monitoring with sensors

CitySee: Urban CO2 monitoring with sensors

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Xufei Mao Xin Miao Yuan He Xiang-Yang Li Yunhao Liu Department of Computer Science and Engineering HKUST Hong Kong China MOE Key Laboratory for Information System Security School of Software TNLIST Tsinghua University China Computer Science Department Illinois Institute of Technology USA

ISBN: (纸本)9781467307734;9781467307758

Motivated by the needs of precise carbon emission measurement and real-time surveillance for CO 2 management in cities, we present CitySee, a real-time CO 2 -monitoring system using sensor networks for an urban area (around 100 square kilometers). In order to conduct environment monitoring in a real-time and long-term manner, CitySee has to address the following challenges, including sensor deployment, data collection, data processing, and network management. In this discussion, we mainly focus on the sensor deployment problem so that necessary requirements like connectivity, coverage, data representability are satisfied. We also briefly go through the solutions for the remaining challenges. In CitySee, the sensor deployment problem can be abstracted as a relay node placement problem under hole-constraint. By carefully taking all constraints and real deployment situations into account, we propose efficient and effective approaches and prove that our scheme uses additional relay nodes at most twice of the minimum. We evaluate the performance of our approach through extensive simulations resembling realistic deployment. The results show that our approach outperforms previous strategies. We successfully apply this design into CitySee, a large-scale wireless sensor network consisting of 1096 relay nodes and 100 sensor nodes in Wuxi City, China.

关键词： Sensors Wireless sensor networks Wireless communication Joining processes Relays Steiner trees Carbon dioxide

来源：评论

学校读者我要写书评

暂无评论

Damping based multi-path traffic allocation algorithm for wireless networks

引用

Journal of Computational information systems 2012年第10期8卷 4169-4175页

作者： Lu, Xu Yu, Ruiguo Dong, Wenyong Lei, Ming Hao, Lianxiu School of Computer Science and Technology Tianjin University Tianjin 300072 China Computer School Wuhan University Wuhan 430079 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin 300191 China School of Electronic Information Engineering Tianjin University Tianjin 300072 China

In physics, damping is any effect that tends to reduce the amplitude of oscillations in an oscillatory system. Inspired by this, we present a new traffic allocation algorithm for Wireless Networks in order to limit the packet delay variance. We refer to our algorithm as the damping based traffic allocation algorithm (DBTA). DBTA computes the queuing delay and queuing delay variance, configures system parameters, and finally reduces the amplitude of delay variations. We realize DBTA based on Dynamic Source Routing (DSR) protocol. Performance comparison of DBTA with DSR using Network Simulator (NS-2) simulation shows that DBTA can achieve a remarkable improvement in decreasing the packet delay variance. © 2011 by Binary information Press.

关键词： Damping

来源：评论

学校读者我要写书评

暂无评论

Asymptotic throughput for large-scale wireless networks with general node density

引用

Wireless Networks 2012年第5期19卷 559-575页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China The Tsinghua National Laboratory for Information Science and Technology (TNLIST) Department of Computer Science and Engineering Tongji University Shanghai China The Department of Computer Science Illinois Institute of Technology Chicago USA The TNLIST and School of Software Tsinghua University Beijing China CSE The Hong Kong University of Science and Technology Kowloon Hong Kong

We study the asymptotic throughput for a large-scale wireless ad hoc network consisting of n nodes under the generalized physical model. We directly compute the throughput of multicast sessions to unify the unicast and broadcast throughputs. We design two multicast schemes based on the so-called ordinary arterial road system and parallel arterial road system, respectively. Correspondingly, we derive the achievable multicast throughput by taking account of all possible cases of n s = ω(1) and 1 ≤ n d ≤ n − 1, rather than only the cases of $$n_s=\Uptheta(n)$$ as in most related works, where n s and n d denote the number of sessions and the number of destinations of each session, respectively. Furthermore, we consider the network with a general node density $$\lambda \in [1,n]$$ , while the models in most related works are either random dense network (RDN) or random extended network (REN) where the density is λ = n and λ = 1, respectively, which further enhances the generality of this work. Particularly, for the special case of our results by letting λ = 1 and $$n_s=\Uptheta(n)$$ , we show that for some regimes of n d , the multicast throughputs achieved by our schemes are better than those derived by the well-known percolation-based schemes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-Hop Free Space Optical Communications Using Serial Decode-and-Forward Relay Transmissions

引用

China Communications 2011年第5期8卷 102-110页

作者：王俊波焦媛陈明王金元曹哲 Ministry of Education Key Laboratory for Information System Security School of SoftwareTsinghua University College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics National Mobile Communications Research Laboratory Southeast University

This paper investigates the performance of multi-hop Free Space Optical(FSO) communications using serial Decode-and-Forward(DF) relay transmissions.A statistical model for the optical intensity fluctuation at the receiver due to the combined effects of atmospheric turbulence-induced fading,mis alignment fading and pass-loss is *** given weather and mis alignment conditions,a closed-form analytical expression for the end-to-end outage probability of serial Decode-and-Forward(DF) multi-hop FSO communications is *** results show that the serial DF multi-hop transmission is a promising technology to enhance the performance of FSO ***,the derived analytical expression can provide close approximations to the simulation results.

关键词： free-space optical systems pointing errors atmospheric turbulence outage probability multi-hop transmission

来源：评论

学校读者我要写书评

暂无评论

LIR-OSGi: Extends OSGi to support distributed and heterogeneous ubiquitous computing system

LIR-OSGi: Extends OSGi to support distributed and heterogene...

引用

2011 6th International Conference on Pervasive Computing and Applications, ICPCA 2011

作者： Liu, Jinzhao Lu, Xiaojuan Wang, Dan Liu, Xin Lu, Yongqiang Chen, Yu Dept. of Computer Science and Technology Beijing University of Technology Beijing China General Hospital PLA Second Artillery China Research Institute of Information Technology Key Laboratory of Pervasive Computing Ministry of Education Beijing China System Software and Software Engineering Group Laboratory of Pervasive Computing Dept. of Computer Science and Technology Beijing 100084 China

ISBN: (纸本)9781457702082

As an emerging portable service platform, OSGi is now taking a more and more important role in Ubiquitous Computing environment. As a module management framework, OSGi provides the functions of dynamic loading and unloading software modules at runtime. But its use is limited because it is centralized and single programming language supported. In this paper we present LIR-OSGi, an extended framework of OSGi, which is designed to add the distribution and programming language independence to OSGi. Meanwhile it is easy to use for developers because of the transparence of service invocation and automation of distribution. Not like OSGi which can be applied only on the Java platform, LIR-OSGi makes programs which may be written in different programming languages be able to call each other transparently so that it can be applied in many different platforms such as DotNet Framework and so on. This brings much convenience to the program development in a distributed and heterogeneous environment. © 2011 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：