Please use this identifier to cite or link to this item: https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1594
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMitra, Avik
dc.contributor.authorSardar, Bhaskar
dc.contributor.authorSaha, Debashish
dc.date.accessioned2021-08-26T06:23:39Z-
dc.date.available2021-08-26T06:23:39Z-
dc.date.issued2011
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84858995671&doi=10.1109%2fANTS.2011.6163636&partnerID=40&md5=1c98db8d832a526d6d6be82977e44b71
dc.identifier.urihttps://ir.iimcal.ac.in:8443/jspui/handle/123456789/1594-
dc.descriptionMitra, Avik, Department of Information Technology, Jadavpur University, Kolkata, India; Sardar, Bhaskar, Department of Information Technology, Jadavpur University, Kolkata, India; Saha, Debashish, MIS and Computer Science Group, IIM Calcutta, Kolkata, India
dc.descriptionISSN/ISBN - 21531684
dc.descriptionDOI - 10.1109/ANTS.2011.6163636
dc.description.abstractProtocols for managing network mobility (NEMO) should reduce handoff latency significantly to provide uninterrupted Internet connectivity. Since the path of a high-speed vehicle is predefined in most cases, it could be beneficial for a NEMO protocol to pre-fetch care-of-addresses of the potential future cells. However, the current NEMO protocols either do not use pre-fetching or use it for at most one cell. While investigating this behavior of the NEMO protocols analytically, we find that pre-fetching beyond the next one cell does not necessarily improve the handoff performance even though the future route of the vehicle could be known beforehand. © 2011 IEEE.
dc.publisherSCOPUS
dc.publisherInternational Symposium on Advanced Networks and Telecommunication Systems, ANTS
dc.relation.ispartofseries6163636
dc.subjectHandoff
dc.subjectMIPv6
dc.subjectNEMO
dc.subjectPre-fetching
dc.subjectTuring machine
dc.titleWhy NEMO protocols do not pre-fetch more than one CoA?
dc.typeConference Paper
Appears in Collections:Management Information Systems

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.