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

A Context-Aware Architecture Supporting Service Availability in Mobile Cloud Computing

IEEE TRANSACTIONS ON SERVICES COMPUTING 2017年第6期10卷 956-968页

作者： Guerrero-Contreras, Gabriel Luis Garrido, Jose Balderas-Diaz, Sara Rodriguez-Dominguez, Carlos Univ Granada Software Engn Dept C Periodista Daniel Saucedo Aranda S-N Granada Spain

Mobile systems are gaining more and more importance, and new promising paradigms like Mobile Cloud Computing are emerging. Mobile Cloud Computing provides an infrastructure where data storage and processing could happen outside the mobile node. Specifically, there is a major interest in the use of the services obtained by taking advantage of the distributed resource pooling provided by nearby mobile nodes in a transparent way. This kind of systems is useful in application domains such as emergencies, education and tourism. However, these systems are commonly based on dynamic network topologies, in which disconnections and network partitions can occur frequently, and thus the availability of the services is usually compromised. Techniques and methods from Autonomic Computing can be applied to Mobile Cloud Computing to build dependable service models taking into account changes in the context. In this work, a context-aware software architecture is proposed to support the availability of the services deployed in mobile and dynamic network environments. The proposal is based on a service replication scheme together with a self-configuration approach for the activation/hibernation of the replicas of the service depending on relevant context information from the mobile system. To that end, an election algorithm has been designed and implemented.

关键词： Context-awareness software architecture mobile cloud computing service oriented architecture (SOA) self-configuration election algorithm service availability

来源：评论

学校读者我要写书评

暂无评论

Impact of Transmission Communication Protocol on a Self-adaptive Architecture for Dynamic Network Environments 5th

Impact of Transmission Communication Protocol on a Self-adap...

引用

World Conference on Information Systems and Technologies (WorldCIST)

作者： Guerrero-Contreras, Gabriel Luis Garrido, Jose Rodriguez Fortiz, Maria Jose O'Hare, Gregory M. P. Balderas-Diaz, Sara Univ Granada ETSIIT Software Engn Dept C Periodista Daniel Saucedo Aranda S-N Granada Spain Univ Coll Dublin Sch Comp Sci Dublin 4 Ireland Univ Coll Dublin Earth Inst Dublin 4 Ireland

ISBN: (纸本)9783319565385;9783319565378

The quality attributes of services deployed on distributed system are critically conditioned by their placement within the distributed system. To this regard, the host election process is one of the main elements in the self-adaptive replication and deployment of services, as one of the possible approaches to address the changing computational conditions of dynamic network environments in order to ensure quality attributes of the system. In this paper, a study and an analysis of the behaviour of a host election algorithm under reliable and non-reliable transmission protocols (TCP and UDP) is presented. The algorithm has been proposed as a basis for a self-adaptive architecture in previous work. The results demonstrate that the reliability of TCP redound in a better efficiency in the system, despite its high latency and higher consumption of bandwidth, in comparison to UDP.

关键词： Software architecture Autonomic computing election algorithm Service availability Transmission Control Protocol (TCP) User Datagram Protocol (UDP)

来源：评论

学校读者我要写书评

暂无评论

Gray Hole Attack Detection in MANETs 2

Gray Hole Attack Detection in MANETs

引用

2nd International Conference for Convergence in Technology (I2CT)

作者： Patil, Sarika U. Coll Engn Phaltan Ta Phaltan India

ISBN: (纸本)9781509043071

Networking system does not liable on static infrastructure that interconnects various nodes in identical broadcast range dynamically called as Mobile Ad-hoc Network. A Network requires adaptive connectivity due to this data transmission rate increased. In this paper, we designed developed a dynamic cluster head selection to detect gray hole attack in MANETs on the origin of battery power. MANETs has dynamic nodes so we delivered novel way to choose cluster head by self-stabilizing election algorithm followed by MD5 algorithm for security purposes. The Dynamic cluster based intrusion revealing system to detect gray hole attack in MANET. This Architecture enhanced performance in terms of Packet delivery ratio and throughput due to dynamic cluster based IDS, associating results of existing system with proposed system, throughput of network increased, end to end delay and routing overhead less compared with existing system due to gray hole nodes in the MANET. The future work can be prolonged by using security algorithm AES and MD6 and also by including additional node to create large network by comparing multiple routing protocol in MANETs.

关键词： Ad-hoc on demand distance vector protocol election algorithm Intrusion Detection System Message Digest 5 Mobile ad-hoc Network

来源：评论

学校读者我要写书评

暂无评论

Phenomena Detection in Mobile Wireless Sensor Networks

引用

JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT 2016年第1期24卷 92-115页

作者： Abu Safia, Amany Al Aghbari, Zaher Kamel, Ibrahim Univ Sharjah Sharjah U Arab Emirates

