Abstract
Nowadays, online social networking services in wireless networks are very popular. In this paper, we propose a timer-based push scheme (TPS) where a number of articles posted during a pre-defined time interval are pushed to users and thus the number of push operations and articles to be pulled can be reduced. We develop an analytical model for TPS and derive the optimal timer minimizing the total cost. Simulation results are given to show the effectiveness of TPS over the existing push N scheme and to validate the analytical results.
| Original language | English |
|---|---|
| Article number | 6343255 |
| Pages (from-to) | 2095-2098 |
| Number of pages | 4 |
| Journal | IEEE Communications Letters |
| Volume | 16 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 2012 |
Bibliographical note
Funding Information:Manuscript received September 12, 2012. The associate editor coordinating the review of this letter and approving it for publication was J. Holliday. This work was supported in part by the WCU Project (R33-2008-000-10044-0), in part by the ITRC support program (NIPA-2012-H0301-12-4004), and in part by the KCA R&D program (KCA-10913-05004). H. Ko and S. Pack (corresponding author) are with the School of Electrical Engineering, Korea University, Seoul, Korea (e-mail: {st basket, shpack}@korea.ac.kr). W. Lee is with the Department of Computer Science and Engineering, Korea University, Seoul, Korea (e-mail: wlee@korea.ac.kr). Digital Object Identifier 10.1109/LCOMM.2012.102612.122056
Keywords
- Push
- online social networking service
- pull
ASJC Scopus subject areas
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering