移动自组网中基于稳定邻居的数据复制算法

移动自组网络中由于节点的移动和能量的有限性,节点间的链路不稳定,使得数据的访问成功率较低,节点间能量消耗不平衡。针对此问题,提出基于节点稳定邻居的复制算法,对节点的数据项访问频度进行加权处理,综合考虑节点的稳定邻居数和剩余能量,以此确定数据副本的放置位置。模拟实验结果表明,该算法能有效提高数据访问成功率,平衡节点间能量消耗。     

一种具有移动特征的ad hoc网络电源感知路由协议

在ad hoc网络中,节点通常采用电池一类的可耗尽电源,而且每个节点既是主机又是路由器,很容易因某个节点的电源耗尽而导致网络分裂,节能是-个非常重要的问题.电源感知的路由协议通常追求两个目标:一个是传输数据时选择能量消耗最低的路由,另一个是尽可能最大化网络的生存时间.文中提出了一个改进的ad hoc网络电源感知路由算法.该算法在选择路由时不仅考虑节点的传输能耗和剩余电量,还考虑了节点的移动速度,从而在选择能量消耗最低的路由的同时可以尽可能最大化网络的生存时间,并能够带来较稳定的路由.仿真结果表明,该算法具有较优的性能.     

副本放置中的更新策略及算法

副本技术广泛应用于云计算及分布式系统中,合理的数据副本放置是降低网络运行成本的重要手段,也是副本技术的核心问题。副本更新是针对网络中数据访问请求的动态变化而进行的副本添加与删除。针对副本放置问题,提出了一种基于多访问策略的副本动态更新算法MPFSF(min_placement far servers first)。该算法在引入通信距离限制的同时,尽可能多地重用网络中已存在的副本,并根据需要实施必要的副本更新,最大使用每个副本的处理能力,以便降低数据访问的时延,提高数据访问效率。最后通过实验结果和分析证明,该算法在不同的通信距离限制下,网络的运行成本得到了明显的降低,对原有算法的改进最高可达84.6%。     

断续连接移动自组网络中的数据复制

在移动自组网络中,节点的移动或是无线连接的中断会引起频繁的网络分割.因此,访问节点并获取相应的数据是相当困难的.通过理论和统计分析得到特定运动模型对应的网络分割模式,建立了网络分割模式与数据复制有效性之间的联系,推导出了理想复制方法在特定网络环境下能够获得的数据可用性的上限,也指出纯随机复制方法可提高数据可用性.基于上述分析,提出了一种新的数据复制方法RICMAN(replication in intermittently connected mobile ad hoc networks)来提高断续性连接移动自组网络的数据可用性.该方法将所需数据以副本的形式复制到一系列拓扑结构相对稳定和资源充足的特定节点上,为处于同一分区的节点提供数据服务.副本的分布和更新基于半概率性数据分发协议实现.此协议能够识别可能的跨越多个网络分区的运动节点,由这些节点传播数据及其更新,从而在断续性连接网络中最大化数据传输.为了保持副本的一致性,该方法使用一种弱一致性模型——最终一致性模型,以确保所有的更新最终在有限的延迟内传送到所有的副本处.仿真结果显示,RICMAN方法能够以较小的开销获取较高的数据可用性,经过优化后,数据可用性仅比理想上限低10%～15%.     

移动计算环境中基于广播的数据缓存策略

在研究了数据广播频率的变化对缓存策略的影响之后，提出以移动客户机（Mobile Client，MC）从广播中读取数据的平均响应时间为标准，来决定是否缓存该数据项。其优点是可以避免每次访问这些数据项等待较长时间，同时也可降低移动客户机缓存管理的代价，提高其工作性能。     

可更新数据的数据完整性保护方法

数据收集是移动Agent的一类重要应用，在多个领域的移动Agent应用系统中涉及到数据收集。由于移动Agent可能受到恶意主机攻击，如何保证收集数据的完整性是一个重要的安全问题。文中在分析移动Agent 数据收集的安全性属性的基础上，提出了一个用于保证移动Agent在潜在恶意主机上访问时保护所收集数据的完整性安全协议。该协议能够实现数据的完整性验证与数据被收集的顺序无关，从而可以随机地访问主机，并且同一主机提交的数据可以自己更新，非常适合数据动态变化的应用系统。     

移动环境中数据广播的自适应可靠性研究

在移动计算环境中,数据广播已成为数据发布和获取的重要手段。为了提高数据广播的可靠性,使移动用户能有效的访问到所需数据项,提出一种移动环境下的自适应等距离广播算法。根据广播数据项的被干扰情况,对广播数据项的广播顺序进行等距离调度。最后通过性能分析表明该广播算法有效的提高了数据广播的可靠性。     

移动Ad hoc网络的能量约束路由协议

移动Ad hoc网络中,节点采用电池一类的可耗尽能源来提供电源,很容易因某个节点能量耗完而导致网络分裂。同时,节点在网络中的不断移动可能引起路由失效,从而导致路由重建,降低网络的性能。针对这个问题,从节点能量消耗入手,通过对网络中各节点能量消耗速度的预测,并周期性地监控与节点相关的链路的变化情况,近似获得代表节点移动快慢的移动性参数,提出一种结合节点移动性和节点剩余能量状态预测的路由协议——EMRP。仿真表明EMRP能提高数据传送率,延长整个网络的生存时间,改善网络性能。     

