Pub Date : 2015-09-28DOI: 10.1109/APNOMS.2015.7275422
Zhaofeng Wu, Guyu Hu, Y. Seyedi, Fenglin Jin
Low earth orbit (LEO) satellite networks are capable of providing global or regional mobile services for a large number of users. Since the user's service duration may be greater than the coverage time of a LEO satellite, the user may be handed over to another visible satellite to prevent interruption of the ongoing communication. On the other hand, a mobile user may be covered by more than one satellite at the instant of connection handover. When the user is about to be handed over to another satellite, the serving satellite minimizing the number of handovers would in general be the one that provides the largest service time which is not necessarily equal to the coverage time of the very satellite. In this paper, we propose a new handover algorithm which exploits both the Global Positioning System (GPS) infrastructure and satellite diversity to provide a simple and real-time handover management in LEO satellite networks. The proposed algorithm not only minimizes the expected number of satellite handover, but is also efficient and easy to be implemented in hand-held devices, thus facilitating the mobile users' access to the satellite networks. Numerical simulations performed for two typical mobile satellite networks, viz. Iridium and Globalstar, corroborate the advantages gained by the proposed algorithm.
{"title":"A simple real-time handover management in the mobile satellite communication networks","authors":"Zhaofeng Wu, Guyu Hu, Y. Seyedi, Fenglin Jin","doi":"10.1109/APNOMS.2015.7275422","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275422","url":null,"abstract":"Low earth orbit (LEO) satellite networks are capable of providing global or regional mobile services for a large number of users. Since the user's service duration may be greater than the coverage time of a LEO satellite, the user may be handed over to another visible satellite to prevent interruption of the ongoing communication. On the other hand, a mobile user may be covered by more than one satellite at the instant of connection handover. When the user is about to be handed over to another satellite, the serving satellite minimizing the number of handovers would in general be the one that provides the largest service time which is not necessarily equal to the coverage time of the very satellite. In this paper, we propose a new handover algorithm which exploits both the Global Positioning System (GPS) infrastructure and satellite diversity to provide a simple and real-time handover management in LEO satellite networks. The proposed algorithm not only minimizes the expected number of satellite handover, but is also efficient and easy to be implemented in hand-held devices, thus facilitating the mobile users' access to the satellite networks. Numerical simulations performed for two typical mobile satellite networks, viz. Iridium and Globalstar, corroborate the advantages gained by the proposed algorithm.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121407083","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}
Recent research activities have recognized the essentiality of node mobility for the creation of stable, scalable and adaptive clusters with good performance in mobile ad hoc networks (MANETs). In this paper, we propose a distributed clustering algorithm based on the group mobility and a revised group mobility metric which is derived from the instantaneous speed and direction of nodes. Our dynamic, distributed clustering approach use Gauss Markov group mobility model for mobility prediction that enables each node to anticipate its mobility relative to its neighbors. In particular, it is suitable for reflecting group mobility pattern where group partitions and mergence are prevalent behaviors of mobile groups. We also take the residual energy of nodes and the number of neighbor nodes into consideration. The proposed clustering scheme aims to form stable clusters by reducing the clustering iterations even in a highly dynamic environment. Simulation results show that the performance of the proposed framework is superior to two well-known clustering approaches, the MOBIC and DGMA, in terms of average number of clusterhead changes.
{"title":"Group mobility based clustering algorithm for mobile ad hoc networks","authors":"Mengqing Cai, Lanlan Rui, Danmei Liu, Haoqiu Huang, Xue-song Qiu","doi":"10.1109/APNOMS.2015.7275358","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275358","url":null,"abstract":"Recent research activities have recognized the essentiality of node mobility for the creation of stable, scalable and adaptive clusters with good performance in mobile ad hoc networks (MANETs). In this paper, we propose a distributed clustering algorithm based on the group mobility and a revised group mobility metric which is derived from the instantaneous speed and direction of nodes. Our dynamic, distributed clustering approach use Gauss Markov group mobility model for mobility prediction that enables each node to anticipate its mobility relative to its neighbors. In particular, it is suitable for reflecting group mobility pattern where group partitions and mergence are prevalent behaviors of mobile groups. We also take the residual energy of nodes and the number of neighbor nodes into consideration. The proposed clustering scheme aims to form stable clusters by reducing the clustering iterations even in a highly dynamic environment. Simulation results show that the performance of the proposed framework is superior to two well-known clustering approaches, the MOBIC and DGMA, in terms of average number of clusterhead changes.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125940322","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 : 2015-09-28DOI: 10.1109/APNOMS.2015.7275350
Jee-Sook Eun, Heeyoung Jung
In current internet, there are always scalability problems because it has a flat network model. It is possible to solve a scalable routing problem as use a hierarchical network model instead of a flat network model. By the way, there is no solution for routing protocol available in hierarchical network model. The routing protocol for that must provide many functions different from current routing protocol. It should be able to create topology for each hierarchy, and connect each other. We propose an available routing protocol and a solution to create routing table for hierarchical network model. Also, we implement a hierarchical domain routing system, and verify feasibility and availability of proposed routing protocol and routing tables.
{"title":"The implementation of domain routing protocol in hierarchical domain network model","authors":"Jee-Sook Eun, Heeyoung Jung","doi":"10.1109/APNOMS.2015.7275350","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275350","url":null,"abstract":"In current internet, there are always scalability problems because it has a flat network model. It is possible to solve a scalable routing problem as use a hierarchical network model instead of a flat network model. By the way, there is no solution for routing protocol available in hierarchical network model. The routing protocol for that must provide many functions different from current routing protocol. It should be able to create topology for each hierarchy, and connect each other. We propose an available routing protocol and a solution to create routing table for hierarchical network model. Also, we implement a hierarchical domain routing system, and verify feasibility and availability of proposed routing protocol and routing tables.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127644308","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 : 2015-09-28DOI: 10.1109/APNOMS.2015.7275381
Joong-Sun Lee, T. Obi, Hiroyuki Suzuki, Kazushige Fujita, M. Yachida, N. Ohyama
In dealing with medical information of patients through the network, high-level security is required. In Japan, the Ministry of Health, Labor and Welfare has issued the Security Guidelines for Health Information Systems which stipulates that proper measures should be taken for the network to preserve the patient data. The guideline also state that the management of the network must clarify demarcation of responsibility between network service providers including user. To keep the security regulation in communicating with external organizations, many medical institutions use several managed-VPN service lines separately according to the usages. It is because to avoid the risk of forming a virtual detour which can be used to leak the patient data. This makes the hospital bear the cost and inconvenience. To solve this problem, we propose a new secure network implementation method using single-line VPN network service for small-scale medical institution by arranging OpenFlow control technology with Healthcare PKI. The network works over a dynamic on-demand VPN with control based on the user certification responding their qualification, such as a medical doctor, written in the HPKI digital certificates. We developed a simple network system adopting our new method, and confirmed the validity and the effectiveness of our idea through the experiment.
{"title":"A new method for constructing dynamic VPN cooperating with OpenFlow control technology and healthcare PKI","authors":"Joong-Sun Lee, T. Obi, Hiroyuki Suzuki, Kazushige Fujita, M. Yachida, N. Ohyama","doi":"10.1109/APNOMS.2015.7275381","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275381","url":null,"abstract":"In dealing with medical information of patients through the network, high-level security is required. In Japan, the Ministry of Health, Labor and Welfare has issued the Security Guidelines for Health Information Systems which stipulates that proper measures should be taken for the network to preserve the patient data. The guideline also state that the management of the network must clarify demarcation of responsibility between network service providers including user. To keep the security regulation in communicating with external organizations, many medical institutions use several managed-VPN service lines separately according to the usages. It is because to avoid the risk of forming a virtual detour which can be used to leak the patient data. This makes the hospital bear the cost and inconvenience. To solve this problem, we propose a new secure network implementation method using single-line VPN network service for small-scale medical institution by arranging OpenFlow control technology with Healthcare PKI. The network works over a dynamic on-demand VPN with control based on the user certification responding their qualification, such as a medical doctor, written in the HPKI digital certificates. We developed a simple network system adopting our new method, and confirmed the validity and the effectiveness of our idea through the experiment.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123734260","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 : 2015-09-28DOI: 10.1109/APNOMS.2015.7275367
Anselme Ndikumana, Saeed Ullah, Rossi Kamal, K. Thar, H. S. Kang, S. I. Moon, C. Hong
Internet has grown very rapidly in the last couple of decades and still growing because of the expansion and utilization of various services and applications. Consequently, demand of delay and throughput sensitive services, like audio/video is also increasing. Information Centric Networking (ICN) is proposed as an architecture for the future Internet to meet the modern users and application requirements. In ICN users send requests (Interest Packets) for the Data they need. Interest packet is assigned a lifetime, which greatly affects the Quality of Experience (QoE) because user needs to resend the Interest, when the lifetime expires. Interest lifetime may be expired because of congestion, or Interest lifetime is shorter than the network delay, etc. Waiting for the expiration of an Interest lifetime to resend it is merely appropriate for best effort traffic, rather than services which require high throughput and are delay sensitive. In this paper, we propose Network-Assisted Congestion Control mechanism in ICN, which detects the congestion before it happens, and provides notification to downstream node. On reception of the notification, downstream node continuously reduces the traffic rate. However, when the downstream node fails to adjust the sending rate, the same procedure continues, until the sending node reduces the traffic rate through adjusting its congestion window. We have intensively evaluated our proposal by comparing it with similar proposal using ndnSIM. The experimental results show that our proposal achieves up to 59 percent performance improvement over other proposal in the literature.
{"title":"Network-assisted congestion control for information centric networking","authors":"Anselme Ndikumana, Saeed Ullah, Rossi Kamal, K. Thar, H. S. Kang, S. I. Moon, C. Hong","doi":"10.1109/APNOMS.2015.7275367","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275367","url":null,"abstract":"Internet has grown very rapidly in the last couple of decades and still growing because of the expansion and utilization of various services and applications. Consequently, demand of delay and throughput sensitive services, like audio/video is also increasing. Information Centric Networking (ICN) is proposed as an architecture for the future Internet to meet the modern users and application requirements. In ICN users send requests (Interest Packets) for the Data they need. Interest packet is assigned a lifetime, which greatly affects the Quality of Experience (QoE) because user needs to resend the Interest, when the lifetime expires. Interest lifetime may be expired because of congestion, or Interest lifetime is shorter than the network delay, etc. Waiting for the expiration of an Interest lifetime to resend it is merely appropriate for best effort traffic, rather than services which require high throughput and are delay sensitive. In this paper, we propose Network-Assisted Congestion Control mechanism in ICN, which detects the congestion before it happens, and provides notification to downstream node. On reception of the notification, downstream node continuously reduces the traffic rate. However, when the downstream node fails to adjust the sending rate, the same procedure continues, until the sending node reduces the traffic rate through adjusting its congestion window. We have intensively evaluated our proposal by comparing it with similar proposal using ndnSIM. The experimental results show that our proposal achieves up to 59 percent performance improvement over other proposal in the literature.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130889330","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 : 2015-09-28DOI: 10.1109/APNOMS.2015.7275387
J. Been, WooBeom Yang, Jung Ho Kim, Jae-Oh Lee
With rapid progress in information and communication technology (ICT), the existing communication infrastructure has been continually evolving. Telecommunication network operators may need to expand hardware and software infrastructure to adopt new communication technologies, which will require considerable capital investments. In addition, devices for Internet of Things (IoT) are being rapidly adopted as they facilitate user convenience. As a result, IoT signals and data traffic may explosively increase in the network, which may lead to congestion and server overload. To address this issue, many ICT vendors are conducting research on network function virtualization and for efficiently utilizing network resources and architecture. Therefore, in this paper, we propose a management method for IoT traffic in a virtualized IP multimedia subsystem (IMS) environment. We provide a brief overview of virtualized IMS, dynamic routing, SIP, and the proposed method of management through virtualized IMS.
{"title":"Management of IoT traffic using a virtualized IMS platform","authors":"J. Been, WooBeom Yang, Jung Ho Kim, Jae-Oh Lee","doi":"10.1109/APNOMS.2015.7275387","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275387","url":null,"abstract":"With rapid progress in information and communication technology (ICT), the existing communication infrastructure has been continually evolving. Telecommunication network operators may need to expand hardware and software infrastructure to adopt new communication technologies, which will require considerable capital investments. In addition, devices for Internet of Things (IoT) are being rapidly adopted as they facilitate user convenience. As a result, IoT signals and data traffic may explosively increase in the network, which may lead to congestion and server overload. To address this issue, many ICT vendors are conducting research on network function virtualization and for efficiently utilizing network resources and architecture. Therefore, in this paper, we propose a management method for IoT traffic in a virtualized IP multimedia subsystem (IMS) environment. We provide a brief overview of virtualized IMS, dynamic routing, SIP, and the proposed method of management through virtualized IMS.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132670829","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 the common implementation of software defined networking where only one controller is used, tasks required by various applications may overwhelm the controller as the network grows, leading to degradation of the network performance. Some multi-controller architectures have been proposed to remedy such scalability issue. In this paper, we present our design and implementation of a routing application under a hierarchical multi-controller architecture. In this architecture, a network is partitioned into multiple domains, each of which is managed by a dedicated local controller, which is managed by a common global controller. The routing application is executed on the local and global controllers, jointly providing a routing service for each new flow. We provide effective mechanisms to reduce the link state that should be kept by the global controller. We propose a weight function on the links so that a weighted shortest path can be found that avoids the congested links on the network. Experiments results show that our routing application in the hierarchical multi-controller architecture has a great improvement over that of the single-controller architecture in terms various performance metrics.
{"title":"Weighted routing in hierarchical multi-domain SDN controllers","authors":"Jian-Jhong Huang, Ying-Yu Chen, Chien Chen, Yu-Huang Chu","doi":"10.1109/APNOMS.2015.7275362","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275362","url":null,"abstract":"In the common implementation of software defined networking where only one controller is used, tasks required by various applications may overwhelm the controller as the network grows, leading to degradation of the network performance. Some multi-controller architectures have been proposed to remedy such scalability issue. In this paper, we present our design and implementation of a routing application under a hierarchical multi-controller architecture. In this architecture, a network is partitioned into multiple domains, each of which is managed by a dedicated local controller, which is managed by a common global controller. The routing application is executed on the local and global controllers, jointly providing a routing service for each new flow. We provide effective mechanisms to reduce the link state that should be kept by the global controller. We propose a weight function on the links so that a weighted shortest path can be found that avoids the congested links on the network. Experiments results show that our routing application in the hierarchical multi-controller architecture has a great improvement over that of the single-controller architecture in terms various performance metrics.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132313096","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 : 2015-09-28DOI: 10.1109/APNOMS.2015.7275357
Yun-Ting Lee, Hsi-Lu Chao, Jin-Wei Tang
The exponential growth of wireless data traffic has pushed wireless network vendors and researchers to rethink of a revolutionizing architecture for the fifth generation (5G) wireless network that is capable of supporting 100 times the network capacity of the current 3G/4G systems, yet is able to reduce the net energy consumption of the systems by up to 90 percent. Numerous concepts and technologies have been proposed to approach this goal from various aspects of system design. A consensus reached so far is that 5G is going to be a collection of technology evolutions that include soft core networks, small or even no cellular, pervasive but invisible base stations, and heterogeneous yet self-organizing radio access networks. In addition to advanced radio access technologies, the success of such an ambitious goal really relies on a flexible and scalable network infrastructure to accommodate and harmonize these technologies. On the other hand, virtualization is viewed as one of the essential technologies of the 5G network to provide cost effectiveness of management, maintenance, and hardware upgrade. In this paper, we introduce a cloud service model that has the potential to serve the numerous stringent requirements for future 5G networks. Besides, we describe the designed auto scaling and load balancing rules of each functional block defined in the cloud service model. We conduct emulation to evaluate the performance of resource utilization for the cloud data center.
{"title":"Scalable and elastic cloud data center for self-organizing dense small cell networks","authors":"Yun-Ting Lee, Hsi-Lu Chao, Jin-Wei Tang","doi":"10.1109/APNOMS.2015.7275357","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275357","url":null,"abstract":"The exponential growth of wireless data traffic has pushed wireless network vendors and researchers to rethink of a revolutionizing architecture for the fifth generation (5G) wireless network that is capable of supporting 100 times the network capacity of the current 3G/4G systems, yet is able to reduce the net energy consumption of the systems by up to 90 percent. Numerous concepts and technologies have been proposed to approach this goal from various aspects of system design. A consensus reached so far is that 5G is going to be a collection of technology evolutions that include soft core networks, small or even no cellular, pervasive but invisible base stations, and heterogeneous yet self-organizing radio access networks. In addition to advanced radio access technologies, the success of such an ambitious goal really relies on a flexible and scalable network infrastructure to accommodate and harmonize these technologies. On the other hand, virtualization is viewed as one of the essential technologies of the 5G network to provide cost effectiveness of management, maintenance, and hardware upgrade. In this paper, we introduce a cloud service model that has the potential to serve the numerous stringent requirements for future 5G networks. Besides, we describe the designed auto scaling and load balancing rules of each functional block defined in the cloud service model. We conduct emulation to evaluate the performance of resource utilization for the cloud data center.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133010917","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 : 2015-09-28DOI: 10.1109/APNOMS.2015.7275344
Shuangshuang Chen, Yue Shi, Xingyu Chen, F. Qi
In this paper, we investigate the optimal location of electric vehicle (EV) charging stations. As one of the crucial infrastructures of EV, electric charging stations must be widely deployed to meet the growing needs of EV. In this study, we propose a locating method of charging station when considering economics, capacity, coverage and convenience. In order to solve the locating problem, an optimization model for charging stations location is established first, which minimizes the investment cost and transportation cost, meanwhile, the constraints of capacity, coverage and convenience should be satisfied simultaneously. Then, an improved genetic algorithm (GA) is proposed to solve the optimization problem. The simulation results indicate that the proposed locating method is effective and practical.
{"title":"Optimal location of electric vehicle charging stations using genetic algorithm","authors":"Shuangshuang Chen, Yue Shi, Xingyu Chen, F. Qi","doi":"10.1109/APNOMS.2015.7275344","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275344","url":null,"abstract":"In this paper, we investigate the optimal location of electric vehicle (EV) charging stations. As one of the crucial infrastructures of EV, electric charging stations must be widely deployed to meet the growing needs of EV. In this study, we propose a locating method of charging station when considering economics, capacity, coverage and convenience. In order to solve the locating problem, an optimization model for charging stations location is established first, which minimizes the investment cost and transportation cost, meanwhile, the constraints of capacity, coverage and convenience should be satisfied simultaneously. Then, an improved genetic algorithm (GA) is proposed to solve the optimization problem. The simulation results indicate that the proposed locating method is effective and practical.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123935722","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 : 2015-09-28DOI: 10.1109/APNOMS.2015.7275386
Chung-Hao Hsieh, Pei Jung
Smart home service has been an emerging and profitable new business for IT and telecomm corporations. The nature of integrated heterogeneous gadgets and devices makes smart home system builders face unprecedented challenges in maintenance tasks. In this paper, we propose a symptomproblem correlation model to locate system faults in smart home services. First, we investigate the tree-like structure of a smart home system's objects which reveal their dependency among one another and deduce instinctively a coarse object state to a problem correlation model that relates a set of symptoms to a particular problem. Then the proposed algorithm is applied to verify and reduce the size of this model so that the model can accurately identify the defined problems using minimum number of observed objects' states. The simplified model can be utilized for automatic fault location, optimizing Home Gateway configuration, and boosting system performance.
{"title":"A fault diagnosis method for smart home services","authors":"Chung-Hao Hsieh, Pei Jung","doi":"10.1109/APNOMS.2015.7275386","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275386","url":null,"abstract":"Smart home service has been an emerging and profitable new business for IT and telecomm corporations. The nature of integrated heterogeneous gadgets and devices makes smart home system builders face unprecedented challenges in maintenance tasks. In this paper, we propose a symptomproblem correlation model to locate system faults in smart home services. First, we investigate the tree-like structure of a smart home system's objects which reveal their dependency among one another and deduce instinctively a coarse object state to a problem correlation model that relates a set of symptoms to a particular problem. Then the proposed algorithm is applied to verify and reduce the size of this model so that the model can accurately identify the defined problems using minimum number of observed objects' states. The simplified model can be utilized for automatic fault location, optimizing Home Gateway configuration, and boosting system performance.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131075532","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
扫码关注我们
求助内容：
应助结果提醒方式：