An energy aware algorithm for OLSR clustering

One of the important aspects of a mobile ad hoc network (MANET) is the limitation of the amount of available energy and the network lifetime. The tremendous amount of using mobile nodes in wireless communication medium makes energy efficiency a fundamental requirement for MANETs. In this paper, we propose a novel energy aware clustering algorithm for the optimized link state routing (OLSR) routing protocol. This algorithm takes into account the node density and mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reasonable number of cluster heads that will serve for hierarchical routing based on OLSR. The proposed algorithm aims to increase the network lifetime by considering the ad hoc residual energy while taking routing decisions. It also optimizes the delay of carried flows by adopting a selective forwarding approach based on a hierarchical routing model.     

An energy‐efficient clustering approach for collaborative data forwarding in heterogeneous MANET

Mobile ad hoc network consists of a group of mobile nodes that can communicate with each other without any infrastructure. Clustering of the mobile nodes ensures efficient use of available bandwidth and high network throughput. Various clustering schemes are developed to improve the energy efficiency and lifetime of the network. However, there is an increase in the energy consumption with the increase in the number of clusters for forwarding data. This paper presents an energy‐efficient clustering approach for collaborative data forwarding in mobile ad hoc network. The cluster head (CH) is selected based on the processing capability of the nodes and link connection metrics. The CH receives the data from the server and forwards the data to the member nodes at a corresponding data rate of the nodes. Data offloading technique manages the data traffic in the network. The CH rejoining approach enables load balancing in the network. The proposed clustering approach achieves a significant reduction in the energy consumption and data traffic and improvement in the throughput rate through stable routing.     

Mobility-Aware and Load Balancing Based Clustering Algorithm for Energy Conservation in MANET

Mobile ad hoc network (MANET) is one of wireless communication network architecture that has received a lot of attention. MANET is characterized by dynamic network topology and limited energy. With mobility-aware and load balancing based clustering algorithm (MLCA), this paper proposes a new topology management strategy to conserve energy. Performance simulation results show that the proposed MLCA strategy can balances the traffic load inside the whole network, so as to prolong the network lifetime, meanly, at the same time, achieve higher throughput ratio and network stability.     

A Dynamic Alternate Path QoS Enabled Routing Scheme in Mobile Ad hoc Networks

A mobile ad hoc network (MANET) is a collection of self-organized mobile nodes that are capable of communicating with each other without the aid of any established infrastructure or centralized administration. Routing algorithm has been a challenge task in the wireless ad hoc network for a long time due to the dynamic nature of network topology. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. The on-demand routing protocol for ad hoc network is appealing because of its low routing overhead and its effectiveness when the frequency of route re-establishment and the demand of route queries are not high. However, considering the increasing demand of Quality-of-Service (QoS) requirements in many applications, the current on-demand routing protocols used for ad-hoc network should be adapted appropriately to effectively meet the stringent QoS requirements of specific multimedia traffic. We thus propose a routing protocol which tries its best to satisfy QoS requirements of specific multimedia traffic in the volatile environments of a MANET. The results of a series of simulations exhibit the practicability and feasibility of our approaches. This research was partially supported by National Science Council under grant NSC 93-2213-E-026-001     

Energy Efficient Clustering for Certificate Revocation Scheme in Mobile Ad-Hoc Network

Mobile ad hoc networks (MANETs) have a wide range of uses because of their dynamic topologies and simplicity of processing. Inferable from the autonomous and dynamic behavior of mobile nodes, the topology of a MANET frequently changes and is inclined to different attacks. So, we present certificate revocation which is an efficient scheme is for security enhancement in MANET. This certificate revocation scheme is used to revoke the certificate of malicious nodes in the network. However, the accuracy and speed of the certificate revocation are further to be improved. By considering these issues along with the energy efficiency of the network, an energy-efficient clustering scheme is presented for certificate revocation in MANET. For cluster head (CH) selection, an opposition based cat swarm optimization algorithm (OCSOA) is proposed. This selected CH participates in quick certificate revocation and also supports to recover the falsely accused nodes in the network. Simulation results show that the performance of the proposed cluster-based certificate revocation outperforms existing voting and non-voting based certificate revocation in terms of delivery ratio, throughput, energy consumption, and network lifetime.

     

