Pub Date : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683097
P. Pathak, R. Dutta
When shortest path routing is employed in large scale multi-hop wireless networks, nodes located near the center of the network have to perform disproportionate amount of relaying for others. To solve the problem, various divergent routing schemes are used which route the data on center-avoiding divergent routing paths. Though they achieve better load balancing, overall relaying is increased significantly due to their longer routing paths. In this paper, we propose power control as a way for balancing relay load and mitigating hot-spots in wireless networks. Using a heuristic based on the concept of centrality, we show that if we increase the power levels of only the nodes which are expected to relay more packets, significant relay load balancing can be achieved even with shortest path routing. Different from divergent routing schemes, such load balancing strategy is applicable to any arbitrary topology. Also, it is shown that centrality based power control results into better throughput capacity in many different topologies.
{"title":"Using Centrality-Based Power Control for Hot-Spot Mitigation in Wireless Networks","authors":"P. Pathak, R. Dutta","doi":"10.1109/GLOCOM.2010.5683097","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683097","url":null,"abstract":"When shortest path routing is employed in large scale multi-hop wireless networks, nodes located near the center of the network have to perform disproportionate amount of relaying for others. To solve the problem, various divergent routing schemes are used which route the data on center-avoiding divergent routing paths. Though they achieve better load balancing, overall relaying is increased significantly due to their longer routing paths. In this paper, we propose power control as a way for balancing relay load and mitigating hot-spots in wireless networks. Using a heuristic based on the concept of centrality, we show that if we increase the power levels of only the nodes which are expected to relay more packets, significant relay load balancing can be achieved even with shortest path routing. Different from divergent routing schemes, such load balancing strategy is applicable to any arbitrary topology. Also, it is shown that centrality based power control results into better throughput capacity in many different topologies.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"46 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88961203","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683911
H. Kubo, R. Shinkuma, Tatsuro Takahashi
The enhancements of the transmission speed in wireless access networks and mobile-device capacity enable us to use data/audio streaming/video streaming multicast service in large scale networks via their personal mobile devices. Peer-to-peer (P2P) architecture ensures scalability and robustness more easily and more economically than server-client architecture; as the number of nodes in a P2P network increases, the amount of workload per node decreases and lessens the impact of node failure. However, mobile users feel much larger psychological cost due to strict limitations on bandwidth, processing power, memory capacity, and battery life, and they want to minimize their contributions to these services. Therefore, the issue of how we can reduce this psychological cost remains. In this paper, we consider how effective a social networking service is as a platform for mobile P2P multicast. We model users' cooperative behaviors in mobile P2P multicast streaming, and propose a social-network based P2P streaming architecture for mobile networks. We also measured the psychological forwarding cost of real users in mobile P2P multicast streaming through an emulation experiment, and verify that our social-network based mobile P2P multicast streaming improves service quality by reducing the psychological forwarding cost using multi-agent simulation.
{"title":"Mobile P2P Multicast Based on Social Network Reducing Psychological Forwarding Cost","authors":"H. Kubo, R. Shinkuma, Tatsuro Takahashi","doi":"10.1109/GLOCOM.2010.5683911","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683911","url":null,"abstract":"The enhancements of the transmission speed in wireless access networks and mobile-device capacity enable us to use data/audio streaming/video streaming multicast service in large scale networks via their personal mobile devices. Peer-to-peer (P2P) architecture ensures scalability and robustness more easily and more economically than server-client architecture; as the number of nodes in a P2P network increases, the amount of workload per node decreases and lessens the impact of node failure. However, mobile users feel much larger psychological cost due to strict limitations on bandwidth, processing power, memory capacity, and battery life, and they want to minimize their contributions to these services. Therefore, the issue of how we can reduce this psychological cost remains. In this paper, we consider how effective a social networking service is as a platform for mobile P2P multicast. We model users' cooperative behaviors in mobile P2P multicast streaming, and propose a social-network based P2P streaming architecture for mobile networks. We also measured the psychological forwarding cost of real users in mobile P2P multicast streaming through an emulation experiment, and verify that our social-network based mobile P2P multicast streaming improves service quality by reducing the psychological forwarding cost using multi-agent simulation.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88998049","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683084
Huang Lu, Jie Li, H. Kameda
In this paper, we study the secure routing for cluster-based sensor networks where clusters are formed dynamically and periodically. We point out the deficiency in the secure routing protocols with symmetric key pairing. Along with the investigation of ID-based cryptography for security in WSNs, we propose a new secure routing protocol with ID-based signature scheme for cluster-based WSNs, in which the security relies on the hardness of the Diffie-Hellman problem in the random oracle model. Because of the communication overhead for security, we provide analysis and simulation results in details to illustrate how various parameters act between security and energy efficiency.
{"title":"A Secure Routing Protocol for Cluster-Based Wireless Sensor Networks Using ID-Based Digital Signature","authors":"Huang Lu, Jie Li, H. Kameda","doi":"10.1109/GLOCOM.2010.5683084","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683084","url":null,"abstract":"In this paper, we study the secure routing for cluster-based sensor networks where clusters are formed dynamically and periodically. We point out the deficiency in the secure routing protocols with symmetric key pairing. Along with the investigation of ID-based cryptography for security in WSNs, we propose a new secure routing protocol with ID-based signature scheme for cluster-based WSNs, in which the security relies on the hardness of the Diffie-Hellman problem in the random oracle model. Because of the communication overhead for security, we provide analysis and simulation results in details to illustrate how various parameters act between security and energy efficiency.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"9 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89218000","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5684079
Yongzhao Li, L. Cimini, Hailin Zhang, N. Himayat
In this paper, the impact of co-channel MIMO interference on MIMO Beamforming (MBF) in the desired link is investigated. The exact closed-form expression of the probability density function (pdf ) of the signal-to-interference ratio when the desired user has one antenna is derived. Due to the unavailability of the closed-form pdf expression for arbitrary (N,M) (where N and M are the number of transmit and receive antennas, respectively), a simple approximation for an arbitrary number of antennas is proposed and used to analyze the impact of various MIMO modes used by the co-channel base stations. Simulation results verify the validity of the analysis and the impact of cochannel MIMO modes on the desired MBF receiver is discussed.
{"title":"Statistical Analysis of MIMO Beamforming with Co-Channel MIMO Interferers Under Rayleigh Fading","authors":"Yongzhao Li, L. Cimini, Hailin Zhang, N. Himayat","doi":"10.1109/GLOCOM.2010.5684079","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684079","url":null,"abstract":"In this paper, the impact of co-channel MIMO interference on MIMO Beamforming (MBF) in the desired link is investigated. The exact closed-form expression of the probability density function (pdf ) of the signal-to-interference ratio when the desired user has one antenna is derived. Due to the unavailability of the closed-form pdf expression for arbitrary (N,M) (where N and M are the number of transmit and receive antennas, respectively), a simple approximation for an arbitrary number of antennas is proposed and used to analyze the impact of various MIMO modes used by the co-channel base stations. Simulation results verify the validity of the analysis and the impact of cochannel MIMO modes on the desired MBF receiver is discussed.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"2 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88872842","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683282
Giorgio Quer, Hemanth Meenakshisundaram, T. B. Reddy, B. S. Manoj, R. Rao, M. Zorzi
Cognitive networking deals with applying cognition to the entire network protocol stack for achieving stack-wide as well as network-wide performance goals, unlike cognitive radios that apply cognition only at the physical layer. Designing a cognitive network is challenging since learning the relationship between network protocol parameters in an automated fashion is very complex. We propose to use Bayesian Network (BN) models for creating a representation of the dependence relationships among network protocol parameters. BN is a unique tool for modeling the network protocol stack as it not only learns the probabilistic dependence of network protocol parameters but also provides an opportunity to tune some of the cognitive network parameters to achieve desired performance. To the best of our knowledge, this is the first work to explore the use of BNs for cognitive networks. Creating a BN model for network parameters involves the following steps: sampling the network protocol parameters (Observe), learning the structure of the BN and its parameters from the data (Learn), using a Bayesian Network inference engine (Plan and Decide) to make decisions, and finally effecting the decisions (Act). We have proved the feasibility of achieving a BN-based cognitive network system using the ns-3 simulation platform. From the early results obtained from our cognitive network approach, we provide interesting insights on predicting the network behavior, including the performance of the TCP throughput inference engine based on other observed parameters.
认知网络处理将认知应用于整个网络协议栈，以实现堆栈范围和网络范围的性能目标，而不像认知无线电只在物理层应用认知。设计认知网络具有挑战性，因为以自动化的方式学习网络协议参数之间的关系非常复杂。我们建议使用贝叶斯网络(BN)模型来创建网络协议参数之间依赖关系的表示。BN是一种独特的网络协议栈建模工具，因为它不仅学习网络协议参数的概率依赖性，而且还提供了调整一些认知网络参数以达到预期性能的机会。据我们所知，这是第一个探索在认知网络中使用神经网络的工作。创建网络参数的BN模型包括以下步骤:对网络协议参数进行采样(Observe)，从数据中学习BN的结构及其参数(Learn)，使用贝叶斯网络推理引擎(Plan and Decide)进行决策，最后影响决策(Act)。我们利用ns-3仿真平台证明了实现基于bn的认知网络系统的可行性。从我们的认知网络方法获得的早期结果中，我们提供了关于预测网络行为的有趣见解，包括基于其他观察到的参数的TCP吞吐量推理引擎的性能。
{"title":"Cognitive Network Inference through Bayesian Network Analysis","authors":"Giorgio Quer, Hemanth Meenakshisundaram, T. B. Reddy, B. S. Manoj, R. Rao, M. Zorzi","doi":"10.1109/GLOCOM.2010.5683282","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683282","url":null,"abstract":"Cognitive networking deals with applying cognition to the entire network protocol stack for achieving stack-wide as well as network-wide performance goals, unlike cognitive radios that apply cognition only at the physical layer. Designing a cognitive network is challenging since learning the relationship between network protocol parameters in an automated fashion is very complex. We propose to use Bayesian Network (BN) models for creating a representation of the dependence relationships among network protocol parameters. BN is a unique tool for modeling the network protocol stack as it not only learns the probabilistic dependence of network protocol parameters but also provides an opportunity to tune some of the cognitive network parameters to achieve desired performance. To the best of our knowledge, this is the first work to explore the use of BNs for cognitive networks. Creating a BN model for network parameters involves the following steps: sampling the network protocol parameters (Observe), learning the structure of the BN and its parameters from the data (Learn), using a Bayesian Network inference engine (Plan and Decide) to make decisions, and finally effecting the decisions (Act). We have proved the feasibility of achieving a BN-based cognitive network system using the ns-3 simulation platform. From the early results obtained from our cognitive network approach, we provide interesting insights on predicting the network behavior, including the performance of the TCP throughput inference engine based on other observed parameters.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"43 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88881159","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683503
S. Sugiura, Sheng Chen, L. Hanzo
Motivated by the recent concept of Space-Time Shift Keying (STSK), we propose a novel cooperative STSK scheme, which is capable of achieving a flexible rate-diversity tradeoff, in the context of cooperative space-time transmissions. More specifically, in our cooperative STSK scheme each Relay Node (RN) activates Decode-and-Forward (DF) transmissions, depending on the success or failure of Cyclic Redundancy Checking (CRC). We propose a novel bit-to STSK mapping rule, where according to the input bits, one of the Q pre-assigned dispersion vectors is activated to implicitly convey log2 Q bits, which are transmitted in combination with the classic log2(L)-bit modulated symbol. Additionally, we introduce a beneficial dispersion vector design, which enables us to dispense with symbol-level Inter-Relay Synchronization (IRS). Furthermore, the Destination Node (DN) is capable of jointly detecting the signals received from the source-destination and relay-destination links, using a low-complexity single-stream-based Maximum Likelihood (ML) detector, which is an explicit benefit of our Inter-Element Interference (IEI)-free system model. More importantly, as a benefit of its design flexibility, our cooperative STSK arrangement enables us to adapt the number of the RNs, the transmission rate as well as the achievable diversity order.
{"title":"Packet-Reliability-Based Decode-and-Forward Distributed Space-Time Shift Keying","authors":"S. Sugiura, Sheng Chen, L. Hanzo","doi":"10.1109/GLOCOM.2010.5683503","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683503","url":null,"abstract":"Motivated by the recent concept of Space-Time Shift Keying (STSK), we propose a novel cooperative STSK scheme, which is capable of achieving a flexible rate-diversity tradeoff, in the context of cooperative space-time transmissions. More specifically, in our cooperative STSK scheme each Relay Node (RN) activates Decode-and-Forward (DF) transmissions, depending on the success or failure of Cyclic Redundancy Checking (CRC). We propose a novel bit-to STSK mapping rule, where according to the input bits, one of the Q pre-assigned dispersion vectors is activated to implicitly convey log2 Q bits, which are transmitted in combination with the classic log2(L)-bit modulated symbol. Additionally, we introduce a beneficial dispersion vector design, which enables us to dispense with symbol-level Inter-Relay Synchronization (IRS). Furthermore, the Destination Node (DN) is capable of jointly detecting the signals received from the source-destination and relay-destination links, using a low-complexity single-stream-based Maximum Likelihood (ML) detector, which is an explicit benefit of our Inter-Element Interference (IEI)-free system model. More importantly, as a benefit of its design flexibility, our cooperative STSK arrangement enables us to adapt the number of the RNs, the transmission rate as well as the achievable diversity order.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"39 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83100164","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683185
S. Huang, Hsiao-Chun Wu, J. Cioffi
Orthogonal frequency division multiplexing (OFDM) is a prevalent telecommunication technology to mitigate multipath distortion with high-order modulations such as quadrature amplitude modulation (QAM). However, uncoded OFDM systems also have a serious drawback of high peak-to-mean envelope power ratio (PMEPR). On the other hand, coded OFDM systems can reduce the PMEPR problem but often lead to low code rates. There is thus a tradeoff between PMEPR and code rate in the design of OFDM systems. In this paper, PMEPR reduction for OFDM 64- and 256-QAM sequences is comprehensively studied. Four new families of 64-QAM sequences and seven new families of 256-QAM sequences are proposed to achieve the lowest PMEPR, the highest code rate, or the tradeoffs between these two metrics. Through the comparison with all other OFDM 16- or 64-QAM sequences, these new families of OFDM sequences can facilitate higher code rates. Furthermore, many of these new sequences have lower PMEPR than other OFDM sequences. Adjustment of the tradeoff between PMEPR and code rate can be made to meet the stringent demand in low PMEPR or the need for high code rate subject to various system requirements. Moreover, the construction method of the proposed new sequences is quite simple.
{"title":"Novel PMEPR Control Approach for 64- and 256-QAM Coded OFDM Systems","authors":"S. Huang, Hsiao-Chun Wu, J. Cioffi","doi":"10.1109/GLOCOM.2010.5683185","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683185","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) is a prevalent telecommunication technology to mitigate multipath distortion with high-order modulations such as quadrature amplitude modulation (QAM). However, uncoded OFDM systems also have a serious drawback of high peak-to-mean envelope power ratio (PMEPR). On the other hand, coded OFDM systems can reduce the PMEPR problem but often lead to low code rates. There is thus a tradeoff between PMEPR and code rate in the design of OFDM systems. In this paper, PMEPR reduction for OFDM 64- and 256-QAM sequences is comprehensively studied. Four new families of 64-QAM sequences and seven new families of 256-QAM sequences are proposed to achieve the lowest PMEPR, the highest code rate, or the tradeoffs between these two metrics. Through the comparison with all other OFDM 16- or 64-QAM sequences, these new families of OFDM sequences can facilitate higher code rates. Furthermore, many of these new sequences have lower PMEPR than other OFDM sequences. Adjustment of the tradeoff between PMEPR and code rate can be made to meet the stringent demand in low PMEPR or the need for high code rate subject to various system requirements. Moreover, the construction method of the proposed new sequences is quite simple.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"106 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80693188","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683864
Kwangwon Lee, Seokhwan Park, Jin-Sung Kim, Inkyu Lee
In this paper, we introduce multi-link two-way relay channels where multiple two-way relay systems are interfering with each other. We study the capacity of this system by investigating the degree of freedom (DOF) with various message settings. Specifically, we consider two cases of two-way relay interference channels and two-way relay X channels. We show that the two-way relay interference channel where all nodes have M antennas obtains the DOF of 2M and compare with multipair two-way relay channels. Next, we introduce general message settings for two-way relay X channels. For the case where each user is equipped with 3 antennas and relays have 4 antennas, we prove that the DOF of 8 is achieved by employing network coding.
{"title":"Degrees of Freedom on MIMO Multi-Link Two-Way Relay Channels","authors":"Kwangwon Lee, Seokhwan Park, Jin-Sung Kim, Inkyu Lee","doi":"10.1109/GLOCOM.2010.5683864","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683864","url":null,"abstract":"In this paper, we introduce multi-link two-way relay channels where multiple two-way relay systems are interfering with each other. We study the capacity of this system by investigating the degree of freedom (DOF) with various message settings. Specifically, we consider two cases of two-way relay interference channels and two-way relay X channels. We show that the two-way relay interference channel where all nodes have M antennas obtains the DOF of 2M and compare with multipair two-way relay channels. Next, we introduce general message settings for two-way relay X channels. For the case where each user is equipped with 3 antennas and relays have 4 antennas, we prove that the DOF of 8 is achieved by employing network coding.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"71 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83707462","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683909
E. Guirguis, Mina Guirguis, Christopher Page
Path splicing is a proposed routing architecture for the Internet in which end-hosts (and intermediate routers) are empowered to change the paths their traffic uses by modifying a number of bits in the packet headers. These bits allow intermediate routers to choose alternate paths from the shortest one. To that end, this paper exposes SKWeak (Selective K Weakest links) attacks that exploit the adaptive behavior of end-hosts, through attacking the K weakest links. We show that SKWeak attack can significantly increase the network overhead due to the use of non-optimal paths. Our results show a multiplicative factor of SKWeak attacks that are close to 700. We propose defense mechanisms that aim to limit the dynamics induced by preventing excessive splicing from end-hosts. Our assessment is conducted on the Sprint topology with synthetic traffic matrices.
{"title":"SKWeak Attacks on Path Splicing: Vulnerability Assessment and Defense Mechanisms","authors":"E. Guirguis, Mina Guirguis, Christopher Page","doi":"10.1109/GLOCOM.2010.5683909","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683909","url":null,"abstract":"Path splicing is a proposed routing architecture for the Internet in which end-hosts (and intermediate routers) are empowered to change the paths their traffic uses by modifying a number of bits in the packet headers. These bits allow intermediate routers to choose alternate paths from the shortest one. To that end, this paper exposes SKWeak (Selective K Weakest links) attacks that exploit the adaptive behavior of end-hosts, through attacking the K weakest links. We show that SKWeak attack can significantly increase the network overhead due to the use of non-optimal paths. Our results show a multiplicative factor of SKWeak attacks that are close to 700. We propose defense mechanisms that aim to limit the dynamics induced by preventing excessive splicing from end-hosts. Our assessment is conducted on the Sprint topology with synthetic traffic matrices.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"53 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83812373","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683895
R. K. Kalle, M. Gupta, Aran Bergman, Elad Levy, Shantidev Mohanty, M. Venkatachalam, D. Das
Since mobile devices are equipped with limited battery power, it is essential to have efficient power management mechanisms in mobile broadband networks such as mobile WiMAX that enable always on connectivity and provide high throughputs. In recent times Voice over IP (VoIP) has emerged as an important and dominant application in broadband mobile networks such as WiMAX. VoIP traffic is uniquely characterized by small packets sent regularly at periodic intervals and are bound by strict latency requirements for satisfactory user experience. This paper presents novel mechanisms to achieve enhanced power saving during a VoIP session by exploiting unique characteristics of VoIP traffic in next generation mobile WiMAX networks based on IEEE 802.16m standard. The analytical model and simulation results indicate that proposed methods reduce the average power consumption during a VoIP call by up to 70% compared to the existing IEEE 802.16m draft specifications. Moreover, the simulation results closely match our proposed analytical model.
{"title":"Advanced Mechanisms for Sleep Mode Optimization of VoIP Traffic over IEEE 802.16m","authors":"R. K. Kalle, M. Gupta, Aran Bergman, Elad Levy, Shantidev Mohanty, M. Venkatachalam, D. Das","doi":"10.1109/GLOCOM.2010.5683895","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683895","url":null,"abstract":"Since mobile devices are equipped with limited battery power, it is essential to have efficient power management mechanisms in mobile broadband networks such as mobile WiMAX that enable always on connectivity and provide high throughputs. In recent times Voice over IP (VoIP) has emerged as an important and dominant application in broadband mobile networks such as WiMAX. VoIP traffic is uniquely characterized by small packets sent regularly at periodic intervals and are bound by strict latency requirements for satisfactory user experience. This paper presents novel mechanisms to achieve enhanced power saving during a VoIP session by exploiting unique characteristics of VoIP traffic in next generation mobile WiMAX networks based on IEEE 802.16m standard. The analytical model and simulation results indicate that proposed methods reduce the average power consumption during a VoIP call by up to 70% compared to the existing IEEE 802.16m draft specifications. Moreover, the simulation results closely match our proposed analytical model.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79221683","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
扫码关注我们
求助内容：
应助结果提醒方式：