Pub Date : 2014-07-28DOI: 10.1109/CCNC.2014.6866594
Benjamin Michéle, Andrew Karpow
Smart TVs are slowly becoming ubiquitous in households and offices, offering an ever-growing number of features such as Internet access, media players, and built-in cameras and microphones. They are physically placed in sensitive locations and connected to trusted home and business networks. These TVs use the same operating systems and software stacks as regular PCs, leaving them vulnerable to similar software-based attacks. Even worse, security updates are provided much less frequently and stop completely after the TV has reached end-of-life. Furthermore, as these systems are closed, it is nearly impossible for end users to examine if the TV is vulnerable or if it has been compromised. This paper demonstrates that Smart TVs in their current state must not be considered trustworthy and therefore pose a severe security and privacy threat. We show that the integrated media player - a feature offered on nearly every Smart TV on the market, ranging from entry level to high end models and regardless of the vendor - is highly vulnerable. We developed a practical proof-of-concept attack using a malicious video file that gives an attacker permanent, full control over the device, yet is completely undetectable by the user. Furthermore, we provide fully functional payloads for stealthily tapping into a TV's camera and microphone.
{"title":"Watch and be watched: Compromising all Smart TV generations","authors":"Benjamin Michéle, Andrew Karpow","doi":"10.1109/CCNC.2014.6866594","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866594","url":null,"abstract":"Smart TVs are slowly becoming ubiquitous in households and offices, offering an ever-growing number of features such as Internet access, media players, and built-in cameras and microphones. They are physically placed in sensitive locations and connected to trusted home and business networks. These TVs use the same operating systems and software stacks as regular PCs, leaving them vulnerable to similar software-based attacks. Even worse, security updates are provided much less frequently and stop completely after the TV has reached end-of-life. Furthermore, as these systems are closed, it is nearly impossible for end users to examine if the TV is vulnerable or if it has been compromised. This paper demonstrates that Smart TVs in their current state must not be considered trustworthy and therefore pose a severe security and privacy threat. We show that the integrated media player - a feature offered on nearly every Smart TV on the market, ranging from entry level to high end models and regardless of the vendor - is highly vulnerable. We developed a practical proof-of-concept attack using a malicious video file that gives an attacker permanent, full control over the device, yet is completely undetectable by the user. Furthermore, we provide fully functional payloads for stealthily tapping into a TV's camera and microphone.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"37 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133489339","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 : 2014-07-28DOI: 10.1109/CCNC.2014.6866615
Navid Alamatsaz, Arash Boustani, Murtuza Jadliwala, V. Namboodiri
Security and privacy concerns in the future power grid have recently received tremendous focus from security advocates. Most existing security mechanisms utilize cryptographic techniques that are computationally expensive and bandwidth intensive. However, aggregating the large outputs of these cryptographic algorithms has not been considered thoroughly. Smart Grid Networks (SGN) generally have limitations on bandwidth, network capacity and energy. Hence, utilizing data aggregation algorithms, the limited bandwidth can be efficiently utilized. Most of the aggregation algorithms use statistical functions such as minimum, maximum, and average. before transmitting data over the network. Existing aggregation algorithms, in SGNs, are generally expensive in terms of communication overhead, processing load and delay. However, our proposed CDMA-based data aggregation method provides access to all the data of all the smart meters in the root node, which in this case is the Utility Center, while keeping the smart metering data secure. The efficiency of the proposed method is confirmed by mathematical analysis.
{"title":"AgSec: Secure and efficient CDMA-based aggregation for smart metering systems","authors":"Navid Alamatsaz, Arash Boustani, Murtuza Jadliwala, V. Namboodiri","doi":"10.1109/CCNC.2014.6866615","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866615","url":null,"abstract":"Security and privacy concerns in the future power grid have recently received tremendous focus from security advocates. Most existing security mechanisms utilize cryptographic techniques that are computationally expensive and bandwidth intensive. However, aggregating the large outputs of these cryptographic algorithms has not been considered thoroughly. Smart Grid Networks (SGN) generally have limitations on bandwidth, network capacity and energy. Hence, utilizing data aggregation algorithms, the limited bandwidth can be efficiently utilized. Most of the aggregation algorithms use statistical functions such as minimum, maximum, and average. before transmitting data over the network. Existing aggregation algorithms, in SGNs, are generally expensive in terms of communication overhead, processing load and delay. However, our proposed CDMA-based data aggregation method provides access to all the data of all the smart meters in the root node, which in this case is the Utility Center, while keeping the smart metering data secure. The efficiency of the proposed method is confirmed by mathematical analysis.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115881248","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 : 2014-07-28DOI: 10.1109/CCNC.2014.6866633
K. Ahmed, M. Gregory
Due to the sensor hardware inaccuracy and deviation of environmental parameter, detection of imprecise data by sensor is very likely. Hence, similarity searching problem is receiving significant consideration and became an important problem to resolve. However, most of the state-of-the-art Data Centric Storage (DCS) Schemes lack optimization for similarity query of the events. This paper proposes a distributed metric based data centric similarity storage scheme (DMDCS). DMDCS takes the advantage of the idea of a vector index method, called iDistance and transforms the issue of similarity searching into the problem of interval search in one dimension. Experimental results show that DMDCS yields significant improvements on the efficiency of data querying compared with existing approaches.
{"title":"Distributed data centric similarity storage scheme in wireless sensor network","authors":"K. Ahmed, M. Gregory","doi":"10.1109/CCNC.2014.6866633","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866633","url":null,"abstract":"Due to the sensor hardware inaccuracy and deviation of environmental parameter, detection of imprecise data by sensor is very likely. Hence, similarity searching problem is receiving significant consideration and became an important problem to resolve. However, most of the state-of-the-art Data Centric Storage (DCS) Schemes lack optimization for similarity query of the events. This paper proposes a distributed metric based data centric similarity storage scheme (DMDCS). DMDCS takes the advantage of the idea of a vector index method, called iDistance and transforms the issue of similarity searching into the problem of interval search in one dimension. Experimental results show that DMDCS yields significant improvements on the efficiency of data querying compared with existing approaches.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125822174","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 : 2014-07-28DOI: 10.1109/CCNC.2014.6866553
John Hubbard, Ken Weimer, Yu Chen
According to recent articles in popular technology websites, some mobile applications function in an insecure manner when presented with untrusted SSL certificates. These non-browser based applications seem to, in the absence of a standard way of alerting a user of an SSL error, accept any certificate presented to it. This paper intends to research these claims and show whether or not an invisible proxy based SSL attack can indeed steal user's credentials from mobile applications, and which types applications are most likely to be vulnerable to this attack vector. To ensure coverage of the most popular platforms, applications on both Android 4.2 and iOS 6 are tested. The results of our study showed that stealing credentials is indeed possible using invisible proxy man in the middle attacks.
{"title":"A study of SSL Proxy attacks on Android and iOS mobile applications","authors":"John Hubbard, Ken Weimer, Yu Chen","doi":"10.1109/CCNC.2014.6866553","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866553","url":null,"abstract":"According to recent articles in popular technology websites, some mobile applications function in an insecure manner when presented with untrusted SSL certificates. These non-browser based applications seem to, in the absence of a standard way of alerting a user of an SSL error, accept any certificate presented to it. This paper intends to research these claims and show whether or not an invisible proxy based SSL attack can indeed steal user's credentials from mobile applications, and which types applications are most likely to be vulnerable to this attack vector. To ensure coverage of the most popular platforms, applications on both Android 4.2 and iOS 6 are tested. The results of our study showed that stealing credentials is indeed possible using invisible proxy man in the middle attacks.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126795253","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 : 2014-07-28DOI: 10.1109/CCNC.2014.6866558
Seong-Mun Kim, Hyon-Young Choi, Pill-Won Park, Sung-Gi Min, Youn-Hee Han
Software Defined Network (SDN) is widely deployed by using OpenFlow protocol for the implementation of flexible networking. A lot of researches are progressing to adapt OpenFlow to existing network architectures. PMIPv6 is proposed to handle the network-based local mobility using IP tunneling. However, it has some weak points such as IP tunneling overhead and sharing same path for the data and the control planes. In this paper, we propose OpenFlow-based Proxy Mobile IPv6 (PMIPv6) to obtain the advantages of the OpenFlow architecture for PMIPv6 network. The proposed scheme separates the mobility management function from the components of PMIPv6. It preserves the functionalities and messages defined in PMIPv6 but reconstructs components to take the advantages offered by the OpenFlow architecture. The reconstructed components set the flow table of switches located in the path as the controller of OpenFlow. The proposed scheme removes the tunneling to forward user traffic and separates the data and the control planes. OpenFlow-based PMIPv6 offers more flexible deployment architecture.
软件定义网络SDN (Software Defined Network)被广泛部署，采用OpenFlow协议实现灵活的组网。为了使OpenFlow适应现有的网络架构，许多研究正在进行中。提出了PMIPv6协议，利用IP隧道来处理基于网络的本地移动。然而，它有一些弱点，如IP隧道开销和数据和控制平面共享相同的路径。在本文中，我们提出了基于OpenFlow的代理移动IPv6 (Proxy Mobile IPv6, PMIPv6)，以获得OpenFlow架构在PMIPv6网络中的优势。该方案将移动管理功能从PMIPv6的组件中分离出来。它保留了PMIPv6中定义的功能和消息，但重构了组件以利用OpenFlow体系结构提供的优势。重构组件将位于路径中的交换机流表作为OpenFlow的控制器。该方案消除了转发用户流量的隧道，并将数据平面和控制平面分开。基于openflow的PMIPv6提供了更灵活的部署架构。
{"title":"OpenFlow-based Proxy mobile IPv6 over software defined network (SDN)","authors":"Seong-Mun Kim, Hyon-Young Choi, Pill-Won Park, Sung-Gi Min, Youn-Hee Han","doi":"10.1109/CCNC.2014.6866558","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866558","url":null,"abstract":"Software Defined Network (SDN) is widely deployed by using OpenFlow protocol for the implementation of flexible networking. A lot of researches are progressing to adapt OpenFlow to existing network architectures. PMIPv6 is proposed to handle the network-based local mobility using IP tunneling. However, it has some weak points such as IP tunneling overhead and sharing same path for the data and the control planes. In this paper, we propose OpenFlow-based Proxy Mobile IPv6 (PMIPv6) to obtain the advantages of the OpenFlow architecture for PMIPv6 network. The proposed scheme separates the mobility management function from the components of PMIPv6. It preserves the functionalities and messages defined in PMIPv6 but reconstructs components to take the advantages offered by the OpenFlow architecture. The reconstructed components set the flow table of switches located in the path as the controller of OpenFlow. The proposed scheme removes the tunneling to forward user traffic and separates the data and the control planes. OpenFlow-based PMIPv6 offers more flexible deployment architecture.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124490165","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}
Stream Control Transport Protocol (SCTP)-based multimedia streaming has gained variety of attentions and resulted in many peer-reviewed publications. However, there is no MAC-SCTP cross-layer path switching strategy appropriate for wireless networking, where wireless error tends to occur frequently due to the intrinsic wireless link characteristics. As a remedy, we in this paper propose a novel Cross-layer Cognitive SCTP (SCTP-C2) for efficient multimedia data delivery by jointly considering the characteristics of MAC layer and transport layer. A Cross-layer Path Switching Trigger (CPST) is designed in SCTP-C2 to improve the efficiency of the path switching mechanism and further provide an optimal congestion window (cwnd) fast recovery scheme after path switching. A Congestion-aware Multimedia Data Distributor (CMDD) is introduced in SCTP-C2 to overcome a "hot-potato" congestion problem and enable an optimal transmission behavior by identifying network congestion. The results gained by a close realistic simulation topology show that how SCTP-C2 outperforms existing SCTP protocol in terms of consumers' experience of quality for multimedia streaming service.
{"title":"SCTP-C2: Cross-layer Cognitive SCTP for multimedia streaming over multi-homed wireless networks","authors":"Yuanlong Cao, Changqiao Xu, Jianfeng Guan, Hongke Zhang","doi":"10.1109/CCNC.2014.6866576","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866576","url":null,"abstract":"Stream Control Transport Protocol (SCTP)-based multimedia streaming has gained variety of attentions and resulted in many peer-reviewed publications. However, there is no MAC-SCTP cross-layer path switching strategy appropriate for wireless networking, where wireless error tends to occur frequently due to the intrinsic wireless link characteristics. As a remedy, we in this paper propose a novel Cross-layer Cognitive SCTP (SCTP-C2) for efficient multimedia data delivery by jointly considering the characteristics of MAC layer and transport layer. A Cross-layer Path Switching Trigger (CPST) is designed in SCTP-C2 to improve the efficiency of the path switching mechanism and further provide an optimal congestion window (cwnd) fast recovery scheme after path switching. A Congestion-aware Multimedia Data Distributor (CMDD) is introduced in SCTP-C2 to overcome a \"hot-potato\" congestion problem and enable an optimal transmission behavior by identifying network congestion. The results gained by a close realistic simulation topology show that how SCTP-C2 outperforms existing SCTP protocol in terms of consumers' experience of quality for multimedia streaming service.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130716933","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 : 2014-07-28DOI: 10.1109/CCNC.2014.6866631
Dantong Liu, Yue Chen, K. K. Chai, Tiankui Zhang
In this paper, a fair user association scheme is proposed for heterogeneous networks (HetNets), where the user association optimization is formulated as a Nash bargaining problem. The optimization objective is to maximize the sum of rate related utility, under users' minimal rate constrains, while considering user fairness and load balance between cells in different tiers. Nash bargaining solution and coalition are adopted to solve this optimization problem. Firstly, a two-player bargaining scheme is developed for two base stations (BSs) to bargain user association. Then this two-player scheme is extended to a multi-player bargaining scheme with the aid of Hungarian algorithm that optimally groups BSs into pairs. Simulation results show that the proposed scheme can effectively offload users from macrocells, improve user fairness, and also achieve comparable sum rate to the scheme that maximizes the sum rate without considering user fairness.
{"title":"Nash bargaining solution based user association optimization in HetNets","authors":"Dantong Liu, Yue Chen, K. K. Chai, Tiankui Zhang","doi":"10.1109/CCNC.2014.6866631","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866631","url":null,"abstract":"In this paper, a fair user association scheme is proposed for heterogeneous networks (HetNets), where the user association optimization is formulated as a Nash bargaining problem. The optimization objective is to maximize the sum of rate related utility, under users' minimal rate constrains, while considering user fairness and load balance between cells in different tiers. Nash bargaining solution and coalition are adopted to solve this optimization problem. Firstly, a two-player bargaining scheme is developed for two base stations (BSs) to bargain user association. Then this two-player scheme is extended to a multi-player bargaining scheme with the aid of Hungarian algorithm that optimally groups BSs into pairs. Simulation results show that the proposed scheme can effectively offload users from macrocells, improve user fairness, and also achieve comparable sum rate to the scheme that maximizes the sum rate without considering user fairness.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134537704","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 : 2014-07-28DOI: 10.1109/CCNC.2014.6866546
Ying Li, Jianzhong Zhang, Mian Dong
In this paper, we research on an interdisciplinary field of how the Smart Grid can help energy cost reduction in wireless communications. We study how the advances in the Smart Grid such as the information on predicted electricity price can be used to help reduce the energy cost of the cellular networks. Particularly, smart energy management at cell-sites is studied to minimize the electricity cost for mobile operators by leveraging time-varying electricity prices in the Smart Grid. We first propose a theoretical framework to optimally manage energy at a single cell-site (without and with energy harvester, respectively) by judiciously choosing which power source (the Power-Grid or a storage-battery) to use, when and how much to use in the cell-site; as well as controlling when and how much to charge the storage-battery. Moreover, we extend the framework from a single cell-site to a network including multiple cell-sites with different electricity prices or energy storage capacity, etc., where cell association, power control, and scheduling can be jointly considered to provide load shifting and cell ON/OFF to achieve mobile network operation with the lowest electricity cost.
{"title":"Smart Grid in radio access networks (SG-RAN): Smart energy management at cell-sites","authors":"Ying Li, Jianzhong Zhang, Mian Dong","doi":"10.1109/CCNC.2014.6866546","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866546","url":null,"abstract":"In this paper, we research on an interdisciplinary field of how the Smart Grid can help energy cost reduction in wireless communications. We study how the advances in the Smart Grid such as the information on predicted electricity price can be used to help reduce the energy cost of the cellular networks. Particularly, smart energy management at cell-sites is studied to minimize the electricity cost for mobile operators by leveraging time-varying electricity prices in the Smart Grid. We first propose a theoretical framework to optimally manage energy at a single cell-site (without and with energy harvester, respectively) by judiciously choosing which power source (the Power-Grid or a storage-battery) to use, when and how much to use in the cell-site; as well as controlling when and how much to charge the storage-battery. Moreover, we extend the framework from a single cell-site to a network including multiple cell-sites with different electricity prices or energy storage capacity, etc., where cell association, power control, and scheduling can be jointly considered to provide load shifting and cell ON/OFF to achieve mobile network operation with the lowest electricity cost.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131122057","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 : 2014-07-28DOI: 10.1109/CCNC.2014.6866617
Bin Liu, Hui Tian, Bin Wang, Bo Fan
Due to the lack of spectrum resources in wireless networks, to efficiently make use of the existing heterogeneous wireless networks is of significant importance. Network selection mechanism plays an important role for mobile users to target a network under the principle “always best connected (ABC)” in heterogeneous wireless environment. In this paper, a novel approach for network selection based on the combination of analytic hierarchy process (AHP) and bankruptcy game which is a special type of an N-person cooperative game is proposed and investigated. The AHP method takes the responsibility of evaluating weights of multiple decision criteria, which depends more on the consideration from the user side. On the other hand, the bankruptcy game is mainly used to assess the potentials of available candidate networks. Finally, the combination of AHP and bankruptcy game evaluates the potential contribution ratio (PCR) of each candidate network and the network with the largest PCR is selected.
{"title":"AHP and game theory based approach for network selection in heterogeneous wireless networks","authors":"Bin Liu, Hui Tian, Bin Wang, Bo Fan","doi":"10.1109/CCNC.2014.6866617","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866617","url":null,"abstract":"Due to the lack of spectrum resources in wireless networks, to efficiently make use of the existing heterogeneous wireless networks is of significant importance. Network selection mechanism plays an important role for mobile users to target a network under the principle “always best connected (ABC)” in heterogeneous wireless environment. In this paper, a novel approach for network selection based on the combination of analytic hierarchy process (AHP) and bankruptcy game which is a special type of an N-person cooperative game is proposed and investigated. The AHP method takes the responsibility of evaluating weights of multiple decision criteria, which depends more on the consideration from the user side. On the other hand, the bankruptcy game is mainly used to assess the potentials of available candidate networks. Finally, the combination of AHP and bankruptcy game evaluates the potential contribution ratio (PCR) of each candidate network and the network with the largest PCR is selected.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133309492","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 : 2014-07-28DOI: 10.1109/CCNC.2014.6866587
Jiaming Li, C. Yeo, I. Soon
Robustness is an important issue in tree based P2P streaming applications. In this paper, a new criterion to evaluate robustness is proposed. The criterion is derived from examining the weakest link of stream sources serving a peer. The quality of connection is defined as how complementary the connection is to the other existing connections in order to improve the completeness of the downloading stream as well as the backup copies. Peers can thus find better connection combination and experience the best stream quality and backup robustness from the existing connections. The collective maximization of robustness among peers rather than maximization of a peer's own resource alleviates the contention for resources, and helps the peers to reasonably allocate and utilize the limited network resources. Simulation results show marked performance improvement over other related proposals in terms of stream quality, speed of recovery from failure and ability to respond quickly to changing overlay and network dynamics.
{"title":"Resilient mesh-tree overlay for differentiated temporal requirement service in P2P streaming","authors":"Jiaming Li, C. Yeo, I. Soon","doi":"10.1109/CCNC.2014.6866587","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866587","url":null,"abstract":"Robustness is an important issue in tree based P2P streaming applications. In this paper, a new criterion to evaluate robustness is proposed. The criterion is derived from examining the weakest link of stream sources serving a peer. The quality of connection is defined as how complementary the connection is to the other existing connections in order to improve the completeness of the downloading stream as well as the backup copies. Peers can thus find better connection combination and experience the best stream quality and backup robustness from the existing connections. The collective maximization of robustness among peers rather than maximization of a peer's own resource alleviates the contention for resources, and helps the peers to reasonably allocate and utilize the limited network resources. Simulation results show marked performance improvement over other related proposals in terms of stream quality, speed of recovery from failure and ability to respond quickly to changing overlay and network dynamics.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122305368","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
扫码关注我们
求助内容：
应助结果提醒方式：