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

Approximation algorithm for constructing data aggregation trees for wireless sensor networks

中国高等学校学术文摘·计算机科学 2009年第4期3卷 524-534页

作者： Deying LI Jiannong CAO Qinghua ZHU Key Laboratory of Data Engineering and Knowledge Engineering School of InformationRenmin University of ChinaBeijing 100872China Internet and Mobile Computing Lab Department of ComputingHong Kong Polytechnic UniversityHong KongChina

This paper considers the problem of constructing data aggregation trees in wireless sensor networks (WSNs)for a group of sensor nodes to send collected information to a single sink *** data aggregation tree contains the sink node,all the source nodes,and some other non-source *** goal of constructing such a data aggregation tree is to minimize the number of non-source nodes to be included in the tree so as to save *** prove that the data aggregation tree problem is NP-hard and then propose an approximation algorithm with a performance ratio of four and a greedy *** also give a distributed version of the approximation *** simulations are performed to study the performance of the proposed *** results show that the proposed algorithms can find a tree of a good approximation to the optimal tree and has a high degree of scalability.

关键词： WSNs data aggregation tree approximation algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

GMZRP: Geography-aided multicast zone routing protocol in mobile ad hoc networks 5

GMZRP: Geography-aided multicast zone routing protocol in mo...

引用

5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2008

作者： Cheng, Hui Cao, Jiannong Fan, Xiaopeng Department of Computing Internet and Mobile Computing Lab Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9789639799264

This paper presents the design and evaluation of a highly efficient on-demand multicast routing protocol for mobile ad hoc networks (MANETs). The protocol, called Geography-aided Multicast Zone Routing Protocol (GMZRP), eliminates as much as possible duplicate route queries by using a simple yet effective strategy for propagating the multicast route request (MRREQ) packets. GMZRP is the first hybrid multicast protocol taking the advantages of both topological routing and geographical routing. It partitions the network coverage area into small zones and guarantees that each geographic zone is queried only once. GMZRP maintains a multicast forwarding tree at two levels of granularities, the zone granularity and the node granularity. By doing this, it can easily handle route breakage since the zone level information can help recover the link failure at the node level. The results of the performance evaluation of GMZRP using simulation show that, comparing with the well-known multicast protocol ODMRP (On-Demand Multicast Routing Protocol), GMZRP has much lower protocol overhead in terms of query packets and, meanwhile, achieves competing packet delivery ratio. © Copyright 2008 ICST.

关键词： mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Coordinated Workload Scheduling in Hierarchical Sensor Networks for Data Fusion Applications

引用

Journal of Computer Science & Technology 2008年第3期23卷 355-364页

作者： Xiao-Lin Li 曹建农 Scalable Software Systems Lab Department of Computer Science Oklahoma State University Stillwater OK 74078 U.S.A. Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hung Horn 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 on 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.

关键词： wireless sensor networks load scheduling divisible load theory data fusion

来源：评论

学校读者我要写书评

暂无评论

P2PGrid: Integrating P2P networks into the Grid environment

引用

4th International Conference on Grid and Cooperative computing - GCC 2005

作者： Cao, Jiannong Liu, Fred B. Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hung Horn Kowloon Hong Kong

ISBN: (纸本)3540305106

The current Grid architecture suffers from high complexity, inefficiency in leveraging common PC capabilities, and the single point of failure problem originated from Grid's Client-Server mode of interaction. We propose an approach to solve the problems by incorporating P2P networks with the Grid environment. A two-layer integration model is proposed, which consists of a Grid layer and an underlying P2P layer that can be accessed from but not limited to the Grid layer. A prototype implementation of the model, called P2PGrid, has been developed and experimented with example applications built on the platform. The results show that the complexity for common PCs to participate the Grid can be greatly reduced, the resource aggregation efficiency has been increased, and the single point of failure problem can be solved by using P2P mode of communication in the Grid environment. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

PD agent: A platform for developing and deploying mobile agent-enabled applications for wireless devices

PD agent: A platform for developing and deploying mobile age...

引用

Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004

作者： Cao, Jiannong Tse, Daniel C.K. Chan, Alvin T.S. Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hung Hm KLW Hong Kong

mobile agents (MAs) can support mobile computing by carrying out tasks autonomously for a mobile user temporarily disconnected from the network. In this paper we describe PDAgent, a lightweight and highly portable platform for developing and deploying mobile agent-enabled applications on wireless handheld devices. Our approach offers the following advantages: (i) It does not require installing MA server on handheld devices and supports the adoption of any kind of mobile agent system at network hosts, while at the same time allow mobile users to have control of mobile agent activities;(ii) It supports dynamic downloading of MA-enabled applications which can be made aware of and adaptive to the user's current context, and deploying the application to perform various tasks on behalf of the user over the wired network;(iii) It requires the minimum network connectivity and cost for users to deploy their applications. PDAgent provides APIs which allow developers to build new mobile applications on top of PDAgent. Example applications have been developed for PDAgent. We will report on and discuss the results of experimental performance evaluations of PDAgent.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

