• 제목/요약/키워드: mobile crowd computing

검색결과 5건 처리시간 0.018초

A Novel Architecture for Mobile Crowd and Cloud computing for Health care

  • kumar, Rethina;Ganapathy, Gopinath;Kang, Jeong-Jin
    • International Journal of Advanced Culture Technology
    • /
    • 제6권4호
    • /
    • pp.226-232
    • /
    • 2018
  • The rapid pace of growth in internet usage and rich mobile applications and with the advantage of incredible usage of internet enabled mobile devices the Green Mobile Crowd Computing will be the suitable area to research combining with cloud services architecture. Our proposed Framework will deploy the eHealth among various health care sectors and pave a way to create a Green Mobile Application to provide a better and secured way to access the Products/ Information/ Knowledge, eHealth services, experts / doctors globally. This green mobile crowd computing and cloud architecture for healthcare information systems are expected to lower costs, improve efficiency and reduce error by also providing better consumer care and service with great transparency to the patient universally in the field of medical health information technology. Here we introduced novel architecture to use of cloud services with crowd sourcing.

An Efficient Multi-Layer Encryption Framework with Authentication for EHR in Mobile Crowd Computing

  • kumar, Rethina;Ganapathy, Gopinath;Kang, GeonUk
    • International journal of advanced smart convergence
    • /
    • 제8권2호
    • /
    • pp.204-210
    • /
    • 2019
  • Mobile Crowd Computing is one of the most efficient and effective way to collect the Electronic health records and they are very intelligent in processing them. Mobile Crowd Computing can handle, analyze and process the huge volumes of Electronic Health Records (EHR) from the high-performance Cloud Environment. Electronic Health Records are very sensitive, so they need to be secured, authenticated and processed efficiently. However, security, privacy and authentication of Electronic health records(EHR) and Patient health records(PHR) in the Mobile Crowd Computing Environment have become a critical issue that restricts many healthcare services from using Crowd Computing services .Our proposed Efficient Multi-layer Encryption Framework(MLEF) applies a set of multiple security Algorithms to provide access control over integrity, confidentiality, privacy and authentication with cost efficient to the Electronic health records(HER)and Patient health records(PHR). Our system provides the efficient way to create an environment that is capable of capturing, storing, searching, sharing, analyzing and authenticating electronic healthcare records efficiently to provide right intervention to the right patient at the right time in the Mobile Crowd Computing Environment.

Privacy-Preservation Using Group Signature for Incentive Mechanisms in Mobile Crowd Sensing

  • Kim, Mihui;Park, Younghee;Dighe, Pankaj Balasaheb
    • Journal of Information Processing Systems
    • /
    • 제15권5호
    • /
    • pp.1036-1054
    • /
    • 2019
  • Recently, concomitant with a surge in numbers of Internet of Things (IoT) devices with various sensors, mobile crowdsensing (MCS) has provided a new business model for IoT. For example, a person can share road traffic pictures taken with their smartphone via a cloud computing system and the MCS data can provide benefits to other consumers. In this service model, to encourage people to actively engage in sensing activities and to voluntarily share their sensing data, providing appropriate incentives is very important. However, the sensing data from personal devices can be sensitive to privacy, and thus the privacy issue can suppress data sharing. Therefore, the development of an appropriate privacy protection system is essential for successful MCS. In this study, we address this problem due to the conflicting objectives of privacy preservation and incentive payment. We propose a privacy-preserving mechanism that protects identity and location privacy of sensing users through an on-demand incentive payment and group signatures methods. Subsequently, we apply the proposed mechanism to one example of MCS-an intelligent parking system-and demonstrate the feasibility and efficiency of our mechanism through emulation.

Autonomous Mobile-Based Model for Tawaf / Sa'ay Rounds Counting with Supported Supplications from the Quran and Sunna'a

  • Nashwan, Alromema
    • International Journal of Computer Science & Network Security
    • /
    • 제22권12호
    • /
    • pp.205-211
    • /
    • 2022
  • Performing the rituals of Hajj and Umrah is an obligation of Allah Almighty to all Muslims from all over the world. Millions of Muslims visit the holy mosques in Makkah every year to perform Hajj and Umrah. One of the most important pillars in Performing Hajj/Umrah is Tawaf and Sa'ay. Tawaf finished by seven rounds around the holy house (Al-Kabaa) and Sa'ay is also seven runs between As-Safa and Al-Marwa. Counting/knowing the number of runs during Tawaf/Sa'ay is one of the difficulties that many pilgrims face. The pilgrim's confusing for counting (Tawaf/Sa'ay) rounds finished at a specific time leads pilgrims to stay more time in Mataff bowl or Masa'a run causing stampedes and more crowded as well as losing the desired time for prayers to get closer to Almighty Allah in this holy place. These issues can be solved using effective crowd management systems for Tawaf/Sa'ay pillars, which is the topic of this research paper. While smart devices and their applications are gaining popularity in helping pilgrims for performing Hajj/Umrah activities efficiently, little has been dedicated for solving these issues. We present an autonomous Mobile-based framework for guiding pilgrims during Tawaf/Sa'ay pillars with the aid of GPS for points tracking and rounds counting. This framework is specially designed to prevent and manage stampedes during Tawaf/Sa'ay pillars, by helping pilgrims automatically counting the rounds during Tawaf/Sa'ay with supported Supplications (in written/audio form with different languages) from the Quran and Sunna'a.

게임 환경에 적합한 연속적인 k-개의 이웃 객체 찾기 알고리즘 비교 분석 (Comparison of Algorithms to find Continuous k-nearest Neighbors to be Appropriate under Gaming Environments)

  • 이재문
    • 한국게임학회 논문지
    • /
    • 제13권3호
    • /
    • pp.47-54
    • /
    • 2013
  • 대부분의 연속된 k-개의 이웃 찾기 알고리즘은 차량, 핸드폰 등 이동하는 객체에 대하여 주기적으로 모니터링을 하는 위치 기반 서비스에서 연구되어 왔다. 이러한 연구들은 쿼리 포인트가 이동 객체에 비하여 매우 적을 뿐만 아니라 쿼리 포인트가 움직이지 않고 고정된 환경을 가정한다. 게임 환경에서 k-개의 이웃을 찾아야 하는 경우는 무리 짓기, 군중 시뮬레이션 및 로봇과 같이 이동 객체가 주변의 이웃 객체를 인식하여 다음 이동을 계산하여야 할 때이다. 따라서 모든 이동 객체가 쿼리 포인트가 되고, 그 결과 이동 객체와 쿼리 포인트의 수가 동일하며, 쿼리 포인트도 움직이게 된다. 본 논문에서는 이러한 게임 환경에서 기존의 위치기반 서비스에서 연구된 k-개의 이웃 찾기 알고리즘들을 적용하여 어떤 알고리즘이 어떤 조건에서 적합한지에 대한 성능을 분석한다.