Pub Date : 2014-12-29DOI: 10.1109/APNOMS.2014.6996598
K. Thar, Saeed Ullah, C. Hong
The original Content Centric Network (CCN) employs a simple caching scheme, Leave Copy Everywhere (LCE). However, this scheme is not efficient because cache redundancy reduces the storage capacity of the CCN network. In this paper, to resolve the issue of cache redundancy, we propose a cooperative caching decision and forwarding mechanism which is based on consistent hashing and virtual routers. We divide the Autonomous System (AS) into several groups of routers. The routers in the group cooperatively store the contents (Data) and also forward the requests (Interest) cooperatively in order to increase the caching performance of the CCN network. Finally, we evaluate our proposal by using a chunk-level simulator. The results show that the cache hit ratio of our proposed scheme is better than other proposed schemes.
{"title":"Consistent hashing based cooperative caching and forwarding in content centric network","authors":"K. Thar, Saeed Ullah, C. Hong","doi":"10.1109/APNOMS.2014.6996598","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996598","url":null,"abstract":"The original Content Centric Network (CCN) employs a simple caching scheme, Leave Copy Everywhere (LCE). However, this scheme is not efficient because cache redundancy reduces the storage capacity of the CCN network. In this paper, to resolve the issue of cache redundancy, we propose a cooperative caching decision and forwarding mechanism which is based on consistent hashing and virtual routers. We divide the Autonomous System (AS) into several groups of routers. The routers in the group cooperatively store the contents (Data) and also forward the requests (Interest) cooperatively in order to increase the caching performance of the CCN network. Finally, we evaluate our proposal by using a chunk-level simulator. The results show that the cache hit ratio of our proposed scheme is better than other proposed schemes.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129894768","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-12-29DOI: 10.1109/APNOMS.2014.6996588
Kyu-Seok Shim, Su-Kang Lee, Myung-Sup Kim
Today, network traffic has increased because of the appearance of various applications and services. However, methods for network traffic analysis are not developed to catch up the trend of increasing usage of the network. Most methods for network traffic analysis are operated on a single server environment, which results in the limits about memory, processing speed, storage capacity. When considering the increment of network traffic, we need a method of network traffic to handle the Bigdata traffic. Hadoop system can be effectively used for analyzing Bigdata traffic. In this paper, we propose a method of application traffic classification in Hadoop distributed computing system and compare the processing time of the proposed system with a single server system to show the advantages of Hadoop.
{"title":"Application traffic classification in Hadoop distributed computing environment","authors":"Kyu-Seok Shim, Su-Kang Lee, Myung-Sup Kim","doi":"10.1109/APNOMS.2014.6996588","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996588","url":null,"abstract":"Today, network traffic has increased because of the appearance of various applications and services. However, methods for network traffic analysis are not developed to catch up the trend of increasing usage of the network. Most methods for network traffic analysis are operated on a single server environment, which results in the limits about memory, processing speed, storage capacity. When considering the increment of network traffic, we need a method of network traffic to handle the Bigdata traffic. Hadoop system can be effectively used for analyzing Bigdata traffic. In this paper, we propose a method of application traffic classification in Hadoop distributed computing system and compare the processing time of the proposed system with a single server system to show the advantages of Hadoop.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128532930","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-12-29DOI: 10.1109/APNOMS.2014.6996560
T. Ho, Tuan LeAnh, S. M. Ahsan Kazmi, C. Hong
In this paper, we develop an opportunistic scheduling policy for allocating spectrum in cognitive radio networks. We maximize the throughput utility of secondary users subject to maximum collision constraints with the primary users. Particularly, we consider a cognitive radio network with a subset of the secondary users desire to use the licensed channels of primary system in a stochastic environment. Based on Lyapunov technique, we formulate the above problem as a Lyapunov optimization problem on stability region of virtual and actual queues. Then, we propose an online flow control, scheduling and spectrum allocation algorithm that meets the desired objectives and provides explicit performance guarantees.
{"title":"Opportunistic resource allocation via stochastic network optimization in cognitive radio networks","authors":"T. Ho, Tuan LeAnh, S. M. Ahsan Kazmi, C. Hong","doi":"10.1109/APNOMS.2014.6996560","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996560","url":null,"abstract":"In this paper, we develop an opportunistic scheduling policy for allocating spectrum in cognitive radio networks. We maximize the throughput utility of secondary users subject to maximum collision constraints with the primary users. Particularly, we consider a cognitive radio network with a subset of the secondary users desire to use the licensed channels of primary system in a stochastic environment. Based on Lyapunov technique, we formulate the above problem as a Lyapunov optimization problem on stability region of virtual and actual queues. Then, we propose an online flow control, scheduling and spectrum allocation algorithm that meets the desired objectives and provides explicit performance guarantees.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128737826","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-12-29DOI: 10.1109/APNOMS.2014.6996601
Yoonseon Han, Sin-Seok Seo, Jian Li, J. Hyun, Jae-Hyoung Yoo, J. W. Hong
Today's Data Center Networks (DCNs) contain tens of thousands of hosts with significant bandwidth requirements as the needs for cloud computing, multimedia contents, and big data analysis are increasing. However, the existing DCN technologies accompany the following two problems. First, power consumptions of a DCN is constant regardless of the utilization of network resources. Second, due to a static routing scheme, a few links in DCNs are experiencing congestions while other majority links are being underutilized. To overcome these limitations of the current DCNs, we propose a Software Defined Networking (SDN)-based Traffic Engineering (TE), which consists of optimal topology composition and traffic load balancing. We can reduce the power consumptions of the DCN by turning off links and switches that are not included in the optimal subset topology. To diminish network congestions, the traffic load balancing distributes ever-changing traffic demands over the found optimal subset topology. Simulation results revealed that the proposed SDN-based TE approach can reduce power consumptions of a DCN about 41% and Maximum Link Utilization (MLU) about 60% on average in comparison with a static routing scheme.
随着云计算、多媒体内容、大数据分析等需求的增长，目前的数据中心网络(Data Center network, dcn)包含数以万计的主机，对带宽的要求也越来越高。然而，现有的DCN技术伴随着以下两个问题。首先，无论网络资源的利用率如何，DCN的功耗是恒定的。其次，由于静态路由方案，dcn中的一些链路出现拥塞，而其他大多数链路未得到充分利用。为了克服当前DCNs的这些限制，我们提出了一种基于软件定义网络(SDN)的流量工程(TE)，它由最优拓扑组成和流量负载均衡组成。我们可以通过关闭不包括在最优子集拓扑中的链路和交换机来降低DCN的功耗。为了减少网络拥塞，流量负载均衡将不断变化的流量需求分配到找到的最优子集拓扑上。仿真结果表明，与静态路由方案相比，提出的基于sdn的TE方案可使DCN的功耗平均降低41%，最大链路利用率平均降低60%。
{"title":"Software defined networking-based traffic engineering for data center networks","authors":"Yoonseon Han, Sin-Seok Seo, Jian Li, J. Hyun, Jae-Hyoung Yoo, J. W. Hong","doi":"10.1109/APNOMS.2014.6996601","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996601","url":null,"abstract":"Today's Data Center Networks (DCNs) contain tens of thousands of hosts with significant bandwidth requirements as the needs for cloud computing, multimedia contents, and big data analysis are increasing. However, the existing DCN technologies accompany the following two problems. First, power consumptions of a DCN is constant regardless of the utilization of network resources. Second, due to a static routing scheme, a few links in DCNs are experiencing congestions while other majority links are being underutilized. To overcome these limitations of the current DCNs, we propose a Software Defined Networking (SDN)-based Traffic Engineering (TE), which consists of optimal topology composition and traffic load balancing. We can reduce the power consumptions of the DCN by turning off links and switches that are not included in the optimal subset topology. To diminish network congestions, the traffic load balancing distributes ever-changing traffic demands over the found optimal subset topology. Simulation results revealed that the proposed SDN-based TE approach can reduce power consumptions of a DCN about 41% and Maximum Link Utilization (MLU) about 60% on average in comparison with a static routing scheme.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125942286","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-12-29DOI: 10.1109/APNOMS.2014.6996518
H. Pham-Thi, Hiep Hoang-Van, T. Miyoshi, T. Yamazaki
Network providers are nowadays facing with a big question in allocating network resources due to the constantly increasing of Internet services. While the network resource is not unlimited, users always desire the best quality of experience (QoE) with the huge information exchange. Therefore, finding a justice of network resource allocation based on the user experience is mandatory. In previous studies, network resources were allocated to all users by using a specific utility function without considering the user characteristics. In fact, the network resource consumptions are very different among individual users and directly depend on users' behavior. For instance, the network demands of relax users are usually lower than those of busy users. Thus, allocating the same amount of resources to all users might not meet their expectations. In this paper, we propose two bandwidth allocation methods by classifying users into different groups based on their characteristics such as relax, short-time busy, and long-time busy users. To allocate the bandwidth in each group, specific utility functions are applied. By using these methods, the obtained results show that users get the different allocated bandwidth while they still experience the same level of QoE. On the other hand, the allocation considers users' behavior to allocate suitable bandwidth based on the real resource consumption of users. As a result from these analyses, our proposal tends toward a fair allocation as well as an efficient management of the network resources.
{"title":"QoE-driven bandwidth allocation method based on user characteristics","authors":"H. Pham-Thi, Hiep Hoang-Van, T. Miyoshi, T. Yamazaki","doi":"10.1109/APNOMS.2014.6996518","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996518","url":null,"abstract":"Network providers are nowadays facing with a big question in allocating network resources due to the constantly increasing of Internet services. While the network resource is not unlimited, users always desire the best quality of experience (QoE) with the huge information exchange. Therefore, finding a justice of network resource allocation based on the user experience is mandatory. In previous studies, network resources were allocated to all users by using a specific utility function without considering the user characteristics. In fact, the network resource consumptions are very different among individual users and directly depend on users' behavior. For instance, the network demands of relax users are usually lower than those of busy users. Thus, allocating the same amount of resources to all users might not meet their expectations. In this paper, we propose two bandwidth allocation methods by classifying users into different groups based on their characteristics such as relax, short-time busy, and long-time busy users. To allocate the bandwidth in each group, specific utility functions are applied. By using these methods, the obtained results show that users get the different allocated bandwidth while they still experience the same level of QoE. On the other hand, the allocation considers users' behavior to allocate suitable bandwidth based on the real resource consumption of users. As a result from these analyses, our proposal tends toward a fair allocation as well as an efficient management of the network resources.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124118954","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-12-29DOI: 10.1109/APNOMS.2014.6996569
Qianli Zhang, Yunlong Ma, Jilong Wang, Xing Li
Comparing to TCP traffic, the composition of UDP traffic is still unclear. Although it is observed that a large fraction of UDP traffic appears to be P2P applications, application level classification of UDP traffic is still very hard since most of these applications are private protocols based. In this paper, a novel method is proposed to classify UDP traffic. Based on the assumption that traffic from two communicating half-tuples identified by the <; IP address, portnumber > is from the same application, all half-tuples can be grouped into several connected subgraphs. The port numbers which are adopted by most links or half-tuples in each subgroup can thus be used to characterize the application types of the whole subgroup. Experiment results show that this approach is feasible and can classify UDP traffic only using flow level information. The port numbers adopted by most links or half-tuples are surprisingly stable among different time periods, for example, for Youku application remain the same for more than 90% of periods in all the 1429 periods.
{"title":"UDP traffic classification using most distinguished port","authors":"Qianli Zhang, Yunlong Ma, Jilong Wang, Xing Li","doi":"10.1109/APNOMS.2014.6996569","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996569","url":null,"abstract":"Comparing to TCP traffic, the composition of UDP traffic is still unclear. Although it is observed that a large fraction of UDP traffic appears to be P2P applications, application level classification of UDP traffic is still very hard since most of these applications are private protocols based. In this paper, a novel method is proposed to classify UDP traffic. Based on the assumption that traffic from two communicating half-tuples identified by the <; IP address, portnumber > is from the same application, all half-tuples can be grouped into several connected subgraphs. The port numbers which are adopted by most links or half-tuples in each subgroup can thus be used to characterize the application types of the whole subgroup. Experiment results show that this approach is feasible and can classify UDP traffic only using flow level information. The port numbers adopted by most links or half-tuples are surprisingly stable among different time periods, for example, for Youku application remain the same for more than 90% of periods in all the 1429 periods.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126344428","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-12-29DOI: 10.1109/APNOMS.2014.6996583
T. Kaida, O. Mizuno
We propose a machine-to-machine service platform that employs various types of sensor nodes and can provide many different services. The platform has three requirements: connectivity for many types of sensor node, flexible sensor node configuration, and “Many-to-Many” communication. NetInf, a type of Information Centric Network, realizes flexible sensor node configuration. To meet the other requirements, we propose two methods, a distributed routing method that divides data along two paths, and a cache data location method that caches data that may be requested by subscribers. Simulations have been performed for a network assuming a smart city. The results of the simulations confirm the validity of the proposed methods.
{"title":"Applying NetInf for the M2M service platform","authors":"T. Kaida, O. Mizuno","doi":"10.1109/APNOMS.2014.6996583","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996583","url":null,"abstract":"We propose a machine-to-machine service platform that employs various types of sensor nodes and can provide many different services. The platform has three requirements: connectivity for many types of sensor node, flexible sensor node configuration, and “Many-to-Many” communication. NetInf, a type of Information Centric Network, realizes flexible sensor node configuration. To meet the other requirements, we propose two methods, a distributed routing method that divides data along two paths, and a cache data location method that caches data that may be requested by subscribers. Simulations have been performed for a network assuming a smart city. The results of the simulations confirm the validity of the proposed methods.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132028534","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-12-29DOI: 10.1109/APNOMS.2014.6996554
B. Wen, Wenjing Li, Lei Feng, Peng Yu, Yang Yang
The current power consumption of intelligent terminals are over burden for their battery capacities, which directly restrict the hours used. In order to realize the energy saving of terminals in the LTE-A system, this paper puts forward the concept of virtual cells and a related uplink energy saving mechanism. Virtual Cell's resources and the outage probability of terminals are proposed by this mechanism as constraint conditions. The first step is sectioning off energy saving area in virtual cell. Secondly, we use the uplink CoMP (Coordinated Multiple Points Transmission/Reception) technology to provide diversity gain for the terminals of energy saving area. The third step depends on uplink power control which could adjust the mobile terminals' transmission power for energy saving. The simulation results show that the energy consumption of total terminals will decrease nearly 50% in the virtual cell while its capacity is lower than the 50% of maximum.
{"title":"An energy-saving mechanism for mobile terminals based on LTE-A uplink CoMP","authors":"B. Wen, Wenjing Li, Lei Feng, Peng Yu, Yang Yang","doi":"10.1109/APNOMS.2014.6996554","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996554","url":null,"abstract":"The current power consumption of intelligent terminals are over burden for their battery capacities, which directly restrict the hours used. In order to realize the energy saving of terminals in the LTE-A system, this paper puts forward the concept of virtual cells and a related uplink energy saving mechanism. Virtual Cell's resources and the outage probability of terminals are proposed by this mechanism as constraint conditions. The first step is sectioning off energy saving area in virtual cell. Secondly, we use the uplink CoMP (Coordinated Multiple Points Transmission/Reception) technology to provide diversity gain for the terminals of energy saving area. The third step depends on uplink power control which could adjust the mobile terminals' transmission power for energy saving. The simulation results show that the energy consumption of total terminals will decrease nearly 50% in the virtual cell while its capacity is lower than the 50% of maximum.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124914401","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-12-29DOI: 10.1109/APNOMS.2014.6996108
Yu-Tung Cheng, Heng-An Lin, Yun-Jaw Yeh
This paper presents a software architecture for audio transmission to network cameras while integrating multiple types of cameras from different manufacturers under a Web-based surveillance system. Adding audio streams in surveillance system will enhance the capabilities for remote monitoring. This architecture offers a plug-and-play service of audio transmission to cameras over the network for numerous users. It not only simplifies but also facilitates the integration process of heterogeneous devices.
{"title":"A flexible architecture of real-time audio transmission to heterogeneous devices for surveillance system","authors":"Yu-Tung Cheng, Heng-An Lin, Yun-Jaw Yeh","doi":"10.1109/APNOMS.2014.6996108","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996108","url":null,"abstract":"This paper presents a software architecture for audio transmission to network cameras while integrating multiple types of cameras from different manufacturers under a Web-based surveillance system. Adding audio streams in surveillance system will enhance the capabilities for remote monitoring. This architecture offers a plug-and-play service of audio transmission to cameras over the network for numerous users. It not only simplifies but also facilitates the integration process of heterogeneous devices.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125130107","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-12-29DOI: 10.1109/APNOMS.2014.6996532
Feng Jiang, Lanlan Rui, Yaoyong Guo, Xue-song Qiu, Wei Li
Service search has been introduced to exploit heterogeneous resources of distributed devices on the purpose of supplying ubiquitous services in ubiquitous stub environments, especially in MANETs. However, due to the characteristics of infrastructure-less, devices' limited resources, and dynamic topology caused by the mobility of devices, service search faces great risk of failure. Usually, clusters are the main way of organizing the devices in MANETs. Therefore, an effective clustering algorithm is necessary to ensure the reliability of service search. A maximized reliability clustering algorithm (MRCA) is proposed. We present predicted battery supporting time, CPU computing power, connecting degree and predicted velocity of devices, select the best devices as cluster heads. We combine the four factors together using FAHP algorithm. The simulations show that the MRCA can prolong cluster headers and members' valid time, reduce the consumed energy in the cluster's life cycle. This proves that MRCA can improve the reliability of cluster.
{"title":"Reliability-oriented clustering algorithm for service search in ubiquitous stub environments","authors":"Feng Jiang, Lanlan Rui, Yaoyong Guo, Xue-song Qiu, Wei Li","doi":"10.1109/APNOMS.2014.6996532","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996532","url":null,"abstract":"Service search has been introduced to exploit heterogeneous resources of distributed devices on the purpose of supplying ubiquitous services in ubiquitous stub environments, especially in MANETs. However, due to the characteristics of infrastructure-less, devices' limited resources, and dynamic topology caused by the mobility of devices, service search faces great risk of failure. Usually, clusters are the main way of organizing the devices in MANETs. Therefore, an effective clustering algorithm is necessary to ensure the reliability of service search. A maximized reliability clustering algorithm (MRCA) is proposed. We present predicted battery supporting time, CPU computing power, connecting degree and predicted velocity of devices, select the best devices as cluster heads. We combine the four factors together using FAHP algorithm. The simulations show that the MRCA can prolong cluster headers and members' valid time, reduce the consumed energy in the cluster's life cycle. This proves that MRCA can improve the reliability of cluster.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125331541","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
扫码关注我们
求助内容：
应助结果提醒方式：