Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594819
G. Mandyam, Mark Boyns
Cellular data services have benefited recently from enhancements in access speed, delay, and other parameters generally associated with quality-of-service (QoS). However, end users still often have trouble discovering appropriate content due to fractured and non-intuitive approaches to content discovery. One possible means of addressing this problem is the use of recommender systems to personalize content for cellular data users. Recommender systems have an established role in internet content discovery, but their applications in wireless are not straightforward. This paper discusses the critical challenges in implementing recommender systems for content in cellular systems, and also proposes methods for deployment of such systems so as to improve content discovery.
{"title":"Recommender systems for mobile content: Current challenges and ways forward","authors":"G. Mandyam, Mark Boyns","doi":"10.1109/WOWMOM.2008.4594819","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594819","url":null,"abstract":"Cellular data services have benefited recently from enhancements in access speed, delay, and other parameters generally associated with quality-of-service (QoS). However, end users still often have trouble discovering appropriate content due to fractured and non-intuitive approaches to content discovery. One possible means of addressing this problem is the use of recommender systems to personalize content for cellular data users. Recommender systems have an established role in internet content discovery, but their applications in wireless are not straightforward. This paper discusses the critical challenges in implementing recommender systems for content in cellular systems, and also proposes methods for deployment of such systems so as to improve content discovery.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127888593","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594889
Amir Krifa, C. Barakat, T. Spyropoulos
Delay tolerant networks (DTN) are wireless networks where disconnections may occur frequently. In order to achieve data delivery in DTNs, researchers have proposed the use of store-carry-and-forward protocols: there, a node may store a message in its buffer and carry it along for long periods of time, until an appropriate forwarding opportunity arises. Multiple message replicas are often propagated to increase delivery probability. This combination of long-term storage and replication imposes a high storage and bandwidth overhead. Thus, efficient scheduling and drop policies are necessary to: (i) decide on the order by which messages should be replicated when contact durations are limited, and (ii) which messages should be discarded when nodespsila buffers operate close to their capacity. In this paper, we propose an efficient joint scheduling and drop policy that can optimize different performance metrics, like average delay and delivery probability. Using the theory of encounter-based message dissemination, we first propose an optimal policy based on global knowledge about the network. Then, we introduce a distributed algorithm that can approximate the performance of the optimal algorithm, in practice. Using simulations based on a synthetic mobility model and a real mobility trace, we show that our optimal policy and its distributed variant outperform existing resource allocation schemes for DTNs, such as the RAPID protocol [4], both in terms of average delivery ratio and delivery delay.
{"title":"An optimal joint scheduling and drop policy for Delay Tolerant Networks","authors":"Amir Krifa, C. Barakat, T. Spyropoulos","doi":"10.1109/WOWMOM.2008.4594889","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594889","url":null,"abstract":"Delay tolerant networks (DTN) are wireless networks where disconnections may occur frequently. In order to achieve data delivery in DTNs, researchers have proposed the use of store-carry-and-forward protocols: there, a node may store a message in its buffer and carry it along for long periods of time, until an appropriate forwarding opportunity arises. Multiple message replicas are often propagated to increase delivery probability. This combination of long-term storage and replication imposes a high storage and bandwidth overhead. Thus, efficient scheduling and drop policies are necessary to: (i) decide on the order by which messages should be replicated when contact durations are limited, and (ii) which messages should be discarded when nodespsila buffers operate close to their capacity. In this paper, we propose an efficient joint scheduling and drop policy that can optimize different performance metrics, like average delay and delivery probability. Using the theory of encounter-based message dissemination, we first propose an optimal policy based on global knowledge about the network. Then, we introduce a distributed algorithm that can approximate the performance of the optimal algorithm, in practice. Using simulations based on a synthetic mobility model and a real mobility trace, we show that our optimal policy and its distributed variant outperform existing resource allocation schemes for DTNs, such as the RAPID protocol [4], both in terms of average delivery ratio and delivery delay.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121261541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594897
Antonio Di Ferdinando, A. Rosi, F. Zambonelli, R. Lent, E. Gelenbe
We describe a prototype of trading system platform populated by agents who autonomously decide to buy and/or sell items according to a set of local needs which arise dynamically (also by possibly accessing information provided by pervasive devices) by in the process of fulfilling a given overall utility. The market has combinatorial nature in a way that items to be traded are combined into packages, in accordance with a principle that drives the nature of many current markets. However, differently from these, items belong to a number of distinct sellers distributed in the platform, and are chosen singularly on the basis of buyers preferences and needs. Agents are thus situation-aware, with sellers coming acquainted of the market demand, and buyers price offers, through a Knowledge Network. This latter drives the way market offers balance the demand by gathering the needed information in an autonomous way and taking advantage of pervasive devices. Packaging is realized by agent aggregation into Virtual Sellers, in an autonomous fashion, and we propose an opportunistic policy whereby aggregation is governed by a Combinatorial Auction. The market is studied through proof-of-concept simulation, where the efficiency deriving from the opportunistic aggregation based on Combinatorial Auctions and the influence of contextual self-awareness are studied.
{"title":"A platform for pervasive combinatorial trading with opportunistic self-aggregation","authors":"Antonio Di Ferdinando, A. Rosi, F. Zambonelli, R. Lent, E. Gelenbe","doi":"10.1109/WOWMOM.2008.4594897","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594897","url":null,"abstract":"We describe a prototype of trading system platform populated by agents who autonomously decide to buy and/or sell items according to a set of local needs which arise dynamically (also by possibly accessing information provided by pervasive devices) by in the process of fulfilling a given overall utility. The market has combinatorial nature in a way that items to be traded are combined into packages, in accordance with a principle that drives the nature of many current markets. However, differently from these, items belong to a number of distinct sellers distributed in the platform, and are chosen singularly on the basis of buyers preferences and needs. Agents are thus situation-aware, with sellers coming acquainted of the market demand, and buyers price offers, through a Knowledge Network. This latter drives the way market offers balance the demand by gathering the needed information in an autonomous way and taking advantage of pervasive devices. Packaging is realized by agent aggregation into Virtual Sellers, in an autonomous fashion, and we propose an opportunistic policy whereby aggregation is governed by a Combinatorial Auction. The market is studied through proof-of-concept simulation, where the efficiency deriving from the opportunistic aggregation based on Combinatorial Auctions and the influence of contextual self-awareness are studied.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128593054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594865
Bo Wang, M. Mutka
Multimedia applications over wireless mobile networks become more popular with the increasing deployment of wireless infrastructures. IEEE 802.16 standard has become an emerging technology to support broadband access and quality of service (QoS) for real-time multimedia applications over wireless networks. This paper discusses the path selection problem in IEEE 802.16 mobile multihop relay (MMR) networks where relay stations are used to extend network coverage and enhance network capacity. For real-time applications that have explicit rate and delay requirements, choosing an appropriate path between any mobile station and the base station becomes essential. In this paper, we propose a path selection metric, named normalized number of minislots (NNM), which enables a mobile station to choose a path that satisfies its application rate and delay requirements. Simulation results show that NNM outperforms existing path selection metrics, especially when network has high traffic load.
{"title":"Path selection for mobile stations in IEEE 802.16 multihop relay networks","authors":"Bo Wang, M. Mutka","doi":"10.1109/WOWMOM.2008.4594865","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594865","url":null,"abstract":"Multimedia applications over wireless mobile networks become more popular with the increasing deployment of wireless infrastructures. IEEE 802.16 standard has become an emerging technology to support broadband access and quality of service (QoS) for real-time multimedia applications over wireless networks. This paper discusses the path selection problem in IEEE 802.16 mobile multihop relay (MMR) networks where relay stations are used to extend network coverage and enhance network capacity. For real-time applications that have explicit rate and delay requirements, choosing an appropriate path between any mobile station and the base station becomes essential. In this paper, we propose a path selection metric, named normalized number of minislots (NNM), which enables a mobile station to choose a path that satisfies its application rate and delay requirements. Simulation results show that NNM outperforms existing path selection metrics, especially when network has high traffic load.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114888930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594874
C. Mallery, S. Medidi, M. Medidi
Localization is the process in which nodes in a wireless sensor network self-determine their positions in the network. While there are many effective mathematical techniques for solving the problem of localization, most are not suitable for the resource-constrained distributed environment of sensor networks. We propose ANIML an iterative, range-aware relative localization technique for wireless sensor networks that requires no anchor nodes. ANIML restricts itself to the use of only local 1- and 2-hop neighbor information, avoiding the need for information flooding and thus controlling cascading ranging errors that bedevil other localization techniques. While least-squares minimization is a mathematically simple constraint optimization technique, utilizing 1- and 2-hop neighbor information as constraints, ANIML provides better localization without the need for more sophisticated error control and/or global information. We implemented ANIML in ns-2 and conducted extensive experimentation to evaluate its performance. Experimental results show that ANIML provides robust localization and scales well.
{"title":"Relative localization with 2-hop neighborhood","authors":"C. Mallery, S. Medidi, M. Medidi","doi":"10.1109/WOWMOM.2008.4594874","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594874","url":null,"abstract":"Localization is the process in which nodes in a wireless sensor network self-determine their positions in the network. While there are many effective mathematical techniques for solving the problem of localization, most are not suitable for the resource-constrained distributed environment of sensor networks. We propose ANIML an iterative, range-aware relative localization technique for wireless sensor networks that requires no anchor nodes. ANIML restricts itself to the use of only local 1- and 2-hop neighbor information, avoiding the need for information flooding and thus controlling cascading ranging errors that bedevil other localization techniques. While least-squares minimization is a mathematically simple constraint optimization technique, utilizing 1- and 2-hop neighbor information as constraints, ANIML provides better localization without the need for more sophisticated error control and/or global information. We implemented ANIML in ns-2 and conducted extensive experimentation to evaluate its performance. Experimental results show that ANIML provides robust localization and scales well.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125439520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594877
S. Penz
Mobile ad-hoc networks differ from fixed networks in two essential points: On one hand, the spontaneous formation of these networks by mobile devices requires a dynamic service management system that allows the users to discover and access services offered by other devices on-demand. On the other, multi-hop wireless communication leads to limited and heterogeneous quality-of-service properties of the corresponding transmission paths. Therefore, we developed and implemented a service management system based on the service location protocol SLP, which comprises an optimized caching strategy for dynamic service information and on-demand measurement modules for available bandwidth and connection stability.
{"title":"SLP-based service management with QoS server selection in mobile ad-hoc networks","authors":"S. Penz","doi":"10.1109/WOWMOM.2008.4594877","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594877","url":null,"abstract":"Mobile ad-hoc networks differ from fixed networks in two essential points: On one hand, the spontaneous formation of these networks by mobile devices requires a dynamic service management system that allows the users to discover and access services offered by other devices on-demand. On the other, multi-hop wireless communication leads to limited and heterogeneous quality-of-service properties of the corresponding transmission paths. Therefore, we developed and implemented a service management system based on the service location protocol SLP, which comprises an optimized caching strategy for dynamic service information and on-demand measurement modules for available bandwidth and connection stability.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126129938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594921
B. Tian, Song Han, T. Dillon, S. Das
An efficient self-healing key distribution scheme with revocation capability is proposed for secure group communication in wireless networks. The scheme bases on vector space secret sharing and one way hash function techniques. Vector space secret sharing helps to realize general monotone decreasing structures for the family of subsets of users that can be revoked instead of a threshold one. One way hash chains contribute to reduce communication overhead. Furthermore, the most prominent characteristic of our scheme is resisting collusion between the new joined users and the revoked users, which is fatal weakness of hash function based self-healing key distribution schemes.
{"title":"A self-healing key distribution scheme based on vector space secret sharing and one way hash chains","authors":"B. Tian, Song Han, T. Dillon, S. Das","doi":"10.1109/WOWMOM.2008.4594921","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594921","url":null,"abstract":"An efficient self-healing key distribution scheme with revocation capability is proposed for secure group communication in wireless networks. The scheme bases on vector space secret sharing and one way hash function techniques. Vector space secret sharing helps to realize general monotone decreasing structures for the family of subsets of users that can be revoked instead of a threshold one. One way hash chains contribute to reduce communication overhead. Furthermore, the most prominent characteristic of our scheme is resisting collusion between the new joined users and the revoked users, which is fatal weakness of hash function based self-healing key distribution schemes.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121608817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594900
Erik Wilde
Location-awareness, in the form of location information about clients and location-based services provided by servers, is becoming increasingly important for networked communications in general, and wireless and mobile devices in particular. The current fragmented landscape of location concepts and location-awareness, however, is not suitable for handling location information on a Web scale. Providing users with mechanisms which allow them to control how they want to expose their location information, and thus allow control over how to share location information with others and services, is a crucial step for better location management for mobile devices. This paper presents a concept for representing location vocabularies, matching and mapping them, how these vocabularies can be used to support better privacy for users of location-based services, and better location sharing between users and services. The concept is based on a language for describing place name vocabularies, which we call ldquoplace markup language (PlaceML)rdquo, and on various ways how these vocabularies can be used in a location-aware infrastructure of networked devices.
{"title":"Location management for mobile devices","authors":"Erik Wilde","doi":"10.1109/WOWMOM.2008.4594900","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594900","url":null,"abstract":"Location-awareness, in the form of location information about clients and location-based services provided by servers, is becoming increasingly important for networked communications in general, and wireless and mobile devices in particular. The current fragmented landscape of location concepts and location-awareness, however, is not suitable for handling location information on a Web scale. Providing users with mechanisms which allow them to control how they want to expose their location information, and thus allow control over how to share location information with others and services, is a crucial step for better location management for mobile devices. This paper presents a concept for representing location vocabularies, matching and mapping them, how these vocabularies can be used to support better privacy for users of location-based services, and better location sharing between users and services. The concept is based on a language for describing place name vocabularies, which we call ldquoplace markup language (PlaceML)rdquo, and on various ways how these vocabularies can be used in a location-aware infrastructure of networked devices.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123289444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594825
L. Kant, R. Chadha
Characterized by their flexibility to be deployed in relatively short time spans and ability to function in remote and hostile environments, mobile ad hoc networks (MANETs) are becoming the basis for on-demand peer-to-peer wireless networking in the commercial and military sectors. However, the power and dynamism of MANETs renders their management a significant challenge. For example, unpredictable link qualities render quality of service assurance to the mission critical/platinum services very challenging. Likewise, lack of fixed infrastructure coupled with intermittent connectivity place a significant burden on network management systems that are expected to provide seamless recovery amidst random network failures. Additionally, the network management operations in MANETs need to be automated to a large extent. This paper discusses the challenges associated with two key MANET aspects of interest to the Industry: (a) providing and maintaining QoS guarantees and (b) fault management and self-healing in MANETs, and discusses potential solutions that can be implemented in practice.
{"title":"MANET management: Industry challenges & potential solutions","authors":"L. Kant, R. Chadha","doi":"10.1109/WOWMOM.2008.4594825","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594825","url":null,"abstract":"Characterized by their flexibility to be deployed in relatively short time spans and ability to function in remote and hostile environments, mobile ad hoc networks (MANETs) are becoming the basis for on-demand peer-to-peer wireless networking in the commercial and military sectors. However, the power and dynamism of MANETs renders their management a significant challenge. For example, unpredictable link qualities render quality of service assurance to the mission critical/platinum services very challenging. Likewise, lack of fixed infrastructure coupled with intermittent connectivity place a significant burden on network management systems that are expected to provide seamless recovery amidst random network failures. Additionally, the network management operations in MANETs need to be automated to a large extent. This paper discusses the challenges associated with two key MANET aspects of interest to the Industry: (a) providing and maintaining QoS guarantees and (b) fault management and self-healing in MANETs, and discusses potential solutions that can be implemented in practice.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"73 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123114030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594829
Leo Bhebhe, Andres Arjona
Service continuity between EGPRS (2G) and WCDMA (3G) systems has been identified as one key research item recently. Measurement from live cellular networks indicate that outage time for packet switched traffic during intersystem handovers are too long going up to one minute in some cases. In this article we analyze intersystem handover latency across 3G and 2G wireless networks. The inter-system handover focused on the service interruption during mobility using both of the main data protocols, TCP and UDP. The results showed that the data outage is high for TCP and UDP, up to 7s and 10s respectively and can considerably affect real-time user applications. Some proposals have been highlighted to improve handover performance including candidate features such as the packet switched handover feature in 3GPP Rel 7. The performance degradation mostly depends on the application type, transmission protocol, intersystem handover type, and bandwidth of the wireless access link.
{"title":"Data outage across 3G & 2G wireless networks","authors":"Leo Bhebhe, Andres Arjona","doi":"10.1109/WOWMOM.2008.4594829","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594829","url":null,"abstract":"Service continuity between EGPRS (2G) and WCDMA (3G) systems has been identified as one key research item recently. Measurement from live cellular networks indicate that outage time for packet switched traffic during intersystem handovers are too long going up to one minute in some cases. In this article we analyze intersystem handover latency across 3G and 2G wireless networks. The inter-system handover focused on the service interruption during mobility using both of the main data protocols, TCP and UDP. The results showed that the data outage is high for TCP and UDP, up to 7s and 10s respectively and can considerably affect real-time user applications. Some proposals have been highlighted to improve handover performance including candidate features such as the packet switched handover feature in 3GPP Rel 7. The performance degradation mostly depends on the application type, transmission protocol, intersystem handover type, and bandwidth of the wireless access link.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129611458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：