The information and communication technologies (ICT) integrate different types of wireless communication technologies to provide IT-enabled services and applications. Our goal is to integrate the available wireless communication technologies to enhance seamless communication efficiency and increase resources utilization. We proposed a heterogeneous network management algorithm which includes roaming and sharing functions. The roaming function provides the multiple network resources in physical and media access control layers. The sharing function supports multiple network resource allocation and the service handover process in network and application layers. By applying the incentive scheme, it also encourage users to share the available resources. The simulation result also shows that the proposed scheme can increase the network bandwidth utilization effectively. The sharing system could be used in home, mobile and vehicular environments to realize ubiquitous social sharing networks.
{"title":"A Heterogeneous Network Sharing System Design with Incentive Scheme","authors":"Yu-Ching Lin, Ying-Chuan Chen","doi":"10.1109/ICS.2016.0100","DOIUrl":"https://doi.org/10.1109/ICS.2016.0100","url":null,"abstract":"The information and communication technologies (ICT) integrate different types of wireless communication technologies to provide IT-enabled services and applications. Our goal is to integrate the available wireless communication technologies to enhance seamless communication efficiency and increase resources utilization. We proposed a heterogeneous network management algorithm which includes roaming and sharing functions. The roaming function provides the multiple network resources in physical and media access control layers. The sharing function supports multiple network resource allocation and the service handover process in network and application layers. By applying the incentive scheme, it also encourage users to share the available resources. The simulation result also shows that the proposed scheme can increase the network bandwidth utilization effectively. The sharing system could be used in home, mobile and vehicular environments to realize ubiquitous social sharing networks.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115162955","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}
Congestion control is an important mechanism in wireless sensor networks (WSNs). In this paper, we discuss congestion control and the traffic-aware problem for sensor nodes in WSNs. Congestion may cause serious problems such as packet loss, the consumption of power, and low network throughput for sensor nodes. Hence, we propose a distributed congestion control protocol called traffic-aware congestion control protocol (TACCP). Through the buffer management mechanism, the TACCP can avoid packet loss because of traffic congestion, reduce the power consumption of nodes, and improve the network throughput. Experimental results show that the proposed TACCP can effectively improve network performance.
{"title":"Congestion Control under Traffic Awareness in Wireless Sensor Networks","authors":"Chia-Hsu Kuo, Tzung-Shi Chen, Zhengnan Wu","doi":"10.1109/ICS.2016.0093","DOIUrl":"https://doi.org/10.1109/ICS.2016.0093","url":null,"abstract":"Congestion control is an important mechanism in wireless sensor networks (WSNs). In this paper, we discuss congestion control and the traffic-aware problem for sensor nodes in WSNs. Congestion may cause serious problems such as packet loss, the consumption of power, and low network throughput for sensor nodes. Hence, we propose a distributed congestion control protocol called traffic-aware congestion control protocol (TACCP). Through the buffer management mechanism, the TACCP can avoid packet loss because of traffic congestion, reduce the power consumption of nodes, and improve the network throughput. Experimental results show that the proposed TACCP can effectively improve network performance.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127191467","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}
Po-Jui Tsao, Yi-Feng Sun, Li-Han Chen, Chuan-Yu Cho
Virtualization technology has been widely adopted to enable elastic IT infrastructure, with improved manageability and increased service reliability. Especially, virtualization technology could provide a unique benefit to protect any legacy application systems from hardware failures. The reliability of virtual machines running on virtualized servers is not only threatened by hardware failures beneath the whole virtual infrastructure, but also nosy hypervisors that essentially support virtual machines cannot be trusted. In this paper, a virtualization-based fault tolerance mechanism using epoch-based (checkpoint-based) synchronization is proposed, and several performance optimization technologies are applied including a non-stop/pipelined, continuously migration, dirty tracking for guest virtual memory/virtual device status, and eliminate data transfer between QEMU and KVM. The experimental results show that these optimizations have greatly saved the processor usage, synchronization bandwidth and have significantly improved VM network throughput and latency at the same time.
{"title":"Efficient Virtualization-Based Fault Tolerance","authors":"Po-Jui Tsao, Yi-Feng Sun, Li-Han Chen, Chuan-Yu Cho","doi":"10.1109/ICS.2016.0031","DOIUrl":"https://doi.org/10.1109/ICS.2016.0031","url":null,"abstract":"Virtualization technology has been widely adopted to enable elastic IT infrastructure, with improved manageability and increased service reliability. Especially, virtualization technology could provide a unique benefit to protect any legacy application systems from hardware failures. The reliability of virtual machines running on virtualized servers is not only threatened by hardware failures beneath the whole virtual infrastructure, but also nosy hypervisors that essentially support virtual machines cannot be trusted. In this paper, a virtualization-based fault tolerance mechanism using epoch-based (checkpoint-based) synchronization is proposed, and several performance optimization technologies are applied including a non-stop/pipelined, continuously migration, dirty tracking for guest virtual memory/virtual device status, and eliminate data transfer between QEMU and KVM. The experimental results show that these optimizations have greatly saved the processor usage, synchronization bandwidth and have significantly improved VM network throughput and latency at the same time.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124828984","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}
Computer science education is to teach students to solve problems, design systems, provoke creativity, and explore their own interest by using basic concepts of computer science. From science to the humanities, mathematics and logical thinking ability also affect every aspect of computer science education. To foster mathematics logical thinking and problem-solving ability in primary and secondary schools, students not only require to learn to read, writing, and arithmetic, but also need to understand the abstraction of mathematics operations and logical thinking processes. Therefore, this study uses visual programming language as a basis, i.e. Scratch 2.0 offline edition, to introduce abstraction of mathematics operations. Scratch 2.0 can empower learners using graphical elements to solve mathematics problems with a smooth learning curve through user-friendly programming interface. However, the latest version of Scratch 2.0 does not include enough functions for abstracting mathematical blocks. Consequently, this study integrates Scratch programming environment with math library of Python language to expand functionality and improve usability of Scratch. Moreover, learners are expected to learn and practice more about mathematical thinking through those additional Scratch building blocks.
{"title":"Experimental Functionality Development for Scratch Mathematical and Statistics Extensions","authors":"Ching Chang, Ya-Lun Chin, Chih-Kai Chang","doi":"10.1109/ICS.2016.0131","DOIUrl":"https://doi.org/10.1109/ICS.2016.0131","url":null,"abstract":"Computer science education is to teach students to solve problems, design systems, provoke creativity, and explore their own interest by using basic concepts of computer science. From science to the humanities, mathematics and logical thinking ability also affect every aspect of computer science education. To foster mathematics logical thinking and problem-solving ability in primary and secondary schools, students not only require to learn to read, writing, and arithmetic, but also need to understand the abstraction of mathematics operations and logical thinking processes. Therefore, this study uses visual programming language as a basis, i.e. Scratch 2.0 offline edition, to introduce abstraction of mathematics operations. Scratch 2.0 can empower learners using graphical elements to solve mathematics problems with a smooth learning curve through user-friendly programming interface. However, the latest version of Scratch 2.0 does not include enough functions for abstracting mathematical blocks. Consequently, this study integrates Scratch programming environment with math library of Python language to expand functionality and improve usability of Scratch. Moreover, learners are expected to learn and practice more about mathematical thinking through those additional Scratch building blocks.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125350577","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}
Jia Lin, Wen-Qing Luo, Wen-Pei Chen, M. Liou, Suh Jen Tsai, Yaw-Ling Lin
The growth of public DNA sequence and metagenomic data over the last two decades has been exponential. Bioinformatics researchers are confronted with analysis of massive data sets, while the problem is still growing at an alarming rate in the near future. In this paper, we integrate many open source software tools in biological sequences analysis to construct an effective cloud-based microbial metagenomics analysis tool. The proposed method incorporates the Hadoop framework, with combination of data analysis and data storage, which makes the analysis tools more efficient to work with Big Data behind the ever growing metagenomic DNA sequences.
{"title":"An Effective Approach for Cloud-Based Microbial Metagenomics Analysis","authors":"Jia Lin, Wen-Qing Luo, Wen-Pei Chen, M. Liou, Suh Jen Tsai, Yaw-Ling Lin","doi":"10.1109/ICS.2016.0016","DOIUrl":"https://doi.org/10.1109/ICS.2016.0016","url":null,"abstract":"The growth of public DNA sequence and metagenomic data over the last two decades has been exponential. Bioinformatics researchers are confronted with analysis of massive data sets, while the problem is still growing at an alarming rate in the near future. In this paper, we integrate many open source software tools in biological sequences analysis to construct an effective cloud-based microbial metagenomics analysis tool. The proposed method incorporates the Hadoop framework, with combination of data analysis and data storage, which makes the analysis tools more efficient to work with Big Data behind the ever growing metagenomic DNA sequences.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"85 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115052991","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}
Meng-Jie Wang, Jheng-Liang Cai, F. Tseng, Chao-Yuan Hsu
Massive multiple-input multiple-output (MIMO) systems are promising technology to greatly increase the spectral efficiency for the 5G cellular system. However, the implementation is practically a challenge due to the limitation of cost, space, and complexity. Though the millimeter-wave (mm-wave) transmission can greatly save the space for deploying numerous antennas, the demand on the numerous RF chains increases the implementation cost significantly. The hybrid structures of sub-array antennas are then developed to alleviate the cost, where the entire array is grouped into several sub-arrays. All antennas in a subarray share a common RF chain, which greatly reduces the complexity. Furthermore, the downlink channel state information (CSI) is crucial for several pre-processing technologies such as precoding. Nevertheless, the CSI estimation is difficult due to the large dimension of a channel matrix. Accordingly, CSI estimation by the structured channel matrix is attractive since only few unknown angle-of-arrivals (AoA) and deterministic signatures can model the CSI. Estimation of CSI is equivalent to estimating the AoA. In this paper, we propose a new AoA estimation by using estimating signal parameters via rotational invariance technique (ESPRIT) for the massive MIMO system with two kinds of hybrid subarrays, referred to side-by-side and interleave sub-arrays. Numerical results validate the proposed AoA estimation and show that the proposed AoA estimation with side-by-side sub-arrays can approach to the fully-digitized arrays while keeping a lower computational complexity.
{"title":"A Low-Complexity 2-D Angle of Arrival Estimation in Massive MIMO Systems","authors":"Meng-Jie Wang, Jheng-Liang Cai, F. Tseng, Chao-Yuan Hsu","doi":"10.1109/ICS.2016.0146","DOIUrl":"https://doi.org/10.1109/ICS.2016.0146","url":null,"abstract":"Massive multiple-input multiple-output (MIMO) systems are promising technology to greatly increase the spectral efficiency for the 5G cellular system. However, the implementation is practically a challenge due to the limitation of cost, space, and complexity. Though the millimeter-wave (mm-wave) transmission can greatly save the space for deploying numerous antennas, the demand on the numerous RF chains increases the implementation cost significantly. The hybrid structures of sub-array antennas are then developed to alleviate the cost, where the entire array is grouped into several sub-arrays. All antennas in a subarray share a common RF chain, which greatly reduces the complexity. Furthermore, the downlink channel state information (CSI) is crucial for several pre-processing technologies such as precoding. Nevertheless, the CSI estimation is difficult due to the large dimension of a channel matrix. Accordingly, CSI estimation by the structured channel matrix is attractive since only few unknown angle-of-arrivals (AoA) and deterministic signatures can model the CSI. Estimation of CSI is equivalent to estimating the AoA. In this paper, we propose a new AoA estimation by using estimating signal parameters via rotational invariance technique (ESPRIT) for the massive MIMO system with two kinds of hybrid subarrays, referred to side-by-side and interleave sub-arrays. Numerical results validate the proposed AoA estimation and show that the proposed AoA estimation with side-by-side sub-arrays can approach to the fully-digitized arrays while keeping a lower computational complexity.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124672615","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}
Te-Chuan Chiu, Ya-Ju Yu, Shih-Fan Chou, Yu-Ting Tsai, Ai-Chun Pang
Recently, Cisco has predicted that there will be an explosive growth of the mobile data traffic such that video streaming will account for nearly 70% total demand. To foresee such heavy burden in each eNB, Device-to-Device (D2D) technology is a promising solution to do data offloading while maintain acceptable service quality. In this paper, we first target on two different D2D interfaces, Wi-Fi and LTE direct, and propose an efficient multi-radio selection scheme by dynamic programming design approach for video streaming in wireless cellular networks. To minimize total LTE radio resource usage, we leverage D2D technology and adaptively select the different transmission links to meet QoS requirement of each user. Since the data rate of Wi-Fi transmission link is hard to correctly evaluate, we conduct a series of experiments under realistic interference environment to measure the actual capacity of Wi-Fi transmission links. Besides, we also study related works about general capacity predict model to take both measurement and mathematical model into consideration for designing our solution. The simulation results show that the proposed scheme can significantly reduce the LTE radio resource usage and successfully do data offloading for each eNB in wireless cellular networks.
{"title":"Efficient Multi-Radio Selections for Device-to-Device in Wireless Cellular Networks","authors":"Te-Chuan Chiu, Ya-Ju Yu, Shih-Fan Chou, Yu-Ting Tsai, Ai-Chun Pang","doi":"10.1109/ICS.2016.0037","DOIUrl":"https://doi.org/10.1109/ICS.2016.0037","url":null,"abstract":"Recently, Cisco has predicted that there will be an explosive growth of the mobile data traffic such that video streaming will account for nearly 70% total demand. To foresee such heavy burden in each eNB, Device-to-Device (D2D) technology is a promising solution to do data offloading while maintain acceptable service quality. In this paper, we first target on two different D2D interfaces, Wi-Fi and LTE direct, and propose an efficient multi-radio selection scheme by dynamic programming design approach for video streaming in wireless cellular networks. To minimize total LTE radio resource usage, we leverage D2D technology and adaptively select the different transmission links to meet QoS requirement of each user. Since the data rate of Wi-Fi transmission link is hard to correctly evaluate, we conduct a series of experiments under realistic interference environment to measure the actual capacity of Wi-Fi transmission links. Besides, we also study related works about general capacity predict model to take both measurement and mathematical model into consideration for designing our solution. The simulation results show that the proposed scheme can significantly reduce the LTE radio resource usage and successfully do data offloading for each eNB in wireless cellular networks.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"72 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130351595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The network traffic has been growing explosively in recent years after users can watch the high quality video from the Internet. It is an important issue to reduce network traffic and increase the user quality of experience (QoE). Therefore, there have been in-network caching schemes to cache the content fetched by users in proxy servers. Recently, software defined networking (SDN) was proposed to implement the network function by the virtualization function. Programmers can implement the customized network functions by the SDN architecture. This paper proposes an extended SDN-based caching service architecture, abbreviated as ESC. The ESC decomposes the function of inspecting incoming traffic, making cache decision, and storing cache content into three types of network entities: an extended OpenFlow (DPI-based) switch, a cache controller, and cache nodes. This design can lessen the load of single network entity. Moreover, the ESC can cache different parts of a video in distinct cache nodes. The distributed content storage mechanism can increase the cache capability and the system flexibility. In addition, we use M/M/1 queuing model to analyze the average queuing delay time, and compare the ESC queuing delay time with the C-flow and the OpenCache. The results in numerical analysis show that the ESC average queuing delay is shorter than the other two.
{"title":"An Extended SDN-Based In-Network Caching Service for Video on Demand","authors":"Wei-Kuo Chiang, Tsung-Ying Li","doi":"10.1109/ICS.2016.0040","DOIUrl":"https://doi.org/10.1109/ICS.2016.0040","url":null,"abstract":"The network traffic has been growing explosively in recent years after users can watch the high quality video from the Internet. It is an important issue to reduce network traffic and increase the user quality of experience (QoE). Therefore, there have been in-network caching schemes to cache the content fetched by users in proxy servers. Recently, software defined networking (SDN) was proposed to implement the network function by the virtualization function. Programmers can implement the customized network functions by the SDN architecture. This paper proposes an extended SDN-based caching service architecture, abbreviated as ESC. The ESC decomposes the function of inspecting incoming traffic, making cache decision, and storing cache content into three types of network entities: an extended OpenFlow (DPI-based) switch, a cache controller, and cache nodes. This design can lessen the load of single network entity. Moreover, the ESC can cache different parts of a video in distinct cache nodes. The distributed content storage mechanism can increase the cache capability and the system flexibility. In addition, we use M/M/1 queuing model to analyze the average queuing delay time, and compare the ESC queuing delay time with the C-flow and the OpenCache. The results in numerical analysis show that the ESC average queuing delay is shorter than the other two.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129232810","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}
Finite element method (FEM) must be created the element mesh, it is very tedious and time-consuming. A novel meshless method doesn't require generating the element mesh, it reduces a large amount of computational and human time. The shape parameter plays a key role of meshless methods, the authors usually choose the shape parameter by trial and error or some other ad-hoc means. This study will propose LOOCV-GRBFCM to choose a "GOOD" shape parameter and solve problems automatically and practically. Performance evaluations will also be presented. We hope these results to support useful suggestions.
{"title":"LOOCV-GRBFCM Performance Evaluation","authors":"C. Chou, Kuen-Tsann Chen","doi":"10.1109/ICS.2016.0020","DOIUrl":"https://doi.org/10.1109/ICS.2016.0020","url":null,"abstract":"Finite element method (FEM) must be created the element mesh, it is very tedious and time-consuming. A novel meshless method doesn't require generating the element mesh, it reduces a large amount of computational and human time. The shape parameter plays a key role of meshless methods, the authors usually choose the shape parameter by trial and error or some other ad-hoc means. This study will propose LOOCV-GRBFCM to choose a \"GOOD\" shape parameter and solve problems automatically and practically. Performance evaluations will also be presented. We hope these results to support useful suggestions.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121588083","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}
To adapt to the underwater application environment and extend network lifecycle, an improved protocol called energy balanced pressure routing (EBPR) is proposed in this paper. EBPR is based on void-aware pressure routing (VAPR). In VAPR, determination of beacon cycle is related to node velocity. However, the node velocity is difficult to get without assisted positioning system, and it has certain difference at different positions. EBPR proposes a different method to determine cycle based on sensor node's feedback without knowledge of node velocity. Besides, EBPR introduces the residual energy into the next hop selection process to balance energy consumption of node and postpone the sparse process of network. At the same time, a routing reconstruct mechanism is proposed to help node who missing the routing construct process to update routing information with the help of redundant information in aware packets. In this paper, we simulate the two protocols using OMNeT++. Result shows that two protocols have almost the same data delivery ratio. However, at the aspect of lifecycle, EBPR can extend by 10% ~ 30% under low water velocity. This advantage will decrease as the increase of node velocity, but not weaker than VAPR.
{"title":"Energy Balanced Pressure Routing Protocol for Underwater Sensor Networks","authors":"Wang Kun, Tian Yuzhen, Shi Yinhua","doi":"10.1109/ICS.2016.0050","DOIUrl":"https://doi.org/10.1109/ICS.2016.0050","url":null,"abstract":"To adapt to the underwater application environment and extend network lifecycle, an improved protocol called energy balanced pressure routing (EBPR) is proposed in this paper. EBPR is based on void-aware pressure routing (VAPR). In VAPR, determination of beacon cycle is related to node velocity. However, the node velocity is difficult to get without assisted positioning system, and it has certain difference at different positions. EBPR proposes a different method to determine cycle based on sensor node's feedback without knowledge of node velocity. Besides, EBPR introduces the residual energy into the next hop selection process to balance energy consumption of node and postpone the sparse process of network. At the same time, a routing reconstruct mechanism is proposed to help node who missing the routing construct process to update routing information with the help of redundant information in aware packets. In this paper, we simulate the two protocols using OMNeT++. Result shows that two protocols have almost the same data delivery ratio. However, at the aspect of lifecycle, EBPR can extend by 10% ~ 30% under low water velocity. This advantage will decrease as the increase of node velocity, but not weaker than VAPR.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124505446","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
扫码关注我们
求助内容：
应助结果提醒方式：