访问特征驱动的副本存储策略自动生成框架

大规模分布式数据存储是云计算和大数据时代的重要支撑技术.在分布式存储系统中,数据副本如何放置是一个基本问题.然而,现有可实用的算法或忽略应用具体的访问特征而牺牲效率,或拘泥于单一应用而不具备泛化能力.通过建立副本存储策略的统一描述模型以及提取应用的关键访问特征参数,定义出副本存储策略自动生成算法的输出和输入;通过机器学习的方法获得访问特征参数和最优副本存储策略参数之间的一般性关系,从而形成自动生成机制的核心算法.在提高存储系统访问性能及节约能耗等成本的同时,有效降低副本存储策略设计过程中的人工干预程度.     

移动计算环境中数据广播的启发式遗传调度算法

数据广播调度是移动计算环境中数据管理技术的研究热点之一.现有的广播调度算法在移动数据库环境中缺乏一定的实用性.在数据项长度可变的条件下,理论上分析了多盘数据广播的平均访问时间,并提出了一种启发式的遗传调度算法,在广播调度中引入贪婪变换的启发式求解策略.理论分析和实验结果表明,该算法在访问概率偏斜率较大和数据项长度不等的情况下,平均访问时间较小,能很好的适应于移动数据库环境.     

Updated data dissemination methods for updating old replicas in ad hoc networks

In this paper, we propose two updated data dissemination methods to not only reduce the number of accesses to old replicas, but also to improve the data accessibility in ad hoc networks where data items are updated regularly. In the first method, when a mobile host updates a data item, it disseminates the updated data item after the flooding of with invalidation reports. In the second method, two newly connected mobile hosts disseminate updated data items with each other after the flooding with invalidation reports.     

Mosaic-Net: a game theoretical method for selection and allocation of replicas in ad hoc networks

Due to the continuous mobility of hosts, an ad hoc network suffers from frequent disconnections. This phenomenon is undesirable when mobile hosts are accessing data from each other, and thus, data accessibility is lower than that in conventional fixed networks. Because one cannot control network disconnections, an alternative solution to this problem is to replicate data objects onto mobile hosts so that when disconnections occur, mobile hosts can still access data. In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general, flexible and adaptable to cater for various applications in ad hoc networks. We prove that this problem in general is NP-complete and propose a game theoretical technique in which players (mobile hosts) continuously compete in a non-cooperative environment to improve data accessibility by replicating data objects. The technique incorporates the access frequency from mobile hosts to each data object, the status of the network connectivity, and communication costs. In the proposed scheme, players (mobile hosts) compete through bids in a non-cooperative environment to replicate data objects that are beneficial to themselves and the system as a whole. To cater for the possibility of cartel type behavior of the players, the scheme uses the Vickrey payment protocol that leaves the players with no option than to bid in such a fashion that is beneficial to the system as a whole. The paper also identifies some useful properties of the proposed scheme and the necessary conditions of optimality. The proposed technique is extensively evaluated against some well-known ad hoc network replica allocation methods, such as: (a) randomized, (b) extended static access frequency, (c) extended dynamic access frequency and neighborhood, and (d) extended dynamic connectivity grouping. The experimental results reveal that the proposed approach outperforms the four techniques in solution quality and projects a competitive execution time.     

Secure communications for cluster-based ad hoc networks using node identities

Ad hoc networks are self-configurable networks with dynamic topologies. All involved nodes in the network share the responsibility for routing, access, and communications. The mobile ad hoc network can be considered as a short-lived collection of mobile nodes communicating with each other. Such networks are more vulnerable to security threats than traditional wireless networks because of the absence of the fixed infrastructure. For providing secure communications in such networks, lots of mechanisms have been proposed since the early 1990s, which also have to deal with the limitations of the mobile ad hoc networks, including high power saving and low bandwidth. Besides, public key infrastructure (PKI) is a well-known method for providing confidential communications in mobile ad hoc networks. In 2004, Varadharajan et al. proposed a secure communication scheme for cluster-based ad hoc networks based on PKI. Since the computation overheads of the PKI cryptosystem are heavy for each involved communicating node in the cluster, we propose an ID-based version for providing secure communications in ad hoc networks. Without adopting PKI cryptosystems, computation overheads of involved nodes in our scheme can be reduced by 25% at least.     

Ad Hoc网络中一种基于环状分层结构的组密钥协商协议

移动ad hoc网络是一种新型的移动多跳无线网络.其自身的特征,如网络规模庞大、动态的拓扑结构、有限的计算、通信和存储能力等,使得传统的密钥分配和管理机制无法直接应用于该网络.提出了一种新的适用于移动 ad hoc网络的组密钥协商协议.该协议在环状分层结构上基于多线性映射进行组密钥的协商和分配,使得节点在密钥协商过程中具有低计算开销与低通信开销的优势,较好地解决了在移动ad hoc网络中进行组密钥协商时所遇到的节点能量受限问题,适用于移动ad hoc网络.     