Environmental phenomena, such as fires, poisonous gases, and oil spills, can be detected by wireless sensor networks (WSNs) that cover the geographical area of the phenomena. These sensors collaboratively monitor the area to detect the sensors' readings that deviate from normal reading patterns after which a phenomena is declared. This research proposes a distributed algorithm to detect dynamic phenomena using mobile WSNs under the assumption that there is no centralized server to collect and aggregate the sensors data. Therefore, the sensors self-organize into disjoint groups by first electing a few sensors to be group heads (GHs) and then the rest of the sensors group themselves with the nearest GH. Each group of sensors detect phenomena locally. Then, the GHs communicate the detected local phenomena information among themselves to aggregate the information and detect the global phenomena. Moreover, the paper proposes two GH election algorithms, namely the Last Group Head election algorithm and the Distributed Group Head election algorithm. The experimental results show that the proposed election algorithms reduce the energy costs of the mobile WSN by 54-66 % as compared with the straightforward election algorithm. In addition, this paper proposes an optimization technique to further reduce the energy costs of reporting the global phenomena to about 33 % by reducing the size of the reported phenomena information. The proposed algorithms are validated through a comprehensive set of experiments conducted using the NS2 network simulator.

关键词： Phenomena detection Sensor networks election algorithm Mobile sensors network Energy efficient mobile WSN

来源：评论

学校读者我要写书评

暂无评论

The Design and Implementation on Distributed System

The Design and Implementation on Distributed System

引用

2017 3rd International Conference on Innovation Development of E-commerce and Logistics (ICIDEL 2017)

作者： Xin Sui Zetian Zhang Yan Zeng Dan Liu Li Li Liu Liu Changchun University of Science and Technology Jilin Provincial Institute of Education Baicheng Ordnance Test Center

The paper achieves the traveling balance control in exploratory behavior by fuzzy logic method,uses the least squares fitting to realize the corner detection and realizes the roadblock detection by designing the Barrier Predictive Function *** paper designs a distributed system based on block storage and electoral computing model which provides high reliability storage and computing *** paper proposes the BUS communication model,achieves the storage and computing node's selection by LSM merging tree and Bully *** real-time ultrasonic roadblock detection information data obtained by Arduino detector is analyzed based on the distributed system and finally,the detection of environmental map is realized.

关键词： Distributed system LSM merging tree election algorithm roadblock detection Arduino

来源：评论

学校读者我要写书评

暂无评论

Analysis of fully distributed splitting and naming probabilistic procedures and applications

引用

THEORETICAL COMPUTER SCIENCE 2015年 584卷 115-130页

作者： Metivier, Y. Robson, J. M. Zemmari, A. Univ Bordeaux Bordeaux INP LaBRI UMR CNRS 5800 F-33405 Talence France

This paper proposes and analyses two fully distributed probabilistic splitting and naming procedures which assign a label to each vertex of a given anonymous graph G without any initial knowledge. We prove, in particular, that with probability 1-o(n(-1)) (resp. with probability 1-o(n(-c)) for any c >= 1) there is a unique vertex with the maximal label in the graph G having n vertices. In the first case, the size of labels is O (logn) with probability 1-o(n(-1)) and the expected value of the size of labels is also O (logn). In the second case, the size of labels is O ((logn)(log* n)(2)) with probability 1-o(n(-c)) for any c >= 1;their expected size is O ((logn)(log* n)). We analyse a basic Simple maximum broadcasting algorithm and prove that if vertices of a graph G use the same probabilistic distribution to choose a label then, for broadcasting the maximal label over the labelled graph, each vertex sends O (logn) messages with probability 1-o(n(-1)). From these probabilistic procedures we deduce Monte Carlo algorithms for electing or computing a spanning tree in anonymous graphs without any initial knowledge and for counting vertices of an anonymous ring;these algorithms are correct with probability 1-o(n(-1)) or with probability 1-o(n(-c)) for any c >= 1. The size of messages has the same value as the size of labels. The number of messages is O(m logn) for electing and computing a spanning tree;it is O (n logn) for counting the vertices of a ring. These algorithms can be easily extended to also ensure for each vertex v an error probability bounded by epsilon(v);the error probability epsilon(v), is decided by v in a totally decentralised way. We illustrate the power of the splitting procedure by giving a probabilistic election algorithm for rings having n vertices with identities which is correct and always terminates;its message complexity is equal to O(n logn) with probability 1-o(n(-1)). (C) 2015 Elsevier B.V. All rights reserved.

关键词： Monte Carlo algorithm Spanning tree computation Counting election algorithm Probabilistic analysis Splitting and naming

来源：评论

学校读者我要写书评

暂无评论

Dynamic Cluster Head Selection to Detect Gray Hole Attack using Intrusion Detection System in MANETs 15

Dynamic Cluster Head Selection to Detect Gray Hole Attack us...

