Derivation of an Algorithm for Location Management for Mobile Communication Devices

1998 ◽  
Vol 08 (04) ◽  
pp. 473-488 ◽  
Author(s):  
Beverly A. Sanders ◽  
Berna L. Massingill ◽  
Svetlana Kryukova

In a network supporting mobile communication devices, a mechanism to find the location of a device, wherever it may be, is needed. In this paper, we present a distributed algorithm for this purpose along with its formal specification and proof sketch. Starting with an algorithm due to Wang, the process of formalization together with careful attention to abstraction leads to a more regular, general, and robust algorithm with a clearer description. An incidental contribution is a useful theorem for proving progress properties in distributed algorithms that use tokens.

Author(s):  
Nenad Jukic ◽  
Abhishek Sharma ◽  
Boris Jukic ◽  
Manoj Parameswaran

Mobile Commerce (m-commerce) has been defined as a process of conducting commercial transactions via “mobile” telecommunications networks using a communication, information, and payment devices such as a mobile phone or a palmtop unit. Here, we analyze the potential ramifications in the field of marketing and changes in the market due to the advent of m-commerce. In particular, we analyze the opportunities that various characteristics of the m-commerce model can bring to the field of marketing. We investigate the likelihood of the emergence of mall-like zones that are based both on the geographical proximity of services and goods providers and the use of mobile communication devices. Such zones have a potential for becoming the basic units for any analysis of m-commerce scenarios. As m-commerce attains maturity, the zones could become the fundamental parameter in marketing evaluation.


2007 ◽  
Vol 08 (03) ◽  
pp. 253-284 ◽  
Author(s):  
IAIN A. STEWART

We derive a sequential algorithm Find-Ham-Cycle with the following property. On input: k and n (specifying the k-ary n-cube [Formula: see text]); F, a set of at most 2n − 2 faulty links; and v , a node of [Formula: see text], the algorithm outputs nodes v + and v − such that if Find-Ham-Cycle is executed once for every node v of [Formula: see text] then the node v + (resp. v −) denotes the successor (resp. predecessor) node of v on a fixed Hamiltonian cycle in [Formula: see text] in which no link is in F. Moreover, the algorithm Find-Ham-Cycle runs in time polynomial in n and log k. We also obtain a similar algorithm for an n-dimensional hypercube with at most n − 2 faulty links. We use our algorithms to obtain distributed algorithms to embed Hamiltonian cycles k-ary n-cubes and hypercubes with faulty links; our hypercube algorithm improves on a recently-derived algorithm due to Leu and Kuo, and our k-ary n-cube algorithm is the first distributed algorithm for embedding a Hamiltonian cycle in a k-ary n-cube with faulty links.


1998 ◽  
Vol 38 (6) ◽  
pp. 1-8 ◽  
Author(s):  
Charles N. Haas ◽  
R. Rhodes Trussell

The development of potable water reuse systems (systems for the treatment of wastewater to quality adequate to augment other surface water supplies) requires careful attention to the consistent production of product water which has low levels of contaminants, such as infectious pathogens, capable of causing human health effects from acute exposure. Little consideration has been given to the formal specification of the degree of reliability of such systems. In this paper we present two ways to approach the problem. The first is a formal extension of the ‘multiple barrier’ concept often cited in the water treatment literature. The second is an application of probabilistic analysis. With either method, it is clear that much more information should be obtained with respect to the failure modes, and the frequency with which individual processes achieve a particular level of performance. However the conceptual framework presented here should enable a formal analysis of the problem to be conducted.


Sign in / Sign up

Export Citation Format

Share Document