Enhanced Energy Efficient with a Trust Aware in MANET for Real-Time Applications

Mobile ad hoc networks (MANETs) are subjected to attack detection for transmitting and creating new messages or existing message modifications. The attacker on another node evaluates the forging activity in the message directly or indirectly. Every node sends short packets in a MANET environment with its identifier, location on the map, and time through beacons. The attackers on the network broadcast the warning message using faked coordinates, providing the appearance of a network collision. Similarly, MANET degrades the channel utilization performance. Performance highly affects network performance through security algorithms. This paper developed a trust management technique called Enhanced Beacon Trust Management with Hybrid Optimization (EBTM-Hyopt) for efficient cluster head selection and malicious node detection. It tries to build trust among connected nodes and may improve security by requiring every participating node to develop and distribute genuine, accurate, and trustworthy material across the network. Specifically, optimized cluster head election is done periodically to reduce and balance the energy consumption to improve the lifetime network. The cluster head election optimization is based on hybridizing Particle Swarm Optimization (PSO) and Gravitational Search Optimization Algorithm (GSOA) concepts to enable and ensure reliable routing. Simulation results show that the proposed EBTM-HYOPT outperforms the state-of-the-art trust model in terms of 297.99 kbps of throughput, 46.34% of PDR, 13% of energy consumption, 165.6 kbps of packet loss, 67.49% of end-to-end delay, and 16.34% of packet length.     

A comparative QoS survey of mobile ad hoc network routing protocols

A mobile ad hoc network (MANET) is a wireless, dynamic, infrastructure-less, self-organized, multi-hop, and decentralized network. Each node in MANET can act as a router as well as a work station. Many routing protocols have been developed to increase the efficiency of MANET. The primary objective of this paper is a detailed QoS comparison of reactive (AODV), proactive (DSDV), and hybrid (ZRP) routing protocols of MANET in order to find which routing protocol works best in a particular network scenario. The analysis was made for TCP-based traffic patterns. The performance differentials were analyzed on the basis of normalized routing overhead, packet loss, packet delivery ratio, control packets, end-to-end delay, packet received, and packet sent with a variation of nodes density and mobility. The results were obtained using the NS-2 simulator.     

ACO–EEOLSR: enhanced energy model based link stability routing protocol in mobile ad hoc networks

A mobile ad hoc network (MANET) has abundant mobile nodes that are free to communicate independently in many locations. Many existing energy models address the inadequacy of resources based on Ad hoc On-demand Multipath Distance Vector and Optimized Link State Protocol (OLSP) routing protocols for MANET along with various parameters. The architecture of energy-efficient routing mechanisms is a challenging problem in a MANET. In this work, a novel energy-aware routing model is introduced for MANET comprising an ant colony optimization (ACO) enhanced approach to energy-efficient-optimized link state routing (named ACO–EEOLSR). Initially, the route discovery is progressed by means of neighbor estimation and also with the authentication of link stability. Parameters such as energy, distance, and hop count are employed as willingness nodes, where both the energy and distance are entrenched through the OLSP. Consequently, the hop count is applied via the ACO system that is beneficial for link stability. After the acceptance of an acknowledgement, the hop count is authorized for further performance analysis. This approach increases the Quality of Service and also uses less energy compared to other energy models. The accomplished simulation upshot depicts that the ACO–EEOLSR outperforms the EEOLSR scheme with respect to the performance metrics of energy consumption, packet delivery ratio, total remaining time, average network lifetime, and a variance of energy.     

Reliability Analysis of Mobile Ad Hoc Networks Using Universal Generating Function

The proliferation of the wireless network over the last decade is one of the significant drivers for the increased deployment of mobile ad hoc networks (MANETs) in the battle field. It is not practically possible to build a fixed wired network infrastructure in battle field. But it is possible to create a mobile wireless network infrastructure because of the mobility of the soldiers. MANET is justified by the possibility of building a network where no infrastructure exists. MANET with group communication applications and multicasting can highly benefit from a networking environment such as military and emergency uses. In such applications, the used ad hoc networks need to be reliable and secure. In recent years, a specific technique called the universal generating function technique (UGFT) has been applied to determine the network reliability. The UGFT is based on an approach that is closely connected to generating functions that are widely used in probability theory. This work devotes to assess the MANET reliability using the UGFT. Reliability of the MANET is defined as the probability that the transformed message from the source can be passed successfully through the MANET and reached the target without any delay. Two kinds of UGFs are discussed in this work, and an algorithm has been proposed to execute the system reliability. This UGFT is illustrated with a case study in a battlefield environment. Copyright © 2014 John Wiley & Sons, Ltd.     