引用

6th International Conference on Computer & Communication Technology (ICCCT-2015)

作者： Funde, Rahul Chandre, Pankaj Flora Inst Technol Dept Comp Engn Pune Maharashtra India

ISBN: (纸本)9781450335522

A Networking system that does not liable on static infrastructure that interconnects various nodes in identical broadcast range is called as Mobile Ad-hoc Network. A Network requires adaptive connectivity deprived from any interference. In this paper, we design and developed a dynamic cluster head selection to detect gray hole attack in MANETs on the origin of battery power. MANETs has dynamic nodes so we delivered novel way to choose cluster head by self-stabilizing election algorithm followed by MD5 algorithm for security purposes. The Dynamic cluster based intrusion revealing system to detect gray hole attack in MANET Architecture has to enhanced performance in terms of Packet delivery ratio and throughput due to dynamic cluster based IDS, associating results of existing system with proposed system, throughput of network increased, end to end delay and routing overhead has less performance compared with existing due to gray hole nodes in the MANET. The future work can be prolonged by using security algorithm AES and MD6 and also it is include additional node to create large network by comparing multiple routing protocol in MANETs.

关键词： Ad-hoc on demand distance vector protocol election algorithm Intrusion Detection System Message Digest 5 Mobile ad-hoc Network

来源：评论

学校读者我要写书评

暂无评论

A New Approach For election algorithm in Distributed Systems

A New Approach For Election Algorithm in Distributed Systems

引用

2nd International Conference on Communication Theory, Reliability and Quality of Services

作者： Gholipour, M. Kordafshari, M. S. Jahanshahi, M. Rahmani, A. M. Islamic Azad Univ Dept Comp Engn Qazvin Branch Qazvin Iran Islamic Azad Univ Dept Comp Engn Cent Tehran Branch Tehran Iran Islamic Azad Univ Dept Comp Engn Sci & Res Branch Tehran Iran

ISBN: (纸本)9781424444236

Leader election is an important problem in distributed computing systems. In this problem, when the leader is crashed, other nodes must elect another leader. Garcia-Molina's Bully algorithm is a classic solution to cope with this problem. In this paper we introduce a new method based on electing a leader and alternatives. If the leader crash, the alternative takes, care of the leader's responsibilities. Our results revealed that often, after a leader crash, leader alternative elect as a leader and continue to work. increases. We show that our proposed algorithm is more efficient than the Garcia Molina's one in term of time, message complexity and in the fewer stages.

关键词： election algorithm

来源：评论

学校读者我要写书评

暂无评论

Experiments on an election algorithm for Decision Element Failures in 4D Future Internet Architecture

Experiments on an Election Algorithm for Decision Element Fa...

引用

International Conference on Future Generation Communication and Networking/International Conference on Advanced Communication and Networking (FGCN/ACN 2009)

作者： Yue, Songqing Xiao, Yang Xie, Geoffrey G. Univ Alabama Dept Comp Sci Tuscaloosa AL 35487 USA US Navy Postgrad Sch Monterey CA 93943 USA

ISBN: (纸本)9783642108433

A novel 4D architecture has been presented in [1], [3] for the future Internet, advocating a decomposition of network control functions into three distinct planes: decision, dissemination, and discovery, along with a streamlined data plane, to achieve more predictable network performance. An underlying concern with the 4D architecture is that the decision making is centralized at a single entity called Decision Element (DE), whose failure may disrupt the whole network [2]. A simple approach has been proposed to increase the reliability of the system by attaching a few hot stand-by DEs to the network. These hot stand-by DEs collect information from other network elements and perform computation in the same manner as the master DE. In this work, we have created a set of experiments to verify the performance of the election algorithm based on the prototype of the 4D architecture, and experimentally evaluate the re-convergence time required for the election algorithm after a failure of the master DE.

关键词： Future Internet 4D architecture election algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Application of Distribute OLAP System with an Improved election algorithm

Research on Application of Distribute OLAP System with an Im...

引用

2008年国际电子商务、工程及科学领域的分布式计算和应用学术研讨会

作者： Lijun Wang Economics and Management Department,North China Electric Power University,Baoding,Hebei,China

The OLAP system can support enterprise decision well through intelligent query with data of *** deal with abundant and complicated query tasks OLAP system needs high performance server,so that the cost of OLAP system is higher for most middle and small *** the aid of distribution technology,we can deploy OLAP system on multiple minicomputers according to allocating tasks to each server,so we can attain application of OLAP with existing resource of *** system coordinator is selected by using election *** a full-connected LAN,the adopted election schemas are generally the classic Bully algorithm by Garcia-Molina or improved *** this study,we propose an improved election algorithm suitable to the distributed OLAP *** the new algorithm can improve the system performance and produce fewer messages.

关键词： OLAP Data Warehouse Distributed system election algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：