Mobile telephony

About: Mobile telephony is a research topic. Over the lifetime, 38008 publications have been published within this topic receiving 553646 citations.

Secure friend discovery in mobile social networks

Abstract: Mobile social networks extend social networks in the cyberspace into the real world by allowing mobile users to discover and interact with existing and potential friends who happen to be in their physical vicinity. Despite their promise to enable many exciting applications, serious security and privacy concerns have hindered wide adoption of these networks. To address these concerns, in this paper we develop novel techniques and protocols to compute social proximity between two users to discover potential friends, which is an essential task for mobile social networks.We make three major contributions. First, we identify a range of potential attacks against friend discovery by analyzing real traces. Second, we develop a novel solution for secure proximity estimation, which allows users to identify potential friends by computing social proximity in a privacy-preserving manner. A distinctive feature of our solution is that it provides both privacy and verifiability, which are frequently at odds in secure multiparty computation. Third, we demonstrate the feasibility and effectiveness of our approaches using real implementation on smartphones and show it is efficient in terms of both computation time and power consumption.

Data Replication for Improving Data Accessibility in Ad Hoc Networks

Abstract: In ad hoc networks, due to frequent network partition, data accessibility is lower than that in conventional fixed networks. In this paper, we solve this problem by replicating data items on mobile hosts. First, we propose three replica allocation methods assuming that each data item is not updated. In these three methods, we take into account the access frequency from mobile hosts to each data item and the status of the network connection. Then, we extend the proposed methods by considering aperiodic updates and integrating user profiles consisting of mobile users' schedules, access behavior, and read/write patterns. We also show the results of simulation experiments regarding the performance evaluation of our proposed methods

Location tracking of mobiles in cellular radio networks

Abstract: Some useful services in cellular radio networks and also a class of handover algorithms require knowledge of the present position and velocity of mobiles. This paper deals with a method to track mobiles by on-line monitoring of field strength data of surrounding base stations at successive time points. Such data is available in present global system for mobile communication (GSM) systems each 0.48 s and also in code-division multiple-access (CDMA) systems for transmission control. Because of strong random fluctuations of the signals, appropriate smoothing is the key point of the procedure. We develop a locally linear prediction model of successive positions as a basis for Kalman filtering. This approach turns out to be extremely successful, achieving average mislocations of 70 m in simulated test runs. Further improvement is possible by using external geographical information.

LTE-advanced: an operator perspective

Abstract: LTE-Advanced extends the capabilities originally developed in LTE within the 3GPP. Carrier aggregationis the most significant, albeit complex, improvement provided by LTE-Advanced. Bandwidths from various portions of the spectrum are logically concatenated resulting in a virtual block of a much larger band, enabling increased data throughput. Additionally, enhancements to MIMO antenna techniques in the uplink and downlink further increase the data throughput. Cell coverage is improved by means of relay nodes, which connect to donor eNode-Bs. To cope with the many varieties of cell types and sizes (macro, pico, femto), intercell interference control is enhanced to handle these heterogeneous networks. Operators hope to leverage LTE-Advanced to offer their mobile wireless customers a vastly superior user experience.

Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage

Abstract: One of the research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment problem to achieve multi-level coverage of an area I. We consider two sub-problems: k-coverage placement and distributed dispatch problems. The placement problem asks how to determine the minimum number of sensors required and their locations in I to guarantee that I is k-covered and the network is connected; the dispatch problem asks how to schedule mobile sensors to move to the designated locations according to the result computed by the placement strategy such that the energy consumption due to movement is minimized. Our solutions to the placement problem consider both the binary and probabilistic sensing models, and allow an arbitrary relationship between the communication distance and sensing distance of sensors. For the dispatch problem, we propose a competition-based and a pattern-based schemes. The former allows mobile sensors to bid for their closest locations, while the latter allows sensors to derive the target locations on their own. Our proposed schemes are efficient in terms of the number of sensors required and are distributed in nature. Simulation results are presented to verify their effectiveness.