Pub Date : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928946
Osman Yağan, Dajun Qian, Junshan Zhang, D. Cochran
We consider a cyber-physical system consisting of two interacting networks, i.e., a cyber-network overlaying a physical-network. In the event of attacks, due to the interdependence between the networks, node failures in one network may result in a cascade of failures affecting both networks - potentially leading to the collapse of the entire infrastructure. Robustness against such catastrophic failure hinges heavily on the allocation of the interconnecting links that connect nodes in one network to nodes in the other network for proper functioning. Assuming that no information about the degree distribution within each of the two constituent networks, we develop a “uniform” allocation strategy that allots inter-network links equally across all nodes. Our findings indicate that, from a network resilience perspective, uniform allocation of internetwork edges yields a significant gain compared to random allocation.
{"title":"On allocating interconnecting links against cascading failures in cyber-physical networks","authors":"Osman Yağan, Dajun Qian, Junshan Zhang, D. Cochran","doi":"10.1109/INFCOMW.2011.5928946","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928946","url":null,"abstract":"We consider a cyber-physical system consisting of two interacting networks, i.e., a cyber-network overlaying a physical-network. In the event of attacks, due to the interdependence between the networks, node failures in one network may result in a cascade of failures affecting both networks - potentially leading to the collapse of the entire infrastructure. Robustness against such catastrophic failure hinges heavily on the allocation of the interconnecting links that connect nodes in one network to nodes in the other network for proper functioning. Assuming that no information about the degree distribution within each of the two constituent networks, we develop a “uniform” allocation strategy that allots inter-network links equally across all nodes. Our findings indicate that, from a network resilience perspective, uniform allocation of internetwork edges yields a significant gain compared to random allocation.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132433115","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928868
Ahmed E. A. A. Abdulla, Hiroki Nishiyama, N. Ansari, N. Kato
Power-aware routing algorithms in Wireless Sensor Networks (WSNs) aim to solve the key issue of prolonging the lifetime of resource-constrained ad-hoc sensor nodes. Contemporary WSN routing algorithm designs have severe limitations on their scalability; that is, large-scale deployments of WSNs result in relatively shorter lifetimes, as compared to small-scale deployments, primarily owing to rapid sink node isolation caused by the quick battery exhaustion of nodes that are close to the sink. In this paper, we analyze the scalability limitations of conventional routing algorithms and compare them to those of our recently proposed Hybrid Multi-hop routing (HYMN) [1]. We mathematically analyze HYMN and show the relationship between network size and routing algorithm scalability. Additionally, through extensive simulations, we show that HYMN scales considerably better in terms of network connectivity.
{"title":"HYMN to improve the scalability of Wireless Sensor Networks","authors":"Ahmed E. A. A. Abdulla, Hiroki Nishiyama, N. Ansari, N. Kato","doi":"10.1109/INFCOMW.2011.5928868","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928868","url":null,"abstract":"Power-aware routing algorithms in Wireless Sensor Networks (WSNs) aim to solve the key issue of prolonging the lifetime of resource-constrained ad-hoc sensor nodes. Contemporary WSN routing algorithm designs have severe limitations on their scalability; that is, large-scale deployments of WSNs result in relatively shorter lifetimes, as compared to small-scale deployments, primarily owing to rapid sink node isolation caused by the quick battery exhaustion of nodes that are close to the sink. In this paper, we analyze the scalability limitations of conventional routing algorithms and compare them to those of our recently proposed Hybrid Multi-hop routing (HYMN) [1]. We mathematically analyze HYMN and show the relationship between network size and routing algorithm scalability. Additionally, through extensive simulations, we show that HYMN scales considerably better in terms of network connectivity.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"4 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120988289","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928854
N. Garralda, I. Llatser, A. Cabellos-Aparicio, M. Pierobon
Nanonetworking is an emerging field of research, where nanotechnology and communication engineering are applied on a common ground. Molecular Communication (MC) is a bio-inspired paradigm, where Nanonetworks, i.e., the interconnection of devices at the nanoscale, are based on the exchange of molecules. Amongst others, diffusion-based MC is expected to be suitable for covering short distances (nm-µm). In this work, we explore the main characteristics of diffusion-based MC through the use of N3Sim, a physical simulation framework for MC. N3Sim allows for the simulation of the physics underlying the diffusion of molecules for different scenarios. Through the N3Sim results, the Linear Time Invariant (LTI) property is proven to be a valid assumption for the free diffusion-based MC scenario. Moreover, diffusion-based noise is observed and evaluated with reference to already proposed stochastic models. The optimal pulse shape for diffusion-based MC is provided as a result of simulations. Two different pulse-based coding techniques are also compared through N3Sim in terms of available bandwidth and energy consumption for communication.
{"title":"Simulation-based evaluation of the diffusion-based physical channel in molecular nanonetworks","authors":"N. Garralda, I. Llatser, A. Cabellos-Aparicio, M. Pierobon","doi":"10.1109/INFCOMW.2011.5928854","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928854","url":null,"abstract":"Nanonetworking is an emerging field of research, where nanotechnology and communication engineering are applied on a common ground. Molecular Communication (MC) is a bio-inspired paradigm, where Nanonetworks, i.e., the interconnection of devices at the nanoscale, are based on the exchange of molecules. Amongst others, diffusion-based MC is expected to be suitable for covering short distances (nm-µm). In this work, we explore the main characteristics of diffusion-based MC through the use of N3Sim, a physical simulation framework for MC. N3Sim allows for the simulation of the physics underlying the diffusion of molecules for different scenarios. Through the N3Sim results, the Linear Time Invariant (LTI) property is proven to be a valid assumption for the free diffusion-based MC scenario. Moreover, diffusion-based noise is observed and evaluated with reference to already proposed stochastic models. The optimal pulse shape for diffusion-based MC is provided as a result of simulations. Two different pulse-based coding techniques are also compared through N3Sim in terms of available bandwidth and energy consumption for communication.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115636608","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928942
E. Jaho, M. Karaliopoulos, I. Stavrakakis
This paper proposes a framework for node clustering in computerized social networks according to common interests. Communities in such networks are mainly formed by user selection, which may be based on various factors such as acquaintance, social status, educational background. However, such selection may result in groups that have a low degree of similarity. The proposed framework could improve the effectiveness of these social networks by constructing clusters of nodes with higher interest similarity, and thus maximize the benefit that users extract from their participation. The framework is based on methods for detecting communities over weighted graphs, where graph edge weights are defined based on measures of similarity between nodes' interests in certain thematic areas. The capacity of these measures to enhance the sensitivity and resolution of community detection is evaluated with concrete benchmark scenarios over synthetic networks. We also use the framework to assess the level of common interests among sample users of a popular online social application. Our results confirm that clusters formed by user selection have low degrees of similarity; our framework could, hence, be valuable in forming communities with higher coherence of interests.
{"title":"ISCoDe: A framework for interest similarity-based community detection in social networks","authors":"E. Jaho, M. Karaliopoulos, I. Stavrakakis","doi":"10.1109/INFCOMW.2011.5928942","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928942","url":null,"abstract":"This paper proposes a framework for node clustering in computerized social networks according to common interests. Communities in such networks are mainly formed by user selection, which may be based on various factors such as acquaintance, social status, educational background. However, such selection may result in groups that have a low degree of similarity. The proposed framework could improve the effectiveness of these social networks by constructing clusters of nodes with higher interest similarity, and thus maximize the benefit that users extract from their participation. The framework is based on methods for detecting communities over weighted graphs, where graph edge weights are defined based on measures of similarity between nodes' interests in certain thematic areas. The capacity of these measures to enhance the sensitivity and resolution of community detection is evaluated with concrete benchmark scenarios over synthetic networks. We also use the framework to assess the level of common interests among sample users of a popular online social application. Our results confirm that clusters formed by user selection have low degrees of similarity; our framework could, hence, be valuable in forming communities with higher coherence of interests.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123397027","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928933
J. Liu
This paper describes a cross-layer filtering mechanism which facilitates real-time video frames to meet their stringent decoding deadlines in the existence of network congestion. The basic idea is to remove the dysfunctional video frames, which have missed their decoding deadlines, from transmission as early as possible, since they no longer serve for the functioning of a real-time media streaming application. The filtering mechanism consists of a pair of components which operate at the encoder and the decoder, respectively. The decoder-side component identifies the dysfunctional frames and sends the notifications to the encoder. The encoder-side component removes the identified dysfunctional frames from transmission. By removing dysfunctional frames from transmission, the video frames that are behind the dysfunctional frames are eligible for transmission at an earlier time and are made likely to meet their decoding deadlines. Meanwhile, removing dysfunctional frames from transmission also serves to maintain a stable and low queueing delay. The filtering mechanism relies on a user-space transport stack which enables the application-controlled transmission of data segments. The effectiveness of the filtering mechanism has been demonstrated through experiments in emulated networks.
{"title":"Hard-deadline-based frame filtering mechanism supporting the delivery of real-time video streams","authors":"J. Liu","doi":"10.1109/INFCOMW.2011.5928933","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928933","url":null,"abstract":"This paper describes a cross-layer filtering mechanism which facilitates real-time video frames to meet their stringent decoding deadlines in the existence of network congestion. The basic idea is to remove the dysfunctional video frames, which have missed their decoding deadlines, from transmission as early as possible, since they no longer serve for the functioning of a real-time media streaming application. The filtering mechanism consists of a pair of components which operate at the encoder and the decoder, respectively. The decoder-side component identifies the dysfunctional frames and sends the notifications to the encoder. The encoder-side component removes the identified dysfunctional frames from transmission. By removing dysfunctional frames from transmission, the video frames that are behind the dysfunctional frames are eligible for transmission at an earlier time and are made likely to meet their decoding deadlines. Meanwhile, removing dysfunctional frames from transmission also serves to maintain a stable and low queueing delay. The filtering mechanism relies on a user-space transport stack which enables the application-controlled transmission of data segments. The effectiveness of the filtering mechanism has been demonstrated through experiments in emulated networks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124906857","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928827
R. Bolla, R. Bruschi, A. Carrega, F. Davoli
In this contribution, we focus on energy-aware devices able to reduce their energy requirements by adapting their performance. We propose an analytical model to accurately represent the impact of green network technologies (i.e., low power idle and adaptive rate) on network- and energy-aware performance indexes. The model has been validated with experimental results, performed by using energy-aware software routers and real-world traffic traces. The achieved results demonstrate how the proposed model can effectively represent energy- and network-aware performance indexes. Moreover, also an optimization procedure based on the model has been proposed and experimentally evaluated. The procedure aims at dynamically adapting the energy-aware device configuration to minimize energy consumption, while coping with incoming traffic volumes and meeting network performance constraints.
{"title":"Green network technologies and the art of trading-off","authors":"R. Bolla, R. Bruschi, A. Carrega, F. Davoli","doi":"10.1109/INFCOMW.2011.5928827","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928827","url":null,"abstract":"In this contribution, we focus on energy-aware devices able to reduce their energy requirements by adapting their performance. We propose an analytical model to accurately represent the impact of green network technologies (i.e., low power idle and adaptive rate) on network- and energy-aware performance indexes. The model has been validated with experimental results, performed by using energy-aware software routers and real-world traffic traces. The achieved results demonstrate how the proposed model can effectively represent energy- and network-aware performance indexes. Moreover, also an optimization procedure based on the model has been proposed and experimentally evaluated. The procedure aims at dynamically adapting the energy-aware device configuration to minimize energy consumption, while coping with incoming traffic volumes and meeting network performance constraints.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128073636","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928910
Rui Wang, Lei Zhang, Li Cui
The effective energy control while maintaining reliable detection performance is a key problem in wireless sensor networks surveillance, such as blue-green algae surveillance. An intelligent wakening scheme (IWS) is proposed in this paper which considers different importance degrees of the grids in the surveillance zone. It uses a voronoi diagram to determine the effective scope of each sensor node and calculates the node wakening probability with the importance degree in the effective scope. The nodes are then turned on stochastically according to the node wakening probability. Simulation results illustrate that this scheme greatly reduces the number of wakening nodes while maintaining high reliability in surveillance.
{"title":"Intelligent wakening scheme for wireless sensor networks surveillance","authors":"Rui Wang, Lei Zhang, Li Cui","doi":"10.1109/INFCOMW.2011.5928910","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928910","url":null,"abstract":"The effective energy control while maintaining reliable detection performance is a key problem in wireless sensor networks surveillance, such as blue-green algae surveillance. An intelligent wakening scheme (IWS) is proposed in this paper which considers different importance degrees of the grids in the surveillance zone. It uses a voronoi diagram to determine the effective scope of each sensor node and calculates the node wakening probability with the importance degree in the effective scope. The nodes are then turned on stochastically according to the node wakening probability. Simulation results illustrate that this scheme greatly reduces the number of wakening nodes while maintaining high reliability in surveillance.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129401322","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928882
M. Takahashi, Bin Tang, Neeraj Jaggi
We study data preservation in intermittently connected sensor networks, wherein the sensor nodes do not always have connected paths to the base station. In such networks, the generated data is first stored inside the network before being uploaded to the base station when uploading opportunity arises. How to preserve the data inside the network is therefore an important problem. The problem becomes more challenging when sensor nodes have finite and unreplenishable battery energy. In this paper, we identify, formulate and study the data preservation problem in the intermittently connected sensor networks under energy constraints at sensor nodes. The problem aims to preserve the data inside the network for maximum possible time, by distributing the data items from low energy nodes to high energy nodes. We first show that this problem is NP-hard. We then design a centralized greedy heuristic and a distributed data distribution algorithm, and compare their performances using simulations.
{"title":"Energy-efficient data preservation in intermittently connected sensor networks","authors":"M. Takahashi, Bin Tang, Neeraj Jaggi","doi":"10.1109/INFCOMW.2011.5928882","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928882","url":null,"abstract":"We study data preservation in intermittently connected sensor networks, wherein the sensor nodes do not always have connected paths to the base station. In such networks, the generated data is first stored inside the network before being uploaded to the base station when uploading opportunity arises. How to preserve the data inside the network is therefore an important problem. The problem becomes more challenging when sensor nodes have finite and unreplenishable battery energy. In this paper, we identify, formulate and study the data preservation problem in the intermittently connected sensor networks under energy constraints at sensor nodes. The problem aims to preserve the data inside the network for maximum possible time, by distributing the data items from low energy nodes to high energy nodes. We first show that this problem is NP-hard. We then design a centralized greedy heuristic and a distributed data distribution algorithm, and compare their performances using simulations.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127972510","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 : 2011-04-10DOI: 10.1504/IJSN.2011.043670
Ningning Cheng, K. Govindan, P. Mohapatra
Development of network of nodes connected with their trust values and the propagation of these trust values to far away nodes are basic operations of the modern day trustworthy networks. Trust can be exploited to mitigate the security threats in wireless network. Most of the existing trust propagation methods are based on flooding trust information, which puts a heavy burden on wireless communication, especially in ad hoc network and sensor network. In this paper, we propose a rendezvous based trust propagation scheme. Trust requester and trust provider send out trust-request and computed-trust tickets respectively, which will meet in some common rendezvous node with certain probability. Computed-trust will then be propagated to the requester. We carry out detailed performance evaluations of our scheme. The results show that our method achieves up to 66% overhead reduction in trust propagation compared to flood based methods.
{"title":"Rendezvous based trust propagation to enhance distributed network security","authors":"Ningning Cheng, K. Govindan, P. Mohapatra","doi":"10.1504/IJSN.2011.043670","DOIUrl":"https://doi.org/10.1504/IJSN.2011.043670","url":null,"abstract":"Development of network of nodes connected with their trust values and the propagation of these trust values to far away nodes are basic operations of the modern day trustworthy networks. Trust can be exploited to mitigate the security threats in wireless network. Most of the existing trust propagation methods are based on flooding trust information, which puts a heavy burden on wireless communication, especially in ad hoc network and sensor network. In this paper, we propose a rendezvous based trust propagation scheme. Trust requester and trust provider send out trust-request and computed-trust tickets respectively, which will meet in some common rendezvous node with certain probability. Computed-trust will then be propagated to the requester. We carry out detailed performance evaluations of our scheme. The results show that our method achieves up to 66% overhead reduction in trust propagation compared to flood based methods.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128383700","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}
In this paper, we proposed a novel sensing scheme so-called Transmitter-Receiver Cooperative Sensing in a MIMO cognitive network by combining sensing information of both sides. Compared with most of the existing sensing schemes which simply use listen-before talk (LBT) only at the transmitter side, the proposed scheme can further improve the system performance by jointly feedback the Channel State Information (CSI) and the Sensing information (SI) from the receiver. However, the quantization impact on the sensing performance and the channel capacity as well as the interference to primary network should be considered in the case of limited feedback. Here a tradeoff criterion is proposed to allocate bits for CSI and SI so as to maximize the MIMO link capacity while meeting the interference constraints. Simulation results are given to verify the effectiveness of the proposed scheme.
{"title":"Transmitter-receiver cooperative sensing in MIMO cognitive network with limited feedback","authors":"Chao Wang, Zhaoyang Zhang, Xiaoming Chen, Yu-Xi Chau","doi":"10.1109/INFCOMW.2011.5928870","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928870","url":null,"abstract":"In this paper, we proposed a novel sensing scheme so-called Transmitter-Receiver Cooperative Sensing in a MIMO cognitive network by combining sensing information of both sides. Compared with most of the existing sensing schemes which simply use listen-before talk (LBT) only at the transmitter side, the proposed scheme can further improve the system performance by jointly feedback the Channel State Information (CSI) and the Sensing information (SI) from the receiver. However, the quantization impact on the sensing performance and the channel capacity as well as the interference to primary network should be considered in the case of limited feedback. Here a tradeoff criterion is proposed to allocate bits for CSI and SI so as to maximize the MIMO link capacity while meeting the interference constraints. Simulation results are given to verify the effectiveness of the proposed scheme.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125879886","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
扫码关注我们
求助内容：
应助结果提醒方式：