基于移动Agent的JPEG2000分布式编码算法研究

该文针对无线传感器网络节点处理能力、存储能力和能量供应均有限的特点,提出一种基于移动Agent的JPEG2000分布式编码算法。采用多个节点对图像进行分布式编码,通过引入移动Agent机制来实现网络节点间的信息交互,在保证图像编码性能不变的情况下,降低单个节点能耗,使系统不因单个节点能量耗尽而瘫痪,以延长系统的生命周期。仿真实验结果表明,该文所提出的基于移动Agent的分布式编码算法在无线传感器网络环境中可以保证编码后的图像质量没有下降,并能有效均衡系统能耗、延长网络工作寿命达3倍左右。     

一种能量感知的Ad Hoc网络路由协议

Ad Hoc网络中的节点是由电池供电,整个网络是一个能量受限系统,如何节省节点的能量,尽可能延长网络的可操控时间逐渐成为衡量路由协议性能的重要指标.基于移动节点能量的不同级别,采取不同的转发策略,提出了一种基于能量感知的Ad Hoc网络路由协议--EARP.并与AODV协议进行了性能比较,仿真结果显示,EARP具有较低的能耗,较长的网络存活时间.     

一种射频能量捕获网络移动能量源均衡化充电策略

为解决传统电池供电传感器网络存在的电池不易更换、节点能量容易耗尽等问题,射频能量捕获技术已逐步应用于无线可充电传感器网络中.由于不同位置传感器节点的工作负荷不同,捕获能量也有差异,实现节点能量的均衡化分布可以有效地提高节点的存活率.考虑射频能量源移动充电的场景,在已知节点位置信息的条件下,设计合理均衡的路由方案和充电算法.首先将区域基于蜂窝六边形网格划分,分别对网格和节点分层,提出逐层传输的均衡式路由策略,然后给出无线充电小车的移动路径,对相邻两层内节点剩余能量的方差最小化问题建模,由内层向外层依次确定能量源在各停留点的充电时间.仿真结果表明,相比已有的均衡化充电方法,该策略可以明显提高节点剩余能量的均衡性,从而延长网络的生命周期.     

基于移动Agent和WSN的突发事件场景数据收集算法研究

该文针对无线传感器网络应用于突发事件监测场景的能量消耗和网络延迟问题,提出了基于移动Agent的无线传感器网络簇式数据收集算法.动态成簇过程基于事件严重程度,并由其决定簇的生命周期和覆盖范围.Sink和簇头之间形成以Sink节点为簇头的虚拟簇.移动Agent迁移路径规划过程中下一跳节点的选取基于节点剩余能量、路径损耗及受刺激强度.移动Agent通过节点遍历的方式完成对所有簇内成员节点信息的收集.仿真结果表明,相对于C/S数据收集模型,基于移动Agent的模型具有更好的节能效果,并能一定程度地减少网络延迟,尤其适用于大规模无线传感器网络应用.     

遗传算法在无线传感器网络中的应用

传感器节点能量的供应一般采用电池,节点能量有限.为了尽可能减少传感器节点通信模块的能量消耗,保证能量供应的持续性,文中提出了一种基于遗传算法的路由算法,不仅降低了单个节点的能量消耗,而且使整个网络能量的消耗更加均衡,从而延长了整个传感器网络的生存周期.     

一种有效的稀疏无线传感器网络路由方案

稀疏无线传感器网络中节点之间距离过远,使得移动代理节点成为最有效的数据收集方式,然而移动代理节点由于能量限制无法在一次数据收集中到达网络所有节点进行数据收集.为保证在能量受限的移动代理节点总路由路径最短,给出了一种稀疏无线传感器网络能量受限移动代理节点的路由方案.首先构建移动代理节点的路由数学模型,然后根据移动代理节点初始能量将无线传感器网络划分成不同的子集,最后采用旅行商人问题的模拟退火算法计算出每个子集最短路由,全部子路由的集合即最优路由.仿真及其分析结果表明:随着网络节点个数增多和移动代理节点能量增大,所给方案的总路由能够比较接近于理想情况,在实际应用中比较有效且适于推广.     

基于Multi-Agent的多权值优化分簇算法及仿真研究

提出了一种基于Multi-Agent的多权值优化分簇算法,算法定义了多种Agent类型,在簇头选举阶段选取了影响簇头合理分布的多个网络参数,在簇的更新阶段采用移动Agent启发机制进行簇的局部更新.仿真结果表明,算法不仅可以选出合理的簇头,使能量均匀的消耗,还可以节省整个网络的能量消耗.     

基于邻居节点的拓扑控制算法研究与仿真

