Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594849
M. Bargh, Bob Hulsebosch, H. Eertink, G. Heijenk, Jeroen Idserda, J. Laganier, A. Prasad, A. Zugenmaier
Handover in future wireless communication systems must be seamless. Current IP-level mobility protocols have difficulties meeting the stringent handover delay requirements. At the same time they do not give sufficient control to the network to optimize the handover process and they do not deal well with slow connection setups of some wireless technologies. In this paper we propose an enhancement of Proxy MIPv6 (PMIPv6) with Simultaneous bindings. The result, called SPMIPv6, is a proactive network- controlled handover solution that allows some handover processes to be carried proactively while the mobile node is connected to the serving network. We analyze SPMIPv6 performance and show that the handover latency can be limited to one RTT between the mobile node and the target access router, which is typically below 10ms, and that the packet loss due to handover can be decreased and eliminated by appropriately buffering packets at the target access router. Moreover, our performance evaluation based on a SPMIPv6 implementation shows no TCP and UDP performance degradation during handovers. Two important characteristics of SPMIPv6 are its robustness to incorrect handover predictions and its built-in features to accommodate large network attachment latencies.
{"title":"Reducing handover latency in future IP-based wireless networks: proxy mobile IPv6 with simultaneous bindings","authors":"M. Bargh, Bob Hulsebosch, H. Eertink, G. Heijenk, Jeroen Idserda, J. Laganier, A. Prasad, A. Zugenmaier","doi":"10.1109/WOWMOM.2008.4594849","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594849","url":null,"abstract":"Handover in future wireless communication systems must be seamless. Current IP-level mobility protocols have difficulties meeting the stringent handover delay requirements. At the same time they do not give sufficient control to the network to optimize the handover process and they do not deal well with slow connection setups of some wireless technologies. In this paper we propose an enhancement of Proxy MIPv6 (PMIPv6) with Simultaneous bindings. The result, called SPMIPv6, is a proactive network- controlled handover solution that allows some handover processes to be carried proactively while the mobile node is connected to the serving network. We analyze SPMIPv6 performance and show that the handover latency can be limited to one RTT between the mobile node and the target access router, which is typically below 10ms, and that the packet loss due to handover can be decreased and eliminated by appropriately buffering packets at the target access router. Moreover, our performance evaluation based on a SPMIPv6 implementation shows no TCP and UDP performance degradation during handovers. Two important characteristics of SPMIPv6 are its robustness to incorrect handover predictions and its built-in features to accommodate large network attachment latencies.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"24 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":"133035248","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.4594906
Kartik Muralidharan, K. Dhanapal, A. Chowdhury
A truly pervasive computing environment can only be created if ubiquitous computation power can collaborate seamlessly to create superior user experience. With the adoption of mobile computing platforms on the rise, we have explored how the IEEE 802.11 wireless access standards can be used to enable a device to be more aware of the capabilities of the infrastructure in its surroundings. Specifically, we have been able to effectively transfer information to these WiFi enabled devices without explicit connections being established and therefore our solution is proven to be much more scalable. We have also showcased a pilot application using the broadcast over wireless LAN (BOWL) technology.
{"title":"BOWL: Design and implementation of a (connectionless) broadcasting system over wireless LAN","authors":"Kartik Muralidharan, K. Dhanapal, A. Chowdhury","doi":"10.1109/WOWMOM.2008.4594906","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594906","url":null,"abstract":"A truly pervasive computing environment can only be created if ubiquitous computation power can collaborate seamlessly to create superior user experience. With the adoption of mobile computing platforms on the rise, we have explored how the IEEE 802.11 wireless access standards can be used to enable a device to be more aware of the capabilities of the infrastructure in its surroundings. Specifically, we have been able to effectively transfer information to these WiFi enabled devices without explicit connections being established and therefore our solution is proven to be much more scalable. We have also showcased a pilot application using the broadcast over wireless LAN (BOWL) technology.","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":"115428672","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.4594863
C. Ververidis, George C. Polyzos
Optimized service provisioning is a challenging problem in dynamic environments such as mobile ad hoc networks (MANETs). Most of the existing approaches assume an environment, where service provision is free (and dictated) and servers do not have an incentive to maximize their benefit. In this paper we consider the nodes in MANETs to be independent, rational agents trying to maximize their profits through service provision. We model this problem as a generalized assignment problem (GAP). We adopt a pay-as-you-go model and introduce into the proposed profit maximization algorithm expected payoffs based on estimates of server-to-client connectivity. We define connectivity as the lifetime of the network connection between a client and a server. We experimentally study cases with non-cooperative and cooperative servers and investigate the gain of the estimate based maximization algorithm versus a classic maximization algorithm, which does not take into account the networkpsilas dynamics that affect server-to-client connectivity. The results show that our approach achieves up to three-fold improved server profits compared to the classical one and is especially suited for MANETs with high-mobility.
{"title":"Optimizations for charged service provision in Mobile Ad Hoc Networks","authors":"C. Ververidis, George C. Polyzos","doi":"10.1109/WOWMOM.2008.4594863","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594863","url":null,"abstract":"Optimized service provisioning is a challenging problem in dynamic environments such as mobile ad hoc networks (MANETs). Most of the existing approaches assume an environment, where service provision is free (and dictated) and servers do not have an incentive to maximize their benefit. In this paper we consider the nodes in MANETs to be independent, rational agents trying to maximize their profits through service provision. We model this problem as a generalized assignment problem (GAP). We adopt a pay-as-you-go model and introduce into the proposed profit maximization algorithm expected payoffs based on estimates of server-to-client connectivity. We define connectivity as the lifetime of the network connection between a client and a server. We experimentally study cases with non-cooperative and cooperative servers and investigate the gain of the estimate based maximization algorithm versus a classic maximization algorithm, which does not take into account the networkpsilas dynamics that affect server-to-client connectivity. The results show that our approach achieves up to three-fold improved server profits compared to the classical one and is especially suited for MANETs with high-mobility.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"28 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":"125176089","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.4594924
M. Guennoun, A. Lbekkouri, Amine Benamrane, Mohamed Ben-Tahir, K. El-Khatib
An encryption protocol is the first line of defense against network attacks. The wired equivalent privacy (WEP), used to secure 802.11 based networks, suffers from many weaknesses that were exploited in order to compromise the security of the network, data confidentiality and integrity. An attack named chopchop can decrypt the content of a frame without knowing the encryption key. There has been no theoretical proof of the functionality of the attack. In this paper, we will give a review of the attack and build a mathematical model to prove theoretically that the attack is capable of decrypting messages in WEP enabled wireless networks without requiring the knowledge of the encryption key.
{"title":"Wireless networks security: Proof of chopchop attack","authors":"M. Guennoun, A. Lbekkouri, Amine Benamrane, Mohamed Ben-Tahir, K. El-Khatib","doi":"10.1109/WOWMOM.2008.4594924","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594924","url":null,"abstract":"An encryption protocol is the first line of defense against network attacks. The wired equivalent privacy (WEP), used to secure 802.11 based networks, suffers from many weaknesses that were exploited in order to compromise the security of the network, data confidentiality and integrity. An attack named chopchop can decrypt the content of a frame without knowing the encryption key. There has been no theoretical proof of the functionality of the attack. In this paper, we will give a review of the attack and build a mathematical model to prove theoretically that the attack is capable of decrypting messages in WEP enabled wireless networks without requiring the knowledge of the encryption key.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"1968 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":"129926751","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.4594901
W. Kiess, T. Ogilvie, M. Mauve
In this paper, we present a methodology and a toolkit to conduct tightly controlled real-world experiments in wireless multihop networks. The main features of our EXC toolkit are a plug-in architecture for easy integration of new functionality, simple scheduling of experiment runs, direct monitoring of experiments, easy management of node mobility, and high portability. EXC does not require specific hardware and can be used for investigating applications and algorithms in real-world environments. We explain the basic features of the toolkit and examine these by means of an experiment with a special focus on repeatability.
{"title":"The EXC toolkit for real-world experiments with wireless multihop networks","authors":"W. Kiess, T. Ogilvie, M. Mauve","doi":"10.1109/WOWMOM.2008.4594901","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594901","url":null,"abstract":"In this paper, we present a methodology and a toolkit to conduct tightly controlled real-world experiments in wireless multihop networks. The main features of our EXC toolkit are a plug-in architecture for easy integration of new functionality, simple scheduling of experiment runs, direct monitoring of experiments, easy management of node mobility, and high portability. EXC does not require specific hardware and can be used for investigating applications and algorithms in real-world environments. We explain the basic features of the toolkit and examine these by means of an experiment with a special focus on repeatability.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"324 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120882361","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.4594914
Ai-Mei Huang, Truong Q. Nguyen
In this paper, we address the potential issues in bidirectional motion compensated frame interpolation when the received motion vector field is directly used. Based on this motion vector analysis, we therefore propose using bidirectional motion vector processing method to eliminate the ghost artifacts around the moving objects. The artifacts caused by large motion vector magnitude can be effectively removed by correcting motion vectors bidirectionally. Moreover, since the proposed motion vector selection process chooses the best motion vector from adjacent motion vectors, the computational complexity can be greatly reduced comparing to motion estimation. We also demonstrate how to obtain clearer object edges by allowing displacement adjustment during the bidirectional motion vector processing. Experimental results show that the proposed algorithm outperforms other methods in terms of visual quality.
{"title":"Motion vector processing using bidirectional frame difference in motion compensated frame interpolation","authors":"Ai-Mei Huang, Truong Q. Nguyen","doi":"10.1109/WOWMOM.2008.4594914","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594914","url":null,"abstract":"In this paper, we address the potential issues in bidirectional motion compensated frame interpolation when the received motion vector field is directly used. Based on this motion vector analysis, we therefore propose using bidirectional motion vector processing method to eliminate the ghost artifacts around the moving objects. The artifacts caused by large motion vector magnitude can be effectively removed by correcting motion vectors bidirectionally. Moreover, since the proposed motion vector selection process chooses the best motion vector from adjacent motion vectors, the computational complexity can be greatly reduced comparing to motion estimation. We also demonstrate how to obtain clearer object edges by allowing displacement adjustment during the bidirectional motion vector processing. Experimental results show that the proposed algorithm outperforms other methods in terms of visual quality.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"22 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":"127231343","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.4594866
Vinay Kolar, N. Abu-Ghazaleh
Network flow models have proven to be an effective tool in the analysis, optimization and design of network protocols. Critical to the success of these models in general multi-hop wireless networks (MHWNs) is an accurate estimation of the effect of CSMA scheduling. While the existing models capture coarse grained estimates of interference, they do not account for the substantial impact of MAC scheduling. On the other hand, accurate models of throughput in CSMA networks exist. However, they are unsuitable for use as a part of a network flow formulation because of their complexity and some of their underlying assumptions. This paper contributes an efficient and constructive model to estimate the effect of scheduling on interfering links in general MHWN settings. We integrate this approach with a network flow routing model which works with aggregate estimates of capacity to improve the quality of the solution. Simulation results show that accounting for scheduling effects leads to large improvements in the quality of the solution.
{"title":"Scheduling aware network flow models for multi-hop wireless networks","authors":"Vinay Kolar, N. Abu-Ghazaleh","doi":"10.1109/WOWMOM.2008.4594866","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594866","url":null,"abstract":"Network flow models have proven to be an effective tool in the analysis, optimization and design of network protocols. Critical to the success of these models in general multi-hop wireless networks (MHWNs) is an accurate estimation of the effect of CSMA scheduling. While the existing models capture coarse grained estimates of interference, they do not account for the substantial impact of MAC scheduling. On the other hand, accurate models of throughput in CSMA networks exist. However, they are unsuitable for use as a part of a network flow formulation because of their complexity and some of their underlying assumptions. This paper contributes an efficient and constructive model to estimate the effect of scheduling on interfering links in general MHWN settings. We integrate this approach with a network flow routing model which works with aggregate estimates of capacity to improve the quality of the solution. Simulation results show that accounting for scheduling effects leads to large improvements in the quality of the solution.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"4 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":"130795343","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.4594907
S. Wong, T. Wilkinson, S. Stoker
This paper investigates the C/I gain of a single frequency network for an MBSFN network using TD-CDMA over an equivalent unicast network based on measurements from a trial network and simulations. It is shown that a cell edge C/I gain of 14.4 dB can be achieved in the trial network giving an increase of 59% in coverage by using a SFN over a unicast network.
{"title":"C/I gains in a single frequency network using TD-CDMA over a unicast network","authors":"S. Wong, T. Wilkinson, S. Stoker","doi":"10.1109/WOWMOM.2008.4594907","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594907","url":null,"abstract":"This paper investigates the C/I gain of a single frequency network for an MBSFN network using TD-CDMA over an equivalent unicast network based on measurements from a trial network and simulations. It is shown that a cell edge C/I gain of 14.4 dB can be achieved in the trial network giving an increase of 59% in coverage by using a SFN over a unicast network.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"32 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":"131164099","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.4594848
F. Tan, Youmna Borghol, S. Ardon
We propose EMO, a model to evaluate delay tolerant networks (DTN) and opportunistic systems, which focuses on simulating encounter events between mobile radios, rather than node locations as done in existing models and simulators. Our approach introduces a more accurate simulation of DTNs on the main system timescale (the encounter timescale), while trading off some accuracy at the bit-level, through an abstraction of radio propagation simulation. To design EMO, we extract and characterize the necessary parameters from experimental data and propose a method to generate synthetic node encounter traces based on this characterization. The output of the model is validated using hold-out cross-validation method. Our validation results indicate that EMO is able to maintain the statistical properties of experimental data over a wide range of time (simulation duration) and space (number of nodes) scales, with mean square errors of less than 3% for the main system parameters.
{"title":"EMO: A statistical encounter-based mobility model for simulating delay tolerant networks","authors":"F. Tan, Youmna Borghol, S. Ardon","doi":"10.1109/WOWMOM.2008.4594848","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594848","url":null,"abstract":"We propose EMO, a model to evaluate delay tolerant networks (DTN) and opportunistic systems, which focuses on simulating encounter events between mobile radios, rather than node locations as done in existing models and simulators. Our approach introduces a more accurate simulation of DTNs on the main system timescale (the encounter timescale), while trading off some accuracy at the bit-level, through an abstraction of radio propagation simulation. To design EMO, we extract and characterize the necessary parameters from experimental data and propose a method to generate synthetic node encounter traces based on this characterization. The output of the model is validated using hold-out cross-validation method. Our validation results indicate that EMO is able to maintain the statistical properties of experimental data over a wide range of time (simulation duration) and space (number of nodes) scales, with mean square errors of less than 3% for the main system parameters.","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":"133301177","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.4594871
Xiaohuan Yan, Y. Sekercioglu, N. Mani
In near future, various wireless access technologies will be used together to provide seamless and cost effective connectivity to mobile users. Multiple wireless access systems with overlapping coverage fields will be accessible to a mobile terminal with multiple interfaces. One problem arising from the availability of alternatives is the unnecessary occurrences of handovers (especially vertical ones) that lead to excessive resource consumption. To avoid this, a suite of algorithms need to be deployed to limit the number of handovers. In this paper, we present an algorithm which is run in the mobile terminal and minimizes the number of handovers when the device detects the presence of wireless local area network (WLAN) signals. Conventionally, a mobile terminal should switch from cellular to WLAN whenever WLAN connectivity is available, to make use of the WLAN's high speed and low cost as much as possible. However, a considerable proportion of these handovers will be detrimental to the call quality due to potential failures. Our algorithm reduces the number of handovers whenever the predicted traveling distance inside the WLAN cell is smaller than a threshold value. Through performance analysis we show that our algorithm successfully minimizes the probability of unnecessary handovers, and through simulation we discuss about the accuracy of the distance prediction based on the received signal strength measurements.
{"title":"A method for minimizing unnecessary handovers in heterogeneous wireless networks","authors":"Xiaohuan Yan, Y. Sekercioglu, N. Mani","doi":"10.1109/WOWMOM.2008.4594871","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594871","url":null,"abstract":"In near future, various wireless access technologies will be used together to provide seamless and cost effective connectivity to mobile users. Multiple wireless access systems with overlapping coverage fields will be accessible to a mobile terminal with multiple interfaces. One problem arising from the availability of alternatives is the unnecessary occurrences of handovers (especially vertical ones) that lead to excessive resource consumption. To avoid this, a suite of algorithms need to be deployed to limit the number of handovers. In this paper, we present an algorithm which is run in the mobile terminal and minimizes the number of handovers when the device detects the presence of wireless local area network (WLAN) signals. Conventionally, a mobile terminal should switch from cellular to WLAN whenever WLAN connectivity is available, to make use of the WLAN's high speed and low cost as much as possible. However, a considerable proportion of these handovers will be detrimental to the call quality due to potential failures. Our algorithm reduces the number of handovers whenever the predicted traveling distance inside the WLAN cell is smaller than a threshold value. Through performance analysis we show that our algorithm successfully minimizes the probability of unnecessary handovers, and through simulation we discuss about the accuracy of the distance prediction based on the received signal strength measurements.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"31 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":"133974862","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
扫码关注我们
求助内容：
应助结果提醒方式：