雜志介紹

Networks雜志介紹

《Networks》是一本以English為主的未開放獲取國際優(yōu)秀期刊，中文名稱網(wǎng)絡(luò)，本刊主要出版、報(bào)道計(jì)算機(jī)科學(xué)-COMPUTER SCIENCE, HARDWARE & ARCHITECTURE領(lǐng)域的研究動(dòng)態(tài)以及在該領(lǐng)域取得的各方面的經(jīng)驗(yàn)和科研成果，介紹該領(lǐng)域有關(guān)本專業(yè)的最新進(jìn)展，探討行業(yè)發(fā)展的思路和方法，以促進(jìn)學(xué)術(shù)信息交流，提高行業(yè)發(fā)展。該刊已被國際權(quán)威數(shù)據(jù)庫SCIE收錄，為該領(lǐng)域相關(guān)學(xué)科的發(fā)展起到了良好的推動(dòng)作用，也得到了本專業(yè)人員的廣泛認(rèn)可。該刊最新影響因子為1.6，最新CiteScore 指數(shù)為4.4。

本刊近期中國學(xué)者發(fā)表的論文主要有：

• The probabilistic uncapacitated open vehicle routing location problem

  Author: Averbakh, Igor; Yu, Wei

• Beyond PulseSync: Less Clock Granularity Impact, More Synchronization Accuracy

  Author: zhangaigh

• Frame Counter: Achieving Accurate and Real-Time Link Estimation in Low Power Wireless Sensor Networks

  Author: dbliu.sky

• Multi-hop energy sharing in rechargeable wireless sensor networks

  Author: mm1028_wang

英文介紹

Networks雜志英文介紹

Network problems are pervasive in our modern technological society, as witnessed by our reliance on physical networks that provide power, communication, and transportation. As well, a number of processes can be modeled using logical networks, as in the scheduling of interdependent tasks, the dating of archaeological artifacts, or the compilation of subroutines comprising a large computer program. Networks provide a common framework for posing and studying problems that often have wider applicability than their originating context.

The goal of this journal is to provide a central forum for the distribution of timely information about network problems, their design and mathematical analysis, as well as efficient algorithms for carrying out optimization on networks. The nonstandard modeling of diverse processes using networks and network concepts is also of interest. Consequently, the disciplines that are useful in studying networks are varied, including applied mathematics, operations research, computer science, discrete mathematics, and economics.

Networks publishes material on the analytic modeling of problems using networks, the mathematical analysis of network problems, the design of computationally e?cient network algorithms, and innovative case studies of successful network applications. We do not typically publish works that fall in the realm of pure graph theory (without signi?cant algorithmic and modeling contributions) or papers that deal with engineering aspects of network design. Since the audience for this journal is then necessarily broad, articles that impact multiple application areas or that creatively use new or existing methodologies are especially appropriate. We seek to publish original, well-written research papers that make a substantive contribution to the knowledge base. In addition, tutorial and survey articles are welcomed. All manuscripts are carefully refereed.