• 沒有找到結果。

[PDF] Top 20 Efficient migration for mobile computing in distributed networks

Has 10000 "Efficient migration for mobile computing in distributed networks" found on our website. Below are the top 20 most common "Efficient migration for mobile computing in distributed networks".

Efficient migration for mobile computing in distributed networks

Efficient migration for mobile computing in distributed networks

... A Mobile agent is a kind of software program that can migrate from one host to another in a heterogeneous ...the distributed resource system on heterogeneous networks. A mobile agent ... See full document

8

Efficient algorithms for reliability analysis of distributed computing systems

Efficient algorithms for reliability analysis of distributed computing systems

... A distributed computing system is modeled as a collection of resources ...a distributed operating system. The distributed program reliability in a distributed computing ... See full document

18

Efficient Channel Allocation Tree Generation for Data Broadcasting in a Mobile Computing Environment

Efficient Channel Allocation Tree Generation for Data Broadcasting in a Mobile Computing Environment

... degree in elec- trical engineering from National Taiwan University, Taipei, Taiwan, and the ...degrees in computer, information and control engineering from The University of Michigan, Ann Arbor, MI, USA, ... See full document

13

An efficient multipath routing for distributed computing systems with data replication

An efficient multipath routing for distributed computing systems with data replication

... Conclusion In this paper, we propose a heuristic multipath routing algorithm on virtual circuit based ...appropriate for high-bandwidth demanded data transfers issued by real-time ...various networks ... See full document

15

An Efficient Time-Based Checkpointing Protocol for Mobile Computing Systems over Mobile IP

An Efficient Time-Based Checkpointing Protocol for Mobile Computing Systems over Mobile IP

... Keywords: mobile computing, fault tolerance, checkpointing and rollback-recovery Category: Fault tolerance for IPv6 or IPv4-based mobile computing ...of mobile computing ... See full document

11

Channel occupancy times and handoff rate for mobile computing and PCS networks

Channel occupancy times and handoff rate for mobile computing and PCS networks

... approximation for call holding time, and showed that the call holding time cannot simply be modeled by exponential ...distribution. In our study of MC/PCS networks, we address a similar ...that, ... See full document

14

Distributed deployment schemes for mobile wireless sensor networks to ensure multilevel coverage

Distributed deployment schemes for mobile wireless sensor networks to ensure multilevel coverage

... issues in wireless sensor networks (WSNs) is how sensors can efficiently be deployed to cover an ...area. In this paper, we solve the k-coverage sensor deployment problem to achieve multilevel ðkÞ ... See full document

15

Efficient Color-theory-based Dynamic Localization for Mobile Wireless Sensor Networks

Efficient Color-theory-based Dynamic Localization for Mobile Wireless Sensor Networks

... 3.5.1 Average Hop Distance Estimation We propose two simple and quick enhancements to improve the average hop distance esti- mate. When a sensor node intends to route data to some destination, it would select a nearby ... See full document

22

Efficient Search and Topology Adaptation in Mobile Peer-to-Peer Networks

Efficient Search and Topology Adaptation in Mobile Peer-to-Peer Networks

... systems, in which peers are connected arbitrarily and flooding is the main query ...resources in most mobile devices, the flooding mechanism is not suitable for implementing file sharing ... See full document

6

Termination detection protocols for mobile distributed systems

Termination detection protocols for mobile distributed systems

... wireless networks, many distributed protocols well suited for static hosts have to be reevaluated for their appropriateness on wireless ...considered. In this paper, we have shown how ... See full document

9

Efficient Algorithms For Distributed Program Reliability Analysis

Efficient Algorithms For Distributed Program Reliability Analysis

... developed for other restricted networks, such as a star network, a 2-tree network, and a series-parallel network ...files in DCS's, i.e., if there is only one copy of each file in DCS's, the ... See full document

21

Distributed clustering algorithms for data-gathering in wireless mobile sensor networks

Distributed clustering algorithms for data-gathering in wireless mobile sensor networks

... phases in each round. The pro- posed algorithms ACE-C and ACE-L are used for cluster-head election and the mechanism CM is used for cluster formation in clustering ...algorithms in a ... See full document

14

An efficient authentication protocol for mobile networks

An efficient authentication protocol for mobile networks

... Keys In general, session keys are relatively easier to be compromised than master keys because they have to be stored in local memory, which might be insecure throughout the ...credentials in the ... See full document

16

REPC: Reliable and Efficient Participatory Computing for Mobile Devices

REPC: Reliable and Efficient Participatory Computing for Mobile Devices

... Devices: In practical deployments, the density of participating devices within an area may be quite low and vary with ...time. In order to understand the performance with small number of participating ... See full document

9

Efficient End-to-End Authentication Protocols for
Mobile Networks

Efficient End-to-End Authentication Protocols for Mobile Networks

... First, the portable unit (entity) authenticates with the VSD and sets up a session key which is used t o encrypt the signaling information.. After successfully au[r] ... See full document

5

An efficient reliable broadcasting protocol for wireless mobile ad hoc networks

An efficient reliable broadcasting protocol for wireless mobile ad hoc networks

... works in three phases. In the first scattering phase, the source host tries to send the broadcast message to as many hosts in the MANET as possi- ble, with efficiency in ... See full document

14

An Efficient Power-Aware Multicast Protocol for Mobile Ad Hoc Networks

An Efficient Power-Aware Multicast Protocol for Mobile Ad Hoc Networks

... members In figure 6, we can know that whatever the speed is fast or slow, our multicast routing pro- tocol PAMP still keeps high packet delivery ra- ...PAMP. In figure 7, when the transmission range is ... See full document

6

Message-Efficient Location Prediction for Mobile Objects in Wireless Sensor Networks Using a Maximum Likelihood Technique

Message-Efficient Location Prediction for Mobile Objects in Wireless Sensor Networks Using a Maximum Likelihood Technique

... consumption in a wireless sensor network because fewer redundant sensors will be activated to keep monitoring the ...the mobile object, which is not suitable for tracking objects in a wireless ... See full document

7

An Algorithm for Detecting Z-cycles in Distributed Computing System

An Algorithm for Detecting Z-cycles in Distributed Computing System

... Introduction In distributed computing system, checkpointing and rollback-recovery[17] is an important mechanism for fault ...lution for a process to achieve this is to take a check- ... See full document

10

QoS routing in mobile ad hoc networks based on the enhanced distributed coordination function

QoS routing in mobile ad hoc networks based on the enhanced distributed coordination function

... protocol for mul- timedia services in mobile ad hoc networks ...new distributed MAC protocol, called enhanced distributed coordination function (EDCF), that has being developed ... See full document

5

Show all 10000 documents...