Throughput consideration for location-aware handoff in mobile data networks

Location aware handoff algorithms have a much better performance than traditional algorithms in terms of the number of handoffs and handoff delay (crossover point). As they do not pay attention to the received signal strength (RSS), it is not clear if they also maintain the best throughput in the case of wireless data networks. We evaluate the tradeoffs between unnecessary handoffs, handoff delay and system throughput. The results indicate that, with location-aware handoff algorithms, the throughput is also higher than the throughput in the case of using traditional RSS-based algorithms.

[1]  Ilenia Tinnirello,et al.  Using packet-level information in handover and admission control schemes for wireless packet network , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[2]  Prashant Krishnamurthy,et al.  Telegeoinformatics for efficient resource allocation and protocol development in wireless networks , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[3]  Wiklom Teerapabkajorndet,et al.  Comparison of performance of location-aware and traditional handoff-decision algorithms in CDPD networks , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[4]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[5]  David J. Goodman,et al.  General packet radio service in GSM , 1997, IEEE Commun. Mag..

[6]  Nishith D. Tripathi.  Generic Adaptive Handoff Algorithms Using Fuzzy Logic and Neural Networks , 1997 .