CIC: An integrated approach to checkpointing in mobile agent systems

CIC: An integrated approach to checkpointing in mobile agent...

引用

2nd International Conference on Semantics, Knowledge, and Grid, SKG 2006

作者： Yang, Jin Cao, Jiannong Wu, Weigang Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong

ISBN: (纸本)076952673X

As a widely used fault tolerance technique, checkpointing has evolved into several schemes: independent, coordinated, and communication-induced (CIC). Independent and coordinated checkpointing have been adopted in many works on fault tolerant mobile agent (MA) systems. However, CIC, a flexible, efficient, and scalable checkpointing scheme, has not been applied to MA systems. Based on the analysis of the behavior of mobile agent, we argue that CIC is a well suited checkpointing scheme for MA systems. CIC not only establishes the consistent recovery lines efficiently but also integrates well with the independent checkpointing for reliable MA migration. Here, we propose an important improvement to CIC, referred to as the deferred message processing based CIC algorithm (DM-CIC), which achieves higher efficiency by exempting the CIC algorithm from making the forced checkpoints in MA systems. Through simulation, we find out that DM-CIC is stable and better suited to large scale MA systems. © 2006 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Collaborative edge computing enabling AIoT applications

Collaborative edge computing enabling AIoT applications

引用

2022 IEEE Region 10 International Conference, TENCON 2022

作者： Cao, Jiannong Department of Computing Hong Kong Polytechnic University Hong Kong Graduate School Director Research Institute for Ai of IoT Internet and Mobile Computing Lab

来源：评论

学校读者我要写书评

暂无评论

mobile agent-enabled framework for structuring and building distributed systems on the internet

引用

Science in China(Series F) 2006年第6期49卷 885-905页

作者： CAO Jiannong ZHOU Jingyang ZHU Weiweit LI Xuhui Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hung Hom KLW Hong Kong China State Key Lab of Novel Software Technologies Nanjing University Nanjing 210093 China State Key Lab of Software Engineering Wuhan University Wuhan 430072 China

mobile agent has shown its promise as a powerful means to complement and enhance existing technology in various application areas. In particular, existing work has demonstrated that MA can simplify the development and improve the performance of certain classes of distributed applications, especially for those running on a wide-area, heterogeneous, and dynamic networking environment like the internet. In our previous work, we extended the application of MA to the design of distributed control functions, which require the maintenance of logical relationship among and/or coordination of processing entities in a distributed system. A novel framework is presented for structuring and building distributed systems, which use cooperating mobile agents as an aid to carry out coordination and cooperation tasks in distributed systems. The framework has been used for designing various distributed control functions such as load balancing and mutual ex- clusion in our previous work. In this paper, we use the framework to propose a novel approach to detecting deadlocks in distributed system by using mobile agents, which demonstrates the advantage of being adaptive and flexible of mobile agents. We first describe the MAEDD （mobile Agent Enabled Deadlock Detection） scheme, in which mobile agents are dispatched to collect and analyze deadlock information distributed across the network sites and, based on the analysis, to detect and resolve deadlocks. Then the design of an adaptive hybrid algorithm derived from the framework is presented. The algorithm can dynamically adapt itself to the changes in system state by using different deadlock detection strategies. The performance of the proposed algorithm has been evaluated using simulations. The results show that the algorithm can outperform existing algorithms that use a fixed deadlock detection strategy.

关键词： mobile agent internet computing distributed systems deadlock detection.

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

11th IEEE International Conference on Embedded and Real-Time computing Systems and Applications

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

ISBN: (纸本)0769523463

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. © 2005 IEEE.

关键词： Fuzzy control

来源：评论

学校读者我要写书评

暂无评论

Fast source switching for gossip-based peer-to-peer streaming

Fast source switching for gossip-based peer-to-peer streamin...

引用

37th International Conference on Parallel Processing, ICPP 2008

作者： Li, Zhenhua Cao, Jiannong Chen, Guihai Liu, Yan State Key Lab. for Novel Software Techonology Nanjing University China Internet and Mobile Computing Lab. Hong Kong Polytechnic University

ISBN: (纸本)9780769533742

In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast source switching to minimize the startup delay of the new source. We model the source switch process and formulate it into an optimization problem. Then we propose a practical greedy algorithm that can approximate the optimal solution by properly interleaving the data delivery of the old source and the new source. We perform simulations on various real-trace overlay topologies to demonstrate the effectiveness of our algorithm. The simulation results show that our proposed algorithm outperforms the normal source switch algorithm by reducing the source switch time by 20%-30% without bringing extra communication overhead, and the reduction ratio tends to increase when the network scale expands. © 2008 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：