Mobile cloud computing (MCC) has been widely used in every aspect of our society, bringing both advantages and challenges. However, the adoption of MCC technology is still at an early stage of implementation in the governments. To promote the adoption and diffusion of MCC in the government area, exploring the determinants and influence mechanisms of mobile cloud computing-based government (m-Gov cloud) adoption has become the focus in academic and industry. Based on the technology-organization-environment framework and trust theory at the organizational level, an integrated model including the determinants on the adoption of m-Gov cloud is proposed, and 93 survey samples from China are used to analyzed by partial least squares structural equation modeling (PLS-SEM). The results show that provider competence, organizational readiness, external pressure, and trust of m-Gov cloud have significant effects on m-Gov cloud adoption. Perceived benefit, perceived risk, and provider competence have significant effects on m-Gov cloud trust. The m-Gov cloud trust plays an indirect-only (full) mediation and a complementary (partial) mediation effect between perceived benefit, provider competence, and m-Gov cloud adoption, respectively, while perceived risk has no significant direct and indirect effect on m-Gov cloud adoption. The findings provide a new research perspective and practice insights to promote the implementation of solutions based on the idea of mobile cloud computing.

Yikai Liang

Weijie Wang

Kunxiang Dong

Guijie Zhang

Guijie Qi

Adoption of Mobile Government Cloud from the Perspective of Public Sector

With a sponsored content plan on the Internet market, a content provider (CP) negotiates with the Internet service providers (ISPs) on behalf of the end-users to remove the network subscription fees. In this work, we have studied the impact of data sponsoring plans on the decision-making strategies of the ISPs and the CPs in the telecommunications market. We develop game-theoretic models to study the interaction between providers (CPs and ISPs), where the CPs sponsor content. We formulate the interactions between the ISPs and between the CPs as a noncooperative game. We have shown the existence and uniqueness of the Nash equilibrium. We used the best response dynamic algorithm for learning the Nash equilibrium. Finally, extensive simulations show the convergence of a proposed schema to the Nash equilibrium and show the effect of the sponsoring content on providers&#x2019; policies.

Mohamed El Amrani

Hamid Garmani

Driss Ait Omar

Mohamed Baslam

Brahim Minaoui

Analyzing the Dynamic Data Sponsoring in the Case of Competing Internet Service Providers and Content Providers

It is increasingly popular that platforms integrate various services into mobile applications due to the high usage and convenience of mobile devices, many of which demand high computational capacities and energy, such as cryptocurrency services based on blockchain. However, it is hard for mobile devices to run these services due to the limited storage and computational capacity. In this paper, the problem of computation offloading that requires sufficient computing resources with high utilization in large-scale users and multiprovider MEC system was investigated. A mechanism based on the combinatorial double auction, G-TRAP, is proposed in this paper to solve the above problem. In the mechanism, resources are provided both in the cloud and at the edge of the network. Mobile users compete for these resources to offload computing tasks by the rule that the edge-level resources will be allocated at first while cloud-level resources could be the supplement for the edge level. Given that the proof-of-work (PoW), the core issue of blockchain application, is resource-expensive to implement in mobile devices, we provide resource allocation service to users of blockchain application as experimental subjects. Simulation results show that the proposed mechanism for serving large-scale users in a short execution time outperforms two existing algorithms in terms of social utility and resource utilization. Consequently, our proposed system can effectively solve the intensive computation offloading problem of mobile blockchain applications.

Li Li

Yue Li

Ruotong Li

Double Auction-Based Two-Level Resource Allocation Mechanism for Computation Offloading in Mobile Blockchain Application