Routing security in wireless ad hoc networks

A mobile ad hoc network consists of a collection of wireless mobile nodes that are capable of communicating with each other without the use of a network infrastructure or any centralized administration. MANET is an emerging research area with practical applications. However, wireless MANET is particularly vulnerable due to its fundamental characteristics, such as open medium, dynamic topology, distributed cooperation, and constrained capability. Routing plays an important role in the security of the entire network. In general, routing security in wireless MANETs appears to be a problem that is not trivial to solve. In this article we study the routing security issues of MANETs, and analyze in detail one type of attack-the "black hole" problem-that can easily be employed against the MANETs. We also propose a solution for the black hole problem for ad hoc on-demand distance vector routing protocol.     

Biologically inspired artificial intrusion detection system for detecting wormhole attack in MANET

A mobile ad hoc network (MANET) does not have traffic concentration points such as gateway or access points which perform behaviour monitoring of individual nodes. Therefore, maintaining the network function for the normal nodes when other nodes do not forward and route properly is a big challenge. One of the significant attacks in ad hoc network is wormhole attack. In this wormhole attack, the adversary disrupts ad hoc routing protocols using higher bandwidth and lower-latency links. Wormhole attack is more hidden in character and tougher to detect. So, it is necessary to use mechanisms to avoid attacking nodes which can disclose communication among unauthorized nodes in ad hoc networks. Mechanisms to detect and punish such attacking nodes are the only solution to solve this problem. Those mechanisms are known as intrusion detection systems (IDS). In this paper, the suggested biological based artificial intrusion detection system (BAIDS) include hybrid negative selection algorithm (HNSA) detectors in the local and broad detection subsection to detect anomalies in ad hoc network. In addition to that, response will be issued to take action over the misbehaving nodes. These detectors employed in BAIDS are capable of discriminating well behaving nodes from attacking nodes with a good level of accuracy in a MANET environment. The performance of BAIDS in detecting wormhole attacks in the background of DSR, AODV and DSDV routing protocols is also evaluated using Qualnet v 5.2 network simulator. Detection rate, false alarm rate, packet delivery ratio, routing overhead are used as metrics to compare the performance of HNSA and the BAIDS technique.     

An Energy-Efficient Method for Nodes Assignment in Cluster-Based Ad Hoc Networks

One of the most critical issues in wireless ad hoc networks is represented by the limited availability of energy within network nodes. Thus, making good use of energy is a must in ad hoc networks. In this paper, we define as network lifetime the time period from the instant when the network starts functioning to the instant when the first network node runs out of energy. Our objective is to devise techniques to maximize the network lifetime in the case of cluster-based systems, which represent a significant sub-set of ad hoc networks. Cluster-based ad hoc networks comprise two types of nodes: cluster-heads and ordinary nodes. Cluster-heads coordinate all transmissions from/to ordinary nodes and forward all traffic in a cluster, either to other nodes in the cluster or to other cluster-heads. In this case, to prolong the network lifetime we must maximize the lifetime of the cluster-heads because they are the critical network element from the energy viewpoint. We propose an original approach to maximize the network lifetime by determining the optimal assignment of nodes to cluster-heads. Given the number of cluster-heads, the complexity of the proposed solution grows linearly with the number of network nodes. The network topology is assumed to be either static or slowly changing. Two working scenarios are considered. In the former, the optimal network configuration from the energy viewpoint is computed only once; in the latter, the network configuration can be periodically updated to adapt to the evolution of the cluster-heads energy status. In both scenarios, the presented solution greatly outperforms the standard assignment of nodes to cluster-heads, based on the minimum transmission power criterion.     

IoT energy efficiency routing protocol using FHO-based clustering and improved CSO model-based routing in MANET