An Efficient and Reliable Multicasting for Smart Cities

The Internet of thing (IoT) is a growing concept for smart cities, and it is compulsory to communicate data between different networks and devices. In the IoT, communication should be rapid with less delay and overhead. For this purpose, flooding is used for reliable data communication in a smart cities concept but at the cost of higher overhead, energy consumption and packet drop etc. This paper aims to increase the efficiency in term of overhead and reliability in term of delay by using multicasting and unicasting instead of flooding during packet forwarding in a smart city using the IoT concept. In this paper, multicasting and unicasting is used for IoT in smart cities within a receiver-initiated mesh-based topology to disseminate the data to the cluster head. Smart cities networks are divided into cluster head, and each cluster head or core node will be responsible for transferring data to the desired receiver. This protocol is a novel approach according to the best of our knowledge, and it proves to be very useful due to its efficiency and reliability in smart cities concept because IoT is a collection of devices and having a similar interest for transmission of data. The results are implemented in Network simulator 2 (NS-2). The result shows that the proposed protocol shows performance in overhead, throughput, packet drop, delay and energy consumption as compared to benchmark schemes.     

自组网中一种基于跨层负载感知的蚁群优化路由协议

将蚁群优化和跨层优化方法结合起来,提出了一种基于跨层负载感知和蚁群优化的路由协议(CLAOR)。协议将整个路径中各节点MAC层的总平均估计时延和节点队列缓存的占用情况结合起来,共同作为路由选择和路由调整的重要度量标准进行按需路由发现和维护,通过拥塞节点丢弃蚂蚁分组以及借助部分兼具蚂蚁功能的数据分组实现正常路由表的维护等方法,减少了控制开销,增加了算法的可扩展性,较好地解决了自组网中现有基于蚁群优化的路由协议中普遍存在的拥塞问题、捷径问题和引入的路由开销问题。仿真结果表明,CLAOR在分组成功递交率、路由开销以及端到端平均时延等方面具有优良性能,能很好地实现网络中的业务流负载均衡。     

Trust-based hexagonal clustering for efficient certificate management scheme in mobile ad hoc networks

The wireless and dynamic nature of mobile ad hoc networks (MANET) render them more vulnerable to security attacks. However, providing a security mechanism implicitly has been a major challenge in such an ad-hoc environment. Certificate management plays an important role in securing an ad-hoc network. Certificate assignment, verification, and revocation complexity associated with the Public Key Infrastructure (PKI) framework is significantly large. Smaller the size of the network lesser will be the certificate management complexity. However, smaller the size, large will be the overall infrastructural cost, and also larger will be the overall redundant certificates due to multiple certificate assignment at the boundary regions, that in turn affects the prompt and accurate certificate revocation. By taking these conflicting requirements into consideration, we propose the trust-based hexagonal clustering for an efficient certificate management (THCM) scheme, to bear an absolutely protected MANET Disparate to the existing clustering techniques, we present a hexagonal geographic clustering model with Voronoi technique where trust is accomplished. In particular, to compete against attackers, we initiate a certificate management strategy in which certificate assignment, verification, and revocation are carried out efficiently. The performance of THCM is evaluated by both simulation and empirical analysis in terms of effectiveness of revocation scheme (with respect to revocation rate and time), security, and communication cost. Besides, we conduct a mathematical analysis of measuring the parameters obtained from the two platforms in multiple times. Relevant results demonstrate that our design is efficient to guarantee a secured mobile ad hoc network.     

An Application-Oriented Buffer Management Strategy in Opportunistic Networks

In Opportunistic networks (ONs), buffer management is critical to improve the message exchanging efficiency due to the limited storage space and transmission bandwidth at the wireless edge. Current solutions make message scheduling and drop policy based on assumptions that messages can always been forwarded in a single contact, and all node pairs have the same contact rates. However, such ideal assumptions are invalid for realistic mobility traces of hand-held. Recent studies show that the single contact duration is limited and the mobility of nodes is heterogeneous in reality. In this paper, a buffer management strategy based on contact duration and heterogeneous mobility is proposed to improve the efficiency of buffer policy in the practical applications. We mainly focus on the minimization of the total expected delivery delay for all messages in ONs with resource constraints. Using the global network information including existing copies of message in the network, the distribution of pair-wise inter-contact time and contact duration between nodes, we develop a function to compute per-message utility which reflects the contribution of single message to the total expected delivery delay. Messages are scheduled or dropped according to their utilities. Simulation results show that our proposed strategy not only achieves lower delivery delay than mainstream strategies, but also keeps a high delivery ratio and a low network overhead.     

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years, with the rapid development of the Internet and wireless communication technology, wireless Ad hoc networks have received more attention. Due to the limited transmission range and energy of nodes in Ad hoc networks, it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks. This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol, which has the following two aspects of improvement: (1) In the route discovery process, a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a “Mark” bit that representing remaining energy of a node. (2) Based on (1), a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively. Simulation results demonstrate that compared with AODV and other existing routing protocols, proposed algorithm can reduce network energy consumption and balance node energy, thus extending the network lifetime.     

