Algorithms for validating E-tickets in mobile computing environment

  • Authors:
  • A. Tripathi;T. Suman Kumar Reddy;Sanjay Madria;H. Mohanty;R. K. Ghosh

  • Affiliations:
  • Department of Computer Science, Missouri University of Science and Technology, 1870 Miner Circle Drive, Rolla, MO 65401, USA;Department of Computer Science, University of Hyderabad, India;Department of Computer Science, Missouri University of Science and Technology, 1870 Miner Circle Drive, Rolla, MO 65401, USA;Department of Computer Science, University of Hyderabad, India;Department of Computer Science, Indian Institute of Technology, Kanpur, India

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2009

Quantified Score

Hi-index 0.07

Visualization

Abstract

E-tickets issued online can be used by different vendors to provide services such as discount coupons for E-shopping, or an entrance for a football game. One major issue associated with E-tickets is the problem of validation, which becomes more severe in a mobile environment due to mobility of a mobile host (MH) and frequent failure/disconnection of validation servers known as mobile support stations (MSSs). Some additional problems include the identification of duplicate submissions of an E-ticket by a MH. Thus, this paper proposes two protocols using the Flat and Hierarchical schemes for E-ticket processing and validation in a mobile environment that guarantee at least and at most once property (each E-ticket is validated at least and at most once). The protocols have been validated and compared through complexity analysis and experiments.