Certification-based trust models in mobile ad hoc networks: A survey and taxonomy

A mobile ad hoc network is a wireless communication network which does not rely on a pre-existing infrastructure or any centralized management. Securing the exchanges in such network is compulsory to guarantee a widespread development of services for this kind of networks. The deployment of any security policy requires the definition of a trust model that defines who trusts who and how. There is a host of research efforts in trust models framework to securing mobile ad hoc networks. The majority of well-known approaches is based on public-key certificates, and gave birth to miscellaneous trust models ranging from centralized models to web-of-trust and distributed certificate authorities. In this paper, we survey and classify the existing trust models that are based on public-key certificates proposed for mobile ad hoc networks, and then we discuss and compare them with respect to some relevant criteria. Also, we have developed analysis and comparison among trust models using stochastic Petri nets in order to measure the performance of each one with what relates to the certification service availability.     

Service discovery in mobile ad hoc networks: A field theoretic approach

Service discovery in mobile ad hoc networks is challenging because of the absence of any central intelligence in the network. Traditional solutions as used in the Internet are hence not well suited for mobile ad hoc networks. In this paper, we present a novel decentralized service discovery mechanism for ad hoc networks. The basic idea is to distribute information about available services to the network neighborhood. We achieve this by using the analogy of an electrostatic field: A service is modelled by a (positive) point charge, and service request packets are seen as (negative) test charges which are attracted by the service instances. In our approach, we map the physical model to a mobile ad hoc network in a way where each network element calculates a potential value and routes service requests towards the neighbor with the highest potential, hence towards a service instance. Our approach allows for differentiation of service instances based on their capacity. We define the required protocols and methods which we implemented in a network simulator. Using extensive simulations, we evaluate the performance and robustness of the mechanisms. The results indicate good performance and convergence even in highly mobile environments. We believe that this technique can and should be further exploited, e.g., as a routing protocol in mobile ad hoc networks.     

Routing with adaptive path and limited flooding for mobile ad hoc networks

In MANET, each mobile host can freely move around and the network topology is dynamically changing. To send a datagram, a source host broadcasts a route discovery packet to the network. All neighboring nodes receiving this packet will rebroadcast this packet until it reaches the destination. It will have large flooding overhead, poor network performance and undesirable battery power consumption. To improve network performance, we design a novel routing protocol called RAPLF (Routing with Adaptive Path and Limited Flooding) for mobile ad hoc networks. Simulation results show that our protocol has better performance especially in packet delivery rate and flooding overhead when compared to similar protocols.     

无线自组网中基于移动预测与功率调整的适应性分簇算法

传送功率控制是无线自组网中资源管理和控制干扰的中心技术.传统上功率控制只是用作消除信道消隐负作用的一种手段,当前观点一般认为功率控制是一种可以为单个用户提供服务质量的灵活机制.提出一种分簇算法以达到减轻网络拓扑的动态变化的同时节省电能.此提案是基于全球定位系统的(GPS).根据移动主机的历史轨迹预测它下一个最可能处在的位置,预先调整传送功率.为了最大化网络的吞吐量,算法自适应性的控制每个簇在合适的大小.在GlomoSim模拟器上仿真了提出的算法.仿真结果表明,它是无线自组网中有效的拓扑管理机制,对由高速运动主机组成的网络特别有效.     

Robustness Analysis and Enhancement of MANETs Using Human Mobility Traces

Understanding network behavior that undergoes challenges is essential to constructing a resilient and survivable network. Due to the mobility and wireless channel properties, it is more difficult to model and analyze mobile ad hoc networks under various challenges. In this paper, we provide a model to assess the vulnerability of mobile ad hoc networks in face of malicious attacks. We analyze comprehensive graph-theoretical properties and network performance of the dynamic networks under attacks against the critical nodes using real-world mobility traces. Motivated by minimum spanning tree and small-world networks, we propose a network enhancement strategy by adding long-range links. We compare the performance of different enhancement strategies by evaluating a list of robustness measures. Our study provides insights into the design and construction of resilient and survivable mobile ad hoc networks.     

A location routing protocol based on smart antennas for ad hoc networks

Ad hoc networks are a type of mobile networks that function without any fixed infrastructure. One of the weaknesses of ad hoc networks is that route between a source and a destination is likely to break during communication. Location-based routing algorithms are promising in reducing routing overhead in ad hoc networks. Existing location-based routing algorithms employ the Global Positioning System (GPS) as their location information provider, and synchronize information network-wide. Nonetheless, these protocols have some limitations because the use of GPS is not realistic in certain circumstances. Since smart antenna is able to infer direction and ranging information between pairs of ad hoc node, the obtained local position information can be used to improve routing mechanism. This work proposes a novel Location-Enhanced On-Demand (LEOD) routing protocol which is based on smart antenna technique. The LEOD protocol utilizes local position instead of global position to discover routes and make routing decision for the ad hoc network. Theoretical computation and simulation results show that data packet loss rate decreased significantly compared to other methods well-documented in the literature. In addition, this protocol reduces the network control overheads and the power consumption. It also improves network average throughput.