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

Proceedings of the 2003 international conference on Parallel and distributed processing and applications

作者： Jiannong Cao Xuhui Li Sou King Yanxiang He Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong and Parallel and Distributed Computing Lab Computer School Wuhan University Wuhan Hubei China Parallel and Distributed Computing Lab Computer School Wuhan University Wuhan Hubei China

ISBN: (纸本)9783540405238

mobile agent has been applied to develop the solutions for various kinds of parallel and distributed computing problems. However, performance evaluation of mobile agent algorithms remains a difficult task, mainly due to the characteristics of mobile agents such as distributed and asynchronous execution, autonomy and mobility. This paper proposes a general approach based on direct execution simulation for evaluating the performance of mobile agent algorithms by collecting and analyzing the information about the agents during their execution. We describe the proposed generic simulation model, named MADES, the architecture of a software environment based on MADES, and a prototype implementation. A mobile agent-based distributed load balancing algorithm is used for experiments with the prototype.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Locating Nodes in mobile Sensor Networks More Accurately and Faster

Locating Nodes in Mobile Sensor Networks More Accurately and...

引用

IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON)

作者： Shigeng Zhang Jiannong Cao Lijun Chen Daoxu Chen Internet and Mobile Computing Lab†Hong Kong Polytechnic UniversityHong Kong Internet and Mobile Computing Lab Hong Kong Polytechnic University Hong Kong Hong Kong China State Key Laboratory for Novel Software Technology†Nanjing UniversityNanjing P.R. China

Localization in mobile sensor networks is more challenging than in static sensor networks because mobility increases the uncertainty of nodes' positions. Most existing localization algorithms in mobile sensor networks use Sequential Monte Carlo (SMC) methods due to their simplicity in implementation. However, SMC methods are very time-consuming because they need to keep sampling and filtering until enough samples are obtained for representing the posterior distribution of a moving node's position. In this paper, we propose a localization algorithm that can reduce the computation cost of obtaining the samples and improve the location accuracy. A simple bounding-box method is used to reduce the scope of searching the candidate samples. Inaccurate position estimations of the common neighbor nodes is used to reduce the scope of finding the valid samples and thus improve the accuracy of the obtained location information. Our simulation results show that, comparing with existing algorithms, our algorithm can reduce the total computation cost and increase the location accuracy. In addition, our algorithm shows several other benefits: (1) it enables each determined node to know its maximum location error, (2) it achieves higher location accuracy under higher density of common nodes, and (3) even when there are only a few anchor nodes, most nodes can still get position estimations.

关键词： Sliding mode control Computational efficiency Iterative algorithms mobile computing Computer networks mobile communication Costs Monte Carlo methods Sampling methods Filtering

来源：评论

学校读者我要写书评

暂无评论

Location-aware information retrieval for mobile computing

Location-aware information retrieval for mobile computing

引用

International Conference on Embedded and Ubiquitous computing, EUC 2004

作者： Cao, Jiannong Chan, Kwok Ming Shea, Geofffrey Yu-Kai Guo, Minyi Internet and Mobile Computing Lab Department of Computing Hong Kong PolyTechnic University Hung Hom Kowloon Hong Kong Department of Land Survey and Geo-informatic Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong Department of Computer Software University of Aizu Aizu-Wakamatsu Fukushima965-8580 Japan

ISBN: (纸本)354022906X

With the knowledge about their locations, mobile users are able to issue location-dependent queries. Most of existing approaches focus on how to obtain the information about objects within a certain distance to the location of the mobile user. In this paper, we describe techniques for location aware information retrieval to answer more specific queries about surrounding objects such as which room is on my left, right, up and down. We developed a system with applications in building and construction, where the objects of our interests are rooms. The data model for representing building-related spatial data and the query algorithms for the location aware information retrieval are proposed. The implementation of a prototype of the system is described. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Service adaptation using fuzzy theory in context-aware mobile computing middleware

Service adaptation using fuzzy theory in context-aware mobil...

引用

IEEE International Conference on Embedded and Real-Time computing Systems and Applications (RTCSA)

作者： Jiannong Cao Na Xing A.T.S. Chan Yulin Feng Beihong Jin Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hong Kong China Technology Center of Software Engineering Institute of Software Chinese Academy and Sciences China