In order to effectively solve the problem of data transmission security and peak-to-average ratio (PAPR) in an orthogonal frequency division multiplexing passive optical network (OFDM-PON) transmission system, in this paper, a joint encryption scheme of discrete cosine transform (DCT) and selective mapping (SLM) based on chaotic mapping is proposed. In this scheme, the chaotic sequence of a 3D Lorenz chaotic system is used as the row and column index of the DCT matrix and the phase factor of SLM to resist selective plaintext attack, and the system encryption is realized while reducing PAPR. The theoretical analysis and numerical simulation show that the common OFDM-PON, the proposed algorithm, can obtain a PAPR suppression gain of ∼4.8 dB and improve the receiver sensitivity by ∼4 dB <span class="nowrap"><svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-2.2681pt" id="M1" height="13.8595pt" version="1.1" viewBox="-0.0498162 -11.5914 65.1447 13.8595" width="65.1447pt"><g transform="matrix(.013,0,0,-0.013,0,0)"><path id="g113-41" d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z"/></g><g transform="matrix(.013,0,0,-0.013,4.498,0)"><path id="g190-67" d="M372 352C427 368 507 407 507 502C507 548 486 592 451 616C420 638 376 650 301 650H44V622C124 616 128 610 128 527V123C128 40 122 34 36 28V0H257C336 0 402 12 453 40C512 72 548 124 548 191C548 291 471 335 372 350V352ZM213 362V558C213 591 216 602 226 608C235 614 258 618 282 618C377 618 415 558 415 490C415 406 369 362 260 362H213ZM213 328H258C380 328 450 283 450 181C450 76 377 35 296 34C231 34 213 53 213 125V328Z"/></g><g transform="matrix(.013,0,0,-0.013,12.09,0)"><path id="g190-70" d="M517 162C503 123 484 88 467 68C445 42 417 34 341 34C291 34 256 34 237 47C219 59 213 81 213 128V317H308C395 317 402 311 415 240H444V431H415C403 364 398 356 307 356H213V584C213 613 215 616 246 616H322C394 616 421 609 435 587C448 566 458 544 467 502L496 506C493 557 488 625 488 650H42V622C120 616 128 612 128 523V125C128 43 120 35 29 28V0H511C520 31 540 125 546 158L517 162Z"/></g><g transform="matrix(.013,0,0,-0.013,19.474,0)"><path id="g190-83" d="M631 18C609 24 585 35 559 65C534 91 514 117 478 169C448 214 406 281 389 313C462 346 516 399 516 485C516 545 490 590 449 616C412 641 363 650 290 650H42V622C120 615 128 612 128 527V125C128 40 120 34 38 28V0H300V28C221 34 212 40 212 125V284H244C295 284 312 272 329 244C359 195 395 133 430 84C475 19 516 -3 592 -7C603 -8 615 -8 627 -8L631 18ZM212 316V563C212 591 215 602 223 607C231 613 248 617 277 617C352 617 423 577 423 469C423 415 407 375 368 345C343 324 310 316 260 316H212Z"/></g><g transform="matrix(.013,0,0,-0.013,27.633,0)"><path id="g113-65" d="M545 -14C518 -29 444 -52 385 -52C186 -52 116 86 116 218C116 404 241 540 428 540C565 540 665 460 665 322C665 187 587 118 519 116C494 115 490 128 500 181C515 263 532 343 548 408C538 408 528 409 514 412C501 415 479 420 464 420C402 419 348 388 303 346C245 290 223 213 223 158C223 100 247 74 271 74C317 74 408 155 441 204L443 203L432 145C424 104 424 74 477 74C611 74 713 186 713 322C713 459 612 579 433 579C241 579 53 442 52 208C52 5 195 -97 352 -97C421 -97 486 -83 556 -42L545 -14ZM422 380C442 380 464 375 477 369C472 339 462 291 452 258C392 175 338 138 320 138C308 138 299 147 299 183C299 247 328 318 357 350C374 368 396 380 422 380Z"/></g><g transform="matrix(.013,0,0,-0.013,37.423,0)"><path id="g113-50" d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"/></g><g transform="matrix(.013,0,0,-0.013,43.663,0)"><path id="g113-49" d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"/></g><g transform="matrix(.0091,0,0,-0.0091,49.95,-5.741)"><path id="g54-33" d="M556 236V289H56V236H556Z"/></g><g transform="matrix(.0091,0,0,-0.0091,55.51,-5.741)"><path id="g50-52" d="M290 377C321 398 342 415 358 430C378 450 389 473 389 502C389 578 329 635 238 635H237C184 635 137 610 109 578L64 515L88 493C112 529 154 573 208 573S303 542 303 482C303 409 233 370 141 341L149 308C165 313 190 319 215 319C272 319 341 283 341 193C342 98 292 43 222 43C163 43 122 72 96 94C88 101 79 100 70 94C61 87 47 73 46 60C44 47 48 37 62 23C76 10 118 -12 165 -12C238 -12 430 62 430 223C430 297 379 359 290 375V377Z"/></g><g transform="matrix(.013,0,0,-0.013,60.477,0)"><path id="g113-42" d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z"/></g></svg>.</span> In addition, it shows that, with the increase of row/column index mismatch of the DCT matrix, the bit error rate of the system increases gradually. An encrypted data transmission of 8 GB/s 16-QAM optical OFDM signals is successfully simulated over a 20 km standard single-mode fiber, which proves the excellent confidentiality of the proposed secure transmission.

Shuai Zhang

Liqun Huang

Mingxu Zhu

Joint Encryption Scheme Based on the Chaotic DCT Matrix and SLM Algorithm in an OFDM-PON System

Content Delivery Networks (CDNs) have enabled large-scale, reliable, and efficient content distribution over the Internet. Although CDNs have been very successful in serving a large portion of Internet traffic, they have several drawbacks. Despite their distributed nature, they rely on largely centralized management and replication. This can affect availability in case of node failure. Further, CDNs are complex infrastructures that span multiple layers of the networking stack. To address these issues, in this paper, we introduce NCDN, a novel highly distributed system for large-scale delivery of content and services. NCDN is designed to provide resilience against node failure through location-independent storage and replication of content. This is achieved through a two-layer architecture: the first layer (exposure layer) exposes services implemented by NCDN (e.g., Web, SFTP) to clients; the second layer (hidden layer) provides reliable distributed storage of content and application state. Content in NCDN&#x2019;s hidden layer is stored and exchanged as Named Data Network (NDN) content packets. We employ the reinforcement learning (RL) to dynamically learn the optimal numbers of duplicates for different type of contents, because the RL agent has the advantage of not requiring expert labels or knowledge and instead the ability to learn directly from its own interaction with the world. The combination of NDN and RL brings NCDN fine-grained, fully decentralized content replication mechanisms. We compare the performance and resilience of NCDN to those of an idealized CDN via extensive simulations. Our results show that NCDN is able to provide higher availability than CDNs (between 8&#x0025; and 100&#x0025; higher under the same conditions), without substantially increasing content retrieval delay.

