J. Networks最新文献_第10页

Social Relation Based Cache Distribution Policy in Wireless Mobile Networks 基于社会关系的无线移动网络缓存分配策略

J. Networks Pub Date : 2014-04-09 DOI: 10.4304/jnw.9.9.2279-2288

Lei Yang, Yifang Qin, Xu Zhou, Hongjia Li, S. Ci, Hui Tang

{"title":"Social Relation Based Cache Distribution Policy in Wireless Mobile Networks","authors":"Lei Yang, Yifang Qin, Xu Zhou, Hongjia Li, S. Ci, Hui Tang","doi":"10.4304/jnw.9.9.2279-2288","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2279-2288","url":null,"abstract":"Recent advances in intelligent mobile terminal result in the rapid development of wireless mobile networks, which has inherently properties of high access time, low bandwidth and other shortcoming that pull down the Quality of Service (QoS). Cache technologies are considered as the most favorable tools for dealing with the problems of wireless traffic flow, having attracted tremendous interest from both the engineering and academic fields. However, most of the algorithms and tools developed are essentially based on descriptive models instead of predictive models, which are not capable of processing content traffic in the optimal way for wireless users with strong social characteristics. In this paper, a novel social relation based cache distribution policy is proposed, by which not only interaction among network users is used to detect the influential users among them, but also inherent friend relationships are used to predict desirable contents. These features are utilized to assist cache distribution among caching servers in advance for the purpose of serving the future needs of wireless mobile users. Evaluation analyzes the realistic network dataset, and the simulation results demonstrate the superior performance of the proposed optimization framework over existing systems","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"9 1 1","pages":"2279-2288"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83408019","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}

引用次数: 2

An Inverse Shortest Path Problem on an Uncertain Graph 不确定图上的逆最短路径问题

J. Networks Pub Date : 2014-04-09 DOI: 10.4304/jnw.9.9.2353-2359

Jian Zhou, F. Yang, Ke Wang

引用次数: 27

Evolutionary Game Analysis of Knowledge Sharing in Asymmetric Upstream and Downstream Enterprises of Supply Chain 非对称供应链上下游企业知识共享的演化博弈分析

J. Networks Pub Date : 2014-04-09 DOI: 10.4304/jnw.9.9.2490-2497

Hengshan Zong, Guozhu Jia, Feng Jin, Jili Kong

{"title":"Evolutionary Game Analysis of Knowledge Sharing in Asymmetric Upstream and Downstream Enterprises of Supply Chain","authors":"Hengshan Zong, Guozhu Jia, Feng Jin, Jili Kong","doi":"10.4304/jnw.9.9.2490-2497","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2490-2497","url":null,"abstract":"As the core of the production means of enterprises, knowledge has become the strategic resource of the supply chain. Through the knowledge sharing among the enterprises in the supply chain, the efficiency of knowledge innovation and application can be improved. In this paper, based on the state-of-the-art literature, the evolutionary game model of asymmetric upstream and downstream enterprises in the supply chain is built; the dynamic evolutionary process and the influencing factors of the selection of knowledge sharing strategies are analyzed. Based on those analysis, the results show that selecting knowledge sharing strategy in the upstream and downstream enterprises are affected by the factors: the cost coefficient of knowledge sharing, the risk coefficient of knowledge sharing, the gap between the amount of knowledge sharing of enterprises, which have negative correlation to selecting knowledge sharing strategy in the upstream and downstream enterprises; the coefficient of gains in social relationships, the synergistic effect coefficient of knowledge sharing, the incentive and punishment factor of knowledge sharing, which have positive correlation to selecting knowledge sharing strategy. On the basis of these factors, the concrete measures to promote knowledge sharing are put forward. This research has a positive significance for remodeling and strengthening the supply chain core advantages in the era of knowledge economy","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"11 1","pages":"2490-2497"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87193375","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}

引用次数: 0

Optimization Algorithm of Power Communication Network Based on the Equivalent Network 基于等效网络的电力通信网优化算法

J. Networks Pub Date : 2014-04-09 DOI: 10.4304/jnw.9.9.2474-2481

Ningzhe Xing

{"title":"Optimization Algorithm of Power Communication Network Based on the Equivalent Network","authors":"Ningzhe Xing","doi":"10.4304/jnw.9.9.2474-2481","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2474-2481","url":null,"abstract":"Electric power communication requires two nodes in the network or cable period expires, the communication network as a whole is still can continue to run. Reliable power network can provide reliable operation of electric power for dispatching communication security. Due to many key network nodes external connectivity in the electric power, communication network has only one path, so once the link damage because of emergencies, these networks because of the failure of nodes (or communication link) and power operation scheduling of exception can occur easily, thus to cause great damage to the safe operation of the whole power network. In order to improve the robustness of system in this case, this paper designed a new optimization algorithm based on the equivalent network to simplify the real network and the network analysis. This paper studies the nature of circular web spider's webs and predator characteristics, analysis of the structure characteristics of the orb web and information transfer mechanism, which constructs the network topology model of single and double artificially cobweb; all terminal reliability of the factor theorem analysis of single-layer artificial spider network topology, analysis results show that, compared with the network topology artificial spider web structure and the traditional star network, ring network, double loop network and star network, with better all terminal reliability and stronger survivability","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"10 1","pages":"2474-2481"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87774996","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}

引用次数: 1

Output Feedback Tracking Control Based on Neural Network for a Class of SISO Strict Feedback Nonlinear Systems 一类SISO严格反馈非线性系统的神经网络输出反馈跟踪控制

J. Networks Pub Date : 2014-04-09 DOI: 10.4304/jnw.9.9.2521-2528

Hui Hu, Zhongxiao Hao, Pengfei Guo, Xilong Qu

引用次数: 0

P2P Network Traffic Identification Based on Random Forest Algorithm 基于随机森林算法的P2P网络流量识别

J. Networks Pub Date : 2014-04-09 DOI: 10.4304/jnw.9.9.2456-2461

Yajun Hou

{"title":"P2P Network Traffic Identification Based on Random Forest Algorithm","authors":"Yajun Hou","doi":"10.4304/jnw.9.9.2456-2461","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2456-2461","url":null,"abstract":"With the rapid development of computer technique in the past decades, the emergence of P2P techniqueprompts the network computing model evolving from centralized network to distributed network. Although P2P technique has brought tremendous changes to the network technique, P2P technique also exposes a lot of problems during its implementation. If we can manage the P2P network traffic effectively,e.g. identifies and controls its traffic and distinguishes its services, then it will make great sense for research on improving the performance of network service and use efficiency. However,the traditional approaches have shown a great lack of adaptability in dealing with samples which contain heterogeneous information.large scale of samples,unnormalizeddata or uneven data distributed in high dimensional feature space. This paper is based on therelated researches, to overcomethe limitations and shortcomings of current network traffic identification; we explored network traffic identification and came up with an approach of network traffic identification based on random forest. This paper uses campus network of North China University of Water Resources and Electric Power and takes its outlet flow as sample data to experiment. The result shows that random forest is suitable for large scale of data situation, complex dimensional situation, data contain lots of heterogeneous information etc. Additionally, random forest algorithm provide broad application prospects and rich design ideas for machine learning in feature extraction, multiple class object detection and pattern recognition fields","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"28 1","pages":"2456-2461"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87405323","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}

引用次数: 3

Study on the Survival of Wireless Sensor Networks Based on Hierarchical Topology Control Method 基于层次拓扑控制方法的无线传感器网络生存研究

J. Networks Pub Date : 2014-04-09 DOI: 10.4304/jnw.9.9.2482-2489

Hongdong Zhang, Yuli Song

{"title":"Study on the Survival of Wireless Sensor Networks Based on Hierarchical Topology Control Method","authors":"Hongdong Zhang, Yuli Song","doi":"10.4304/jnw.9.9.2482-2489","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2482-2489","url":null,"abstract":"Wireless sensor network (WSN) is composed of a large number of sensor nodes, it can real-time monitor and collect various information of monitored objects and passed to the user for analysis and use. This paper studies and designs a hierarchical WSN network management architecture and communication model, focus on the wireless sensor network topology control mechanism and based on the analysis of the existing hierarchical topology control algorithms. On the introduction of node load, the judgment method and the backup cluster head, design a load balancing topology control algorithm, the cluster management WSN, effectively balance the node energy consumption, reducing the number of network clusters, and the cluster head failure. Design of WSN network management protocol has a simple data type, operation type and the format of the message level HWSNMP, the improved MER protocol code to PDU code, the coded data length ratio after using the BER code length is reduced by 10%. Based on the hierarchical structure as the research object and energy-saving topology, a comprehensive analysis of the LEACH algorithm in layered structures (physical model, algorithm), and compares the advantages and disadvantages and the existing typical algorithms based on LEACH, the cluster algorithm based on node energy balance, balance the node energy consumption to meet the clusters in the theory history","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"1 1","pages":"2482-2489"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88323142","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}

引用次数: 2

Empirical Measurement and Analysis of I2P Routers I2P路由器的实证测量与分析

J. Networks Pub Date : 2014-04-09 DOI: 10.4304/jnw.9.9.2269-2278

Peipeng Liu, Lihong Wang, Qingfeng Tan, Quangang Li, Xuebin Wang, Jinqiao Shi

{"title":"Empirical Measurement and Analysis of I2P Routers","authors":"Peipeng Liu, Lihong Wang, Qingfeng Tan, Quangang Li, Xuebin Wang, Jinqiao Shi","doi":"10.4304/jnw.9.9.2269-2278","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2269-2278","url":null,"abstract":"With the increased focus on Internet privacy, especially after the exposure of PRISM(an Internet surveillance program), anonymous communication have been getting more and more attentions. One of the most widely used anonymous communication systems is I2P(Invisible Internet Project). And as opposed to Tor’s(another popular anonymous communication system) directory-based approach, which provides a centralized directory server to manage the overall ‘view’ of the network, I2P is fully distributed and self organizing, which aims to avoid attackers’ enumeration of all I2P’s routers. In this paper, based on I2P’s operating mechanism, we presented two passive and two active methods to discover I2P routers. In a more than two week’s collecting experiment, about 25640 routers were discovered everyday, which turned out to be an almost full coverage(94.9%) of the I2P network compared with the data announced on the official website [1]. And based on the routers collected, this paper further made a preliminary analysis of both the I2P network’s overall status and its security. The result showed that I2P is a well structured P2P network, while some powerful attackers operating several routers are still possible to perform compromise attack to break I2P users’ anonymity given the current I2P’s security mechanism. Finally, this paper discussed some countermeasures to improve the security of the I2P network.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"12 1","pages":"2269-2278"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81722786","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}

引用次数: 21

Automatic Generation of Meta Classifiers with Large Levels for Distributed Computing and Networking 面向分布式计算和网络的大层次元分类器的自动生成

J. Networks Pub Date : 2014-04-09 DOI: 10.4304/jnw.9.9.2259-2268

J. Abawajy, A. Kelarev, M. Chowdhury

{"title":"Automatic Generation of Meta Classifiers with Large Levels for Distributed Computing and Networking","authors":"J. Abawajy, A. Kelarev, M. Chowdhury","doi":"10.4304/jnw.9.9.2259-2268","DOIUrl":"https://doi.org/10.4304/jnw.9.9.2259-2268","url":null,"abstract":"This paper is devoted to a case study of a new construction of classifiers. These classifiers are called automatically generated multi-level meta classifiers, AGMLMC. The construction combines diverse meta classifiers in a new way to create a unified system. This original construction can be generated automatically producing classifiers with large levels. Different meta classifiers are incorporated as low-level integral parts of another meta classifier at the top level. It is intended for the distributed computing and networking. The AGMLMC classifiers are unified classifiers with many parts that can operate in parallel. This make it easy to adopt them in distributed applications. This paper introduces new construction of classifiers and undertakes an experimental study of their performance. We look at a case study of their effectiveness in the special case of the detection and filtering of phishing emails. This is a possible important application area for such large and distributed classification systems. Our experiments investigate the effectiveness of combining diverse meta classifiers into one AGMLMC classifier in the case study of detection and filtering of phishing emails. The results show that new classifiers with large levels achieved better performance compared to the base classifiers and simple meta classifiers classifiers. This demonstrates that the new technique can be applied to increase the performance if diverse meta classifiers are included in the system.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"7 1","pages":"2259-2268"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73212264","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}

引用次数: 5

Service Adaptively Medium Access Control Algorithm Based on Fuzzy Logical for Energy Harvesting Wireless Sensor Networks 基于模糊逻辑的能量采集无线传感器网络业务自适应介质访问控制算法

J. Networks Pub Date : 2014-04-09 DOI: 10.4304/jnw.9.9.2336-2341

Meijuan Chen, Xiaorong Zhu, Hongbo Zhu

引用次数: 11