Pub Date : 1900-01-01DOI: 10.32604/csse.2018.33.421
Hany Ramadan, B. S. Tawfik, A. Riad
Mobile ad hoc networks (MANET) are wireless network without infrastructure and suffering from low power battery. Therefore the main objective in finding a route for traffic transfer from a given source to a given destination is to minimize the node energy consumption. This paper solves the problem of finding a route satisfying the main objective of minimum energy consumption and other QoS requirements such as minimum delay and maximum packet delivery ratio by using linear programming technique. Two cases are considered: 1. The traffic amount of a given request is transmitted into single path, and 2. The traffic amount of a request can be distributed into parallel paths. A preprocessing step is done first for network topology design. This step leads to formulate the first case as integer linear programming problem and the second case as linear programming and not mixed integer linear programming. The two obtained solutions are evaluated in terms of three criteria: energy consumption, execution time, and packet delivery ratio using an experimental study. The results show that the solution of second case is much better than the first case in terms of energy consumption and execution time. Packet delivery ratio in the second case is 100% while in the first case is only 76%.
{"title":"Energy Aware Routing Algorithm in Manet Using Linear Programming","authors":"Hany Ramadan, B. S. Tawfik, A. Riad","doi":"10.32604/csse.2018.33.421","DOIUrl":"https://doi.org/10.32604/csse.2018.33.421","url":null,"abstract":"Mobile ad hoc networks (MANET) are wireless network without infrastructure and suffering from low power battery. Therefore the main objective in finding a route for traffic transfer from a given source to a given destination is to minimize the node energy consumption. This paper solves the problem of finding a route satisfying the main objective of minimum energy consumption and other QoS requirements such as minimum delay and maximum packet delivery ratio by using linear programming technique. Two cases are considered: 1. The traffic amount of a given request is transmitted into single path, and 2. The traffic amount of a request can be distributed into parallel paths. A preprocessing step is done first for network topology design. This step leads to formulate the first case as integer linear programming problem and the second case as linear programming and not mixed integer linear programming. The two obtained solutions are evaluated in terms of three criteria: energy consumption, execution time, and packet delivery ratio using an experimental study. The results show that the solution of second case is much better than the first case in terms of energy consumption and execution time. Packet delivery ratio in the second case is 100% while in the first case is only 76%.","PeriodicalId":119237,"journal":{"name":"Commun. Stat. Simul. Comput.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116987969","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 Content-Centric Networking (CCN) architecture, popular content can be cached in some intermediate network devices while being delivered, and the following requests for the cached content can be efficiently handled by the caches. Thus, how to design in-network caching is important for reducing both the traffic load and the delivery delay. In this paper, we propose a caching framework of Prefix-based Popularity Prediction (PPP) for efficient caching in CCN. PPP assigns a lifetime (in a cache) to the prefix of a name (of each cached object) based on its access history (or popularity), which is represented as a Prefix-Tree (PT). We demonstrate PPP’s predictability of content popularity in CCN by both traces and simulations. The evaluation results show that PPP can achieve higher cache hits and less traffic load than traditional caching algorithms (i.e., LRU and LFU). Also, its performance gain increases with users of high mobility
{"title":"PPP: Prefix-Based Popularity Prediction for Efficient Content Caching in Contentcentric Networks","authors":"Jianji Ren, Shanyu Zhao, Junding Sun, Ding Li, Song Wang, Zong-pu Jia","doi":"10.32604/csse.2018.33.259","DOIUrl":"https://doi.org/10.32604/csse.2018.33.259","url":null,"abstract":"In the Content-Centric Networking (CCN) architecture, popular content can be cached in some intermediate network devices while being delivered, and the following requests for the cached content can be efficiently handled by the caches. Thus, how to design in-network caching is important for reducing both the traffic load and the delivery delay. In this paper, we propose a caching framework of Prefix-based Popularity Prediction (PPP) for efficient caching in CCN. PPP assigns a lifetime (in a cache) to the prefix of a name (of each cached object) based on its access history (or popularity), which is represented as a Prefix-Tree (PT). We demonstrate PPP’s predictability of content popularity in CCN by both traces and simulations. The evaluation results show that PPP can achieve higher cache hits and less traffic load than traditional caching algorithms (i.e., LRU and LFU). Also, its performance gain increases with users of high mobility","PeriodicalId":119237,"journal":{"name":"Commun. Stat. Simul. Comput.","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117271439","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 : 1900-01-01DOI: 10.32604/csse.2018.33.335
Kaijun Xu, Yusheng Yao, Shanshan Li
The flight lateral conflict model which is based on human subjective factors has always been a research hotspot for training flight. In order to effectively evaluate the safety interval and lateral collision risk in training airspace, in this paper, pilot subjective factors were modeled. It was studied in lateral conflict risk of low altitude complex flight by flight performance shaping factor. By analyzing flight data of a flight training institution in China, it is pointed that the lateral collision risk in specific training airspace meets the requirement of safety target level of international civil aviation organization. The collision risk of circle procedure and eight characters procedure is 2 . 9264 × 10 − 13 and 3 . 19232 × 10 − 13 . The results indicate that the lateral conflict model of training flight based on subjective factors is an effective method to analyze collision risk of low altitude complex flight. and method of modern navigation.
{"title":"Lateral Conflict Model of Training Flight Based on Subjective Factors","authors":"Kaijun Xu, Yusheng Yao, Shanshan Li","doi":"10.32604/csse.2018.33.335","DOIUrl":"https://doi.org/10.32604/csse.2018.33.335","url":null,"abstract":"The flight lateral conflict model which is based on human subjective factors has always been a research hotspot for training flight. In order to effectively evaluate the safety interval and lateral collision risk in training airspace, in this paper, pilot subjective factors were modeled. It was studied in lateral conflict risk of low altitude complex flight by flight performance shaping factor. By analyzing flight data of a flight training institution in China, it is pointed that the lateral collision risk in specific training airspace meets the requirement of safety target level of international civil aviation organization. The collision risk of circle procedure and eight characters procedure is 2 . 9264 × 10 − 13 and 3 . 19232 × 10 − 13 . The results indicate that the lateral conflict model of training flight based on subjective factors is an effective method to analyze collision risk of low altitude complex flight. and method of modern navigation.","PeriodicalId":119237,"journal":{"name":"Commun. Stat. Simul. Comput.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131098793","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}
With the rapid development of information technology and the explosive growth of data, the scale of storage equipment is growing rapidly. The high energy consumption storage devices have become a serious problem for data centers. For data storage, the model of sequential data access a storage system is commonly used. Aiming at the characteristics of a sequential data storage system, this paper, we propose a structure, named Adapted to Dynamic Load based on Redundant Array Independent Disks (ADL-RAID) which is an effective energy-saving data layout for dynamic loads based on the existing Semi-Redundant Array Independent Disks (S-RAID). ADL-RAID inherits the local parallel energy-saving strategy, uses an address mapping mechanism, and allocates storage space to satisfy the performance requirements for the user requested application. By sensing different loads, ADL-RAID allocates storage space for its dynamic loads with the appropriate parallelism. One or several data disks are used when the load is minimized, and all the data disks are used in parallel when the load is maximized. Experimental results show that, for 100% continuous write request, ADL-RAID saves 33.6% energy consumption than S-RAID5 and improves write performance than S-RAID5 by 34.3%. Thus, ADL-RAID has higher availability and is ideal for sequential data storage applications
{"title":"ADL-RAID: Energy-Saving Data Layout for Dynamic Loads","authors":"Youxi Wu, Shengyuan Shi, Jingyu Liu, Huaizhong Zhu","doi":"10.32604/csse.2018.33.309","DOIUrl":"https://doi.org/10.32604/csse.2018.33.309","url":null,"abstract":"With the rapid development of information technology and the explosive growth of data, the scale of storage equipment is growing rapidly. The high energy consumption storage devices have become a serious problem for data centers. For data storage, the model of sequential data access a storage system is commonly used. Aiming at the characteristics of a sequential data storage system, this paper, we propose a structure, named Adapted to Dynamic Load based on Redundant Array Independent Disks (ADL-RAID) which is an effective energy-saving data layout for dynamic loads based on the existing Semi-Redundant Array Independent Disks (S-RAID). ADL-RAID inherits the local parallel energy-saving strategy, uses an address mapping mechanism, and allocates storage space to satisfy the performance requirements for the user requested application. By sensing different loads, ADL-RAID allocates storage space for its dynamic loads with the appropriate parallelism. One or several data disks are used when the load is minimized, and all the data disks are used in parallel when the load is maximized. Experimental results show that, for 100% continuous write request, ADL-RAID saves 33.6% energy consumption than S-RAID5 and improves write performance than S-RAID5 by 34.3%. Thus, ADL-RAID has higher availability and is ideal for sequential data storage applications","PeriodicalId":119237,"journal":{"name":"Commun. Stat. Simul. Comput.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131256422","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 routing mechanism in Data Center networks can affect network performance and latency significantly. Hash-based method, such as ECMP (Equal-Cost Multi-Path), has been widely used in Data Center networks to fulfill the requirement of load balance. However, ECMP statically maps one flow to a path by a hash method, which results in some paths overloaded while others remain underutilized. Some dynamic flow scheduling schemes choose the most underutilized link as the next hop to better utilize the network bandwidth, while these schemes lacks of utilizing the global state of the network. To achieve high bandwidth utilization and low latency, we present a dynamic flow scheduling mechanism based on OpenFlow protocol which enables monitoring the global network information by a centralized controller. Depending on the network statistics obtained by the OpenFlow controller, the routing algorithm chooses the best path for the flow. Because there are two kinds of flows in a Data Center, short-lived flows and long-lived flows, we proposed two different algorithms for them. The implementation uses pox as OpenFlow controller and mininet as the network emulator. The evaluation results demonstrate that our dynamic flow scheduling algorithm is effective and can achieve high link utilization
{"title":"Openflow Based Dynamic Flow Scheduling with Multipath for Data Center Networks","authors":"Haisheng Yu, Heng Qi, Keqiu Li, Jianhui Zhang, Peng Xiao, Xun Wang","doi":"10.32604/csse.2018.33.251","DOIUrl":"https://doi.org/10.32604/csse.2018.33.251","url":null,"abstract":"The routing mechanism in Data Center networks can affect network performance and latency significantly. Hash-based method, such as ECMP (Equal-Cost Multi-Path), has been widely used in Data Center networks to fulfill the requirement of load balance. However, ECMP statically maps one flow to a path by a hash method, which results in some paths overloaded while others remain underutilized. Some dynamic flow scheduling schemes choose the most underutilized link as the next hop to better utilize the network bandwidth, while these schemes lacks of utilizing the global state of the network. To achieve high bandwidth utilization and low latency, we present a dynamic flow scheduling mechanism based on OpenFlow protocol which enables monitoring the global network information by a centralized controller. Depending on the network statistics obtained by the OpenFlow controller, the routing algorithm chooses the best path for the flow. Because there are two kinds of flows in a Data Center, short-lived flows and long-lived flows, we proposed two different algorithms for them. The implementation uses pox as OpenFlow controller and mininet as the network emulator. The evaluation results demonstrate that our dynamic flow scheduling algorithm is effective and can achieve high link utilization","PeriodicalId":119237,"journal":{"name":"Commun. Stat. Simul. Comput.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123387938","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 : 1900-01-01DOI: 10.32604/csse.2018.33.369
Wang Qi
With the continuous development of database technology, the data volume that can be stored and processed by the database is increasing. How to dig out information that people are interested in from the massive data is one of the important issues in the field of database research. This article starts from the user demand analysis, and makes an in-depth study of various query expansion problems of skylines. Then, according to different application scenarios, this paper proposes efficient and targeted solutions to effectively meet the actual needs of people. Based on krepresentative skyline query problem in the data stream environment, a k-representative skyline selection standard k-LDS is presented which is applicable for data stream environment. k-LDS hopes to select the skyline subset with the largest dominant area (containing k skyline tuples only) as krepresentative skyline set in data stream. And for the 3-dimensionalal and multidimensional k-LDS problems, this paper also proposes the approximation algorithm, namely GA algorithm. Finally, through the experiment, it is proved that k-LDS is more suitable for the data stream environment, and the algorithm proposed can effectively solve k-LD problems under the data stream environment.
{"title":"Research on K Maximum Dominant Skyline and E-GA Algorithm Based on Data Stream Environment","authors":"Wang Qi","doi":"10.32604/csse.2018.33.369","DOIUrl":"https://doi.org/10.32604/csse.2018.33.369","url":null,"abstract":"With the continuous development of database technology, the data volume that can be stored and processed by the database is increasing. How to dig out information that people are interested in from the massive data is one of the important issues in the field of database research. This article starts from the user demand analysis, and makes an in-depth study of various query expansion problems of skylines. Then, according to different application scenarios, this paper proposes efficient and targeted solutions to effectively meet the actual needs of people. Based on krepresentative skyline query problem in the data stream environment, a k-representative skyline selection standard k-LDS is presented which is applicable for data stream environment. k-LDS hopes to select the skyline subset with the largest dominant area (containing k skyline tuples only) as krepresentative skyline set in data stream. And for the 3-dimensionalal and multidimensional k-LDS problems, this paper also proposes the approximation algorithm, namely GA algorithm. Finally, through the experiment, it is proved that k-LDS is more suitable for the data stream environment, and the algorithm proposed can effectively solve k-LD problems under the data stream environment.","PeriodicalId":119237,"journal":{"name":"Commun. Stat. Simul. Comput.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122636991","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 : 1900-01-01DOI: 10.32604/CSSE.2018.33.317
Xuejun Tian, Jianliang Li, Li Luo
{"title":"Design of Greenhouse Temperature and Humidity Measuring System based on Zigbee Technology","authors":"Xuejun Tian, Jianliang Li, Li Luo","doi":"10.32604/CSSE.2018.33.317","DOIUrl":"https://doi.org/10.32604/CSSE.2018.33.317","url":null,"abstract":"","PeriodicalId":119237,"journal":{"name":"Commun. Stat. Simul. Comput.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124365903","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}