Zhihao Wang

Shengyong Du

Min Ren

NCDN: A Node-Failure Resilient CDN Solution with Reinforcement Learning Optimization

Under the umbrella of 1G to 5G, different technologies have been used to provide mobile communication. Various technologies are being proposed to bring a person in remote area under coverage. However, a statistical analysis on what these users get from already existing technologies has not been carried out. We fill this gap by carrying out such a study using a measurement campaign, where we present a framework for analyzing mobile signal strength experienced at the user end. Measurements are taken throughout the Norrbotten county, the northernmost county in Sweden, using mobile phones recording various parameters at regular intervals. Based on measured signal strength, a coverage map has been made via inverse distance weighting (IDW) interpolation. Based on the coverage map, various analyses are carried out on signal strength over residential areas and roads of Norrbotten. Overall, we lay a framework to analyze and quantify the effect of signal strength on users.

P. G. Sudheesh

Jaap van de Beek

Mobile Coverage in Rural Sweden: Analysis of a Comparative Measurement Campaign

Vehicle path planning plays a key role in the car navigation system. In actual urban traffic, the time spent at intersections accounts for a large proportion of the total time and cannot be ignored. Therefore, studying the shortest path planning problem considering node attributes has important practical significance. In this article, we study the vehicle path planning problem in time-invariant networks, with the minimum travel time from the starting node to the destination node as the optimization goal (including node time cost). Based on the characteristics of the problem, we construct the mathematical model. We propose a Reverse Order Labeling Algorithm (ROLA) based on the traditional Dijkstra algorithm to solve the problem; the correctness of the proposed algorithm is proved theoretically, and we analyse and give the time complexity of the ROLA and design a calculation example to verify the effectiveness of the algorithm. Finally, through extensive simulation experiments, we compare the performance of the proposed ROLA with several other existing algorithms. The experimental results show that the proposed algorithm has good stability and high efficiency.

Dan-dan Zhu

Jun-qing Sun

The Path Optimization Algorithm of Car Navigation System considering Node Attributes under Time-Invariant Network

Cross-organization emergency resource allocation optimization problem is essential to guarantee a successful emergency disposal, and it has become a research focus of modern emergency management. Generally speaking, there are two possible types of resource allocation scenarios: (1) if the emergency resources are overallocated, on the one hand, parallel execution of independent emergency activities can be supported and the emergency disposal time is reduced; on the other hand, too many idle resources may cause low resource utilization rate, high scheduling overhead, and high cost; and (2) if emergency resources are underallocated, this may lead to resource conflicts and the need for some emergency activities to wait for others to complete, and finally the emergency disposal time may increase. Therefore, reasonable emergency resource allocation strategies are highly desired. To the best of our knowledge, there is no formal approach to support the cross-organization emergency resource allocation issue. To handle this problem, we propose a two-layered framework to facilitate the allocation of limited emergency resources to meet its time constraints with high efficiency. More specifically, a kind of Petri net extended with time, resource, and message information, denoted as CE-net, is presented to model cross-organization emergency response processes. Based on the obtained CE-net, the minimum resource requirements are obtained with corresponding algorithms. Then, Minimum Execution Time (MET) strategy and Minimum Resource Consumption (MRC) strategy with their corresponding estimated execution intervals are introduced to facilitate the stakeholder to determine which strategy is suitable according to the timing requirements. A cross-organization fire emergency case is applied to validate the proposed approaches throughout the whole paper.

Ying Gao

Cong Liu

Qingtian Zeng

Hua Duan

Two Effective Strategies to Support Cross-Organization Emergency Resource Allocation Optimization

About this journal

<p><em>Mobile Information Systems</em> publishes original research articles as well as review articles that report the theory and/or application of new ideas and concepts in the field of mobile information systems.</p>


Journal profile

Meet the editorial board

<p>Chief Editor&nbsp;Dr Alessandro Bazzi&nbsp;is based at the University of Bologna, Italy. His current research is focused on wireless technologies applied to automated and connected vehicles.</p>


Editor spotlight

Submit your proposal

Do you think there is an emerging area of research that really needs to be highlighted? Or an existing research area that has been overlooked or would benefit from deeper investigation? Raise the profile of a research area by leading a Special Issue.

Special Issues

Author guidelines

Editorial board

Databases and indexing

Mobile Information Systems - Table of contents 2021

title

Mobile Information Systems publishes original research articles as well as review articles that report the theory and/or application of new ideas and concepts in the field of mobile information systems.

Mobile Information Systems