Many protocols, services, and electrical devices with built-in sensors have been developed in response to the rapid expansion of the Internet of Things. Mobile ad hoc networks (MANETs) consist of a collection of autonomous mobile nodes that can form an ad hoc network in the absence of any pre-existing infrastructure. System performance may suffer due to the changeable topology of MANETs. Since most mobile hosts operate on limited battery power, energy consumption poses the biggest challenge for MANETs. Both network lifetime and throughput improve when energy usage is reduced. However, existing approaches perform poorly in terms of energy efficiency. Scalability becomes a significant issue in large-scale networks as they grow, leading to overhead associated with routing updates and maintenance that can become unmanageable. This article employs a MANET routing protocol combined with an energy conservation strategy. The clustering hierarchy is used in MANETs to maximize the network's lifespan, considering its limited energy resources. In the MANET communication process, the cluster head (CH) is selected using Fire Hawk Optimization (FHO). When choosing nodes to act as a cluster for an extended period, CH election factors in connectivity, mobility, and remaining energy. This process is achieved using an optimized version of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, utilizing Improved Chicken Swarm Optimization (ICSO). In comparison to existing protocols and optimization techniques, the proposed method offers an extended network lifespan ranging from 90 to 160 h and reduced energy consumption of 80 to 110 J, as indicated by the implementation results.     

A Hyper-Exponential Factor-Based Semi-Markov Prediction Mechanism for Selfish Rendezvous Nodes in MANETs

Wireless Personal Communications - In multi-hop wireless network like mobile ad hoc network (MANET), co-operation between mobile nodes under group communication is inevitable for ensuring reliable...     

Approximate minimum-energy multicasting in wireless ad hoc networks

A wireless ad hoc network consists of mobile nodes that are equipped with energy-limited batteries. As mobile nodes are battery-operated, an important issue in such a network is to minimize the total power consumption for each operation. Multicast is one of fundamental operations in any modern telecommunication network including wireless ad hoc networks. Given a multicast request consisting of a source node and a set of destination nodes, the problem is to build a minimum-energy multicast tree for the request such that the total transmission power consumption in the tree is minimized. Since the problem in a symmetric wireless ad hoc network is NP-complete, we instead devise an approximation algorithm with provable approximation guarantee. The approximation of the solution delivered by the proposed algorithm is within a constant factor of the best-possible approximation achievable unless P = NP.     

Weighted cluster in mobile ad hoc network using enhanced long short-term memory-based squid game optimizer concept

A collection of autonomous frameworks will most likely make up a wireless mobile network. They are not solely dependent on a wireless network with no established infrastructure. In the mobile ad hoc network, it is highly challenging to safeguard the viability of the cluster head (CH) within a cluster; therefore, this research provides a big scope for routing utilizing enhanced long short-term memory–squid game optimizer (ELSTM-SGO). The quality of service attribute of the nodes determines which CH is chosen within them. How long the CH will hold will depend on the weight applied to it. The best CH is chosen using an ELSTM-SGO routing method within a cluster, and the best CH will improve the routing. The three procedures that make up the developed ELSTM-SGO protocol are SGO, CH selection, and cluster's gateway. The wireless system's energy consumption, buffer size, packet delivery ratio, routing overhead and end-to-end delay throughput represent the characteristics used in the suggested approach. Weighted clustering approach is evaluated on the system. According to the results of the experimental research, ELSTM-SGO yields superior results for preserving the resiliency of the CH.     

Connectivity management in mobile ad hoc networks using particle swarm optimization

This paper proposes a dynamic mobile ad hoc network (MANET) management system to improve network connectivity by using controlled network nodes, called agents. Agents have predefined wireless communication capabilities similar to the other nodes in the MANET, however their movements, and thus their locations, are dynamically determined to optimize network connectivity. A new approach to measuring connectivity using a maximum flow formulation is proposed – this is both responsive and tractable. Furthermore, users’ locations are predicted for several time steps ahead and this is shown to improve network connectivity over the network operation period. A particle swarm optimization (PSO) algorithm uses the maximum flow objective to choose optimal locations of the agents during each time step of network operation. The proposed MANET management system is rigorously tested on numerous static and dynamic problems. Computational results show that the proposed approach is effective in improving the connectivity of MANETs and predicting movements of user nodes and deploying agents accordingly significantly improves the overall performance of a MANET.     

