• Title/Summary/Keyword: Mobile Pone

Search Result 3, Processing Time 0.029 seconds

Analysis and Design of Smart-phone App. for O2O Restaurant Service (O2O 음식점 서비스 개발을 위한 스마트폰 앱의 분석/설계)

  • Cho, Byung-Ho
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.2
    • /
    • pp.125-132
    • /
    • 2017
  • O2O service contribute to sales increment by marketing of offline store using online. In particular, O2O business allowed various services by smart-phone due to rapid increase of mobile device use and various services depend on customer's location. This O2O service play major roll in real purchase making of offline store. In smart-phone apps. development for O2O service, recent an Object-oriented Analysis and Design Method, that is, UML is more useful method than Structured Analysis and Design Method. Therefore in this paper, Software analysis and design method which is smart-pone app. for O2O restaurant service is presented. Also it shows that this analysis/design method is very useful for the Restaurant O2O Commercial System production.

An Enhanced Greedy Message Forwarding Protocol for High Mobile Inter-vehicular Communications (고속으로 이동하는 차량간 통신에서 향상된 탐욕 메시지 포워딩 프로토콜)

  • Jang, Hyun-Hee;Yu, Suk-Dae;Park, Jae-Bok;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.3
    • /
    • pp.48-58
    • /
    • 2009
  • Geo-graphical routing protocols as GPSR are known to be very suitable and useful for vehicular ad-hoc networks. However, a corresponding node can include some stale neighbor nodes being out of a transmission range, and the stale nodes are pone to get a high priority to be a next relay node in the greedy mode. In addition, some useful redundant information can be eliminated during planarization in the recovery mode. This paper deals with a new recovery mode, the Greedy Border Superiority Routing(GBSR), along with an Adaptive Neighbor list Management(ANM) scheme. Each node can easily treat stale nodes on its neighbor list by means of comparing previous and current Position of a neighbor. When a node meets the local maximum, it makes use of a border superior graph to recover from it. This approach improve the packet delivery ratio while it decreases the time to recover from the local maximum. We evaluate the performance of the proposed methods using a network simulator. The results shown that the proposed protocol reveals much better performance than GPSR protocol. Please Put the of paper here.