Search

In a mobile telecommunications network, the period when a mobile station (MS) resides in a cell (the radio coverage of a base station) is called the cell residence time of that MS. The period between when a call arrives at the MS and when the MS moves out the cell is called the excess life of the cell residence time for that MS. In performance evaluation of a mobile telecommunications network, it is important to derive the excess life distribution from the cell residence times. This distribution determines if a connected call will be handed over to a new cell, and therefore significantly affects the call dropping probability of the network. In mobile-telecommunications-network simulation, generating the excess-life random numbers is not a trivial task, which has not been addressed in the literature. This paper shows how to generate the random numbers from the excess life distribution, and develop the excess-life random number generation procedures for cell residence times with gamma, Pareto, lognormal, and Weibull distributions. This paper indicates that the generated random numbers closely match the true excess-life distributions. [ABSTRACT FROM AUTHOR]

Privacy is becoming a major issue in ad hoc networks. In this paper, using pseudonimity for achieving communication anonymity in networks that apply geographic-routing algorithms is explored. An Anonymous Receiver-Contention POsitioning (ARCPO) routing algorithm is proposed. Node identities (IDs) are kept anonymous. Pseudonyms, i.e., the positions of destinations, are used for data-packet delivery. The anonymity for a destination relies on the difficulty of matching its position to its ID by any observer. Position servers that provide node position information act as trusted third parties and handle identity management. Node mobility makes the use of the pseudonym momentary, and therefore can further improve privacy. The anonymity for the source and intermediate nodes in the path is also achieved because they are not required to reveal any identity information. A receiver-contention mechanism is proposed so that a next hop can be generated without local position information exchange, which otherwise may lead to severe privacy degradation. Analysis and simulation show that while ARCPO guarantees anonymous communication in ad hoc networks, its routing performance degrades moderately compared with other position routing algorithms. [ABSTRACT FROM AUTHOR]

In this paper, the authors propose a node-cooperative automatic repeat request (ARQ) scheme for wireless ad hoc networks, which is suitable for mobile wireless channels with high and correlated frame-error profile. An analytical model based on a two-state Markovian process is proposed to describe the behavior of the proposed retransmission scheme and to obtain its throughput, average delay, and delay jitter. The results of Monte Carlo simulations are included to demonstrate the efficacy of the proposed scheme and to verify the accuracy of the analytical models. Results show that a cooperation among a small number of nodes can significantly improve the performance of the retransmission process in terms of throughput, average delay, and delay jitter by reducing the average duration of retransmission trials. [ABSTRACT FROM AUTHOR]

Energy constraints have a significant impact on the design and operation of wireless sensor networks. This paper investigates the base station (BS) selection (or anycast) problem in wireless sensor networks. A wireless sensor network having multiple BSs (data sink nodes) is considered. Each source node must send all its locally generated data to only one of the BSs. To maximize network lifetime, it is essential to optimally match each source node to a particular BS and find an optimal routing solution. A polynomial time heuristic is proposed for optimal BS selection and anycast via a sequential fixing procedure. Through extensive simulation results, it is shown that this algorithm has excellent performance behavior and provides a near-optimal solution. [ABSTRACT FROM AUTHOR]