网络编码在MANET最小能量多播中的应用研究

网络编码理论是当代信息论的重要组成部分,移动特设网络(MANET)是由-组带有无线收发装置的移动终端组成的一个多跳临时性自治系统,利用网络编码理论解决MANET中最小能量多播问题是无线通信中新的研究热点之一.文中阐述了网络编码基本理论在无线通信中应用的技术原理,然后通过构建无线网络节点分层模型分析了基于网络编码的MANET最小能量求解过程,为解决该类型网络中能耗问题提供新的视角.     

移动Ad HOc网络中的公平按需多址接入协议

基于快速、有效竞争预约接入、无冲突轮询传输的思想和带冲突预防的冲突分解策略,本文提出了适于移动Ad Hoc网络的公平按需多址接入(FODA)协议.该协议在分群结构的基础上,利用公平冲突预防算法预约信道资源获得轮询服务,从而完全消除了载波侦听方式下多跳无线网络业务传输中的隐藏终端和暴露终端问题.另外,公平冲突预防算法解决了节点竞争接入时的冲突问题和不公平现象.最后,仿真结果表明,与带冲突避免的载波侦听多址接入(CSMA/CA)和轮询协议相比,FODA协议可以提供较高的信道吞吐量、较低的平均消息丢弃率和平均消息时延.     

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.     

Load-balancing in MANET shortest-path routing protocols

Mobile ad hoc networks (MANET) are infrastructure-less networks, dynamically formed by an independent system of mobile nodes that are connected via wireless links. Because routing is performed by nodes with limited resources, load should be efficiently distributed through the network. Otherwise, heavily-loaded nodes may make up a bottleneck that lowers the network performances by congestion and larger delays. Regrettably, load-balancing is a critical deficiency in MANET shortest-path routing protocols, as nodes at the center of the network are much heavily-loaded than the others. Thus, we propose, in this paper, load-balancing mechanisms that push the traffic further from the center of the network. Basically, we provide novel routing metrics that take into account nodes degree of centrality, for both proactive and reactive routing protocols. Simulations show that the proposed mechanisms improve the load distribution and significantly enhance the network performances in terms of average delay and reliability.     

MANET中一种基于Agent的能量节约方案

MANET是一种没有中心的特殊的移动自组织网络,由于节点依赖于电池,能量有限,因此节能是一个重要问题。文中提出的了一种基于Agent的能量节约方案,首先通过较少的移动Agent传递网络中节点的信息;然后根据各节点电池余量等参数,选择最合适的路径进行数据传输。从而可以节省整个网络的能耗,并保护剩余能量低的节点。实验结果表明这种方案可以延长整个网络的生存时间。     

Power-aware routing protocols in ad hoc wireless networks

An ad hoc wireless network has no fixed networking infrastructure. It consists of multiple, possibly mobile, nodes that maintain network connectivity through wireless communications. Such a network has practical applications in areas where it may not be economically practical or physically possible to provide a conventional networking infrastructure. The nodes in an ad hoc wireless network are typically powered by batteries with a limited energy supply. One of the most important and challenging issues in ad hoc wireless networks is how to conserve energy, maximizing the lifetime of its nodes and thus of the network itself. Since routing is an essential function in these networks, developing power-aware routing protocols for ad hoc wireless networks has been an intensive research area in recent years. As a result, many power-aware routing protocols have been proposed from a variety of perspectives. This article surveys the current state of power-aware routing protocols in ad hoc wireless networks.     

基于MANET的移动学习及其系统构建研究

移动自组网（MANET）是一种具有高度动态拓扑结构、节点任意移动的无线移动通信网络。针对MANET的特点及其应用,探讨了基于MANET的移动学习及其系统构建,并通过JisT／SWANS平台进行仿真实验,仿真结果证明MANET具有良好的通信性能。基于MANET的移动学习系统,能够实现随时随地、快速、有效的学习及资源共享,促进教育公平和教育资源效益的最大化。