Context-aware mobile computing middleware is designed to automatically adapt its behavior to changing environment. To achieve this, an important issue to be addressed is how to effectively select services for adaptation according to the user's current context. Existing work does not adequately address this issue. In this paper, we propose a fuzzy-based service adaptation model (FSAM) that can be used in context-aware middleware. We formulate the service adaptation process by using fuzzy linguistic variables and membership degrees to define the context situations and the rules for adopting the policies of implementing a service. We propose three fitness functions to calculate the fitness degree for each policy based on the distance of fuzzy status between the policy and the current context situation. The decision for service adaptation is achieved by selecting the policy with the largest fitness degree. A context-aware application scenario called Campus Assistant is used to exemplify the proposed service adaptation process and demonstrate its effectiveness.

关键词： Context-aware services mobile computing Middleware Adaptation model Computer applications Software engineering Application software Hardware Programming profession Context modeling

来源：评论

学校读者我要写书评

暂无评论

Toward a formal approach to composite Web service construction and automation

Toward a formal approach to composite Web service constructi...

引用

International Conference on Parallel Processing (ICPP)

作者： Zhihong Ren Jiannong Cao A.T.S. Chan Jing Li Technology Center of Software Engineering Institute of Software Chinese Academy and Sciences Beijing China Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hung Hom China

Based on business processes, composite Web services combine the offerings of two or more Web services to achieve the desired business goals. Several candidate standards have been proposed, providing a foundation for composite Web service specifications. However, at a higher level, there is no framework that supports composite Web service construction and automation. We propose a framework that facilitates the visual design, validation and automation of composite Web services. The framework is based mainly on Web service composition graph (WSCG), the underlying formalism for composite Web services. Using graph grammar and graph transformation defined on WSCG, the static topological structure of a composite Web service can be described in an intuitive way and the automation of the constructed composite Web services is also facilitated with a sound formal semantic basis. We also outline the design and implementation of a prototype for the proposed framework

关键词： Web services Application software Software engineering XML Service oriented architecture Automatic control mobile computing Design automation Software prototyping Prototypes

来源：评论

学校读者我要写书评

暂无评论

Coordinated Workload Scheduling in Hierarchical Sensor Networks for Data Fusion Applications

Coordinated Workload Scheduling in Hierarchical Sensor Netwo...

引用

IEEE Internatonal Conference on mobile Adhoc and Sensor Systems (MASS)

作者： Xiaolin Li Hui Kang Jiannong Cao Scalable Software Systems Lab Department of Computer Science Oklahoma State University Stillwater OK USA Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China

To minimize the execution time of a sensing task over a multi-hop hierarchical sensor network, we present a coordinated scheduling method following the divisible load scheduling paradigm. The proposed scheduling strategy builds from eliminating transmission collisions and idle gaps between two successive data transmissions. We consider a sensor network consisting of several clusters. In a cluster, after related raw data measured by source nodes are collected at the fusion node, in-network data aggregation is further considered. The scheduling strategies consist of two phases: intra-cluster scheduling and inter-cluster scheduling. Intra-cluster scheduling deals with assigning different fractions of a sensing workload among source nodes in each cluster; inter-cluster scheduling involves the distribution of fused data among all fusion nodes. Closed-form solutions to the problem of task scheduling are derived. Finally, numerical examples are presented to demonstrate the impacts of different system parameters such as the number of sensor nodes, measurement, communication, and processing speed, on the finish time and energy consumption.

关键词： Sensor fusion Processor scheduling Wireless sensor networks Energy consumption Sensor systems and applications Spread spectrum communication Closed-form solution Sensor systems Time measurement Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

HUMAN-DRIVEN EDGE computing AND COMMUNICATION: PART 2

引用

IEEE COMMUNICATIONS MAGAZINE 2018年第2期56卷 134-135页

作者： Cao, Jiannong Castiglione, Aniello Motta, Giovanni Pop, Florin Yang, Yanjiang Zhou, Wanlei Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China Internet & Mobile Computing Lab Dept Hong Kong Hong Kong Peoples R China Univ Res Facil Big Data Analyt Hong Kong Hong Kong Peoples R China Univ Salerno Fisciano Italy Univ Naples Federico II Naples Italy Natl Inst for Res and Dev Bucharest Romania Shield Lab Singapore Singapore Huawei Singapore Singapore Deakin Univ Fac Sci Engn & Built Environm Melbourne Vic Australia

Examines the new challenges posed by human-driven edge computing. The massive proliferation of personal computing devices is opening new human-centered designs that blur the boundaries between man and machine. In addition, edge services are also used to exchange the data collected and processed within the context of the IoT towards external services and/or to visualize them through traditional browser by the users. Now, the frontier for the research on the data management is related to the so-called edge computation and communication, consisting of an architecture of one or more collaborative multitude(s) of computing nodes that are placed between the sensor networks and the cloud-based services. Such a mediating level is responsible for carrying out a substantial amount of data storage and processing to reduce the retrieval time and have more control over the data with respect to cloud-based services, and to consume less resources and energy to reduce the workload.