Flooding-limited for multi-constrained quality-of-service routing protocol in mobile ad hoc networks

Multi-constrained quality-of-service (QoS) routing is used to find routes in a network to satisfy multiple independent QoS constraints. This problem is considered to be NP-complete, and most existing QoS routing algorithms are based on maintaining a global network state at every node. A multi-constrained, flooding-limited, QoS routing method to deal with limited available resources and minimum computation in a dynamic environment is proposed. The solution is based on decomposition of a routing area and a restriction in the exchange of routing information. It reduces the size of the control messages, restricts the amount of routing information, minimises the overhead from the flooding of control traffic and decreases the complexity of path selection. It is also proved that the flooding-limited-path heuristic can achieve very high performance by maintaining entries in each node, which indicates that the performance of the limited-path heuristic is not sensitive to the number of constraints. Simulation results show that this protocol provides better performance than other protocols, especially with regards to end-to-end delay, throughput and packet loss.     

Prophet_TD Routing Algorithm Based on Historical Throughput and Encounter Duration

Opportunistic networks are self-organizing networks that do not require a complete path between the source node and the destination node as it uses encounter opportunities brought by nodes movement to achieve network communication. Opportunistic networks routing algorithms are numerous and can be roughly divided into four categories based on different forwarding strategies. The Prophet routing algorithm is an important routing algorithm in opportunistic networks. It forwards messages based on the encounter probability between nodes, and has good innovation significance and optimization potential. However, the Prophet routing algorithm does not consider the impact of the historical throughput of the node on message transmission, nor does it consider the impact of the encounter duration between nodes on message transmission. Therefore, to improve the transmission efficiency of opportunistic networks, this paper based on the Prophet routing algorithm, fuses the impact of the historical throughput of the node and the encounter duration between nodes on message transmission at the same time, and proposes the Prophet_TD routing algorithm based on the historical throughput and the encounter duration. This paper uses the Opportunistic Networks Environment v1.6.0 (the ONE v1.6.0) as the simulation platform, controls the change of running time and the number of nodes respectively, conducts simulation experiments on the Prophet_TD routing algorithm. The simulation results show that compared to the traditional Prophet routing algorithm, on the whole, the Prophet_TD routing algorithm has a higher message delivery rate and a lower network overhead rate, and its average latency is also lower when node density is large.     

acSB: Anti-Collision Selective-Based Broadcast Protocol in CR-AdHocs

As a fundamental operation in ad hoc networks, broadcast could achieve efficient message propagations. Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels, broadcasts are carried out on multiple channels. Accordingly, channel selection and collision avoidance are challenging issues to balance the efficiency against the reliability of broadcasting. In this paper, an anti-collision selective broadcast protocol, called acSB, is proposed. A channel selection algorithm based on limited neighbor information is considered to maximize success rates of transmissions once the sender and receiver have the same channel. Moreover, an anti-collision scheme is adopted to avoid simultaneous rebroadcasts. Consequently, the proposed broadcast acSB outperforms other approaches in terms of smaller transmission delay, higher message reach rate and fewer broadcast collisions evaluated by simulations under different scenarios.     

Co-simulation of wireless networked control systems over mobile ad hoc network using SIMULINK and OPNET

Wireless networked control systems (WNCS) over mobile ad hoc network (MANET) is a new area of research and has many potential applications, for instance, military or rescue missions, exploring hazardous environments, and so on. For performance evaluation, researchers mostly rely on computer simulations as WNCS experiments are expensive to execute. It will generate a significant benefit to conduct performance analysis of WNCS over MANET using co-simulation that utilises SIMULINK and OPtimised Network Engineering Tool (OPNET) to simulate plant/controller behaviour and the MANET, respectively. Previous conference papers by the authors reported the initial SIMULINK-OPNET co-simulation for only one network size. Here the authors present an extention of their previous work, and presents the SIMULINK-OPNET co-simulation, methodology and comprehensive simulation results that have not been reported previously. It also considers the impact of five network sizes with stationary and mobile nodes. The proposed SIMULINK-OPNET co-simulation is applied to WNCS over MANET using a realistic wireless communication model. It investigates the impact of network data rates, node mobility, the packet delay, packet drop on the system stability and performance.     