拓扑控制是移动自组织网络提高网络能量利用率和网络容量的一种重要机制。针对移动自组织网络拓扑易变、带宽和能量有限等特点,简要介绍了一种节约节点能耗,有效提高整个网络寿命的拓扑控制算法;通过对基于邻居个数的拓扑控制协议K-Neigh算法的仿真,研究了不同k值的选择下拓扑控制对节点功耗和网络性能(包括吞吐量、丢包率和时延等)的影响。其结果表明选择合适的k值可以取得节点功耗和网络性能的平衡,而且经过K-Neigh拓扑控制后的网络具有很好的鲁棒性。     

基于移动Agent的LEACH协议的研究与改进

无线传感器网络中路由协议最重要的设计目标是避免节点过早死亡,延长网络生存时间。文中在原有层次式路由协议LEACH的基础上,提出了一种新的MA-LEACH（Mobile Agent LEACH）路由协议,MA—LEACH中引入了移动Agent计算模式,避免了大量的感知数据在网络中传输,由移动Agent移动到感知节点进行本地处理。仿真实验表明,MA-LEACH比原有LEACH协议在降低节点能耗,延长网络寿命等方面上有了显著提高。     

一种自组网功率控制算法及分析

无线自组网中的移动节点大多依靠电池提供能量,因此能量是影响无线自组网性能的一个很大的瓶颈,作为事实上的无线自组网媒体接入协议,802.11并没有动态调整传输功率的能力,大大限制了网络的生存时间。采用功率控制可以提高节点的功率使用效率,减少相邻节点间的干扰,改善网络的性能。在802.11基础上提出一种基于信噪比的动态传输功率控制算法。通过进行计算机仿真,与802.11协议相比,在保持吞吐量性能的前提下,大大减少了节点的功率消耗,提高了节点的能量利用率。     

An energy efficient and QoS routing protocol for MANET realised over multi-objective red deer algorithm (RD-MOCER) in support of emergency disaster management

Terrorist attacks have contributed significantly to using wireless technologies to identify concrete destruction survivors. A dynamic ad hoc mobile network (MANET) consists of wireless linked nodes, which route hop-by-hop without the support of a fixed infrastructure acquires information from trapped survivors. The energy efficiency that extends the lifespan of the network is an essential prerequisite of MANET. Researchers have suggested many strategies to accomplish this purpose and a cluster of these techniques in MANETs are used to provide an energy-efficient approach. In this paper we are proposing a red deer multi-objective constraint applied for an energy efficient QoS routing (RD-MOCER) algorithm to the number of clusters in an ad hoc network and the energy dispensing in nodes to provide an energy effective solution and to minimise network traffic. Intracluster and intercluster traffic is handled by the cluster heads in the proposed approach. The algorithm suggested takes account of mobile nodes' node degrees, transmitting capacity and battery power usage. This approach gives a variety of options at a time, the key benefit of which is that the ideal Pareto front results in these solutions. We correlate the findings with two other well-known methods of clustering; MOPSO and MOEAQ-based clustering with different results. We conduct detailed simulations to demonstrate that the solution proposed is an effective and stronger solution to clustering in ad hoc cell networks than the other two techniques.     

HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks

This article reviews the hierarchical optimized link state routing (HOLSR) mechanism for heterogeneous mobile ad hoc networks. In this work a heterogeneous mobile ad hoc network is defined as a network of mobile nodes that are characterized by different communications capabilities, such as multiple radio interfaces. The article focuses on proposing the HOLSR protocol. The HOLSR mechanism is derived from the OLSR protocol; however, unlike OLSR, the HOLSR protocol takes advantage of different mobile node capabilities to reduce the routing control overhead in large heterogeneous ad hoc networks, thus improving the performance of the routing mechanism.     

Unidirectional link-state advertisement based on power control for MANET

Link states are studied in ad hoc network. The characters of unidirectional links are discussed. Unidirectional link-state advertisement based on power control mechanism (ULAPC) for mobile ad hoc networks (MANET) is designed. ULAPC is able to advertise unidirectional link-state to relational nodes. And it may offer help for process of routing discovery in ad hoc network. Based on ULAPC, the routing method solving the problem of unidirectional link is described in ad hoc network. Simulation results show the performance of ULAPC is better than the traditional routing protocols in many aspects.     

Topology and mobility considerations in mobile ad hoc networks

A highly dynamic topology is a distinguishing feature and challenge of a mobile ad hoc network. Links between nodes are created and broken, as the nodes move within the network. This node mobility affects not only the source and/or destination, as in a conventional wireless network, but also intermediate nodes, due to the network’s multihop nature. The resulting routes can be extremely volatile, making successful ad hoc routing dependent on efficiently reacting to these topology changes.

In order to better understand this environment, a number of characteristics have been studied concerning the links and routes that make up an ad hoc network. Several network parameters are examined, including number of nodes, network dimensions, and radio transmission range, as well as mobility parameters for maximum speed and wait times. In addition to suggesting guidelines for the evaluation of ad hoc networks, the results reveal several properties that should be considered in the design and optimization of MANET protocols.     

Detecting unauthorized and compromised nodes in mobile ad hoc networks

