PARallel and distributedcomputing (PArdISC) is a parallel programming environment which provides the needed transparency as a scalable OpenFrame computing Model. It can be used to configure the network as a loosely c...
详细信息
PARallel and distributedcomputing (PArdISC) is a parallel programming environment which provides the needed transparency as a scalable OpenFrame computing Model. It can be used to configure the network as a loosely coupled parallel machine, processor pool architecture, and distributedcomputing environment with Logical Network Connectivity. The software architecture of PArdISC is made up of configuration servers, client processes, processor pool servers and process communication interface.
Geo-distributed mobile cloud computing (GMCC) integrates location information into mobile cloud computing, that has high potential for a large variety of applications. In a vehicular environment, a GMCC provides a lar...
详细信息
ISBN:
(纸本)9781509009466
Geo-distributed mobile cloud computing (GMCC) integrates location information into mobile cloud computing, that has high potential for a large variety of applications. In a vehicular environment, a GMCC provides a large number of resources to vehicles that are geographically close to them. However, there are few studies that focus on security and privacy issues in a GMCC scenario. Vehicles need sufficient pseudonyms to periodically change for privacy preservation. In this paper, we focus on pseudonym management in GMCC system for vehicular environment. We design a three-layer on-demand pseudonym system to manage the pseudonyms. Moreover, we propose a secure pseudonym distribution scheme for secure communication among vehicles. As the number of demanded pseudonyms varies with traffic loads in different clouds, we use a newsvendor model to address the optimal on-demand pseudonym distribution problem. Numerical results indicate our proposed schemes not only improve utility of the clouds, but also maximize utilization of the pseudonyms.
Now a day large research is going on in Wireless sensor Network (WSNs). WSN is collection of various sensor nodes and one destination as sink. These nodes sense the environment and transmit data to the designation sin...
详细信息
ISBN:
(纸本)9781467345286
Now a day large research is going on in Wireless sensor Network (WSNs). WSN is collection of various sensor nodes and one destination as sink. These nodes sense the environment and transmit data to the designation sink. The main aim of wireless sensor network is data dissemination to the destination sink which must be reliable. All the nodes send data at a time, so congestion may happen and is the most important problem in WSNs. Congestion causes arbitrary dropping of packet and energy wastage. This paper describes the performance analysis of existing routing protocol in WSNs. Simulation result shows the suitability protocol for random topology in terms of packet delivery ratio, received packets, total drop packets, node density.
Huge information is available in distributed database that can be exploited for constructive use. A query posed over a distributed database may get processed against disparate data sources distributed over a network. ...
详细信息
ISBN:
(纸本)9781467345286
Huge information is available in distributed database that can be exploited for constructive use. A query posed over a distributed database may get processed against disparate data sources distributed over a network. Each of these sources may contain data relevant to the query. The aim of distributed database system is to provide efficient query processing strategy for the given query. In distributed database scenario, multiple copies of the same data may reside at different sources. As a result, there can be multiple query strategy for a given query and finding an optimal query processing strategy is a combinatorial optimization problem. In this paper, an approach is presented that is able to generate optimal query processing plans for a given user query. The approach uses iterative improvement and simulated annealing algorithms to determine optimal query plans for a given query. The approach uses the cost heuristic defined in [1]
Under the rapid development of information technology in todays society, kiosk system has become an indispensable part in many fields. Especially in retail business, retailers use the kiosk system to meet customer dem...
详细信息
The proceedings contain 27 papers. The topics discussed include: distributed coalition formation in visual sensor networks: a virtual vision approach;efficient and distributed access control for sensor networks;optimi...
ISBN:
(纸本)3540730893
The proceedings contain 27 papers. The topics discussed include: distributed coalition formation in visual sensor networks: a virtual vision approach;efficient and distributed access control for sensor networks;optimizing end to end routing performance in wireless sensor networks;improving event-to-sink throughput in wireless sensor networks;localization for an choritic sensor networks;mobile anchor-free localization for wireless sensor networks;optimal cluster association in two-tiered wireless sensor networks;distributed facility location algorithms for flexible configuration of wireless sensor networks;design and implementation of a flexible location directory service for tiered sensor networks;and a fully polynomial approximation algorithm for collaborative relaying in sensor networks under finite rate constraints.
In this paper, we present OVERTAKE, an opportunistic routing protocol for Time-Slotted Channel Hopping (TSCH). OVERTAKE combines (1) opportunistic routing, (2) concurrent transmissions and (3) TSCH. We show that this ...
详细信息
ISBN:
(数字)9781728143514
ISBN:
(纸本)9781728143514
In this paper, we present OVERTAKE, an opportunistic routing protocol for Time-Slotted Channel Hopping (TSCH). OVERTAKE combines (1) opportunistic routing, (2) concurrent transmissions and (3) TSCH. We show that this novel combination enables low-latency, central scheduling withstanding node failures. Our initial results show its ability to withstand node failures of up to 40% of nodes of a flow while keeping minimal latency.
Fault-tolerance is an important research topic in the study of distributedsystems. To counter the influence of faulty components, it is essential to reach a common agreement in the presence of faults before performin...
详细信息
ISBN:
(纸本)9781424455379
Fault-tolerance is an important research topic in the study of distributedsystems. To counter the influence of faulty components, it is essential to reach a common agreement in the presence of faults before performing certain tasks. However, the agreement problem is fundamental to fault-tolerant distributedsystems. In previous studies, protocols dealing with the agreement problem have focused on a network topology with faulty hardware components. However, cloud computing, an Internet-based development in which dynamically scalable and often virtualized resources are provided as a service over the Internet has become a significant issue. Therefore, previous protocols for the agreement problem with fallible hardware are not suitable for a cloud computing environment with fallible processes. To enhance fault tolerance, the agreement problem in a cloud computing environment with fallible processes is revisited in this study. The proposed protocol can solve the agreement problem with a minimal number of rounds of message exchange and tolerates a maximal number of faulty processes.
In the emerging edge computing architecture, several types of devices have computational resources available. In order to make efficient use of those resources, deciding on which device a task should execute is of gre...
详细信息
ISBN:
(纸本)9781728123653
In the emerging edge computing architecture, several types of devices have computational resources available. In order to make efficient use of those resources, deciding on which device a task should execute is of great importance. Existing works on task placement in edge computing focus on a resource supply side consisting of stationary devices only. In this paper, we consider the addition of mobile edge devices. We explore how mobile and stationary edge devices can augment the original task placement problem with a second placement problem: the placement of the mobile edge devices. We propose the ORCH framework in order to solve the joint problem in a distributed manner and evaluate it in the context of a spatially-changing load. Our implementation of the combined task and edge placement algorithms shows a normalized 83% delay-sensitive task completion rate compared to a perfect edge placement strategy.
The weather nowadays has become so unpredictable that there is a need for a system that predicts correct weather patterns and allows them to take a precautionary plan of action to cope up with it. Three major sources ...
详细信息
暂无评论