Pub Date : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928791
Marta Barrilero, Silvia Uribe, M. Alduán, Faustino Sánchez, F. Álvarez
This paper describes a novel content-based image recommendation system based on new image low level descriptors derived from the well known MPEG-7 parameters. Furthermore, it also proposes the integration of this recommendation system into a content-aware network architecture to enhance and enrich the content delivery and improve user's experience.
{"title":"In-network content based image recommendation system for Content-aware Networks","authors":"Marta Barrilero, Silvia Uribe, M. Alduán, Faustino Sánchez, F. Álvarez","doi":"10.1109/INFCOMW.2011.5928791","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928791","url":null,"abstract":"This paper describes a novel content-based image recommendation system based on new image low level descriptors derived from the well known MPEG-7 parameters. Furthermore, it also proposes the integration of this recommendation system into a content-aware network architecture to enhance and enrich the content delivery and improve user's experience.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"90 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":"125010596","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}
Since the radio access of secondary users is typically confined to ensure sufficient operation for primary users in underlay cognitive radio networks (CRNs), the inevitably induced latency and interference pose new challenges on existing routing schemes for Quality-of-Service (QoS) provisioning. Due to stringent accessing and interference constraints, secondary users appeal to exploit multi-path routing based on multi-hop relaying protocol to support QoS requirements. Via our model, we derive the end-to-end delay statistics including medium access and retransmission delay, where we successfully relate path diversity to end-to-end reliability and optimize the delivery delay by adjusting transmission power. We analyze the performance of the duplication-based and coding-aided multi-path routing schemes, where opportunistic transmission is employed to improve the delivery delay due to channel awareness, and encoding packets on multiple paths further achieves throughput efficiency. This paper firstly presents insights and performance analysis to facilitate multi-path routing with QoS provisioning in underlay CRN.
{"title":"Multi-path routing with end-to-end statistical QoS Provisioning in Underlay Cognitive Radio Networks","authors":"Pin-Yu Chen, Shin-Ming Cheng, Weng-Chon Ao, Kwang-Cheng Chen","doi":"10.1109/INFCOMW.2011.5928921","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928921","url":null,"abstract":"Since the radio access of secondary users is typically confined to ensure sufficient operation for primary users in underlay cognitive radio networks (CRNs), the inevitably induced latency and interference pose new challenges on existing routing schemes for Quality-of-Service (QoS) provisioning. Due to stringent accessing and interference constraints, secondary users appeal to exploit multi-path routing based on multi-hop relaying protocol to support QoS requirements. Via our model, we derive the end-to-end delay statistics including medium access and retransmission delay, where we successfully relate path diversity to end-to-end reliability and optimize the delivery delay by adjusting transmission power. We analyze the performance of the duplication-based and coding-aided multi-path routing schemes, where opportunistic transmission is employed to improve the delivery delay due to channel awareness, and encoding packets on multiple paths further achieves throughput efficiency. This paper firstly presents insights and performance analysis to facilitate multi-path routing with QoS provisioning in underlay CRN.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"47 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":"126131382","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}
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.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.5928951
Nandhakumar Kathiresshan, Zhifeng Xiao, Yang Xiao
We propose EagleEye, an accountable logging framework as a middleware for distributed and networked systems. EagleEye offloads the logging function from the distributed application program so that applications can focus on the logic handling without worrying about when and how to do logging. By capturing and analyzing network packets, EagleEye is able to reproduce the entire networking event history in the application layer, which is the basis of implementing an accountable system. We provide a case study by replacing the logging component of PeerReview [1] with EagleEye. The evaluation result shows that EagleEye can achieve equivalent accountability without modifying the host application program, which can save numerous workloads of modifying, republishing, and redeploying the host software.
{"title":"EagleEye: A logging framework for accountable distributed and networked systems","authors":"Nandhakumar Kathiresshan, Zhifeng Xiao, Yang Xiao","doi":"10.1109/INFCOMW.2011.5928951","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928951","url":null,"abstract":"We propose EagleEye, an accountable logging framework as a middleware for distributed and networked systems. EagleEye offloads the logging function from the distributed application program so that applications can focus on the logic handling without worrying about when and how to do logging. By capturing and analyzing network packets, EagleEye is able to reproduce the entire networking event history in the application layer, which is the basis of implementing an accountable system. We provide a case study by replacing the logging component of PeerReview [1] with EagleEye. The evaluation result shows that EagleEye can achieve equivalent accountability without modifying the host application program, which can save numerous workloads of modifying, republishing, and redeploying the host software.","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":"130074456","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.5928943
S. Scellato, C. Mascolo
While in recent years online social networks have been largely shaping user experience on the Web, only in the last year there has been a soaring increase of novel location-based social applications. By allowing users to check-in at places and share their location with friends, these social platforms provide a new facet of user online behavior.
{"title":"Measuring user activity on an online location-based social network","authors":"S. Scellato, C. Mascolo","doi":"10.1109/INFCOMW.2011.5928943","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928943","url":null,"abstract":"While in recent years online social networks have been largely shaping user experience on the Web, only in the last year there has been a soaring increase of novel location-based social applications. By allowing users to check-in at places and share their location with friends, these social platforms provide a new facet of user online behavior.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"74 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":"127279674","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}
Scalable mobility support is an important task in large-scale mobile Internet. A considerable amount of research on distributed hash table (DHT) based mobility support schemes, which are highly user scalable and load balanced, has been done. However these schemes have shortcomings in query and update performances and network scalability. It is because although routing of overlay itself is effective, there is inconsistency between logical and physical topologies, so the actual physical network performances are not necessarily efficient. In this article, while modeling the overlay mapping query to a Markov decision process (MDP), we define the reward function combining physical layer information with application layer information. Then we present a Markov decision routing (MDR) algorithm, which improves backward induction to get the global optimal strategy, and can balance the complexity of the time and space.We propose a DHT and MDR-based mobility management (DMDRMM) scheme. The numerical results show that the scheme inherits the advantages of the DHT-based management structure, and optimizes the update and query performances of dDHT especially for large-scale network.
{"title":"A DHT and MDP-based mobility management scheme for large-scale mobile internet","authors":"Yujia Zhai, Yue Wang, I. You, Jian Yuan, Yong Ren, X. Shan","doi":"10.1109/INFCOMW.2011.5928842","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928842","url":null,"abstract":"Scalable mobility support is an important task in large-scale mobile Internet. A considerable amount of research on distributed hash table (DHT) based mobility support schemes, which are highly user scalable and load balanced, has been done. However these schemes have shortcomings in query and update performances and network scalability. It is because although routing of overlay itself is effective, there is inconsistency between logical and physical topologies, so the actual physical network performances are not necessarily efficient. In this article, while modeling the overlay mapping query to a Markov decision process (MDP), we define the reward function combining physical layer information with application layer information. Then we present a Markov decision routing (MDR) algorithm, which improves backward induction to get the global optimal strategy, and can balance the complexity of the time and space.We propose a DHT and MDR-based mobility management (DMDRMM) scheme. The numerical results show that the scheme inherits the advantages of the DHT-based management structure, and optimizes the update and query performances of dDHT especially for large-scale network.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"22 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":"125972335","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.5928777
Cong Sun, Liyong Tang, Zhong Chen
Language-based information flow security aims to decide whether an action-observable program can unintentionally leak confidential information if it has the authority to access confidential data. Recent concerns about declassification polices have provided many choices for practical intended information release, but more precise enforcement mechanism for these policies is insufficiently studied. In this paper, we propose a security property on the where-dimension of declassification and present an enforcement based on automated verification. The approach automatically transforms the abstract model with a variant of self-composition, and checks the reachability of illegal-flow state of the model after transformation. The self-composition is equipped with a store-match pattern to reduce the state space and to model the equivalence of declassified expressions in the premise of property. The evaluation shows that our approach is more precise than type-based enforcement.
{"title":"A new enforcement on declassification with reachability analysis","authors":"Cong Sun, Liyong Tang, Zhong Chen","doi":"10.1109/INFCOMW.2011.5928777","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928777","url":null,"abstract":"Language-based information flow security aims to decide whether an action-observable program can unintentionally leak confidential information if it has the authority to access confidential data. Recent concerns about declassification polices have provided many choices for practical intended information release, but more precise enforcement mechanism for these policies is insufficiently studied. In this paper, we propose a security property on the where-dimension of declassification and present an enforcement based on automated verification. The approach automatically transforms the abstract model with a variant of self-composition, and checks the reachability of illegal-flow state of the model after transformation. The self-composition is equipped with a store-match pattern to reduce the state space and to model the equivalence of declassified expressions in the premise of property. The evaluation shows that our approach is more precise than type-based enforcement.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"21 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":"125252243","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
扫码关注我们
求助内容：
应助结果提醒方式：