Algorithms for Validating E-tickets in Mobile Computing Environment
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.
A. Tripathi et al., "Algorithms for Validating E-tickets in Mobile Computing Environment," Information Sciences, Elsevier, May 2009.
The definitive version is available at https://doi.org/10.1016/j.ins.2009.01.018
Keywords and Phrases
Distributed Algorithms; E-Ticket; Mobile Computing
International Standard Serial Number (ISSN)
Article - Journal
© 2009 Elsevier, All rights reserved.
01 May 2009