Pub Date : 2012-06-10DOI: 10.1109/ICC.2012.6363825
C. Callegari, A. D. Pietro, S. Giordano, Teresa Pepe, G. Procissi
The increasing number of network attacks causes growing problems for network operators and users. Thus, detecting anomalous traffic is of primary interest in IP networks management and many detection techniques, able to promptly reveal and identify network attacks, mainly detecting Heavy Changes (HCs) in the network traffic, have been proposed. Nevertheless, the recent spread of coordinated attacks, that occur in multiple networks simultaneously, makes extremely difficult the detection, using isolated intrusion detection systems that only monitor a limited portion of the Internet. For this reason in this paper we propose a novel distributed architecture that represents a general framework for the detection of network anomalies. The performance analysis, presented in this paper, demonstrates the effectiveness of the proposed architecture.
{"title":"The LogLog counting reversible sketch: A distributed architecture for detecting anomalies in backbone networks","authors":"C. Callegari, A. D. Pietro, S. Giordano, Teresa Pepe, G. Procissi","doi":"10.1109/ICC.2012.6363825","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363825","url":null,"abstract":"The increasing number of network attacks causes growing problems for network operators and users. Thus, detecting anomalous traffic is of primary interest in IP networks management and many detection techniques, able to promptly reveal and identify network attacks, mainly detecting Heavy Changes (HCs) in the network traffic, have been proposed. Nevertheless, the recent spread of coordinated attacks, that occur in multiple networks simultaneously, makes extremely difficult the detection, using isolated intrusion detection systems that only monitor a limited portion of the Internet. For this reason in this paper we propose a novel distributed architecture that represents a general framework for the detection of network anomalies. The performance analysis, presented in this paper, demonstrates the effectiveness of the proposed architecture.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116633000","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364765
Wei Wang, Baoju Zhang
The theory of Bayesian Compressive Sensing is briefly introduced. An evaluation index based on differential entropy of estimated signal is devised and the adaptive compressive measurement procedure without any prior information about the measured signals is presented in block manner. Numerical simulations on random step signal and real radar signal verify that the adaptive algorithm has good performance. This novel offers great potential for adaptive compressive measuring real time signal.
{"title":"Bayesian compressive sensing for adaptive measurement of radar signal","authors":"Wei Wang, Baoju Zhang","doi":"10.1109/ICC.2012.6364765","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364765","url":null,"abstract":"The theory of Bayesian Compressive Sensing is briefly introduced. An evaluation index based on differential entropy of estimated signal is devised and the adaptive compressive measurement procedure without any prior information about the measured signals is presented in block manner. Numerical simulations on random step signal and real radar signal verify that the adaptive algorithm has good performance. This novel offers great potential for adaptive compressive measuring real time signal.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117188313","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364148
Xiangyun Zhou, M. Tao, R. Kennedy
Cooperative jamming as a physical layer security enhancement has recently drawn considerable attention. While most existing works focus on communication systems with a small number of nodes, we investigate the use of cooperative jamming for providing secrecy in large-scale decentralized networks consisting of randomly distributed legitimate users and eavesdroppers. A modified slotted ALOHA protocol, named CJ-ALOHA, is considered where each legitimate transmitter either sends its message signal or acts as a helping jammer according to a message transmission probability p. We derive the secrecy transmission capacity to characterize the network throughput and show how the throughput is affected by the CJ-ALOHA protocol. Both analytical and numerical insights are provided on the design of the CJ-ALOHA protocol for optimal throughput performance.
{"title":"Cooperative jamming for secrecy in decentralized wireless networks","authors":"Xiangyun Zhou, M. Tao, R. Kennedy","doi":"10.1109/ICC.2012.6364148","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364148","url":null,"abstract":"Cooperative jamming as a physical layer security enhancement has recently drawn considerable attention. While most existing works focus on communication systems with a small number of nodes, we investigate the use of cooperative jamming for providing secrecy in large-scale decentralized networks consisting of randomly distributed legitimate users and eavesdroppers. A modified slotted ALOHA protocol, named CJ-ALOHA, is considered where each legitimate transmitter either sends its message signal or acts as a helping jammer according to a message transmission probability p. We derive the secrecy transmission capacity to characterize the network throughput and show how the throughput is affected by the CJ-ALOHA protocol. Both analytical and numerical insights are provided on the design of the CJ-ALOHA protocol for optimal throughput performance.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117194474","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364790
Yibo Jiang, J. Hou, A. Bharadwaj, S. Sambhwani
Closed loop beamforming transmit diversity is a promising technique to improve the uplink transmission performance in cellular networks. This technique was recently incorporated into the 3GPP HSPA standard. This paper reflects on several design aspects of closed loop beamforming transmit diversity, including: precoded pilot channels design, precoding information determination when UE is in soft handover, and enhanced symmetric beamforming implementation.
{"title":"Design aspects of closed loop beamforming transmit diversity in HSUPA","authors":"Yibo Jiang, J. Hou, A. Bharadwaj, S. Sambhwani","doi":"10.1109/ICC.2012.6364790","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364790","url":null,"abstract":"Closed loop beamforming transmit diversity is a promising technique to improve the uplink transmission performance in cellular networks. This technique was recently incorporated into the 3GPP HSPA standard. This paper reflects on several design aspects of closed loop beamforming transmit diversity, including: precoded pilot channels design, precoding information determination when UE is in soft handover, and enhanced symmetric beamforming implementation.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120899150","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364243
Christian M. Mueller
Coordinated Multi-Point transmission schemes have a large potential to increase spectral efficiency in cellular networks. While the physical layer aspects of coordinated transmission received a lot of attention, its integration into higher layers yet remains to be investigated. In this work, we analyze the transmit mode selection for coordinated and uncoordinated transmission of data traffic. We propose two transmit mode selection schemes to decide whether to use coordinated transmission for an object or not. One scheme is based on object size, the other one is based on queue state. We derive the optimal parameter settings for our selective coordination schemes and show how they improve system performance.
{"title":"Transmit mode selection schemes for distributed coordinated transmission of data traffic","authors":"Christian M. Mueller","doi":"10.1109/ICC.2012.6364243","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364243","url":null,"abstract":"Coordinated Multi-Point transmission schemes have a large potential to increase spectral efficiency in cellular networks. While the physical layer aspects of coordinated transmission received a lot of attention, its integration into higher layers yet remains to be investigated. In this work, we analyze the transmit mode selection for coordinated and uncoordinated transmission of data traffic. We propose two transmit mode selection schemes to decide whether to use coordinated transmission for an object or not. One scheme is based on object size, the other one is based on queue state. We derive the optimal parameter settings for our selective coordination schemes and show how they improve system performance.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120974560","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 : 2012-06-10DOI: 10.1109/ICC.2012.6363709
A. Behnad, A. M. Rabiei, N. Beaulieu
An exact expression for the outage probability of opportunistic relaying in a dual-hop amplify-and-forward relay network is derived for general fading environments and the case where the source and destination nodes make use of directional antennas. The relaying nodes are assumed to be distributed according to a homogeneous two-dimensional Poisson point process with fixed density. This assumption is of great practical importance as in a typical practical scenario, the number of relays as well as their distances from the source and destination are random. It is observed that under some circumstances, a directional antenna at the source may permit more efficient deployment of the relay network than the case where an omnidirectional antenna is used.
{"title":"Outage probability of dual-hop AF opportunistic relaying with directional antennas","authors":"A. Behnad, A. M. Rabiei, N. Beaulieu","doi":"10.1109/ICC.2012.6363709","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363709","url":null,"abstract":"An exact expression for the outage probability of opportunistic relaying in a dual-hop amplify-and-forward relay network is derived for general fading environments and the case where the source and destination nodes make use of directional antennas. The relaying nodes are assumed to be distributed according to a homogeneous two-dimensional Poisson point process with fixed density. This assumption is of great practical importance as in a typical practical scenario, the number of relays as well as their distances from the source and destination are random. It is observed that under some circumstances, a directional antenna at the source may permit more efficient deployment of the relay network than the case where an omnidirectional antenna is used.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121315461","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364982
M. Maier
Survivability will play a more prominent role in emerging high-speed, multichannel, long-reach next-generation passive optical networks (NG-PONs) than it did in conventional PONs. In this paper, we report on some of the most promising NG-PON survivability techniques such as dual homing, hitless protection switching by means of equalization delays, interconnection fibers, protection rings, and meshed PON topologies, including their cost-benefit analysis for different population densities. We pay particular attention to the design of advanced in-service monitoring techniques for fault detection and localization in PON distribution fibers and study the merits of combining partial optical protection with wireless protection for realizing reliable fiber-wireless (FiWi) access networks and exploiting them to improve the survivability of other critical networks such as the future smart grid.
{"title":"Survivability techniques for NG-PONs and FiWi access networks","authors":"M. Maier","doi":"10.1109/ICC.2012.6364982","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364982","url":null,"abstract":"Survivability will play a more prominent role in emerging high-speed, multichannel, long-reach next-generation passive optical networks (NG-PONs) than it did in conventional PONs. In this paper, we report on some of the most promising NG-PON survivability techniques such as dual homing, hitless protection switching by means of equalization delays, interconnection fibers, protection rings, and meshed PON topologies, including their cost-benefit analysis for different population densities. We pay particular attention to the design of advanced in-service monitoring techniques for fault detection and localization in PON distribution fibers and study the merits of combining partial optical protection with wireless protection for realizing reliable fiber-wireless (FiWi) access networks and exploiting them to improve the survivability of other critical networks such as the future smart grid.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127090239","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364839
Pramita Mitra, C. Poellabauer
Today's modern mobile devices (e.g., smartphones and tablets) present great potential for building large-scale mobile sensing and information sharing systems which can be highly beneficial to minimize the fatalities of human lives during emergency response. This paper presents a framework, called BREathing rate MONitoring (BREMON) that allows paramedics to monitor the breathing activities of multiple patients at once using their smartphones. BREMON uses the smartphone accelerometer to measure the accelerations during the breathing activities of a patient. These raw acceleration data are then processed to calculate the number of Breaths Per Minute (BPM) and periodically sent to the smartphones used by the paramedics over a multi-hop network. BREMON makes use of an underlying service sharing infrastructure, called SPontaneous Information and Resource sharing InfrasTructure (SPIRIT) that allows mobile devices to share the breathing activity data as services within the infrastructure.
{"title":"Emergency response in smartphone-based Mobile Ad-Hoc Networks","authors":"Pramita Mitra, C. Poellabauer","doi":"10.1109/ICC.2012.6364839","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364839","url":null,"abstract":"Today's modern mobile devices (e.g., smartphones and tablets) present great potential for building large-scale mobile sensing and information sharing systems which can be highly beneficial to minimize the fatalities of human lives during emergency response. This paper presents a framework, called BREathing rate MONitoring (BREMON) that allows paramedics to monitor the breathing activities of multiple patients at once using their smartphones. BREMON uses the smartphone accelerometer to measure the accelerations during the breathing activities of a patient. These raw acceleration data are then processed to calculate the number of Breaths Per Minute (BPM) and periodically sent to the smartphones used by the paramedics over a multi-hop network. BREMON makes use of an underlying service sharing infrastructure, called SPontaneous Information and Resource sharing InfrasTructure (SPIRIT) that allows mobile devices to share the breathing activity data as services within the infrastructure.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127178144","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364848
I. Senturk, Sabri Yilmaz, K. Akkaya
Network partitioning can happen due to node failures in Wireless Sensor and Actor Networks (WSANs) that are deployed in inhospitable environments. In case of multiple actor damages, the network can be easily partitioned into several partitions which disrupt the communication among actors. In such a case, the nodes can relocate to re-establish the network connectivity. Such movement, however, should be minimized due to high energy cost for movement. In this paper, we tackle the problem of connectivity restoration in partitioned WSAN with minimized movement overhead by using a Game Theory based heuristic. The idea is based on the comparison of Nash equilibrium of the partitions. Specifically, the nodes staying in the partitions with greater equilibrium will be stationary while the nodes that are in partitions with the less equilibrium are relocated. In this way, partitions become a part of a federated partition and this federation process takes place until reaching the system-wide unique equilibrium. The effectiveness of the approach is evaluated under a variety of conditions and has been shown to be scalable and effective.
{"title":"A Game-Theoretic approach to connectivity restoration in Wireless Sensor and Actor Networks","authors":"I. Senturk, Sabri Yilmaz, K. Akkaya","doi":"10.1109/ICC.2012.6364848","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364848","url":null,"abstract":"Network partitioning can happen due to node failures in Wireless Sensor and Actor Networks (WSANs) that are deployed in inhospitable environments. In case of multiple actor damages, the network can be easily partitioned into several partitions which disrupt the communication among actors. In such a case, the nodes can relocate to re-establish the network connectivity. Such movement, however, should be minimized due to high energy cost for movement. In this paper, we tackle the problem of connectivity restoration in partitioned WSAN with minimized movement overhead by using a Game Theory based heuristic. The idea is based on the comparison of Nash equilibrium of the partitions. Specifically, the nodes staying in the partitions with greater equilibrium will be stationary while the nodes that are in partitions with the less equilibrium are relocated. In this way, partitions become a part of a federated partition and this federation process takes place until reaching the system-wide unique equilibrium. The effectiveness of the approach is evaluated under a variety of conditions and has been shown to be scalable and effective.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127259203","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364676
Sharhabeel H. Alnabelsi, A. Kamal
In this paper, we propose to recover collided packets between Primary Users (PUs) and Secondary Users (SUs) in Cognitive Radio Networks (CRNs) for two scenarios. When a collision occurs between an SU and a PU transmitters, the SU's receiver considers the PU's transmitted packet's signals as an interference, and hence, cancels its effect in order to recover its corresponding received packet's signals. Recovering collided packets, instead of retransmitting them saves transmitters' energy. In the first scenario, we assume PUs and SUs employ the standard Binary Phase-Shift keying (BPSK) and a 90 degree phase shifted version, i.e., orthogonal to BPSK, respectively, as their modulation techniques. In the Second scenario, we assume PUs and SUs employ BPSK and QPSK as their modulation techniques, respectively, or vice versa. In both scenarios, we propose protocols to recover the SU collided packets, depending on the received phase shifts. We show through numerical analysis that a significant fraction of collided packets can be recovered. We also derive an energy saving performance metric for our proposed mechanisms, in order to assess the saved energy due to recovering the collided packets. Our numerical analysis also shows that a high percentage of energy can be saved over the traditional scheme, in which our packets recovery mechanisms are not employed.
{"title":"Interference-based packet recovery for energy saving in Cognitive Radio Networks","authors":"Sharhabeel H. Alnabelsi, A. Kamal","doi":"10.1109/ICC.2012.6364676","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364676","url":null,"abstract":"In this paper, we propose to recover collided packets between Primary Users (PUs) and Secondary Users (SUs) in Cognitive Radio Networks (CRNs) for two scenarios. When a collision occurs between an SU and a PU transmitters, the SU's receiver considers the PU's transmitted packet's signals as an interference, and hence, cancels its effect in order to recover its corresponding received packet's signals. Recovering collided packets, instead of retransmitting them saves transmitters' energy. In the first scenario, we assume PUs and SUs employ the standard Binary Phase-Shift keying (BPSK) and a 90 degree phase shifted version, i.e., orthogonal to BPSK, respectively, as their modulation techniques. In the Second scenario, we assume PUs and SUs employ BPSK and QPSK as their modulation techniques, respectively, or vice versa. In both scenarios, we propose protocols to recover the SU collided packets, depending on the received phase shifts. We show through numerical analysis that a significant fraction of collided packets can be recovered. We also derive an energy saving performance metric for our proposed mechanisms, in order to assess the saved energy due to recovering the collided packets. Our numerical analysis also shows that a high percentage of energy can be saved over the traditional scheme, in which our packets recovery mechanisms are not employed.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127472575","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
扫码关注我们
求助内容：
应助结果提醒方式：