关键词： Special issues and sections Edge computing internet of Things Access control Cryptography Data collection Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A Mobility Prediction-Based Adaptive Data Gathering Protocol for Delay Tolerant mobile Sensor Network

A Mobility Prediction-Based Adaptive Data Gathering Protocol...

引用

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

作者： Jinqi Zhu Jiannong Cao Ming Liu Yuan Zheng Haigang Gong Guihai Chen Department of Computer Science and Engineering University of Electronic Science and Technology Chengdu China Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hong Kong China Nanjing University Nanjing China

The basic operation of delay tolerant mobile sensor network (DTMSN) is for pervasive data gathering in networks with intermittent connectivity, where traditional data gathering methods can not be applied. In this paper, an efficient mobility prediction-based adaptive data gathering protocol (MPAD) based on the random waypoint mobility model tailored for DTMSN is proposed. In MPAD, a node independently makes decision to replicate messages and send them to the neighbor sensor nodes with a higher probability of meeting the sink node. MPAD consists of two components for data transmission and queue management. Data transmission makes decisions on when and where to transmit data messages according to the node delivery probability, and the queue management employs the message survival time to decide whether the message should be transmitted or dropped for minimizing the transmission overhead. Simulation results show that the proposed MPAD achieves the longer network lifetime and the higher message delivery ratio with the lower transmission overhead and data delivery delay than some other previous solutions designed for DTMSN, such as direct transmission, flooding and message fault tolerance-based data delivery protocol (FAD).

关键词： Disruption tolerant networking Routing protocols Data communication mobile computing Biosensors Computer networks Delay Predictive models Wireless sensor networks Sensor phenomena and characterization

来源：评论

学校读者我要写书评

暂无评论

Middleware Support for Context-awareness in Asynchronous Pervasive computing Environments

Middleware Support for Context-awareness in Asynchronous Per...

引用

IEEE/IFIP International Conference on Embedded and Ubiquitous computing, EUC

作者： Jianping Yu Yu Huang Jiannong Cao Xianping Tao Department of Computer Science and Technology Nanjing University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hong Kong China

Context-awareness is an essential feature of pervasive applications, and runtime detection of contextual properties is one of the primary approaches to enabling context awareness. However, existing context-aware middleware does not provide sufficient support for detection of contextual properties in asynchronous environments. We argue that in asynchronous environments, the concept of time needs to be reexamined. Instead of assuming the availability of global time or synchronous interaction, we should rely on logical time. To this end, we present the Middleware Infrastructure for Predicate detection in Asynchronous environments (MIPA), which supports context-awareness based on logical time. Design and operation of MIPA are explained in detail. We also evaluate MIPA with a comprehensive case study. The evaluation results show the cost-effectiveness and scalability of MIPA.

关键词： Context Radiofrequency identification Context modeling Middleware Memory management Pervasive computing

来源：评论

学校读者我要写书评

暂无评论

An Energy-Aware Protocol for Data Gathering Applications in Wireless Sensor Networks

An Energy-Aware Protocol for Data Gathering Applications in ...

引用

IEEE International Conference on Communications (ICC)

作者： M. Liu Y. Zheng J. Cao G. Chen L. Chen H. Gong School of Computer Science and Engineering University of Electronic Science and Technology China Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hong Kong China State Key Laboratory for Novel Software Technology Nanjing University China

Data gathering is a major function of many applications in wireless sensor networks (WSNs). The most important issue in designing a data gathering algorithm is how to save energy of sensor nodes while meeting the requirement of applications/users such as sensing area coverage. In this paper, we propose a novel hierarchical clustering protocol for long-lived sensor network. EAP achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load among all nodes. EAP introduces a new clustering parameter for cluster head election, which can better handle the heterogeneous energy capacities. Furthermore, it also introduces a simple but efficient approach, namely intra-cluster coverage to cope with the area coverage problem. We evaluate the performance of the proposed protocol using a simple temperature sensing application. Simulation results show that our protocol significantly outperforms LEACH and HEED in terms of network lifetime and the amount of data gathered.

关键词： Wireless application protocol Wireless sensor networks Energy consumption Application software Temperature sensors Computer networks Clustering algorithms Peer to peer computing Scalability Paper technology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：