Pub Date : 2009-04-22DOI: 10.1109/WTS.2009.5068932
C. Ho
We present the formulas for searching for the thresholds of regular and irregular low-density parity-check (LDPC) codes under message-passing (MP) algorithm. A Gaussian approximation is applied to studying the evolution of the means of the messages of the variable nodes and the check nodes. Accurate numerical integration methods by using transformations are shown for evaluating the expected values of the message of the check nodes. Tables are built first and interpolations are used for further evaluations. Two curves are used to locate the threshold. We utilize an iterative decoding tunnel between these two curves and study the decoding performance by evaluating conditions of the derivatives of these two curves. Using this method the performance of both regular and irregular LDPC codes can be studied in a unified manner without using simulation.
{"title":"Analysis of threshold of regular and irregular LDPC codes using Gaussian approximation","authors":"C. Ho","doi":"10.1109/WTS.2009.5068932","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068932","url":null,"abstract":"We present the formulas for searching for the thresholds of regular and irregular low-density parity-check (LDPC) codes under message-passing (MP) algorithm. A Gaussian approximation is applied to studying the evolution of the means of the messages of the variable nodes and the check nodes. Accurate numerical integration methods by using transformations are shown for evaluating the expected values of the message of the check nodes. Tables are built first and interpolations are used for further evaluations. Two curves are used to locate the threshold. We utilize an iterative decoding tunnel between these two curves and study the decoding performance by evaluating conditions of the derivatives of these two curves. Using this method the performance of both regular and irregular LDPC codes can be studied in a unified manner without using simulation.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114653836","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 : 2009-04-22DOI: 10.1109/WTS.2009.5068998
A. H. Ho, Y. H. Ho, K. Hua, Roy Villafane
A vehicular network is a promising application of mobile ad hoc networks. In this paper, we introduce a near-optimal broadcast technique, called CB-S (Cell Broadcast for Streets), for vehicular networks. In this environment, the road network is fragmented into cells such that nodes in a cell can communicate with any node within a two cell distance. Each mobile node is equipped with a GPS (Global Positioning System) unit and a map of the cells. The cell map has information about the cells including their identifier and the coordinates of the upper-right and lower-left corner of each cell. CB-S has the following desirable property. Broadcast of a message is performed by rebroadcasting the message from every other cell in the terrain. This characteristic allows CB-S to achieve near optimal performance. Our simulation results indicate that data can always reach all nodes in the wireless network. This perfect coverage is achieved with minimal overhead. That is, CB-S uses a near optimal (minimum) number of nodes to disseminate the data packets. This optimality gives it the advantage of minimum delay. To show these benefits, we give simulations results to compare CB-S with four other broadcast techniques. In practice, CB-S can be used for information dissemination, or to reduce the high cost of destination discovery in routing protocols. We also present in this paper a CB-SD (Cell Broadcast for Street Dissemination) variant that has all the advantages of CB-S, with the additional benefit of supporting partial broadcast. This scheme is more efficient when broadcast to a subset of the nodes is desirable.
{"title":"A near-optimal broadcast technique for vehicular networks","authors":"A. H. Ho, Y. H. Ho, K. Hua, Roy Villafane","doi":"10.1109/WTS.2009.5068998","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068998","url":null,"abstract":"A vehicular network is a promising application of mobile ad hoc networks. In this paper, we introduce a near-optimal broadcast technique, called CB-S (Cell Broadcast for Streets), for vehicular networks. In this environment, the road network is fragmented into cells such that nodes in a cell can communicate with any node within a two cell distance. Each mobile node is equipped with a GPS (Global Positioning System) unit and a map of the cells. The cell map has information about the cells including their identifier and the coordinates of the upper-right and lower-left corner of each cell. CB-S has the following desirable property. Broadcast of a message is performed by rebroadcasting the message from every other cell in the terrain. This characteristic allows CB-S to achieve near optimal performance. Our simulation results indicate that data can always reach all nodes in the wireless network. This perfect coverage is achieved with minimal overhead. That is, CB-S uses a near optimal (minimum) number of nodes to disseminate the data packets. This optimality gives it the advantage of minimum delay. To show these benefits, we give simulations results to compare CB-S with four other broadcast techniques. In practice, CB-S can be used for information dissemination, or to reduce the high cost of destination discovery in routing protocols. We also present in this paper a CB-SD (Cell Broadcast for Street Dissemination) variant that has all the advantages of CB-S, with the additional benefit of supporting partial broadcast. This scheme is more efficient when broadcast to a subset of the nodes is desirable.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125504125","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 : 2009-04-22DOI: 10.1109/WTS.2009.5068973
Jyh-ming Huang, Chun-Yi Li, Kuong-Ho Chen
Traffic congestion avoidance is a critical issue associated with data routing in Wireless Sensor Networks (WSNs). Previous researches employ either traffic or resource control strategies as solutions. In this paper, we propose an energy-efficient grid-based traffic congestion avoidance scheme in WSNs, termed as TALONet. With our mechanism, the approaches applied to avoid congestion have three folds: 1) we use two different transmission power levels to alleviate the link-level congestion (LLC); 2) we also employ an effective buffer management approach to avoid node-level congestion (NLC); and 3) based on virtual grid frameworks, a multi-path detouring technique is used to increase the channel capacity for the congested traffic flows. Extensive simulation results show that our proposed TALONet scheme is superior to other existing protocols. Comparing to TARA [11], Backpressure, and naïve (without congestion control) schemes, the improvement on the number of dropped packets can be achieved to about 45%, 51%, and 80%, respectively.
{"title":"TALONet: A power-efficient grid-based congestion avoidance scheme using multi-detouring technique in Wireless Sensor Networks","authors":"Jyh-ming Huang, Chun-Yi Li, Kuong-Ho Chen","doi":"10.1109/WTS.2009.5068973","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068973","url":null,"abstract":"Traffic congestion avoidance is a critical issue associated with data routing in Wireless Sensor Networks (WSNs). Previous researches employ either traffic or resource control strategies as solutions. In this paper, we propose an energy-efficient grid-based traffic congestion avoidance scheme in WSNs, termed as TALONet. With our mechanism, the approaches applied to avoid congestion have three folds: 1) we use two different transmission power levels to alleviate the link-level congestion (LLC); 2) we also employ an effective buffer management approach to avoid node-level congestion (NLC); and 3) based on virtual grid frameworks, a multi-path detouring technique is used to increase the channel capacity for the congested traffic flows. Extensive simulation results show that our proposed TALONet scheme is superior to other existing protocols. Comparing to TARA [11], Backpressure, and naïve (without congestion control) schemes, the improvement on the number of dropped packets can be achieved to about 45%, 51%, and 80%, respectively.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121884972","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 : 2009-04-22DOI: 10.1109/WTS.2009.5068984
S. Mazuelas, A. Bahillo, J. Prieto, R. Lorenzo, J. Blas, P. Fernández, F. A. Lago
The final precision achieved by a wireless location system depends basically on the accuracy of the range estimates and on the geometric distribution between anchors and target, being the second issue easier to manage in the design of a wireless location system. The results related to the impact of the geometric distribution, addressed for GNSS location systems, cannot be used directly to other wireless location systems, since the trilateration algorithms used and the characteristics of range estimates can be rather different. In this paper we develop an exhaustive study on the impact of the geometric distribution of anchors for the two most usual algorithms used in non-GNSS wireless location systems, taking into account the non ideal characteristics of the range noises in those location systems. From this study we present two parameters, particular to these two algorithms, which quantify the suitability of the geometric distribution taking values between 0 and 1, depending only on the geometric distributions. We show that armed with these new parameters, it is possible to design the wireless location system in an optimum way. Moreover, we present more optimum geometric distributions than the ones known in the literature.
{"title":"Assessment of optimum geometric distribution of anchors in non-GNSS wireless location systems","authors":"S. Mazuelas, A. Bahillo, J. Prieto, R. Lorenzo, J. Blas, P. Fernández, F. A. Lago","doi":"10.1109/WTS.2009.5068984","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068984","url":null,"abstract":"The final precision achieved by a wireless location system depends basically on the accuracy of the range estimates and on the geometric distribution between anchors and target, being the second issue easier to manage in the design of a wireless location system. The results related to the impact of the geometric distribution, addressed for GNSS location systems, cannot be used directly to other wireless location systems, since the trilateration algorithms used and the characteristics of range estimates can be rather different. In this paper we develop an exhaustive study on the impact of the geometric distribution of anchors for the two most usual algorithms used in non-GNSS wireless location systems, taking into account the non ideal characteristics of the range noises in those location systems. From this study we present two parameters, particular to these two algorithms, which quantify the suitability of the geometric distribution taking values between 0 and 1, depending only on the geometric distributions. We show that armed with these new parameters, it is possible to design the wireless location system in an optimum way. Moreover, we present more optimum geometric distributions than the ones known in the literature.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129196272","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 : 2009-04-22DOI: 10.1109/WTS.2009.5068994
F. Ishizaki, G. Hwang
Assuming a logarithmic rate model for SISO (Single-Input Single-Output) systems, the information theoretic capacity under scheduling algorithms exploiting multiuser diversity in wireless networks has been studied so far. However, in many cases, the throughput achieved in real wireless networks is very different from (and is much less than) the information theoretic capacity obtained under the assumption of the logarithmic rate model, and the rate functions in real wireless networks are very different from the logarithmic rate model. Hence, to examine the usefulness of the scheduling algorithms exploiting multiuser diversity in real wireless networks, we should study the throughput performance under more realistic rate function model rather than the information theoretic capacity under the logarithmic rate model. In this paper, we consider a wireless network where QPF (Quantized Proportional Fair) scheduling and AMC (adaptive modulation and coding) scheme are employed. Assuming a realistic rate function of AMC, we then analyze the throughput performance under the QPF scheduling with the AMC scheme. We also provide numerical results to investigate the usefulness of the QPF scheduling with the AMC scheme.
{"title":"Throughput performance of quantized proportional fair scheduling with adaptive modulation and coding","authors":"F. Ishizaki, G. Hwang","doi":"10.1109/WTS.2009.5068994","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068994","url":null,"abstract":"Assuming a logarithmic rate model for SISO (Single-Input Single-Output) systems, the information theoretic capacity under scheduling algorithms exploiting multiuser diversity in wireless networks has been studied so far. However, in many cases, the throughput achieved in real wireless networks is very different from (and is much less than) the information theoretic capacity obtained under the assumption of the logarithmic rate model, and the rate functions in real wireless networks are very different from the logarithmic rate model. Hence, to examine the usefulness of the scheduling algorithms exploiting multiuser diversity in real wireless networks, we should study the throughput performance under more realistic rate function model rather than the information theoretic capacity under the logarithmic rate model. In this paper, we consider a wireless network where QPF (Quantized Proportional Fair) scheduling and AMC (adaptive modulation and coding) scheme are employed. Assuming a realistic rate function of AMC, we then analyze the throughput performance under the QPF scheduling with the AMC scheme. We also provide numerical results to investigate the usefulness of the QPF scheduling with the AMC scheme.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129343547","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 : 2009-04-22DOI: 10.1109/WTS.2009.5068960
Kuong-Ho Chen, Jyh-ming Huang, Chieh-Chuan Hsiao
Due to the power restriction of sensor nodes, efficient routing, in wireless sensor networks, is a critical approach to saving node's energy and thus prolonging the network lifetime. Even the chain-based routing is one of significant routing mechanisms, several common flaws, such as data propagation delay and redundant transmission, are associated. In this paper, we propose an energy efficient Chain-Based Hierarchical Routing Protocol, named as CHIRON, to alleviate such deficiencies. Based on the BeamStar concept [9], the main idea of CHIRON is to split the sensing field into a number of smaller areas, so that it can create multiple shorter chains to reduce the data transmission delay and redundant path, and therefore effectively conserve the node energy and prolong the network lifetime. Simulation results show that, in contrast to Enhanced PEGASIS and PEGASIS protocols, the proposed CHIRON can achieve about 15% and 168% improvements on average data propagation delay, 30% and 65% improvements on redundant transmission path, respectively. By these contributions, the network lifetime can also be extended to about 14%∼7% and 50%∼23%, under various small and large simulation areas, respectively.
{"title":"CHIRON: An energy-efficient chain-based hierarchical routing protocol in wireless sensor networks","authors":"Kuong-Ho Chen, Jyh-ming Huang, Chieh-Chuan Hsiao","doi":"10.1109/WTS.2009.5068960","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068960","url":null,"abstract":"Due to the power restriction of sensor nodes, efficient routing, in wireless sensor networks, is a critical approach to saving node's energy and thus prolonging the network lifetime. Even the chain-based routing is one of significant routing mechanisms, several common flaws, such as data propagation delay and redundant transmission, are associated. In this paper, we propose an energy efficient Chain-Based Hierarchical Routing Protocol, named as CHIRON, to alleviate such deficiencies. Based on the BeamStar concept [9], the main idea of CHIRON is to split the sensing field into a number of smaller areas, so that it can create multiple shorter chains to reduce the data transmission delay and redundant path, and therefore effectively conserve the node energy and prolong the network lifetime. Simulation results show that, in contrast to Enhanced PEGASIS and PEGASIS protocols, the proposed CHIRON can achieve about 15% and 168% improvements on average data propagation delay, 30% and 65% improvements on redundant transmission path, respectively. By these contributions, the network lifetime can also be extended to about 14%∼7% and 50%∼23%, under various small and large simulation areas, respectively.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127764460","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 : 2009-04-22DOI: 10.1109/WTS.2009.5068972
J. Shell
Across the globe mobile devices are a facet of everyday life. The technology that is encapsulated within these units is accelerating at a phenomenal rate. The addition of a wide range of network connectivity, from InfraRed (IR) to Wireless Local Area Network (WLAN) and more predominantly Bluetooth, has increased the scope of the applications that can be developed and utilised within this market. The demands of ever evolving technology within mobile phones places large burdens on developers to deploy applications to market at an equal rate. Previous pieces of research have highlighted the benefits of utilising a framework in the development of applications. Through the use of Iterative modeling and software prototypes this paper presents an application framework to reduce the complexity and knowledge base necessary to construct a Bluetooth multi-user application. To reduce hardware dependency the framework has been developed on Java 2 Platform, Micro Edition (J2ME). It is also identified that Bluetooth technology within resource restricted devices is prone to security issues. The issues surrounding human interaction in device authentication are addressed by this paper through the addition of an automated Diffie-Hellman key exchange authentication connection process.
{"title":"Development and implementation of authenticated multi-user mobile Java applications","authors":"J. Shell","doi":"10.1109/WTS.2009.5068972","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068972","url":null,"abstract":"Across the globe mobile devices are a facet of everyday life. The technology that is encapsulated within these units is accelerating at a phenomenal rate. The addition of a wide range of network connectivity, from InfraRed (IR) to Wireless Local Area Network (WLAN) and more predominantly Bluetooth, has increased the scope of the applications that can be developed and utilised within this market. The demands of ever evolving technology within mobile phones places large burdens on developers to deploy applications to market at an equal rate. Previous pieces of research have highlighted the benefits of utilising a framework in the development of applications. Through the use of Iterative modeling and software prototypes this paper presents an application framework to reduce the complexity and knowledge base necessary to construct a Bluetooth multi-user application. To reduce hardware dependency the framework has been developed on Java 2 Platform, Micro Edition (J2ME). It is also identified that Bluetooth technology within resource restricted devices is prone to security issues. The issues surrounding human interaction in device authentication are addressed by this paper through the addition of an automated Diffie-Hellman key exchange authentication connection process.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126242493","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 : 2009-04-22DOI: 10.1109/WTS.2009.5068979
Z. Ahmadian, Somayeh Salimi, A. Salahi
In this paper we propose two new attacks on UMTS network. Both attacks exploit the UMTS-GSM interworking and are possible in the GSM access area of UMTS network. The first attack allows the attacker to eavesdrop on the entire traffic of the victim UMTS subscriber in the GERAN coverage of the UMTS network. The second attack is an impersonation attack i.e. the attacker impersonates a genuine UMTS subscriber to a UMTS network and fools the network to provide services at the expense of the victim subscriber in its GERAN coverage.
{"title":"New attacks on UMTS network access","authors":"Z. Ahmadian, Somayeh Salimi, A. Salahi","doi":"10.1109/WTS.2009.5068979","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068979","url":null,"abstract":"In this paper we propose two new attacks on UMTS network. Both attacks exploit the UMTS-GSM interworking and are possible in the GSM access area of UMTS network. The first attack allows the attacker to eavesdrop on the entire traffic of the victim UMTS subscriber in the GERAN coverage of the UMTS network. The second attack is an impersonation attack i.e. the attacker impersonates a genuine UMTS subscriber to a UMTS network and fools the network to provide services at the expense of the victim subscriber in its GERAN coverage.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131422221","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 : 2009-04-22DOI: 10.1109/WTS.2009.5068936
Lei Chen, D. Yuan
Common Pilot Channel (CPICH) power is a crucial parameter in coverage planning of today's UMTS networks that implement both HSDPA and R99 services. Adopting a non-uniform allocation of cell CPICH power and minimizing its amount necessary for coverage, the resulting power saving significantly improves HSDPA performance. At the same time, it is vital to have the desired level R99 soft handover, which is heavily influenced by CPICH. In this paper, we demonstrate how large scale optimization can deal with both tasks. Our approach focuses on enhancing cell-edge HSDPA data rate, subject to requirements of CPICH coverage and the level of R99 soft(-er) handover. We present a solution algorithm that optimizes CPICH allocation for HSDPA performance, and, in parallel, offers accurate control of R99 soft handover. Experimental results for large and realistic network planning scenarios demonstrate the benefit of our optimization approach.
{"title":"Achieving higher HSDPA performance and preserving R99 soft handover control by large scale optimization in CPICH coverage planning","authors":"Lei Chen, D. Yuan","doi":"10.1109/WTS.2009.5068936","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068936","url":null,"abstract":"Common Pilot Channel (CPICH) power is a crucial parameter in coverage planning of today's UMTS networks that implement both HSDPA and R99 services. Adopting a non-uniform allocation of cell CPICH power and minimizing its amount necessary for coverage, the resulting power saving significantly improves HSDPA performance. At the same time, it is vital to have the desired level R99 soft handover, which is heavily influenced by CPICH. In this paper, we demonstrate how large scale optimization can deal with both tasks. Our approach focuses on enhancing cell-edge HSDPA data rate, subject to requirements of CPICH coverage and the level of R99 soft(-er) handover. We present a solution algorithm that optimizes CPICH allocation for HSDPA performance, and, in parallel, offers accurate control of R99 soft handover. Experimental results for large and realistic network planning scenarios demonstrate the benefit of our optimization approach.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116302716","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 : 2009-04-22DOI: 10.1109/WTS.2009.5068955
William Palmer, B. McCarthy, C. Edwards
The process of testing software that is to be deployed across an adhoc mobile networking environment is inherently challenging. The mobile domain introduces variable conditions mainly due to the wireless communications and the changing topology of the underlying network. Testing software is therefore difficult because of the sheer number of variables that must be considered in order to realistically replicate the intended deployment environment. In this paper we provide a comparison of two static, lab-based Mobile Adhoc Network (MANET) emulation techniques: MAC address filtration and channel separation. These techniques were deployed and tested on a testbed that had global communication links to the Internet. These techniques have been designed to help developers emulate the effects that mobility will have on their protocols and applications in a realistic environment, while reducing resource cost and logistical complexities that are inherent problems when testing across the intended network deployment. Specifically, we focus on the radio interference apparent in the two emulation techniques and show its affect on network performance.
{"title":"A comparison of MANET emulation techniques for the production of a realistic testbed with global communication capabilities","authors":"William Palmer, B. McCarthy, C. Edwards","doi":"10.1109/WTS.2009.5068955","DOIUrl":"https://doi.org/10.1109/WTS.2009.5068955","url":null,"abstract":"The process of testing software that is to be deployed across an adhoc mobile networking environment is inherently challenging. The mobile domain introduces variable conditions mainly due to the wireless communications and the changing topology of the underlying network. Testing software is therefore difficult because of the sheer number of variables that must be considered in order to realistically replicate the intended deployment environment. In this paper we provide a comparison of two static, lab-based Mobile Adhoc Network (MANET) emulation techniques: MAC address filtration and channel separation. These techniques were deployed and tested on a testbed that had global communication links to the Internet. These techniques have been designed to help developers emulate the effects that mobility will have on their protocols and applications in a realistic environment, while reducing resource cost and logistical complexities that are inherent problems when testing across the intended network deployment. Specifically, we focus on the radio interference apparent in the two emulation techniques and show its affect on network performance.","PeriodicalId":313087,"journal":{"name":"2009 Wireless Telecommunications Symposium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121998830","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
扫码关注我们
求助内容：
应助结果提醒方式：