Pub Date : 2006-03-13DOI: 10.1109/PERCOMW.2006.136
C. Floerkemeier
There are a variety of approaches to improve the speed at which large RFID tag populations are being identified. In this paper, we present a transmission control strategy for a common class of RFID multiple access schemes. It builds on earlier work on Bayesian broadcast strategies, but has been adapted to address characteristics of the RFID domain. It has been designed for framed ALOHA and it makes no restrictive assumptions about the distribution of the number of tags in the range of the interrogator. Experimental evidence and simulation results are presented showing that the proposed transmission control scheme performs well in practise when compared to existing approaches
{"title":"Transmission control scheme for fast RFID object identification","authors":"C. Floerkemeier","doi":"10.1109/PERCOMW.2006.136","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.136","url":null,"abstract":"There are a variety of approaches to improve the speed at which large RFID tag populations are being identified. In this paper, we present a transmission control strategy for a common class of RFID multiple access schemes. It builds on earlier work on Bayesian broadcast strategies, but has been adapted to address characteristics of the RFID domain. It has been designed for framed ALOHA and it makes no restrictive assumptions about the distribution of the number of tags in the range of the interrogator. Experimental evidence and simulation results are presented showing that the proposed transmission control scheme performs well in practise when compared to existing approaches","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131794401","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}
U. Lee, Eugenio Magistretti, Biao Zhou, M. Gerla, P. Bellavista, Antonio Corradi
In this paper we study the use of vehicles as sensors in a "vehicular sensor network" a new network paradigm that is critical for gathering valuable information in urban environments. In a vehicular sensor network, each vehicle is responsible for sensing one or more events, routing messages to other vehicles or infostations and processing sensed data. There are several critical differences between a vehicular sensor network and a "traditional" wireless sensor network, namely: 1) the vehicular network has high computation power; 2) it must provide high storage space; 3) it must have mobile sensor nodes. In addition, due to the sheer amount of data generated, sensed data is carried by each mobile sensor node. Admittedly, retrieving information from mobile sensor nodes is difficult. In this paper, we first identify a set of design choices for building a vehicular sensor network. From this we propose two storage architectures: content-addressed storage (CAS) and mobility-assist storage (MAS). While CAS utilizes infostations by hashing the key of an event to a specific infostation, MAS opportunistically disseminates events by "relaying" or sending events only to one's neighbors. CAS is appropriate for time-critical applications and MAS for delay-tolerant applications only if infrastructure is not available. In this paper, we propose data harvesting protocols for CAS and MAS: infostation-based and mobility-assist data harvesting protocols respectively
{"title":"Efficient data harvesting in mobile sensor platforms","authors":"U. Lee, Eugenio Magistretti, Biao Zhou, M. Gerla, P. Bellavista, Antonio Corradi","doi":"10.1109/PERCOMW.2006.47","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.47","url":null,"abstract":"In this paper we study the use of vehicles as sensors in a \"vehicular sensor network\" a new network paradigm that is critical for gathering valuable information in urban environments. In a vehicular sensor network, each vehicle is responsible for sensing one or more events, routing messages to other vehicles or infostations and processing sensed data. There are several critical differences between a vehicular sensor network and a \"traditional\" wireless sensor network, namely: 1) the vehicular network has high computation power; 2) it must provide high storage space; 3) it must have mobile sensor nodes. In addition, due to the sheer amount of data generated, sensed data is carried by each mobile sensor node. Admittedly, retrieving information from mobile sensor nodes is difficult. In this paper, we first identify a set of design choices for building a vehicular sensor network. From this we propose two storage architectures: content-addressed storage (CAS) and mobility-assist storage (MAS). While CAS utilizes infostations by hashing the key of an event to a specific infostation, MAS opportunistically disseminates events by \"relaying\" or sending events only to one's neighbors. CAS is appropriate for time-critical applications and MAS for delay-tolerant applications only if infrastructure is not available. In this paper, we propose data harvesting protocols for CAS and MAS: infostation-based and mobility-assist data harvesting protocols respectively","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133386229","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}
Jean Olivier Caron, Y. Kawahara, H. Morikawa, T. Aoyama
Groupanizer is an extension of groupware and constitutes a development platform to integrate user-centric information for the benefit of groupware applications. User-centric context is used in a collaborative manner to positively link and reinforce group member idiosyncrasies. In order to do so, monitoring of the user's daily context is essential, and thus, one aspect we aim at integrating is user physical position. We believe that common visited places and trajectories constitute one user-centric element that should be used to bias transactions - namely tasks or scheduling - in groupware. Although physical location could by itself be integrated in a model, we believe that motion behaviors are intrinsically linked to moments of daily life. We define those moments using three context elements - a time period, an activity and the current day. This definition leverages position mapping to include its implicit nature. Essentially, the aim is for our model to ideally reflect a group's ecology, namely relations between multiple users given their current and future locations. This paper defines the ontology, mapping locations and moments among users, and the hidden Markov model used to derive location patterns. Finally, it describes the experimentation phase and its results
{"title":"Groupanizer: a method to correlate multi-users position with daily moments","authors":"Jean Olivier Caron, Y. Kawahara, H. Morikawa, T. Aoyama","doi":"10.1109/PERCOMW.2006.61","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.61","url":null,"abstract":"Groupanizer is an extension of groupware and constitutes a development platform to integrate user-centric information for the benefit of groupware applications. User-centric context is used in a collaborative manner to positively link and reinforce group member idiosyncrasies. In order to do so, monitoring of the user's daily context is essential, and thus, one aspect we aim at integrating is user physical position. We believe that common visited places and trajectories constitute one user-centric element that should be used to bias transactions - namely tasks or scheduling - in groupware. Although physical location could by itself be integrated in a model, we believe that motion behaviors are intrinsically linked to moments of daily life. We define those moments using three context elements - a time period, an activity and the current day. This definition leverages position mapping to include its implicit nature. Essentially, the aim is for our model to ideally reflect a group's ecology, namely relations between multiple users given their current and future locations. This paper defines the ontology, mapping locations and moments among users, and the hidden Markov model used to derive location patterns. Finally, it describes the experimentation phase and its results","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129335348","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}
This paper introduces a system for nursing homes, where daily activities of elderly persons are monitored by pervasive sensors. In this system, the sensors detect and save position of an elderly person as his life log and these logs are analyzed for obtaining the evidence of his activities of daily living. The collected evidence enables caregivers to provide effective support for the elderly. In our experiment, the system accumulated position data for a month and a half and we analyzed them to obtain his daily activities models, such as the relation between the time of day and the probability of visiting the lavatory. This paper presents the concept and the overview of the system and explains further some experimental results
{"title":"Evidence-based nursing care support enhanced by minimally privacy invasive and pervasive sensing technology","authors":"T. Hori, Y. Nishida, S. Murakami","doi":"10.1109/PERCOMW.2006.51","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.51","url":null,"abstract":"This paper introduces a system for nursing homes, where daily activities of elderly persons are monitored by pervasive sensors. In this system, the sensors detect and save position of an elderly person as his life log and these logs are analyzed for obtaining the evidence of his activities of daily living. The collected evidence enables caregivers to provide effective support for the elderly. In our experiment, the system accumulated position data for a month and a half and we analyzed them to obtain his daily activities models, such as the relation between the time of day and the probability of visiting the lavatory. This paper presents the concept and the overview of the system and explains further some experimental results","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133978980","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}
S. Basagni, Michele Battelli, Moreno Iachizzi, C. Petrioli, M. Salehi
This paper concerns a study of the process of localizing the nodes of a multi-hop wireless networks, i.e., of having the node computing their coordinates with 'respect to a suitable reference system. We consider networks where the nodes perform measurements of distance and angle of arrival from nodes within their transmission radius. We describe a simple localization protocol, termed range-based centroid (RBC), that starting from a single node (the beacon) with given coordinates localizes all the network nodes with reasonable accuracy. We then propose a new localization protocol that achieves greater accuracy by containing the propagation of the localization error as the process progresses away from the beacon. We quantify the improvements of the proposed protocol, termed MEC2 (for minimum enclosing circle containment) by simulations. In the considered scenarios, MEC2 keeps the localization error within 21% of the nodes' transmission radius, with 20-30% improvements over RBC
{"title":"Limiting the propagation of localization errors in multi-hop wireless network","authors":"S. Basagni, Michele Battelli, Moreno Iachizzi, C. Petrioli, M. Salehi","doi":"10.1109/PERCOMW.2006.75","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.75","url":null,"abstract":"This paper concerns a study of the process of localizing the nodes of a multi-hop wireless networks, i.e., of having the node computing their coordinates with 'respect to a suitable reference system. We consider networks where the nodes perform measurements of distance and angle of arrival from nodes within their transmission radius. We describe a simple localization protocol, termed range-based centroid (RBC), that starting from a single node (the beacon) with given coordinates localizes all the network nodes with reasonable accuracy. We then propose a new localization protocol that achieves greater accuracy by containing the propagation of the localization error as the process progresses away from the beacon. We quantify the improvements of the proposed protocol, termed MEC2 (for minimum enclosing circle containment) by simulations. In the considered scenarios, MEC2 keeps the localization error within 21% of the nodes' transmission radius, with 20-30% improvements over RBC","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115707984","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}
In pervasive computing, devices or peers may implement or compose services using services from other devices or peers, and may use components from various sources. A composition trust binding is a prescriptive set of rules which defines the combination of allowable components for a particular service or application. Composition trust bindings can be used to protect both the service invocation path as well as the content handling path. The subsidiary relationships addressed by a composition trust binding are typically transparent today, but represent potential security exposure in pervasive computing systems because the subsidiary services or components may have security vulnerabilities. We define the composition trust binding and illustrate its use in the context of rights management and distributed search in personal content publishing. We compare this approach to existing authentication and authorization methods in service composition
{"title":"Composition trust bindings in pervasive computing service composition","authors":"J. Buford, Rakesh Kumar, G. Perkins","doi":"10.1109/PERCOMW.2006.31","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.31","url":null,"abstract":"In pervasive computing, devices or peers may implement or compose services using services from other devices or peers, and may use components from various sources. A composition trust binding is a prescriptive set of rules which defines the combination of allowable components for a particular service or application. Composition trust bindings can be used to protect both the service invocation path as well as the content handling path. The subsidiary relationships addressed by a composition trust binding are typically transparent today, but represent potential security exposure in pervasive computing systems because the subsidiary services or components may have security vulnerabilities. We define the composition trust binding and illustrate its use in the context of rights management and distributed search in personal content publishing. We compare this approach to existing authentication and authorization methods in service composition","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"4 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120975393","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}
Pervasive systems are complex distributed systems containing heterogeneous and mobile devices, services and applications. Policy-based management is an effective approach for managing these systems. The dynamism of a pervasive system due to mobility of devices and applications makes policy specification and management a difficult problem. Policies need to be modified when devices and applications are added, removed or migrated across pervasive systems. This causes significant policy management overhead and improper management may lead to policy conflicts, cycles and other undesirable system behaviors. In this paper, we present a role-based approach for managing pervasive systems. Roles group related entities and enable logical separation of entities from policies. Policies and entities are assigned to roles and every entity belonging to a role enforces policies assigned to that role. Policies and entities can be independently modified and this flexibility simplifies policy management. Roles are further organized into hierarchies that enable policy reuse. We present our management framework and middleware based on roles that is being developed for managing our prototype pervasive system
{"title":"Managing pervasive systems using role-based obligation policies","authors":"C. Shankar, R. Campbell","doi":"10.1109/PERCOMW.2006.77","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.77","url":null,"abstract":"Pervasive systems are complex distributed systems containing heterogeneous and mobile devices, services and applications. Policy-based management is an effective approach for managing these systems. The dynamism of a pervasive system due to mobility of devices and applications makes policy specification and management a difficult problem. Policies need to be modified when devices and applications are added, removed or migrated across pervasive systems. This causes significant policy management overhead and improper management may lead to policy conflicts, cycles and other undesirable system behaviors. In this paper, we present a role-based approach for managing pervasive systems. Roles group related entities and enable logical separation of entities from policies. Policies and entities are assigned to roles and every entity belonging to a role enforces policies assigned to that role. Policies and entities can be independently modified and this flexibility simplifies policy management. Roles are further organized into hierarchies that enable policy reuse. We present our management framework and middleware based on roles that is being developed for managing our prototype pervasive system","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121235949","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}
Meta service discovery is used to find and select a service discovery mechanism by context. As multiple service discovery mechanisms (SDM) proliferate across various administrative domains, mobile devices will require a way to locate and select the appropriate mechanism according to the context of the mobile device, such as network domain, location, protocol, and application. We define meta service discovery and explain the motivation for it. We describe our results in building a meta service discovery capability on three existing DHTs and integrated into a new broadcast-oriented SDM. Finally, we analyze the sizing and distribution of DHT entries, including hash distribution of SDM entries according to a geographic population-density scheme
{"title":"Meta service discovery","authors":"J. Buford, A. Brown, M. Kolberg","doi":"10.1109/PERCOMW.2006.93","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.93","url":null,"abstract":"Meta service discovery is used to find and select a service discovery mechanism by context. As multiple service discovery mechanisms (SDM) proliferate across various administrative domains, mobile devices will require a way to locate and select the appropriate mechanism according to the context of the mobile device, such as network domain, location, protocol, and application. We define meta service discovery and explain the motivation for it. We describe our results in building a meta service discovery capability on three existing DHTs and integrated into a new broadcast-oriented SDM. Finally, we analyze the sizing and distribution of DHT entries, including hash distribution of SDM entries according to a geographic population-density scheme","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128607107","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}
Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of transmission radii, so that the resulting network is strongly-connected and more generally k-connected has been studied in the literature. In traditional k-connectedness, the network is able resist the failure of up to k - 1 nodes anywhere in the network, and still remain strongly-connected. In this paper we introduce a much stronger k-connectedness property, which we show can be implemented efficiently, and without great increase in the radii of transmission needed to simply achieve connectedness. We say that a network is dominating k-connected if, for any simultaneous failure of nodes throughout the network, with at most k - 1 nodes failures occurring in the out-neighborhood any surviving (up) node, the set U of up nodes forms a dominating set and induces a strongly-connected subdigraph. In this paper, we give a simple characterization of the networks that are dominating k-connected and design an associated efficient algorithm for determining the dominating connectivity, i.e., the maximum k such that the network is dominating k-connected. We also present an efficient algorithm for computing an assignment of transmission radii that results in a dominating k-connected network which minimizes the maximum radius. Furthermore, we show that the maximum radius in this assignment is no more than a multiplicative factor of k greater than the percolation radius rhoperc, i.e., the minimum that the maximum transmission radius can be so that the network remains connected. We show through empirical testing that this multiplicative factor can, in practice, be considerably less than k and only slightly greater than that required to achieve traditional k-connectedness. Finally, we show that for sensors placed on the lattice points of a two-dimensional square, we can achieve dominating k-connectedness with a multiplicative factor of at most radic2[radick + .5] greater than rhoperc
{"title":"Dominating connectivity and reliability of heterogeneous sensor networks","authors":"K. Berman, Fred S. Annexstein, A. Ranganathan","doi":"10.1109/PERCOMW.2006.44","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.44","url":null,"abstract":"Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of transmission radii, so that the resulting network is strongly-connected and more generally k-connected has been studied in the literature. In traditional k-connectedness, the network is able resist the failure of up to k - 1 nodes anywhere in the network, and still remain strongly-connected. In this paper we introduce a much stronger k-connectedness property, which we show can be implemented efficiently, and without great increase in the radii of transmission needed to simply achieve connectedness. We say that a network is dominating k-connected if, for any simultaneous failure of nodes throughout the network, with at most k - 1 nodes failures occurring in the out-neighborhood any surviving (up) node, the set U of up nodes forms a dominating set and induces a strongly-connected subdigraph. In this paper, we give a simple characterization of the networks that are dominating k-connected and design an associated efficient algorithm for determining the dominating connectivity, i.e., the maximum k such that the network is dominating k-connected. We also present an efficient algorithm for computing an assignment of transmission radii that results in a dominating k-connected network which minimizes the maximum radius. Furthermore, we show that the maximum radius in this assignment is no more than a multiplicative factor of k greater than the percolation radius rhoperc, i.e., the minimum that the maximum transmission radius can be so that the network remains connected. We show through empirical testing that this multiplicative factor can, in practice, be considerably less than k and only slightly greater than that required to achieve traditional k-connectedness. Finally, we show that for sensors placed on the lattice points of a two-dimensional square, we can achieve dominating k-connectedness with a multiplicative factor of at most radic2[radick + .5] greater than rhoperc","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126297571","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}
Complementary characteristics of the WLAN and WWAN networks have led to the current research efforts towards their integration. The integration can be done at different levels in the network, resulting in interworking architectures of different capabilities and with different degrees of complexity. We concentrate here on the WLAN integration at the UMTS radio access level. Due to diversity of the existing as well emerging higher-capacity WLAN technologies, their gradual integration into the future integrated mobile network, while keeping the operators' investments protected, becomes an important issue. In this paper, we address such an interworking architecture and discuss necessary modifications, aiming at defining a framework that would require as minimal modifications as possible for any new type of the WLAN technology that is to be embedded
{"title":"A framework for integration of different WLAN technologies at UMTS radio access level","authors":"N. Vulic, S. Groot, I. Niemegeers","doi":"10.1109/PERCOMW.2006.7","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.7","url":null,"abstract":"Complementary characteristics of the WLAN and WWAN networks have led to the current research efforts towards their integration. The integration can be done at different levels in the network, resulting in interworking architectures of different capabilities and with different degrees of complexity. We concentrate here on the WLAN integration at the UMTS radio access level. Due to diversity of the existing as well emerging higher-capacity WLAN technologies, their gradual integration into the future integrated mobile network, while keeping the operators' investments protected, becomes an important issue. In this paper, we address such an interworking architecture and discuss necessary modifications, aiming at defining a framework that would require as minimal modifications as possible for any new type of the WLAN technology that is to be embedded","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130718047","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
扫码关注我们
求助内容：
应助结果提醒方式：