Pub Date : 2018-07-01DOI: 10.3966/160792642018081904009
Minsu Park, Hee-soo Kang, Seungsoo Baek, Seungjoo Kim
Smart devices have become an important part of our life due to improvements in IT technology and corresponding increase in demand for smart devices. In particular, smart TVs represent a convergence of computers and TV and have become popular. Therefore, many researchers conduct smart TV forensics to accurately and seamlessly investigate a suspect’s actions. However, previous works have focused not on critical information, such as viewing history, but on minor information such as web surfing history and system configuration information in smart TVs. To make matters worse, minor information is irrelevant to time or order. Therefore, it is inadequate to use previous methods to investigate and rearrange the order of a suspect’s action. We therefore propose a novel method to obtain time relevant information in smart TVs. We find additional information, such as the list of TV channels that are watched, the last viewing time, recent service history, information on recently played video and recent camera usage information.
{"title":"Further Analysis on Smart TV Forensics","authors":"Minsu Park, Hee-soo Kang, Seungsoo Baek, Seungjoo Kim","doi":"10.3966/160792642018081904009","DOIUrl":"https://doi.org/10.3966/160792642018081904009","url":null,"abstract":"Smart devices have become an important part of our life due to improvements in IT technology and corresponding increase in demand for smart devices. In particular, smart TVs represent a convergence of computers and TV and have become popular. Therefore, many researchers conduct smart TV forensics to accurately and seamlessly investigate a suspect’s actions. However, previous works have focused not on critical information, such as viewing history, but on minor information such as web surfing history and system configuration information in smart TVs. To make matters worse, minor information is irrelevant to time or order. Therefore, it is inadequate to use previous methods to investigate and rearrange the order of a suspect’s action. We therefore propose a novel method to obtain time relevant information in smart TVs. We find additional information, such as the list of TV channels that are watched, the last viewing time, recent service history, information on recently played video and recent camera usage information.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1055-1061"},"PeriodicalIF":1.6,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49065833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-07-01DOI: 10.3966/160792642018081904014
Jeng-Shyang Pan, Lingping Kong, Tien-Wen Sung, Pei-wei Tsai, V. Snás̃el
The basic K-center problem is a fundamental facility location problem. Given n vertices with some distances, one wants to build k facilities in different vertices, so as to minimize the maximum distance from a vertex to its corresponding facility. This problem is known as the NP-hard problem, and grouping sensor nodes into a cluster is an important mechanism in large multi-hop wireless sensor networks for obtaining scalability, reducing energy consumption, and achieving better network performance. This study proposed a new method for solving the K-center problem based on the Genetic algorithm and dominating (GADO) set, and it is called the GADO method for wireless sensor network. An evaluation of the proposed GADO shows a decrease in the number of the centers compared to the well-known Farthest-first traversal method and dominating set only-based methods. Not only is the total distance from the centers to the sink node less than the other two algorithms, but the proposed GADO also diminishes the data delay and increases the lifetime of the centers.
{"title":"A Clustering Scheme for Wireless Sensor Networks Based on Genetic Algorithm and Dominating Set","authors":"Jeng-Shyang Pan, Lingping Kong, Tien-Wen Sung, Pei-wei Tsai, V. Snás̃el","doi":"10.3966/160792642018081904014","DOIUrl":"https://doi.org/10.3966/160792642018081904014","url":null,"abstract":"The basic K-center problem is a fundamental facility location problem. Given n vertices with some distances, one wants to build k facilities in different vertices, so as to minimize the maximum distance from a vertex to its corresponding facility. This problem is known as the NP-hard problem, and grouping sensor nodes into a cluster is an important mechanism in large multi-hop wireless sensor networks for obtaining scalability, reducing energy consumption, and achieving better network performance. This study proposed a new method for solving the K-center problem based on the Genetic algorithm and dominating (GADO) set, and it is called the GADO method for wireless sensor network. An evaluation of the proposed GADO shows a decrease in the number of the centers compared to the well-known Farthest-first traversal method and dominating set only-based methods. Not only is the total distance from the centers to the sink node less than the other two algorithms, but the proposed GADO also diminishes the data delay and increases the lifetime of the centers.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1111-1118"},"PeriodicalIF":1.6,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42917038","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.6138/JIT.2018.19.6.20161017
M. Awad, P. Lin, Gi-Ren Liu
The existing Ethernet networks are designed with high redundancy and over-dimensioning so they can provide reliable services during peak traffic demand periods. However, this has increased the total energy consumption and operational cost. In this paper, we propose an energy saving algorithm (ESA) to reduce the energy consumption of green routers by considering the buffer status and the traffic load. We develop a Network Simulator, version 2, (NS-2)–based simulation model for ESA to evaluate its performance with respect to real traffic traces. Performance bounds of the proposed algorithm are derived. Numerical evaluations are conducted to verify the accuracy of the simulation model against derived bounds. Performance evaluations demonstrate that the proposed algorithm outperforms candidate algorithms, thereby providing greater energy savings with an acceptable packet delay and loss. We show that the introduced delay is bounded by an upper bound that is slightly larger than half of the sleep timer. Furthermore, performance comparisons are extensive and detailed, thus providing insights into the performance of different energy saving functions considered by the candidate algorithms.
{"title":"Distributed and Load Adaptive Energy Management Algorithm for Ethernet Green Routers","authors":"M. Awad, P. Lin, Gi-Ren Liu","doi":"10.6138/JIT.2018.19.6.20161017","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.6.20161017","url":null,"abstract":"The existing Ethernet networks are designed with high redundancy and over-dimensioning so they can provide reliable services during peak traffic demand periods. However, this has increased the total energy consumption and operational cost. In this paper, we propose an energy saving algorithm (ESA) to reduce the energy consumption of green routers by considering the buffer status and the traffic load. We develop a Network Simulator, version 2, (NS-2)–based simulation model for ESA to evaluate its performance with respect to real traffic traces. Performance bounds of the proposed algorithm are derived. Numerical evaluations are conducted to verify the accuracy of the simulation model against derived bounds. Performance evaluations demonstrate that the proposed algorithm outperforms candidate algorithms, thereby providing greater energy savings with an acceptable packet delay and loss. We show that the introduced delay is bounded by an upper bound that is slightly larger than half of the sleep timer. Furthermore, performance comparisons are extensive and detailed, thus providing insights into the performance of different energy saving functions considered by the candidate algorithms.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"781-794"},"PeriodicalIF":1.6,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48246087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.3966/160792642018051903025
Minseok Kim, Jong‐Moon Chung
In this paper, a distributed transmission power control (TPC) scheme that jointly addresses the hidden and exposed terminal problem to enhance the spatial reuse and fairness performance of multi-hop wireless networks is proposed. Unlike other previous transmission power control schemes where the two-ray ground reflection (TRG) model is adopted, the proposed scheme is designed based on a log-normal shadowing (LNS) channel model. In addition, transmission power selection strategies to further compensate the influences of shadowing are presented. Results demonstrate that the proposed scheme outperforms the other TPC schemes in terms of spatial reuse and power consumption, resulting in an improved throughput and energy efficiency.
{"title":"Adaptive Control of IoT Wireless Networks in Shadowed Fading Channels","authors":"Minseok Kim, Jong‐Moon Chung","doi":"10.3966/160792642018051903025","DOIUrl":"https://doi.org/10.3966/160792642018051903025","url":null,"abstract":"In this paper, a distributed transmission power control (TPC) scheme that jointly addresses the hidden and exposed terminal problem to enhance the spatial reuse and fairness performance of multi-hop wireless networks is proposed. Unlike other previous transmission power control schemes where the two-ray ground reflection (TRG) model is adopted, the proposed scheme is designed based on a log-normal shadowing (LNS) channel model. In addition, transmission power selection strategies to further compensate the influences of shadowing are presented. Results demonstrate that the proposed scheme outperforms the other TPC schemes in terms of spatial reuse and power consumption, resulting in an improved throughput and energy efficiency.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"897-904"},"PeriodicalIF":1.6,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45057698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.6138/JIT.2018.19.6.20160902
S. Liaw, E. Lu, H. Chang, Pin-Chang Su
The rapid growth of the Internet has accelerated e-commerce application development. Numerous problems involving Internet trade transaction security remain. Therefore, security and transaction fairness establishment in e-commerce applications is a crucial research topic. A fair exchange protocol enables users to securely obtain information from each other. This has become a widely applied research topic in e-commerce. A concurrent signature eliminates the need for a trusted third party (TTP) or substantial mutual communication between two parties, to provide fair exchange protocol with e-commerce ideas. The concurrent signature concept was proposed by Chen et al. in 2004 EUROCRYPT. Some researchers improved the concurrent signature susceptibility to the message substitution attack defect, but there are still identify authentication and information exchange procedure security issues. This paper proposes a concurrent signature scheme based on elliptic curve cryptography (ECC) that uses the same security strength shorter key length, reduces public storage costs and the calculation and management risks. We strengthen the identity authentication mechanisms to prevent the counterfeiting identity attacks and provide a more confidential protocol through a self-certified mechanism.
{"title":"New Security Concurrent Signature Design","authors":"S. Liaw, E. Lu, H. Chang, Pin-Chang Su","doi":"10.6138/JIT.2018.19.6.20160902","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.6.20160902","url":null,"abstract":"The rapid growth of the Internet has accelerated e-commerce application development. Numerous problems involving Internet trade transaction security remain. Therefore, security and transaction fairness establishment in e-commerce applications is a crucial research topic. A fair exchange protocol enables users to securely obtain information from each other. This has become a widely applied research topic in e-commerce. A concurrent signature eliminates the need for a trusted third party (TTP) or substantial mutual communication between two parties, to provide fair exchange protocol with e-commerce ideas. The concurrent signature concept was proposed by Chen et al. in 2004 EUROCRYPT. Some researchers improved the concurrent signature susceptibility to the message substitution attack defect, but there are still identify authentication and information exchange procedure security issues. This paper proposes a concurrent signature scheme based on elliptic curve cryptography (ECC) that uses the same security strength shorter key length, reduces public storage costs and the calculation and management risks. We strengthen the identity authentication mechanisms to prevent the counterfeiting identity attacks and provide a more confidential protocol through a self-certified mechanism.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"741-751"},"PeriodicalIF":1.6,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42031991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.3966/160792642018051903004
Kuen-Min Lee, Wei-Guang Teng, M. Huang, Chih-Pin Freg, Ting-Wei Hou
Session-based remote management systems, e.g., customer premises equipment (CPE) WAN management protocol (CWMP), have predictable task counts in a session and each CPE only accesses its own data. When the systems are used in large-scale environments, a static load balancing (LB) policy can be applied with fewer session migrations. Nevertheless, unexpected crash events, e.g., software bugs or improper management, would cause the LB policy to be reassigned so as to degrade the system performance. A self-learning predictor (SLP) is thus proposed in this work to predict unexpected crash events and to achieve a better system performance in terms of resource usage and throughput. Specifically, the SLP records and monitors all crash patterns to evaluate the system stability. Moreover, the relation flags and probabilities of all crash patterns are dynamically updated for quick comparisons. If the SLP finds the current pattern is similar to a crash pattern, a migration request is raised to the load balancer to prevent performance degradation caused by the incoming crash. The simulation results indicate that a better system performance is obtained in a large-scale environment with the proposed SLP, especially as the number of servers in each cluster node increases.
{"title":"Exploiting a self-learning predictor for session-based remote management systems in a large-scale environment","authors":"Kuen-Min Lee, Wei-Guang Teng, M. Huang, Chih-Pin Freg, Ting-Wei Hou","doi":"10.3966/160792642018051903004","DOIUrl":"https://doi.org/10.3966/160792642018051903004","url":null,"abstract":"Session-based remote management systems, e.g., customer premises equipment (CPE) WAN management protocol (CWMP), have predictable task counts in a session and each CPE only accesses its own data. When the systems are used in large-scale environments, a static load balancing (LB) policy can be applied with fewer session migrations. Nevertheless, unexpected crash events, e.g., software bugs or improper management, would cause the LB policy to be reassigned so as to degrade the system performance. A self-learning predictor (SLP) is thus proposed in this work to predict unexpected crash events and to achieve a better system performance in terms of resource usage and throughput. Specifically, the SLP records and monitors all crash patterns to evaluate the system stability. Moreover, the relation flags and probabilities of all crash patterns are dynamically updated for quick comparisons. If the SLP finds the current pattern is similar to a crash pattern, a migration request is raised to the load balancer to prevent performance degradation caused by the incoming crash. The simulation results indicate that a better system performance is obtained in a large-scale environment with the proposed SLP, especially as the number of servers in each cluster node increases.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"657-668"},"PeriodicalIF":1.6,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47031550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-01DOI: 10.6138/JIT.2018.19.6.20160623
Phet Imtongkhum, C. So-In, S. Sanguanpong, Songyut Phoemphon
The immense increase in data traffic has created several issues for the Internet community, including long delays and low throughput. Most Internet user activity occurs via web access, thus making it a major source of Internet traffic. Due to a lack of effective management schemes, Internet usage is inefficient. Advances in caching mechanisms have led to the introduction of web proxies that have improved real-time communication and cost savings. Although several traditional caching polices have been implemented to increase speed and simplicity, cache replacement accuracy remains a key limitation due to cache storage constraints. Our contribution concerns the algorithmic investigation of intelligent soft computing schemes to enhance a web proxy system to improve precision for reproducibility. This research also proposes a two-level caching scheme; the first level is least frequently used (LFU), and an extreme learning machine (ELM) is used for the second level. A traditional ELM for web caching is further optimized with object similarity factors. The proposed scheme is evaluated and compared to a traditional caching policy and its integration with intelligent caching using a well-known dataset from IRCache. The method is shown to achieve good performance in terms of high hit and byte hit rates.
{"title":"A Two-Level Intelligent Web Caching Scheme with a Hybrid Extreme Learning Machine and Least Frequently Used","authors":"Phet Imtongkhum, C. So-In, S. Sanguanpong, Songyut Phoemphon","doi":"10.6138/JIT.2018.19.6.20160623","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.6.20160623","url":null,"abstract":"The immense increase in data traffic has created several issues for the Internet community, including long delays and low throughput. Most Internet user activity occurs via web access, thus making it a major source of Internet traffic. Due to a lack of effective management schemes, Internet usage is inefficient. Advances in caching mechanisms have led to the introduction of web proxies that have improved real-time communication and cost savings. Although several traditional caching polices have been implemented to increase speed and simplicity, cache replacement accuracy remains a key limitation due to cache storage constraints. Our contribution concerns the algorithmic investigation of intelligent soft computing schemes to enhance a web proxy system to improve precision for reproducibility. This research also proposes a two-level caching scheme; the first level is least frequently used (LFU), and an extreme learning machine (ELM) is used for the second level. A traditional ELM for web caching is further optimized with object similarity factors. The proposed scheme is evaluated and compared to a traditional caching policy and its integration with intelligent caching using a well-known dataset from IRCache. The method is shown to achieve good performance in terms of high hit and byte hit rates.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"725-740"},"PeriodicalIF":1.6,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42232492","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Industrial wireless sensor networks (IWSNs) have the potential to contribute significantly to a variety of wireless sensing endpoints, such as cable replacement, mobility, flexibility and cost reduction. However, the harsh and varied industrial environment entails addressing severe challenges, such as dust, heat, electromagnetic interference (EMI) and radio frequency interference from the other heterogeneous networks. One of the important challenges is the link burstiness in industrial wireless environments, which has not been heavily researched. In this paper, we propose a new timeslot scheduling algorithm to address this problem. The algorithm allows transmissions on the same link to be separated at least by a minimum timeslot distance. Moreover, to provide a synergistic complement to the timeslot scheduling, we also propose a timeslot reuse scheme, which facilitates improved efficiency and reliability in the bandwidth utilization and retransmission and decreases the average delay of the packet arrival. We evaluate the proposed algorithm and scheme by a real implementation, targeting a specific industrial application. The experimental results generally indicate that the proposed media access control (MAC) scheme greatly improves the reliability and decreases the packet arrival delay. Compared with the existing popular methods, the execution of our scheme indicates a minimal link burstiness influence and possesses more efficient bandwidth utilization.
{"title":"A Bandwidth-Efficient MAC Scheme for Mission-Critical Applications in Industrial Wireless Sensor Networks","authors":"Hongchao Wang, Jian Ma, Youzhi Xu, Dong Yang, Hongke Zhang","doi":"10.3966/160792642018051903015","DOIUrl":"https://doi.org/10.3966/160792642018051903015","url":null,"abstract":"Industrial wireless sensor networks (IWSNs) have the potential to contribute significantly to a variety of wireless sensing endpoints, such as cable replacement, mobility, flexibility and cost reduction. However, the harsh and varied industrial environment entails addressing severe challenges, such as dust, heat, electromagnetic interference (EMI) and radio frequency interference from the other heterogeneous networks. One of the important challenges is the link burstiness in industrial wireless environments, which has not been heavily researched. In this paper, we propose a new timeslot scheduling algorithm to address this problem. The algorithm allows transmissions on the same link to be separated at least by a minimum timeslot distance. Moreover, to provide a synergistic complement to the timeslot scheduling, we also propose a timeslot reuse scheme, which facilitates improved efficiency and reliability in the bandwidth utilization and retransmission and decreases the average delay of the packet arrival. We evaluate the proposed algorithm and scheme by a real implementation, targeting a specific industrial application. The experimental results generally indicate that the proposed media access control (MAC) scheme greatly improves the reliability and decreases the packet arrival delay. Compared with the existing popular methods, the execution of our scheme indicates a minimal link burstiness influence and possesses more efficient bandwidth utilization.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"795-805"},"PeriodicalIF":1.6,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46760692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-01DOI: 10.6138/JIT.2018.19.4.20160427
Jinhuan Zhang, J. Long, Anfeng Liu, Guihu Zhao
Data gathering and dissemination is a key issue for WSNs. Data collection should take energy efficient, reliability as well as delay into consideration. To address these problems, a novel reproduction packets routing scheme named Green, Reliability and Delay based Route (GRDR) is proposed. The GRDR scheme integrates three core phases, namely, packets reproduction, direction dispersity and multi-route. The key idea of the GRDR is to generate different number of new packet copies after certain steps according to the distance to sink, thus obviating the energy efficiency and latency minimizing for data collection. We formulate the optimization problem as to maximize lifetime under end-to-end delay and given reliability constraints by controlling the system parameters. To demonstrate the effectiveness of the scheme, we conduct extensive theoretical analysis and simulations to evaluate the performance of GRDR. The analysis and simulations show that GRDR is more energy efficient and lower delay than the existing scheme.
{"title":"GRDR: A Novel Data Gathering and Dissemination Scheme for WSNs","authors":"Jinhuan Zhang, J. Long, Anfeng Liu, Guihu Zhao","doi":"10.6138/JIT.2018.19.4.20160427","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.4.20160427","url":null,"abstract":"Data gathering and dissemination is a key issue for WSNs. Data collection should take energy efficient, reliability as well as delay into consideration. To address these problems, a novel reproduction packets routing scheme named Green, Reliability and Delay based Route (GRDR) is proposed. The GRDR scheme integrates three core phases, namely, packets reproduction, direction dispersity and multi-route. The key idea of the GRDR is to generate different number of new packet copies after certain steps according to the distance to sink, thus obviating the energy efficiency and latency minimizing for data collection. We formulate the optimization problem as to maximize lifetime under end-to-end delay and given reliability constraints by controlling the system parameters. To demonstrate the effectiveness of the scheme, we conduct extensive theoretical analysis and simulations to evaluate the performance of GRDR. The analysis and simulations show that GRDR is more energy efficient and lower delay than the existing scheme.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"425-438"},"PeriodicalIF":1.6,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48077715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-01DOI: 10.6138/JIT.2018.19.3.20160426
K. Cowdrey, J. D. Lange, R. Malekian, Johan Wanneburg, A. Jose
The purpose of this paper is to investigate waiting times at banking firms to design a system to optimise the overall banking experience. Queueing analysis and queuing theory will be investigated and applied in order to improve customer experience whilst maximising profits. Different queueing strategies will be implemented using waiting time as a performance measurement. In order to find the most efficient solution the following queuing methods will be investigated: First in First out (FIFO), Last in First out (LIFO), Shortest Job First (SJF), Longest Job First (LJF), most profitable job first and priority queues. After investigation, design and simulation, queuing strategies will be implemented on a real world banking scenario whilst introducing banking traffic at different times of the day as well as disturbances such as tellers going offline. A practical design includes a Field Programmable Gate Array (FPGA) in order to simulate the banking scenario. The FPGA approach will provide a mobile solution for the optimization of queueing in a banking firm which could later be implemented in a banking firm for a better banking experience. Based on results obtained, the SJF method produces the best customer satisfaction, whilst most profitable job first queues maximizes profits.
{"title":"Applying Queueing Theory for the Optimization of a Banking Model","authors":"K. Cowdrey, J. D. Lange, R. Malekian, Johan Wanneburg, A. Jose","doi":"10.6138/JIT.2018.19.3.20160426","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.3.20160426","url":null,"abstract":"The purpose of this paper is to investigate waiting times at banking firms to design a system to optimise the overall banking experience. Queueing analysis and queuing theory will be investigated and applied in order to improve customer experience whilst maximising profits. Different queueing strategies will be implemented using waiting time as a performance measurement. In order to find the most efficient solution the following queuing methods will be investigated: First in First out (FIFO), Last in First out (LIFO), Shortest Job First (SJF), Longest Job First (LJF), most profitable job first and priority queues. After investigation, design and simulation, queuing strategies will be implemented on a real world banking scenario whilst introducing banking traffic at different times of the day as well as disturbances such as tellers going offline. A practical design includes a Field Programmable Gate Array (FPGA) in order to simulate the banking scenario. The FPGA approach will provide a mobile solution for the optimization of queueing in a banking firm which could later be implemented in a banking firm for a better banking experience. Based on results obtained, the SJF method produces the best customer satisfaction, whilst most profitable job first queues maximizes profits.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"381-389"},"PeriodicalIF":1.6,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41868778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：