Security of mobile ad hoc networks (MANET) has become a more sophisticated problem than security in other networks, due to the open nature and the lack of infrastructure of such networks. In this paper, the security challenges in intrusion detection and authentication are identified and the different types of attacks are discussed. We propose a two-phase detection procedure of nodes that are not authorized for specific services and nodes that have been compromised during their operation in MANET. The detection framework is enabled with the main operations of ad hoc networking, which are found at the link and network layers. The proposed framework is based on zero knowledge techniques, which are presented through proofs.     

GPS/Ant-Like Routing in Ad Hoc Networks

A mobile ad hoc network (MANET) is comprised of mobile hosts that can communicate with each other using wireless links. In this paper we present a novel routing algorithm called GPSAL (GPS/Ant-Like Routing Algorithm) which is based on GPS (Global Positioning System) and mobile software agents modeled on ants for routing in ad hoc networks. We compare our algorithm to the Location-Aided Routing (LAR) [20] algorithm for MANET which is also based on GPS. Simulation results show that our algorithm has less overhead than LAR.     

Performance evaluation of mobile ad hoc networks under flooding‐based attacks

A mobile ad hoc network (MANET) is an open wireless network that comprises a set of mobile, decentralized, and self‐organized nodes. Its properties render its environment susceptible to different types of attacks, which can paralyze the mobile nodes in MANET. A particularly dangerous type of attack is run primarily under flooding bogus packet mechanisms, such as hello floods, routing table overflows, exploitation of node penalizing schemes, and resource consumption attack (RCA). Flooding‐based attacks impose severe effects because they are intended to consume MANET resources, such as bandwidth, node memory, and battery power. Therefore, identifying such effects facilitates the development of countermeasures against the intrusions. In this paper, we introduce a simulation‐based study on the effects of RCA on MANET. Qual Net v5.0.2 is used to examine the severity of the effects on MANET performance metrics in terms of throughput, end‐to‐end delay, energy consumption, and routing overhead. The effects of RCA are also monitored under two combinations of four factors: we first vary the number of attackers and attackers' positions, and then modify the attackers' radio range and flooding rate. We also examine the effect of flooding mechanism on the energy consumed by resource consumption attackers. Copyright © 2013 John Wiley & Sons, Ltd.     

Distributed node selection for threshold key management with intrusion detection in mobile ad hoc networks

In mobile ad hoc networks (MANETs), identity (ID)-based cryptography with threshold secret sharing is a popular approach for the security design. Most previous work for key management in this framework concentrates on the protocols and structures. Consequently, how to optimally conduct node selection in ID-based cryptography with threshold secret sharing is largely ignored. In this paper, we propose a distributed scheme to dynamically select nodes with master key shares to do the private key generation service. The proposed scheme can minimize the overall threat posed to the MANET while simultaneously taking into account of the cost (e.g., energy consumption) of using these nodes. Intrusion detection systems are modeled as noisy sensors to derive the system security situations. We use stochastic system to formulate the MANET to obtain the optimal policy. Simulation results are presented to illustrate the effectiveness of the proposed scheme.     

Trust Based Detection and Elimination of Packet Drop Attack in the Mobile Ad-Hoc Networks

The mobile ad hoc network (MANET) is communication network of a mobile node without any prior infrastructure of communication. The network does not have any static support; it dynamically creates the network as per requirement by using available mobile nodes. This network has a challenging security problem. The security issue mainly contains a denial of service attacks like packet drop attack, black-hole attack, gray-hole attack, etc. The mobile ad-hoc network is an open environment so the working is based on mutual trust between mobile nodes. The MANETs are vulnerable to packet drop attack in which packets travel through the different node. The network while communicating, the node drops the packet, but it is not attracting the neighboring nodes to drop the packets. This proposed algorithm works with existing routing protocol. The concept of trusted list is used for secure communication path. The trusted list along with trust values show how many times node was participated in the communication. It differentiates between altruism and selfishness in MANET with the help of energy level of mobile components. The trust and energy models are used for security and for the differentiation between altruism and selfishness respectively.     

Exploring geographic context awareness for data dissemination on mobile ad hoc networks

The use of mobile software agents is a promising approach to implement services and disseminate data over ad hoc networks. This paper presents an analysis of mobile autonomous agents with different levels of intelligence that allow them to make usage of the positioning information with different complexity in a mobile ad hoc network aiming at efficient data dissemination. This information considers the nodes current and future locations, as well as the route used to reach their destinations, depending on the agents’ intelligence. Using this information, the agents decide their movement from node to node during opportunistic connections in order to accomplish their goals related to data dissemination and/or service provisioning. The analysis of this proposal is done in the context of a sensor network application, implemented by sensing services provided by mobile agents, which run on top of an infrastructure-less Vehicular Ad hoc Network (VANET). Simulation results are presented and discussed to support the proposed ideas.