Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382442
Debasis Mandal, Satyajit Nath, Bivas Mitra
In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains connected even after the failure of a single fiber link. This is called survivable routing. It is known to be an NP-complete problem. To address the problem, first, we have proved that embedded Hamiltonian circuit in a mesh network is a must for its survivability. Then using a polynomial time algorithm for generating Hamiltonian circuit i.e. embedded ring virtual topology, we establish lightpaths to the ring. Finally, we design two RWA algorithms to assign lightpaths to other requests in the network, giving priority to wavelength and traffic respectively. We analyze the numerical results obtained for random undirected networks with random normal traffic demands with performance metrics such as maximum one-hop and minimum multi-hop protected traffic, wavelength utilization, number of multi-hops, Buffer size etc.
{"title":"Survivable Routing in WDM Weighted Networks","authors":"Debasis Mandal, Satyajit Nath, Bivas Mitra","doi":"10.1109/COMSWA.2007.382442","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382442","url":null,"abstract":"In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains connected even after the failure of a single fiber link. This is called survivable routing. It is known to be an NP-complete problem. To address the problem, first, we have proved that embedded Hamiltonian circuit in a mesh network is a must for its survivability. Then using a polynomial time algorithm for generating Hamiltonian circuit i.e. embedded ring virtual topology, we establish lightpaths to the ring. Finally, we design two RWA algorithms to assign lightpaths to other requests in the network, giving priority to wavelength and traffic respectively. We analyze the numerical results obtained for random undirected networks with random normal traffic demands with performance metrics such as maximum one-hop and minimum multi-hop protected traffic, wavelength utilization, number of multi-hops, Buffer size etc.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128640777","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382492
P. Varalakshmi, S. Selvi, M. Pradeep
Trust management is an important issue in a grid environment where consumers and service providers are distributed geographically across autonomous administrative domains. In this paper, we propose a reputation-based trust management architecture that supports the choice of service providers (SPs) based on their trust values available on the fly through the intermediaries, brokers. This architecture insists on multiple brokers in each domain. The entities (consumers and the SPs) are distributed across these brokers, with each of these entities being associated with more than one broker. This improves the redundancy of information maintained at the broker sites, thereby improving the reliability. This also eases the network traffic at the broker sites while handling consumer requests and feedbacks. The issues rising out of such an arrangement of multiple brokers, namely the distribution of entities among the brokers and maintenance of consistency of information across the brokers, are addressed well in this paper. Trust values of SPs and consumers are evaluated and updated dynamically after the completion of each transaction. This enables the consumer to receive the response from the broker significantly quicker compared to other reputation-based-trust models where the trust values are computed at the request-time. Trust parameters such as the number of transactions, satisfaction-value, and cost of transaction, criticality of transaction, different weights for direct and indirect transactions and different weights for past and recent transactions are considered for the trust evaluation. This model shows a marked improvement in reduction of the cost-loss to the consumer community and reduction in the waiting time for handling the consumer's requests over other models which operate without trust and with trust computed at the request-time. The impact of broker's feedback on the computation of trust values is also presented.
{"title":"A Multi-Broker Trust Management Framework for Resource Selection in Grid","authors":"P. Varalakshmi, S. Selvi, M. Pradeep","doi":"10.1109/COMSWA.2007.382492","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382492","url":null,"abstract":"Trust management is an important issue in a grid environment where consumers and service providers are distributed geographically across autonomous administrative domains. In this paper, we propose a reputation-based trust management architecture that supports the choice of service providers (SPs) based on their trust values available on the fly through the intermediaries, brokers. This architecture insists on multiple brokers in each domain. The entities (consumers and the SPs) are distributed across these brokers, with each of these entities being associated with more than one broker. This improves the redundancy of information maintained at the broker sites, thereby improving the reliability. This also eases the network traffic at the broker sites while handling consumer requests and feedbacks. The issues rising out of such an arrangement of multiple brokers, namely the distribution of entities among the brokers and maintenance of consistency of information across the brokers, are addressed well in this paper. Trust values of SPs and consumers are evaluated and updated dynamically after the completion of each transaction. This enables the consumer to receive the response from the broker significantly quicker compared to other reputation-based-trust models where the trust values are computed at the request-time. Trust parameters such as the number of transactions, satisfaction-value, and cost of transaction, criticality of transaction, different weights for direct and indirect transactions and different weights for past and recent transactions are considered for the trust evaluation. This model shows a marked improvement in reduction of the cost-loss to the consumer community and reduction in the waiting time for handling the consumer's requests over other models which operate without trust and with trust computed at the request-time. The impact of broker's feedback on the computation of trust values is also presented.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134221552","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382433
Tarun Banka, A. Jayasumana
Impact of random delays and losses in sensor networks manifests in the form of tardiness of data used for processing at the sink nodes. The age of data used by the end application can impact the accuracy of the end results, and may produce detrimental consequences for many real-time sensing applications. This paper uses a tardiness measure for quantitatively capturing the lateness of the data due to network dynamics, and presents an analytical model relating the network delay, network packet loss rate, packet reordering, and sampling rate to the tardiness. We extend this model to provide aggregate weighted tardiness of data at fusion nodes. The tardiness model is validated using simulation results. We also investigate the tradeoffs between energy consumption and tardiness when desired tardiness is achieved by adjusting sampling rate and transmission power of the sensors nodes. Other potential applications of proposed tardiness measure includes determination of the active/sleep period of MAC layer to meet application goals, and comparison of routing protocols based on their impact on tardiness, and hence the application in real-time sensor networks.
{"title":"Impact of Network Dynamics on Tardiness of Data in Sensor Networks","authors":"Tarun Banka, A. Jayasumana","doi":"10.1109/COMSWA.2007.382433","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382433","url":null,"abstract":"Impact of random delays and losses in sensor networks manifests in the form of tardiness of data used for processing at the sink nodes. The age of data used by the end application can impact the accuracy of the end results, and may produce detrimental consequences for many real-time sensing applications. This paper uses a tardiness measure for quantitatively capturing the lateness of the data due to network dynamics, and presents an analytical model relating the network delay, network packet loss rate, packet reordering, and sampling rate to the tardiness. We extend this model to provide aggregate weighted tardiness of data at fusion nodes. The tardiness model is validated using simulation results. We also investigate the tradeoffs between energy consumption and tardiness when desired tardiness is achieved by adjusting sampling rate and transmission power of the sensors nodes. Other potential applications of proposed tardiness measure includes determination of the active/sleep period of MAC layer to meet application goals, and comparison of routing protocols based on their impact on tardiness, and hence the application in real-time sensor networks.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125739133","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382450
J. Kasturi, R. Sundaresan
Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N-1.
{"title":"Sequence Design for Symbol-Asynchronous CDMA with Power or Rate Constraints","authors":"J. Kasturi, R. Sundaresan","doi":"10.1109/COMSWA.2007.382450","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382450","url":null,"abstract":"Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N-1.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123619582","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382606
N. V. Marathe, G. Biradar, U. Desai, S. Merchant
Congestion in cellular networks during peak hours and at hot spots is a major problem being faced today almost everywhere especially in metro cities. Even though capacity increase seems to be a natural solution to this problem, it is not economically viable due to heavy infrastructure costs involved. As the traffic demand is continuously increasing the problem of congestion is going to remain forever and therefore needs to be effectively addressed. Our proposed scheme tries to address the problem of congestion in cellular networks by introducing a new concept of call duration control coupled with dynamic pricing and call-on-hold principle. Long duration calls in the network is one of the major reasons for congestion in the network. We propose to restrict the duration of such calls depending upon traffic conditions. At heavy traffic conditions the network restricts the duration of ongoing calls upto a specific time beyond which the user has to pay at a higher tariff. At the same time a principle of call-on-hold is also implemented so that if a newly generated call does not get a traffic channel then it is not blocked but is put on hold in a queue hoping to get a channel soon. Our scheme reduces the level of congestion substantially without any compromise with system utilization and at the same time it also marginally increases the revenue per unit time.
{"title":"A Comprehensive Call Management Strategy for Congestion Control in Cellular Networks","authors":"N. V. Marathe, G. Biradar, U. Desai, S. Merchant","doi":"10.1109/COMSWA.2007.382606","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382606","url":null,"abstract":"Congestion in cellular networks during peak hours and at hot spots is a major problem being faced today almost everywhere especially in metro cities. Even though capacity increase seems to be a natural solution to this problem, it is not economically viable due to heavy infrastructure costs involved. As the traffic demand is continuously increasing the problem of congestion is going to remain forever and therefore needs to be effectively addressed. Our proposed scheme tries to address the problem of congestion in cellular networks by introducing a new concept of call duration control coupled with dynamic pricing and call-on-hold principle. Long duration calls in the network is one of the major reasons for congestion in the network. We propose to restrict the duration of such calls depending upon traffic conditions. At heavy traffic conditions the network restricts the duration of ongoing calls upto a specific time beyond which the user has to pay at a higher tariff. At the same time a principle of call-on-hold is also implemented so that if a newly generated call does not get a traffic channel then it is not blocked but is put on hold in a queue hoping to get a channel soon. Our scheme reduces the level of congestion substantially without any compromise with system utilization and at the same time it also marginally increases the revenue per unit time.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124811149","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382561
Khaldoon Shami, D. Magoni, P. Lorenz
Many distributed applications build overlays on top of the Internet. Several unsolved issues at the network layer can explain this trend to implement network services such as multicast, mobility and security at the application layer. On one hand, overlays creating basic topologies are usually limited in flexibility and scalability. On the other hand, overlays creating complex topologies require some form of application level addressing, routing and naming mechanisms. Our aim is to design an efficient and robust addressing, routing and naming middleware for building and managing these complex overlays. Our only assumption is that they are deployed over the Internet topology. Applications that use our middleware will be relieved from managing their own overlay topologies. Our middleware architecture is based on the separation of the naming and the addressing planes and provides a convergence plane for the current heterogeneous Internet environment. To implement this property, we have designed a scalable distributed κ-resilient name to address binding system. This paper describes the design of our middleware and presents some performance results concerning its routing scalability, its path inflation efficiency and its resilience to network dynamics.
{"title":"A Scalable Middleware for Creating and Managing Autonomous Overlays","authors":"Khaldoon Shami, D. Magoni, P. Lorenz","doi":"10.1109/COMSWA.2007.382561","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382561","url":null,"abstract":"Many distributed applications build overlays on top of the Internet. Several unsolved issues at the network layer can explain this trend to implement network services such as multicast, mobility and security at the application layer. On one hand, overlays creating basic topologies are usually limited in flexibility and scalability. On the other hand, overlays creating complex topologies require some form of application level addressing, routing and naming mechanisms. Our aim is to design an efficient and robust addressing, routing and naming middleware for building and managing these complex overlays. Our only assumption is that they are deployed over the Internet topology. Applications that use our middleware will be relieved from managing their own overlay topologies. Our middleware architecture is based on the separation of the naming and the addressing planes and provides a convergence plane for the current heterogeneous Internet environment. To implement this property, we have designed a scalable distributed κ-resilient name to address binding system. This paper describes the design of our middleware and presents some performance results concerning its routing scalability, its path inflation efficiency and its resilience to network dynamics.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130048520","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382466
G. Shah, M. Bozyigit
Wireless sensor networks (WSNs) promise fine-grain monitoring in a wide variety of applications, which require dense sensor nodes deployment. Due to high density of nodes, spatially redundant or correlated data is generated. Redundancy increases the reliability level of information delivery but increases the energy consumption of the nodes too. Since energy conservation is a key issue for WSNs, therefore, spatial correlation can be exploited to deactivate some of the nodes generating redundant information. In this paper, we present an energy-aware spatial correlation based on a clustering protocol. In this approach, only the cluster-heads are responsible of exploiting spatial correlation of their member nodes and selecting the appropriate member nodes to remain active. The correlation is based on the distortion tolerance and the residual energy of member nodes. Each cluster-head divides its clustered region into correlation regions and selects a representative node in each correlation region which is closer to the center of correlation region and has the higher residual energy. Hence, the whole field is represented by a subset of active nodes which perform the task well. Simulation results prove that the required reporting rate can be achieved with lesser number of nodes by exploiting spatial correlation and eventually conserving the nodes energy.
{"title":"Exploiting Energy-aware Spatial Correlation in Wireless Sensor Networks","authors":"G. Shah, M. Bozyigit","doi":"10.1109/COMSWA.2007.382466","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382466","url":null,"abstract":"Wireless sensor networks (WSNs) promise fine-grain monitoring in a wide variety of applications, which require dense sensor nodes deployment. Due to high density of nodes, spatially redundant or correlated data is generated. Redundancy increases the reliability level of information delivery but increases the energy consumption of the nodes too. Since energy conservation is a key issue for WSNs, therefore, spatial correlation can be exploited to deactivate some of the nodes generating redundant information. In this paper, we present an energy-aware spatial correlation based on a clustering protocol. In this approach, only the cluster-heads are responsible of exploiting spatial correlation of their member nodes and selecting the appropriate member nodes to remain active. The correlation is based on the distortion tolerance and the residual energy of member nodes. Each cluster-head divides its clustered region into correlation regions and selects a representative node in each correlation region which is closer to the center of correlation region and has the higher residual energy. Hence, the whole field is represented by a subset of active nodes which perform the task well. Simulation results prove that the required reporting rate can be achieved with lesser number of nodes by exploiting spatial correlation and eventually conserving the nodes energy.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130242517","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382490
A. Stavrou, D. Turner, A. Keromytis, V. Prevelakis
We propose the concept of Overlay-linked IntServ (OLIntServ), a system architecture that combines network overlays with intra-domain QoS to provide assured communications over the Internet, while allowing ISPs to extend the reach of their currently under-utilized IntServ services. We describe our system prototype, and provide some preliminary experimental results on its efficacy.
{"title":"Bridging the Network Reservation Gap Using Overlays","authors":"A. Stavrou, D. Turner, A. Keromytis, V. Prevelakis","doi":"10.1109/COMSWA.2007.382490","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382490","url":null,"abstract":"We propose the concept of Overlay-linked IntServ (OLIntServ), a system architecture that combines network overlays with intra-domain QoS to provide assured communications over the Internet, while allowing ISPs to extend the reach of their currently under-utilized IntServ services. We describe our system prototype, and provide some preliminary experimental results on its efficacy.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127080425","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382580
J. Akella, M. Yuksel, S. Kalyanaraman
Directional communication (for example, using directional antennas or free-space optics) has the potential to dramatically increase capacity reuse in multi-hop wireless mesh and ad hoc networks. What is less appreciated is that directional communications can also simplify network layer functions. In this paper, we show how directionality (combined with ranging) can be used to construct a scalable, fully distributed localization system and assign "relative" coordinates to each node (without the need for GPS) that can be used by highly scalable geographic routing systems. We show that range and orientation-based localization schemes (ROL) scale better than range-only or orientation-only localization schemes (e.g., triangulation) for such applications. We present simulations studying scalability, effect of errors (both range and directionality) and compare performance with triangulation methods. Finally, we discuss how such an ROL scheme can be realized with optical wireless nodes, based upon our ongoing efforts to build ad hoc and meshed networks using both FSO and RF technologies.
{"title":"A Relative Ad hoc Localization Scheme using Optical Wireless","authors":"J. Akella, M. Yuksel, S. Kalyanaraman","doi":"10.1109/COMSWA.2007.382580","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382580","url":null,"abstract":"Directional communication (for example, using directional antennas or free-space optics) has the potential to dramatically increase capacity reuse in multi-hop wireless mesh and ad hoc networks. What is less appreciated is that directional communications can also simplify network layer functions. In this paper, we show how directionality (combined with ranging) can be used to construct a scalable, fully distributed localization system and assign \"relative\" coordinates to each node (without the need for GPS) that can be used by highly scalable geographic routing systems. We show that range and orientation-based localization schemes (ROL) scale better than range-only or orientation-only localization schemes (e.g., triangulation) for such applications. We present simulations studying scalability, effect of errors (both range and directionality) and compare performance with triangulation methods. Finally, we discuss how such an ROL scheme can be realized with optical wireless nodes, based upon our ongoing efforts to build ad hoc and meshed networks using both FSO and RF technologies.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127287111","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382496
R. Rajavelsamy, Venkateswar Jeedigunta, O. Song
This paper presents a solution for optimizing network access authentication procedure and security context transfer during vertical handover in heterogeneous wireless networks (HWN). Security in HWN is a major challenge due to the vastly different security architectures used within each network. Currently, standardization working groups study the optimization of authentication procedure and security context transfer for seamless handover between heterogeneous networks. The goal of this paper is to provide a security frame work that accounts for heterogeneity in wireless access networks without degrading the level of security currently provided by the individual wireless systems. We propose a new frame work for access network specific authentication optimization and security context transfer during vertical handover preparation phase. We also demonstrate how the proposed security frame work provides improvement in the handover performance.
{"title":"A Novel Method for Authentication Optimization during Handover in Heterogeneous Wireless Networks","authors":"R. Rajavelsamy, Venkateswar Jeedigunta, O. Song","doi":"10.1109/COMSWA.2007.382496","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382496","url":null,"abstract":"This paper presents a solution for optimizing network access authentication procedure and security context transfer during vertical handover in heterogeneous wireless networks (HWN). Security in HWN is a major challenge due to the vastly different security architectures used within each network. Currently, standardization working groups study the optimization of authentication procedure and security context transfer for seamless handover between heterogeneous networks. The goal of this paper is to provide a security frame work that accounts for heterogeneity in wireless access networks without degrading the level of security currently provided by the individual wireless systems. We propose a new frame work for access network specific authentication optimization and security context transfer during vertical handover preparation phase. We also demonstrate how the proposed security frame work provides improvement in the handover performance.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128052185","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
扫码关注我们
求助内容：
应助结果提醒方式：