scispace - formally typeset
Search or ask a question
Topic

Mobile telephony

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


Papers
More filters
Journal ArticleDOI
En Wang1, Yongjian Yang1, Jie Wu2, Wenbin Liu1, Xingbo Wang1 
TL;DR: An efficient prediction-based user-recruitment strategy for mobile crowdsensing that achieves a lower recruitment payment and PURE-DF achieves the highest delivery efficiency is proposed.
Abstract: Mobile crowdsensing is a new paradigm in which a group of mobile users exploit their smart devices to cooperatively perform a large-scale sensing job. One of the users’ main concerns is the cost of data uploading, which affects their willingness to participate in a crowdsensing task. In this paper, we propose an efficient Prediction-based User Recruitment for mobile crowdsEnsing (PURE), which separates the users into two groups corresponding to different price plans: Pay as you go (PAYG) and Pay monthly (PAYM). By regarding the PAYM users as destinations, the minimizing cost problem goes to recruiting the users that have the largest contact probability with a destination. We first propose a semi-Markov model to determine the probability distribution of user arrival time at points of interest (PoIs) and then get the inter-user contact probability. Next, an efficient prediction-based user-recruitment strategy for mobile crowdsensing is proposed to minimize the data uploading cost. We then propose PURE-DF by extending PURE to a case in which we address the tradeoff between the delivery ratio of sensing data and the recruiter number according to Delegation Forwarding. We conduct extensive simulations based on three widely-used real-world traces: roma/taxi , epfl , and geolife . The results show that, compared with other recruitment strategies, PURE achieves a lower recruitment payment and PURE-DF achieves the highest delivery efficiency.

140 citations

Journal ArticleDOI
TL;DR: It is shown that digital broadcasting systems are inherently capacity limited and do not appropriately scale, and that wireless access in vehicular environment (WAVE) systems scale well, provide ample capacity, and are coverage limited.
Abstract: Future intelligent transportation systems (ITS) will necessitate wireless vehicle-to-infrastructure (V2I) communications. This wireless link can be implemented by several technologies, such as digital broadcasting, cellular communication, or dedicated short-range communication (DSRC) systems. Analyses of the coverage and capacity requirements are presented when each of the three systems is used to implement the V2I link. We show that digital broadcasting systems are inherently capacity limited and do not appropriately scale. Furthermore, we show that the Universal Mobile Telecommunications System (UMTS) can implement the V2I link using either a dedicated channel (DCH) or a multimedia broadcast/multicast service (MBMS), as well as a hybrid approach. In every case, such V2I systems scale well and are capacity limited. We also show that wireless access in vehicular environment (WAVE) systems scale well, provide ample capacity, and are coverage limited. Finally, a direct quantitative comparison of the presented systems is given to show their scaling behavior with the number of users and the geographical coverage.

140 citations

Patent
16 Jul 2002
TL;DR: In this paper, the authors present a system and method for providing real-time position information of one party to another party by utilizing a conventional telecommunication network system such as the convention telephone network (2), a mobile telecommunications network (22), a computer network, or the Internet (1).
Abstract: The present invention is directed to a system and method for providing real-time position information of one party to another party by utilizing a conventional telecommunication network system such as the convention telephone network (2), a mobile telecommunications network (22), a computer network, or the Internet (1). More specifically, the preferred embodiments of the present invention allow a caller (5,6) and a receiver (18a) of a telephone call to provide to and receive from each other position information related to the caller and/or receiver's physical location, including address information, GPS coordinates, nearby fixed locations such as a parking structure, etc. Additionally, the preferred embodiments of the present invention allow a caller (5,6) and receiver (18a) to retrieve routing instructions or maps for traveling to or from each other. In another embodiment of the present invention, a party may locate the position of another party via the entry of the other party's unique identifier such as a phone number of the other party's mobile phone. In yet another embodiment of the present invention, the position information of a party may be concurrently delivered to another party's computer terminal whereby the other party can process the information in further detail.

140 citations

Journal ArticleDOI
TL;DR: A novel concept of weighted barrier graph (WBG) is introduced and it is proved that determining the minimum number of mobile sensors required to form \(k\) -barrier coverage is related with finding \( k\) vertex-disjoint paths with the minimum total length on the WBG.
Abstract: Barrier coverage is a critical issue in wireless sensor networks for security applications (e.g., border protection) where directional sensors (e.g., cameras) are becoming more popular than omni-directional scalar sensors (e.g., microphones). However, barrier coverage cannot be guaranteed after initial random deployment of sensors, especially for directional sensors with limited sensing angles. In this paper, we study how to efficiently use mobile sensors to achieve \(k\) -barrier coverage. In particular, two problems are studied under two scenarios. First, when only the stationary sensors have been deployed, what is the minimum number of mobile sensors required to form \(k\) -barrier coverage? Second, when both the stationary and mobile sensors have been pre-deployed, what is the maximum number of barriers that could be formed? To solve these problems, we introduce a novel concept of weighted barrier graph (WBG) and prove that determining the minimum number of mobile sensors required to form \(k\) -barrier coverage is related with finding \(k\) vertex-disjoint paths with the minimum total length on the WBG. With this observation, we propose an optimal solution and a greedy solution for each of the two problems. Both analytical and experimental studies demonstrate the effectiveness of the proposed algorithms.

140 citations

Proceedings ArticleDOI
17 May 2009
TL;DR: Results of power and energy consumption measurements conducted on mobile phones for 2G and 3G networks for text messaging and voice services imply that mobile phones should switch the network in dependency of the service used to save the maximum amount of energy.
Abstract: Over the last years mobile phones had a remarkable evolution. From a simple device for voice communication, it became a full blown multimedia device with multiple features and appealing services. In parallel with the introduction of novel services, mobile devices became more and more energy-hungry reducing the operational time for the user. To extend the battery life of mobile phones is one of the top priorities for mobile phones' manufacturers. This paper presents results of power and energy consumption measurements conducted on mobile phones for 2G and 3G networks. The services under investigation were text messaging, voice and data. The paper reports larger energy consumption in 3G networks for text messaging and voice services than energy consumption in 2G networks. On the other side the 3G networks become more energy friendly when large volumes of data have to be downloaded. The results imply that mobile phones should switch the network in dependency of the service used to save the maximum amount of energy. As this handover consumes energy, we include its analysis in our measurements.

140 citations


Network Information
Related Topics (5)
Wireless
133.4K papers, 1.9M citations
95% related
Wireless network
122.5K papers, 2.1M citations
94% related
Wireless sensor network
142K papers, 2.4M citations
92% related
Wireless ad hoc network
49K papers, 1.1M citations
92% related
Network packet
159.7K papers, 2.2M citations
91% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20242
202351
2022149
2021339
2020558
2019707