基于三维胞元空间的MA双向并行路由算法

针对传统移动代理(MA)在监测无线传感器网络(WSNs)的感兴趣信息时产生的延迟较大和能耗较多问题,提出了基于三维胞元空间的MA双向并行(3D-BPMA)路由算法.3D-BPMA将MA与传统的客户/服务器(c/S)模式相结合,在胞元内利用C/S模式搜集信息,在单层胞元系统和路由器与路由器之间采用MA双向并行的策略进行传输.仿真结果表明:3D-BPMA与LCF,DSG-MIP算法相比减少了平均响应时间和网络平均能耗,提高了MA发送率.     

Semantically enriched Massive Open Online Courses (MOOCs) platform

Massive Open Online Courses (MOOCs) are becoming an essential source of information for both students and teachers. Noticeably, MOOCs have to adapt to the fast development of new technologies; they also have to satisfy the current generation of online students. The current MOOCs’ Management Systems, such as Coursera, Udacity, edX, etc., use content management platforms where content are organized in a hierarchical structure. We envision a new generation of MOOCs that support interpretability with formal semantics by using the SemanticWeb and the online social networks. Semantic technologies support more flexible information management than that offered by the current MOOCs’ platforms. Annotated information about courses, video lectures, assignments, students, teachers, etc., can be composed from heterogeneous sources, including contributions from the communities in the forum space. These annotations, combined with legacy data, build foundations for more efficient information discovery in MOOCs’ platforms. In this article we review various Collaborative Semantic Filtering technologies for building Semantic MOOCs’ management system, then, we present a prototype of a semantic middle-sized platform implemented at Western Kentucky University that answers these aforementioned requirements.     

Distributed wireless power transfer in sensor networks with multiple Mobile Chargers

We investigate the problem of efficient wireless power transfer in wireless sensor networks. In our approach, special mobile entities (called the Mobile Chargers) traverse the network and wirelessly replenish the energy of sensor nodes. In contrast to most current approaches, we envision methods that are distributed and use limited network information. We propose four new protocols for efficient charging, addressing key issues which we identify, most notably (i) what are good coordination procedures for the Mobile Chargers and (ii) what are good trajectories for the Mobile Chargers. Two of our protocols (DC, DCLK) perform distributed, limited network knowledge coordination and charging, while two others (CC, CCGK) perform centralized, global network knowledge coordination and charging. As detailed simulations demonstrate, one of our distributed protocols outperforms a known state of the art method, while its performance gets quite close to the performance of the powerful centralized global knowledge method.     

Energy-optimal base station density in cellular access networks with sleep modes

Sleep modes are widely accepted as an effective technique for energy-efficient networking: by adequately putting to sleep and waking up network resources according to traffic demands, a proportionality between energy consumption and network utilization can be approached, with important reductions in energy consumption. Previous studies have investigated and evaluated sleep modes for wireless access networks, computing variable percentages of energy savings. In this paper we characterize the maximum energy saving that can be achieved in a cellular wireless access network under a given performance constraint. In particular, our approach allows the derivation of realistic estimates of the energy-optimal density of base stations corresponding to a given user density, under a fixed performance constraint. Our results allow different sleep mode proposals to be measured against the maximum theoretically achievable improvement. We show, through numerical evaluation, the possible energy savings in today’s networks, and we further demonstrate that even with the development of highly energy-efficient hardware, a holistic approach incorporating system level techniques is essential to achieving maximum energy efficiency.     

Modeling and analysis of passive worm propagation in the P2P file-sharing network

A number of worms, named P2P (peer-to-peer) passive worms, have recently surfaced, which propagate in P2P file-sharing networks and have posed heavy threats to these networks. In contrast to the majority of Internet worms, it is by exploiting users’ legitimate activities instead of vulnerabilities of networks in which P2P passive worms propagate. This feature evidently slows down their propagation, which results in them not attracting an adequate amount of attention in literature. Meanwhile, this feature visibly increases the difficulty of detecting them, which makes it very possible for them to become epidemic. In this paper, we propose an analytical model for P2P passive worm propagation by adopting epidemiological approaches so as to identify their behaviors and predict the tendency of their propagation accurately. Compared with a few existing models, dynamic characteristics of P2P networks are taken into account. Based on this proposed model, the sufficient condition for the global stability of the worm free equilibrium is derived by applying epidemiological theories. Large scale simulation experiments have validated both the proposed model and the condition.     

基于感知评价的Internet语音终端流量控制

分析了影响因特网语音通信质量的主要因素，根据实时传输控制协议计算延迟、丢包率等网络参数，并利用RBF神经网络将参数映射为语音质量评分，根据评分值的变化动态地调整语音终端的编码速率，在保证一定语音质量的同时，缓解网络拥塞。实验证明了该方法的有效性。     

异构分层无线网络中基于逗留时间的动态流量均衡算法研究

为使异构分层无线网络能服务更多的移动用户,提出了一种基于逗留时间的动态流量均衡算法.该算法首先根据用户移动模型计算其在小区内的逗留时间,然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内呼叫转移的数量,最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中.为降低切换呼叫掉线率,还对异构网间的呼叫切换策略做了改进.仿真实验结果表明,本算法在新呼叫阻塞率和切换呼叫掉线率等性能指标上比传统方法有显著的提高.     

Efficient multicast search under delay and bandwidth constraints

The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.     

Segmented polymer networks containing amino‐dendrimers

Polymer networks in which poly(propylene imine) dendrimers (Astramol?) are connected to each other by linear polytetrahydrofuran (polyTHF) segments, were prepared by two methods. The first method was a one‐step procedure in which bifunctionally living polyTHF, obtained by initiation of the THF polymerization with trifluoromethane sulfonic anhydride (triflic anhydride), was reacted with an amino‐dendrimer. This reaction was very fast but did not allow formation of the end products. The second method was a two‐step procedure. In a first step, living polyTHF, prepared with acryloyloxybutyl triflate as initiator, was grafted on an amino‐dendrimer, to form a star‐like, acrylate‐terminated polyTHF multi‐macromonomer with the dendrimer as core. In a second step, networks were obtained by Michael addition between the acrylate end‐groups and unreacted amino‐groups of the dendrimer. This cross‐linking reaction occurred spontaneously upon heating of the solution of the multi‐macromonomer with gelation times varying from a few minutes to a few hours, depending on the temperature and the composition of the prepolymers. With this method it was possible to prepare networks in the form of coatings or films. © 2003 Society of Chemical Industry