无线传感器网络中基于信誉的恶意节点检测

提出一种基于信誉的恶意节点检测方法——RMDMN,在分簇的网络结构基础上,对节点的行为属性(如丢包率、转发率、位置匹配信息等)和网络攻击进行建模,结合阈值比较法动态地更新节点信誉值并进行恶意节点判断.实验仿真显示,该方法具有一定的恶意节点检测能力.     

On computing the reliability of opportunistic multihop networks with Mobile relays

Opportunistic multihop networks with mobile relays recently have drawn much attention from researchers across the globe due to their wide applications in various challenging environments. However, because of their peculiar intrinsic features like lack of continuous connectivity, network partitioning, highly dynamic behavior, and long delays, it is very arduous to model and effectively capture the temporal variations of such networks with the help of classical graph models. In this work, we utilize an evolving graph to model the dynamic network and propose a matrix‐based algorithm to generate all minimal path sets between every node pair of such network. We show that these time‐stamped‐minimal‐path sets (TS‐MPS) between each given source‐destination node pair can be used, by utilizing the well‐known Sum‐of‐Disjoint Products technique, to generate various reliability metrics of dynamic networks, ie, two‐terminal reliability of dynamic network and its related metrics, ie, two‐terminal reliabilities of the foremost, shortest, and fastest TS‐MPS, and Expected Hop Count. We also introduce and compute a new network performance metric?Expected Slot Count. We use two illustrative examples of dynamic networks, one of four nodes, and the other of five nodes, to show the salient features of our technique to generate TS‐MPS and reliability metrics.     

Adaptive RS codes for message delivery over an encrypted mobile network

The authors present a hybrid automatic repeat request technique using adaptive Reed-Solomon (RS) codes with packet erasure. This technique suits the transport layer in tactical mobile wireless networks with type I encryption, where encryption erasures the entire Internet protocol packet. The novelty of the presented technique is the multifaceted optimisation of Reed-Solomon codes at the transport layer for delivery assurance, speed of service (SoS) and network throughput. With this technique, the transport layer in tactical networks can meet the stringent requirements of quality of service imposed by the tactical network user, even under adverse conditions. These requirements define a high level of reliability (delivery assurance), a specific SoS and optimum use of the limited bandwidth (BW) of the wireless network, where the probability of packet erasure can be very high. The provided probabilistic analysis shows that focusing on network throughput alone will result in violating SoS and delivery assurance requirements. On the other hand, focusing on SoS and delivery assurance requirements can result in poor network throughput. The multifaceted optimisation technique, which utilises hybrid ARQ for message delivery, is described using a homogeneous Markov chain.     

MANET QoS介质访问控制策略MAQF/MAC及其仿真研究

要实现移动Ad-Hoc网络MANET民用化，必然解决其MAC层的QoS创立。MAQF／MAC是一种新的MANET自适应QoS介质访问控制策略，该策略可以实时动态地测试网络资源，及时调整业务流对资源的访问和占用。本文着重从仿真实现角度，对MAQF／MAC协议的原理，预留表结构，QoS路由，压缩算法等问题进行探讨。仿真结果表明，MAQF／MAC在资源利用率和分级服务的QoS保障能力等方面明显优于MACA／PR。     

Dynamic Power-Conscious Routing for MANETs: An Initial Approach

We develop an initial dynamic power-concious routing scheme (MPR) that incorporates physical layer and link layer statistics to conserve power, while compensating for the channel conditions and interference environment at the intended receiver. The aim of MPR is to route a packet on a path that will require the least amount of total power expended and for each node to transmit with just enough power to ensure reliable communication. We evaluate the performance of MPR and present our preliminary results.     

OLSR路由协议拓扑发现的一种实现方案

OLSR(Optimized Link State Routing Protocol,最优链路状态路由协议,RFC3626)协议是应用于MANET网络的一种先应式表驱动路由协议,其拓扑发现过程是实现有效通信的关键。本文提出了一种基于C 的OLSR协议拓扑发现的实现方案。该方案采用模块化面向对象设计方法,结合C 语言的特点使用了一些新的实现方法,主要完成了邻居侦测、链路侦测、MPR选举、HELLO消息处理、TC消息处理和拓扑计算等功能。     

基于GMPLS的光网络保护和恢复机制

通用MPLS(GMPLS)是MPLS向光网络扩展的必然产物，它提供了网络拓扑和资源发现以及连接配制等基本的功能。本文提出了基于GMPLS的网络故障恢复机制，包括其实现过程以及相关的信令消息。