Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382583
V. Ranatunga, Akira Hosokawa, K. Kinoshita, N. Yamai, K. Murakami
With the rapid increase of global connectivity, various types of distributed computer systems are being implemented to process information located in all parts of the world. Some distributed computing systems such as multi-agent systems require the same task to be applied to many individual instances of data located on disparate nodes. In such an environment, however, some agents may finish earlier than the others, due to the difference in the volume of data to be processed on a node and/or competition with other users' agents running on the same node. In this case, the time taken to complete the task depends on the slowest agent. Most of the existing scheduling algorithms hardly consider the status of the whole system for this type of application. In this paper, we propose and evaluate a fair and effective scheduling algorithm for multi-agent systems based on the processing status of each agent, the CPU power of each node, and the computational demand of each user. Simulation experiments show excellent performance of our scheduling algorithm.
{"title":"A Fair and Effective Scheduling Algorithm for Multi-Agent Systems","authors":"V. Ranatunga, Akira Hosokawa, K. Kinoshita, N. Yamai, K. Murakami","doi":"10.1109/COMSWA.2007.382583","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382583","url":null,"abstract":"With the rapid increase of global connectivity, various types of distributed computer systems are being implemented to process information located in all parts of the world. Some distributed computing systems such as multi-agent systems require the same task to be applied to many individual instances of data located on disparate nodes. In such an environment, however, some agents may finish earlier than the others, due to the difference in the volume of data to be processed on a node and/or competition with other users' agents running on the same node. In this case, the time taken to complete the task depends on the slowest agent. Most of the existing scheduling algorithms hardly consider the status of the whole system for this type of application. In this paper, we propose and evaluate a fair and effective scheduling algorithm for multi-agent systems based on the processing status of each agent, the CPU power of each node, and the computational demand of each user. Simulation experiments show excellent performance of our scheduling algorithm.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"58 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":"126334489","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.382607
Omanand Jha Vatsa, M. Raj, R. K. Kalle, D. Panigrahy, D. Das
WiMAX standard for mobility (IEEE 802.16e) addresses the issues related to energy conservation at Mobile Subscriber Station (MSS) in sleep mode. In 802.16e the sleep mode is exponentially distributed according to traffic, The algorithm that deals with sleep mode energy consumption in 802.16e network does not address the problem of varying traffic rates. This paper proposes an adaptive sleep mode interval control algorithm for 802.16e, which takes into account the downlink traffic pattern to minimize energy consumption. Moreover, we characterize the standardized sleep mode in IEEE 802.16e MSS taking into account various situation like, moving into sleep, listening or wake-up modes. It has been observed that our proposed algorithm for sleep mode saves substantial amount of energy at lower traffic and almost same at higher traffic as compared to 802.16e. The results reveal that the optimization of sleep mode leads to decrease in average waiting time delay at MSS. Furthermore, our analytical evaluations are close to simulation results.
{"title":"Adaptive Power Saving Algorithm for Mobile Subscriber Station in 802.16e","authors":"Omanand Jha Vatsa, M. Raj, R. K. Kalle, D. Panigrahy, D. Das","doi":"10.1109/COMSWA.2007.382607","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382607","url":null,"abstract":"WiMAX standard for mobility (IEEE 802.16e) addresses the issues related to energy conservation at Mobile Subscriber Station (MSS) in sleep mode. In 802.16e the sleep mode is exponentially distributed according to traffic, The algorithm that deals with sleep mode energy consumption in 802.16e network does not address the problem of varying traffic rates. This paper proposes an adaptive sleep mode interval control algorithm for 802.16e, which takes into account the downlink traffic pattern to minimize energy consumption. Moreover, we characterize the standardized sleep mode in IEEE 802.16e MSS taking into account various situation like, moving into sleep, listening or wake-up modes. It has been observed that our proposed algorithm for sleep mode saves substantial amount of energy at lower traffic and almost same at higher traffic as compared to 802.16e. The results reveal that the optimization of sleep mode leads to decrease in average waiting time delay at MSS. Furthermore, our analytical evaluations are close to simulation results.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"77 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":"117045474","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.382608
Sang-Jin Kim, Woo-Jae Kim, Young-Joo Suh
The IEEE 802.16 provides a reservation-based MAC protocol for high speed broadband wireless services. A subscriber station (SS) which wishes to transmit data transmits a bandwidth request message to its base station (BS) to reserve the resource. However, if the bandwidth request message is transmitted by a contention-based scheme, the collision probability of the bandwidth request message may be increased as the number of contending subscriber stations increases. In worst case, the BS cannot allocate the bandwidth to stations due to the failure of the bandwidth request procedure although the BS has enough bandwidth. In this paper, we propose an efficient bandwidth request scheme that appropriately uses a contention-based scheme and a contention-free scheme according to the network condition for non-real-time services such as nrtPS and BE. The proposed scheme determines when the contention-free based bandwidth request scheme can be used, and it allocates more bandwidth to SSs than the contention-based scheme. We implemented the IEEE 802.16 MAC protocol and the proposed scheme in the ns-2 simulator, and evaluated the performance. The simulation results show that the proposed scheme can allocate more bandwidth to nrtPS and BE flows without any influence to UGS and rtPS flows. The simulation results also show that the proposed scheme shows improved performance compared with existing contention-based schemes.
{"title":"An Efficient Bandwidth Request Mechanism for Non-Real-Time Services in IEEE 802.16 Systems","authors":"Sang-Jin Kim, Woo-Jae Kim, Young-Joo Suh","doi":"10.1109/COMSWA.2007.382608","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382608","url":null,"abstract":"The IEEE 802.16 provides a reservation-based MAC protocol for high speed broadband wireless services. A subscriber station (SS) which wishes to transmit data transmits a bandwidth request message to its base station (BS) to reserve the resource. However, if the bandwidth request message is transmitted by a contention-based scheme, the collision probability of the bandwidth request message may be increased as the number of contending subscriber stations increases. In worst case, the BS cannot allocate the bandwidth to stations due to the failure of the bandwidth request procedure although the BS has enough bandwidth. In this paper, we propose an efficient bandwidth request scheme that appropriately uses a contention-based scheme and a contention-free scheme according to the network condition for non-real-time services such as nrtPS and BE. The proposed scheme determines when the contention-free based bandwidth request scheme can be used, and it allocates more bandwidth to SSs than the contention-based scheme. We implemented the IEEE 802.16 MAC protocol and the proposed scheme in the ns-2 simulator, and evaluated the performance. The simulation results show that the proposed scheme can allocate more bandwidth to nrtPS and BE flows without any influence to UGS and rtPS flows. The simulation results also show that the proposed scheme shows improved performance compared with existing contention-based schemes.","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":"122520956","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.382579
Christophe Baraer, Kaustubh S. Phanse, Johan Nykvist, L. Birsa
We present a novel distributed range-free technique called ExPLoIT for estimating geographical location of sensor nodes in mobile sensor networks. ExPLoIT is the first positioning technique that exploits location information at regular nodes in addition to using seeds. The key idea is the notion of confidence that a node has in its location estimate which can be used by other nodes for localization. Using Monte Carlo integration, a node estimates its current location and confidence based on its past location and the location information it receives from its neighbors. Node mobility is exploited to transitively localize the network. Our extensive simulation study shows that our proposal outperforms three other state-of-the-art range-free localization techniques under a wide range of conditions. The strength of ExPLoIT is that it is robust to irregular radio propagation, arbitrary seed and node density, and stochastic seed and node mobility; no special hardware is necessary at sensor nodes.
{"title":"ExPLoIT: Exploiting Past Location Information and Transitivity for positioning in mobile sensor networks","authors":"Christophe Baraer, Kaustubh S. Phanse, Johan Nykvist, L. Birsa","doi":"10.1109/COMSWA.2007.382579","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382579","url":null,"abstract":"We present a novel distributed range-free technique called ExPLoIT for estimating geographical location of sensor nodes in mobile sensor networks. ExPLoIT is the first positioning technique that exploits location information at regular nodes in addition to using seeds. The key idea is the notion of confidence that a node has in its location estimate which can be used by other nodes for localization. Using Monte Carlo integration, a node estimates its current location and confidence based on its past location and the location information it receives from its neighbors. Node mobility is exploited to transitively localize the network. Our extensive simulation study shows that our proposal outperforms three other state-of-the-art range-free localization techniques under a wide range of conditions. The strength of ExPLoIT is that it is robust to irregular radio propagation, arbitrary seed and node density, and stochastic seed and node mobility; no special hardware is necessary at sensor nodes.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"349 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":"122851124","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.382456
V. M. D. Jagannath, B. Raman
Sensor nodes combined with MEMS sensors can form a complete replacement for the existing cumbersome predictive maintenance systems. We have designed a system that can be used to monitor the bearing conditions of induction motors. The system called as WiBeaM (wireless bearing monitoring system) forms a network of sensor nodes that sense the vibration on motors and transmit the same to a central base station, this data is further analyzed through signal processing for defect diagnosis. We have used cheap off the shelf components to realise a real world application at a very low cost. Considering the low cost and the ease of deployment, our application is one of its kind in the domain. The solution has been implemented on Moteiv's Tmote-Sky nodes using ADXL105 accelerometer from Analog devices.The solution includes an application layer, transport layer for reliable data transfer and a MAC protocol for low power consumption. The challenges in the implementation span from the hardware to software. The aim was to select a cheap yet efficient sensor that could be compatible with the sensor node and build a software that can automat the otherwise cumbersome process of bearing monitoring. Whilst developing the application we have found that by proper selection of transmit power of the radio, single hop wireless transmission is more power efficient than the multihop. In sum, we have proved the viability of machinery vibration monitoring with wireless network technology by conducting testbed trials.
{"title":"WiBeaM:Wireless Bearing Monitoring System","authors":"V. M. D. Jagannath, B. Raman","doi":"10.1109/COMSWA.2007.382456","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382456","url":null,"abstract":"Sensor nodes combined with MEMS sensors can form a complete replacement for the existing cumbersome predictive maintenance systems. We have designed a system that can be used to monitor the bearing conditions of induction motors. The system called as WiBeaM (wireless bearing monitoring system) forms a network of sensor nodes that sense the vibration on motors and transmit the same to a central base station, this data is further analyzed through signal processing for defect diagnosis. We have used cheap off the shelf components to realise a real world application at a very low cost. Considering the low cost and the ease of deployment, our application is one of its kind in the domain. The solution has been implemented on Moteiv's Tmote-Sky nodes using ADXL105 accelerometer from Analog devices.The solution includes an application layer, transport layer for reliable data transfer and a MAC protocol for low power consumption. The challenges in the implementation span from the hardware to software. The aim was to select a cheap yet efficient sensor that could be compatible with the sensor node and build a software that can automat the otherwise cumbersome process of bearing monitoring. Whilst developing the application we have found that by proper selection of transmit power of the radio, single hop wireless transmission is more power efficient than the multihop. In sum, we have proved the viability of machinery vibration monitoring with wireless network technology by conducting testbed trials.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"173 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":"115197123","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.382574
P. Sahoo, J. Sheu, Wei-Shin Lin
In wireless sensor network, accidental death of nodes in predictable or unpredictable way may cause coverage and connectivity problems of the original network. In this paper, potential approaches to maintain the network in the post deployment scenario is proposed that lets the sensors work alternatively by identifying the redundant sensing regions in the dense networks under the assumption that the transmission range (Rc) is equal to the sensing range (Rs) or <; 2Rs of a node. The proposed coverage and connectivity maintenance algorithms decide which neighbors of a dead node to migrate, and to what distance, so that the loss of coverage and connectivity can be repaired with low mobility of the nodes. In this work, decision and movement of the nodes are completely autonomous and involve movement of only one-hop neighbors of a dead node to minimize energy consumption due to mobility. Performance analysis of the algorithms show that average mobility distance of the nodes is very small and energy consumption is very less by maintaining the coverage and connectivity.
{"title":"Dynamic Coverage and Connectivity Maintenance Algorithms for Wireless Sensor Networks","authors":"P. Sahoo, J. Sheu, Wei-Shin Lin","doi":"10.1109/COMSWA.2007.382574","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382574","url":null,"abstract":"In wireless sensor network, accidental death of nodes in predictable or unpredictable way may cause coverage and connectivity problems of the original network. In this paper, potential approaches to maintain the network in the post deployment scenario is proposed that lets the sensors work alternatively by identifying the redundant sensing regions in the dense networks under the assumption that the transmission range (Rc) is equal to the sensing range (Rs) or <; 2Rs of a node. The proposed coverage and connectivity maintenance algorithms decide which neighbors of a dead node to migrate, and to what distance, so that the loss of coverage and connectivity can be repaired with low mobility of the nodes. In this work, decision and movement of the nodes are completely autonomous and involve movement of only one-hop neighbors of a dead node to minimize energy consumption due to mobility. Performance analysis of the algorithms show that average mobility distance of the nodes is very small and energy consumption is very less by maintaining the coverage and connectivity.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"11 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":"132517644","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.382467
R. Viswanathan
We compare the signal-to-noise ratio performances of an amplify-forward relay link and a direct link in a wireless sensor network. For a slow Rayleigh fading channel, an exact expression for the probability that the SNR of an amplify-forward relay link exceeds the SNR of a direct link is obtained. For a Rician fading channel, an upper bound for the corresponding probability is obtained. Numerical results indicate that, among the two fading channels considered, Rayleigh fading is more detrimental to the SNR performance of the amplify-forward relaying scheme.
{"title":"Signal-to-Noise Ratio Comparison of Amplify-Forward and Direct Link in Wireless Sensor Networks","authors":"R. Viswanathan","doi":"10.1109/COMSWA.2007.382467","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382467","url":null,"abstract":"We compare the signal-to-noise ratio performances of an amplify-forward relay link and a direct link in a wireless sensor network. For a slow Rayleigh fading channel, an exact expression for the probability that the SNR of an amplify-forward relay link exceeds the SNR of a direct link is obtained. For a Rician fading channel, an upper bound for the corresponding probability is obtained. Numerical results indicate that, among the two fading channels considered, Rayleigh fading is more detrimental to the SNR performance of the amplify-forward relaying scheme.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"10 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132605752","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.382430
T. Mukherjee, Qinghui Tang, Corbett Ziesman, S. Gupta, Phil Cayton
Minimizing the energy cost and improving thermal performance of power-limited datacenters, deploying large computing clusters, are the key issues towards optimizing their computing resources and maximally exploiting the computation capabilities. In this paper, we develop a unique merger between the physical infrastructure and resource management functions of a cluster management system to take a holistic view of datacenter management, and make global (at the level of a datacenter) thermal-aware job scheduling decisions. A software architecture is presented in this regard and implemented in a fully operational computational cluster in the ASU datacenter. The proposed architecture develops a feedback-control loop, by combining information from ambient and on-board sensors with the node allocation and job scheduling mechanisms, for managing the system load depending on the thermal distribution in the datacenter.
{"title":"Software Architecture for Dynamic Thermal Management in Datacenters","authors":"T. Mukherjee, Qinghui Tang, Corbett Ziesman, S. Gupta, Phil Cayton","doi":"10.1109/COMSWA.2007.382430","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382430","url":null,"abstract":"Minimizing the energy cost and improving thermal performance of power-limited datacenters, deploying large computing clusters, are the key issues towards optimizing their computing resources and maximally exploiting the computation capabilities. In this paper, we develop a unique merger between the physical infrastructure and resource management functions of a cluster management system to take a holistic view of datacenter management, and make global (at the level of a datacenter) thermal-aware job scheduling decisions. A software architecture is presented in this regard and implemented in a fully operational computational cluster in the ASU datacenter. The proposed architecture develops a feedback-control loop, by combining information from ambient and on-board sensors with the node allocation and job scheduling mechanisms, for managing the system load depending on the thermal distribution in the datacenter.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"55 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":"131593160","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.382464
Amit Vartak, Sohail Ahmad, K. Gopinath
Wireless Local Area Networks (WLANs) can open certain security backdoors which cannot be mitigated by conventional security mechanisms such as firewalls. This has lead to the development and quick adoption of a new suite of products that specialize in securing a network from the WLAN based security threats. Such products, known as Wireless Intrusion Prevention System (WIPS), not only detect wireless intrusions, but can also prevent them. One of the popular methods used in a WIPS for intrusion prevention is Over-The-Air (OTA) prevention which involves the transmission of specially crafted Medium Access Control (MAC) level packets over the wireless medium. Although OTA prevention is generally based on known MAC level denial-of-service techniques, there is little information available on the strengths and limitations of such techniques in mitigating unauthorized communication. In this paper, we first provide a test-bed based experimental evaluation of several (four) OTA prevention techniques in mitigating unauthorized wireless communication. Experimental results demonstrate that: (i) none of the considered OTA techniques may individually be able to prevent all the wireless threat scenarios reliably, (ii) certain techniques can fail against devices from certain vendors, and, (iii) OTA techniques require continual transmission of MAC level packets for effective blockage. Finally, we discuss the implications of the experimental results on the design of a WIPS.
{"title":"An Experimental Evaluation of Over-The-Air (OTA) Wireless Intrusion Prevention Techniques","authors":"Amit Vartak, Sohail Ahmad, K. Gopinath","doi":"10.1109/COMSWA.2007.382464","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382464","url":null,"abstract":"Wireless Local Area Networks (WLANs) can open certain security backdoors which cannot be mitigated by conventional security mechanisms such as firewalls. This has lead to the development and quick adoption of a new suite of products that specialize in securing a network from the WLAN based security threats. Such products, known as Wireless Intrusion Prevention System (WIPS), not only detect wireless intrusions, but can also prevent them. One of the popular methods used in a WIPS for intrusion prevention is Over-The-Air (OTA) prevention which involves the transmission of specially crafted Medium Access Control (MAC) level packets over the wireless medium. Although OTA prevention is generally based on known MAC level denial-of-service techniques, there is little information available on the strengths and limitations of such techniques in mitigating unauthorized communication. In this paper, we first provide a test-bed based experimental evaluation of several (four) OTA prevention techniques in mitigating unauthorized wireless communication. Experimental results demonstrate that: (i) none of the considered OTA techniques may individually be able to prevent all the wireless threat scenarios reliably, (ii) certain techniques can fail against devices from certain vendors, and, (iii) OTA techniques require continual transmission of MAC level packets for effective blockage. Finally, we discuss the implications of the experimental results on the design of a WIPS.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"80 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":"114619795","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.382491
Vijender Busi Reddy, A. Sarje
TCP is the most commonly used data transfer protocol. It assumes every packet loss to be congestion loss and reduces the sending rate. This will decrease the sender's throughput when there is an appreciable rate of packet loss due to link error and not due to congestion. This issue is significant for wireless links. We present an extension of TCP-Casablanca, which improves TCP performance over wireless links. A new discriminator is proposed that not only differentiates congestion and wireless losses, but also identifies the congestion level in the network, i.e., whether the network is lightly congested or heavily congested and throttles the sender's rate according to the congestion level in the network.
{"title":"Differentiation of Wireless and Congestion Losses in TCP","authors":"Vijender Busi Reddy, A. Sarje","doi":"10.1109/COMSWA.2007.382491","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382491","url":null,"abstract":"TCP is the most commonly used data transfer protocol. It assumes every packet loss to be congestion loss and reduces the sending rate. This will decrease the sender's throughput when there is an appreciable rate of packet loss due to link error and not due to congestion. This issue is significant for wireless links. We present an extension of TCP-Casablanca, which improves TCP performance over wireless links. A new discriminator is proposed that not only differentiates congestion and wireless losses, but also identifies the congestion level in the network, i.e., whether the network is lightly congested or heavily congested and throttles the sender's rate according to the congestion level in the network.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"9 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":"124209970","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
扫码关注我们
求助内容：
应助结果提醒方式：