The exponential growth of wireless service has led to a great amount of energy consumption on base stations. In this paper, we envision that base stations of future cellular networks are heterogenous and can be powered by hybrid energy supplies: on-grid energy and green energy. And the unit cost of green energy can be much less than that of on-grid energy. We study the energy cost saving problem and propose an adaptive range expansion algorithm in such a green heterogeneous network. The key idea of our proposed algorithm is to adaptively set the biasing factor for each pico BS according to the estimated energy drain ratio to make more utilization of the green energy for energy cost saving. We compare the proposed algorithm with the max-RSRP algorithm and the conventional range expansion algorithm with an identical biasing factor for all pico BSs. Simulation results demonstrate that our proposed algorithm can significantly reduce the total energy cost.
{"title":"Adaptive Cell Range Expansion for Energy Cost Saving in Heterogeneous Cellular Networks with Hybrid Energy Supplies","authors":"Qiao Kong, Bang Wang","doi":"10.1109/AINA.2015.276","DOIUrl":"https://doi.org/10.1109/AINA.2015.276","url":null,"abstract":"The exponential growth of wireless service has led to a great amount of energy consumption on base stations. In this paper, we envision that base stations of future cellular networks are heterogenous and can be powered by hybrid energy supplies: on-grid energy and green energy. And the unit cost of green energy can be much less than that of on-grid energy. We study the energy cost saving problem and propose an adaptive range expansion algorithm in such a green heterogeneous network. The key idea of our proposed algorithm is to adaptively set the biasing factor for each pico BS according to the estimated energy drain ratio to make more utilization of the green energy for energy cost saving. We compare the proposed algorithm with the max-RSRP algorithm and the conventional range expansion algorithm with an identical biasing factor for all pico BSs. Simulation results demonstrate that our proposed algorithm can significantly reduce the total energy cost.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"51 1","pages":"829-836"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87847381","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}
Wireless sensor network (WSN) has been widely implemented on a large scale that deals with monitoring and controlling the real environment. Coverage and connectivity are the two most active areas of concerned and also these functionalities are desired in WSN. Connectivity in WSN is generally defined as how well the nodes are connected so that the sink node must receive every bit of information sent by any other node. In the mean while, any event occurred at any point in the specified area should be detected, and it is referred as coverage in WSN. In order to fulfill both these requirements, in this paper, we proposed a coverage algorithm, in which a hierarchical structure is first constructed to satisfy the connectivity and the same structure is further extended to achieve full coverage in WSN. In this proposed approach, a tree is constructed by using a routing mechanism with sleep scheduling, such that all intermediate nodes which are participating in routing are in active mode, and the rest of the nodes are likely to be in sleep mode. Further, to fulfill the coverage requirement, we divide the leaf nodes again into two parts, i.e., The leaf nodes that are active, but not participating in routing, and the leaf nodes that are completely in sleep mode. The tree is reconstructed periodically to ensure balanced consumption of energy among all the nodes in WSN. The performance of the proposed protocol is carried out using the Castalia simulator.
{"title":"Energy Efficient Extended Coverage in Wireless Sensor Networks","authors":"N. Tarasia, M. R. Lenka, Amulya Ratna Swain","doi":"10.1109/AINA.2015.192","DOIUrl":"https://doi.org/10.1109/AINA.2015.192","url":null,"abstract":"Wireless sensor network (WSN) has been widely implemented on a large scale that deals with monitoring and controlling the real environment. Coverage and connectivity are the two most active areas of concerned and also these functionalities are desired in WSN. Connectivity in WSN is generally defined as how well the nodes are connected so that the sink node must receive every bit of information sent by any other node. In the mean while, any event occurred at any point in the specified area should be detected, and it is referred as coverage in WSN. In order to fulfill both these requirements, in this paper, we proposed a coverage algorithm, in which a hierarchical structure is first constructed to satisfy the connectivity and the same structure is further extended to achieve full coverage in WSN. In this proposed approach, a tree is constructed by using a routing mechanism with sleep scheduling, such that all intermediate nodes which are participating in routing are in active mode, and the rest of the nodes are likely to be in sleep mode. Further, to fulfill the coverage requirement, we divide the leaf nodes again into two parts, i.e., The leaf nodes that are active, but not participating in routing, and the leaf nodes that are completely in sleep mode. The tree is reconstructed periodically to ensure balanced consumption of energy among all the nodes in WSN. The performance of the proposed protocol is carried out using the Castalia simulator.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"21 1","pages":"247-254"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87813354","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}
S. Harishankar, I. Woungang, S. K. Dhurandher, I. Traoré, Shakira Banu Kaleel
In mobile ad hoc networks (MANETs), nodes are mobile and have limited energy resource that can quickly deplete due to multi-hop routing activities, which may gradually lead to an un-operational network. In the past decade, the hunt for a reliable and energy-efficient MANETs routing protocol has been extensively researched. This paper proposes a novel Ant Net-based routing scheme for MANETs (so-called MAnt Net), and an its enhanced energy-aware version (so-called E-MAnt Net), for which the routing decisions are facilitated based on the nodes' residual energy. These protocols were evaluated through simulations using NS2, showing that E-MAnt Net outperforms both MAnt Net and EAODV, in terms of network residual energy, network lifetime, number of established connections, and the number of dead nodes in the network, where E-AODV is an energy-aware version of AODV.
{"title":"E-MAnt Net: An ACO-Based Energy Efficient Routing Protocol for Mobile Ad Hoc Networks","authors":"S. Harishankar, I. Woungang, S. K. Dhurandher, I. Traoré, Shakira Banu Kaleel","doi":"10.1109/AINA.2015.162","DOIUrl":"https://doi.org/10.1109/AINA.2015.162","url":null,"abstract":"In mobile ad hoc networks (MANETs), nodes are mobile and have limited energy resource that can quickly deplete due to multi-hop routing activities, which may gradually lead to an un-operational network. In the past decade, the hunt for a reliable and energy-efficient MANETs routing protocol has been extensively researched. This paper proposes a novel Ant Net-based routing scheme for MANETs (so-called MAnt Net), and an its enhanced energy-aware version (so-called E-MAnt Net), for which the routing decisions are facilitated based on the nodes' residual energy. These protocols were evaluated through simulations using NS2, showing that E-MAnt Net outperforms both MAnt Net and EAODV, in terms of network residual energy, network lifetime, number of established connections, and the number of dead nodes in the network, where E-AODV is an energy-aware version of AODV.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"4 1","pages":"29-36"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87895427","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}
The Wi-Fi technology has been fast growing and available on a huge number of electronic devices. Moreover, due to the easiness in deployment a Wi-Fi user is normally in the coverage of several surrounding Wi-Fi access points (APs). The Wi-Fi virtualization, which abstracts a Wi-Fi interface to appear as several virtual ones to the user, is one of the most significant current approaches in improving the performance of Wi-Fi networking. The existence of multiple virtual interfaces enables many useful applications such as aggregating APs' backhaul bandwidth, sharing Internet connections, or increasing range of Wi-Fi networks, etc. In the previously mentioned applications, the authors generally show that a Wi-Fi client with several virtual interfaces has better performances than the one with a physical interface under the considered metrics (e.g., Throughput, mobility, etc.). However, they have not shown the investigation on the performance bounds of the virtual Wi-Fi links. Therefore, it is worthy to investigate those performance parameters. This work extensively evaluates a real virtual Wi-Fi based system to reveal the capacity of downlink, uplink of the virtual Wi-Fi interfaces.
{"title":"Investigating Performance of Concurrent Virtual Wi-Fi Interfaces","authors":"K. Nguyen, K. Ishizu, H. Murakami, F. Kojima","doi":"10.1109/WAINA.2015.43","DOIUrl":"https://doi.org/10.1109/WAINA.2015.43","url":null,"abstract":"The Wi-Fi technology has been fast growing and available on a huge number of electronic devices. Moreover, due to the easiness in deployment a Wi-Fi user is normally in the coverage of several surrounding Wi-Fi access points (APs). The Wi-Fi virtualization, which abstracts a Wi-Fi interface to appear as several virtual ones to the user, is one of the most significant current approaches in improving the performance of Wi-Fi networking. The existence of multiple virtual interfaces enables many useful applications such as aggregating APs' backhaul bandwidth, sharing Internet connections, or increasing range of Wi-Fi networks, etc. In the previously mentioned applications, the authors generally show that a Wi-Fi client with several virtual interfaces has better performances than the one with a physical interface under the considered metrics (e.g., Throughput, mobility, etc.). However, they have not shown the investigation on the performance bounds of the virtual Wi-Fi links. Therefore, it is worthy to investigate those performance parameters. This work extensively evaluates a real virtual Wi-Fi based system to reveal the capacity of downlink, uplink of the virtual Wi-Fi interfaces.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"31 1","pages":"382-386"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86593585","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}
The increasing adoption of Machine-Type Communication (MTC) applications over the Long Term Evolution-Advanced (LTE-Advanced) network brings new challenges for the traditional resources allocation. Particularly, we focus on the smart metering traffic, which is less time-sensitive and transmitting small data at infrequent periods. In this scenario, many MTC devices transmit access requests to the eNodeBat the same time. This situation causes a serious problem of access congestion. Unfortunately, existing scheduling algorithms are not be able to efficiently handle smart metering traffic at a heavily loaded eNodeB. Specifically, there may not be sufficient resource blocks (RBs) available at an eNodeB for smart metering traffic. In this paper, we utilize a combination of Machine-Type Communications and Device-to-Device (D2D)communications to design our group-based uplink scheduling algorithm. In addition, we also take into account the fairness of inter-group and intra-group. Our simulation results demonstrate the benefits of our proposed scheme compared to conventional approaches on resource allocation.
随着LTE-Advanced (Long Term Evolution-Advanced)网络中机器类型通信(MTC)应用的日益普及，对传统的资源分配提出了新的挑战。特别是，我们关注的是智能计量流量，它对时间的敏感度较低，并且在不频繁的时间段传输小数据。在这种场景下，多台MTC设备同时向eNodeBat发送访问请求。这种情况导致了严重的访问拥塞问题。不幸的是，现有的调度算法无法有效地处理负载沉重的eNodeB上的智能计量流量。具体来说，eNodeB上可能没有足够的资源块(RBs)用于智能计量流量。在本文中，我们利用机器类型通信和设备到设备(D2D)通信的组合来设计基于组的上行调度算法。此外，我们还考虑了组间和组内的公平性。仿真结果表明，与传统的资源分配方法相比，本文提出的方案具有优势。
{"title":"Group-Based Uplink Scheduling for Machine-Type Communications in LTE-Advanced Networks","authors":"Tsung-Hui Chuang, Meng-Hsun Tsai, Chun-Yi Chuang","doi":"10.1109/WAINA.2015.54","DOIUrl":"https://doi.org/10.1109/WAINA.2015.54","url":null,"abstract":"The increasing adoption of Machine-Type Communication (MTC) applications over the Long Term Evolution-Advanced (LTE-Advanced) network brings new challenges for the traditional resources allocation. Particularly, we focus on the smart metering traffic, which is less time-sensitive and transmitting small data at infrequent periods. In this scenario, many MTC devices transmit access requests to the eNodeBat the same time. This situation causes a serious problem of access congestion. Unfortunately, existing scheduling algorithms are not be able to efficiently handle smart metering traffic at a heavily loaded eNodeB. Specifically, there may not be sufficient resource blocks (RBs) available at an eNodeB for smart metering traffic. In this paper, we utilize a combination of Machine-Type Communications and Device-to-Device (D2D)communications to design our group-based uplink scheduling algorithm. In addition, we also take into account the fairness of inter-group and intra-group. Our simulation results demonstrate the benefits of our proposed scheme compared to conventional approaches on resource allocation.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"9 1","pages":"652-657"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86824961","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}
Aboobeker Sidhik Koyamparambil Mammu, Josef Jiru, U. Hernández-Jayo
Recently, we are witnessing increased interest in the research of Vehicular Ad-hoc Networks (VANETs). Due to the peculiar characteristics of VANETs, such as high speed, the unstable communication link, and network partitioning, information transfer becomes inevitably challenging. The main communication challenges in vehicle to vehicle communication is scalability, predictability and reliability. With increasing number of vehicles in highway congestion scenarios, the congestion application need to disseminate large amount of information over multiple hops to the control center. This challenge can be solved by reducing the data load through clustering and data aggregation. In this paper, we propose cluster based semantic data aggregation (CBSDA) protocol that divide the road into different segments based on the cluster-ID and aggregate the data in each cluster. The aggregation scheme is a lossy aggregation with maximum precision. CBSDA scheme stores the data using a data structure that consists of super cluster, cluster and cluster member (CM) nodes. CBSDA is proposed to adaptively adjust the number of super cluster nodes. Moreover, the CBSDA scheme consists of weighted deviation scheme that decides which data to be fused for aggregation. Additionally, the aggregation level is controlled based on the density of vehicles and channel busy ratio (CBR). Simulation results show that the CBSDA using weighted deviation decision scheme is able to quickly reduce the channel congestion and improve the data precision even in congested traffic scenarios.
{"title":"Cluster Based Semantic Data Aggregation in VANETs","authors":"Aboobeker Sidhik Koyamparambil Mammu, Josef Jiru, U. Hernández-Jayo","doi":"10.1109/AINA.2015.263","DOIUrl":"https://doi.org/10.1109/AINA.2015.263","url":null,"abstract":"Recently, we are witnessing increased interest in the research of Vehicular Ad-hoc Networks (VANETs). Due to the peculiar characteristics of VANETs, such as high speed, the unstable communication link, and network partitioning, information transfer becomes inevitably challenging. The main communication challenges in vehicle to vehicle communication is scalability, predictability and reliability. With increasing number of vehicles in highway congestion scenarios, the congestion application need to disseminate large amount of information over multiple hops to the control center. This challenge can be solved by reducing the data load through clustering and data aggregation. In this paper, we propose cluster based semantic data aggregation (CBSDA) protocol that divide the road into different segments based on the cluster-ID and aggregate the data in each cluster. The aggregation scheme is a lossy aggregation with maximum precision. CBSDA scheme stores the data using a data structure that consists of super cluster, cluster and cluster member (CM) nodes. CBSDA is proposed to adaptively adjust the number of super cluster nodes. Moreover, the CBSDA scheme consists of weighted deviation scheme that decides which data to be fused for aggregation. Additionally, the aggregation level is controlled based on the density of vehicles and channel busy ratio (CBR). Simulation results show that the CBSDA using weighted deviation decision scheme is able to quickly reduce the channel congestion and improve the data precision even in congested traffic scenarios.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"5 1","pages":"747-753"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86402018","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}
This paper focuses on evaluating the use of MPTCP to forward sub flows in Open Flow networks. MPTCP is a network protocol designed to forward sub flows through disjointed paths. Modern networks commonly use Equal-Cost Multipath Protocol (ECMP) to split flows through distinct paths. However, even with ECMP enabled, sub flows may be forwarded through the same path. MPTCP improves the multipath routing by setting sub flows to be forwarded through distinct paths. As a consequence, the amount of sub flows must be considered to evaluate the network throughput. In this paper, we design Multiflow to use MPTCP in Open Flow networks. Our proposal is to improve the throughput in shared bottlenecks by forwarding sub flows from a same MPTCP connection through multiple paths. We validate our approach in a test bed where shared bottlenecks occur in the link at the endpoints. The Multiflow improvement of the network performance is evaluated in experiments about resilience and end-to-end throughput.
{"title":"On the Benefits of Using Multipath TCP and Openflow in Shared Bottlenecks","authors":"M. Sandri, Alan C. Silva, L. Rocha, F. Verdi","doi":"10.1109/AINA.2015.159","DOIUrl":"https://doi.org/10.1109/AINA.2015.159","url":null,"abstract":"This paper focuses on evaluating the use of MPTCP to forward sub flows in Open Flow networks. MPTCP is a network protocol designed to forward sub flows through disjointed paths. Modern networks commonly use Equal-Cost Multipath Protocol (ECMP) to split flows through distinct paths. However, even with ECMP enabled, sub flows may be forwarded through the same path. MPTCP improves the multipath routing by setting sub flows to be forwarded through distinct paths. As a consequence, the amount of sub flows must be considered to evaluate the network throughput. In this paper, we design Multiflow to use MPTCP in Open Flow networks. Our proposal is to improve the throughput in shared bottlenecks by forwarding sub flows from a same MPTCP connection through multiple paths. We validate our approach in a test bed where shared bottlenecks occur in the link at the endpoints. The Multiflow improvement of the network performance is evaluated in experiments about resilience and end-to-end throughput.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"78 1","pages":"9-16"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86418475","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}
A. H. Khan, N. Javaid, M. Imran, Z. Khan, U. Qasim, Noman Haider
The prolonged existence of wireless sensor networks (WSNs) is a major issue that impacts the application of such networks. This issue can be addressed by sink mobility which is an effective way to enhance network lifetime. Most of the proposals give evidence of lifetime improvement, however, joint optimization of sink mobility and routing is still an important area in WSNs. In this paper, we present need-based clustering (NbC) with dynamic joint sink mobility (JSM) scheme (DYN-NbC-JSM) for WSNs. Our proposed scheme increases the stability period, network lifetime, and throughput of the WSN. The scheme incorporates dynamic sink mobility in a way that two mobile sinks jointly move in the regions of highest density and sparsity. Intelligently moving the sink to high density region ensures maximum collection of data. As, more number of nodes are able to send data directly to sink, therefore, significant amount of energy is saved in each particular round. Secondly, moving another sink to sparse region, save the energy for nodes which due to communicating at long distances (as sparsely disributed) are close to death. However, there is certain limitation to this approach. Nodes which are far from sink have to wait much for their turn. So, there is chance of buffer overflow that is not desirable. To overcome this issue our scheme includes NbC. Clustering (communication via CHs) becomes the part for those regions which are away from both sinks. Simulation results show that DYN-NbC-JSM outperforms the other two protocols DYN-NbC-SSM (single sink mobility scenario) and M-LEACH in terms of stability period, network lifetime, and network throughput.
{"title":"DYN-NbC-JSM: Dynamic Joint Sink Mobility with Need-Based Clustering in WSNs","authors":"A. H. Khan, N. Javaid, M. Imran, Z. Khan, U. Qasim, Noman Haider","doi":"10.1109/WAINA.2015.132","DOIUrl":"https://doi.org/10.1109/WAINA.2015.132","url":null,"abstract":"The prolonged existence of wireless sensor networks (WSNs) is a major issue that impacts the application of such networks. This issue can be addressed by sink mobility which is an effective way to enhance network lifetime. Most of the proposals give evidence of lifetime improvement, however, joint optimization of sink mobility and routing is still an important area in WSNs. In this paper, we present need-based clustering (NbC) with dynamic joint sink mobility (JSM) scheme (DYN-NbC-JSM) for WSNs. Our proposed scheme increases the stability period, network lifetime, and throughput of the WSN. The scheme incorporates dynamic sink mobility in a way that two mobile sinks jointly move in the regions of highest density and sparsity. Intelligently moving the sink to high density region ensures maximum collection of data. As, more number of nodes are able to send data directly to sink, therefore, significant amount of energy is saved in each particular round. Secondly, moving another sink to sparse region, save the energy for nodes which due to communicating at long distances (as sparsely disributed) are close to death. However, there is certain limitation to this approach. Nodes which are far from sink have to wait much for their turn. So, there is chance of buffer overflow that is not desirable. To overcome this issue our scheme includes NbC. Clustering (communication via CHs) becomes the part for those regions which are away from both sinks. Simulation results show that DYN-NbC-JSM outperforms the other two protocols DYN-NbC-SSM (single sink mobility scenario) and M-LEACH in terms of stability period, network lifetime, and network throughput.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"99 4 1","pages":"320-325"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83614344","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}
A data processing functions are expected as a key-issue of knowledge-intensive service functions in the Cloud computing environment. Cloud computing is a technology that evolved from technologies of the field of virtual machine and distributed computing. However, these unique technologies brings unique privacy and security problems concerns for customers and service providers due to involvement of expertise (such as knowledge, experience, idea, etc.) in data to be processed. We propose the cryptographic protocols preserving the privacy of users and confidentiality of the problem solving servers.
{"title":"Privacy Preserving Data Processing","authors":"H. Yamaguchi, M. Gotaishi, P. Sheu, S. Tsujii","doi":"10.1109/AINA.2015.258","DOIUrl":"https://doi.org/10.1109/AINA.2015.258","url":null,"abstract":"A data processing functions are expected as a key-issue of knowledge-intensive service functions in the Cloud computing environment. Cloud computing is a technology that evolved from technologies of the field of virtual machine and distributed computing. However, these unique technologies brings unique privacy and security problems concerns for customers and service providers due to involvement of expertise (such as knowledge, experience, idea, etc.) in data to be processed. We propose the cryptographic protocols preserving the privacy of users and confidentiality of the problem solving servers.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"40 1","pages":"714-719"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77691950","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}
K. Aburada, Yoshihiro Kita, Mirang Park, N. Okazaki
In recent years, with the improvement of the high speed communication infrastructure, P2P content distribution systems have been attracting more attention. In a P2P content distribution system, the lack of a central management server provides the system its robustness. However, it also leads to problems in content reliability and accessibility. We propose a secure content distribution system with improved accessibility by introducing a secret sharing scheme.
{"title":"Content Access Control Scheme for P2P Networks Using a Reputation Value","authors":"K. Aburada, Yoshihiro Kita, Mirang Park, N. Okazaki","doi":"10.1109/AINA.2015.232","DOIUrl":"https://doi.org/10.1109/AINA.2015.232","url":null,"abstract":"In recent years, with the improvement of the high speed communication infrastructure, P2P content distribution systems have been attracting more attention. In a P2P content distribution system, the lack of a central management server provides the system its robustness. However, it also leads to problems in content reliability and accessibility. We propose a secure content distribution system with improved accessibility by introducing a secret sharing scheme.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"33 1","pages":"527-533"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73969273","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
扫码关注我们
求助内容：
应助结果提醒方式：