A Hierarchical Algorithm for Mobile Ad-Hoc Networks

For mobile ad hoc networks, hierarchical algorithm can reduce communication relay and enhance the QoS of MANETs. In this paper, A hierarchical algorithm-FGM algorithm is proposed. This algorithm based on dynamic node’s Multi-feature fusion and Gibbs Random Field—Maximum a Posterior. The simulation results verify the effectiveness of the algorithm.

Download Full-text

A Protocol for Content-Based Communication in Disconnected Mobile Ad Hoc Networks

Mobile Information Systems ◽

10.1155/2010/839457 ◽

2010 ◽

Vol 6 (2) ◽

pp. 123-154 ◽

Cited By ~ 8

Author(s):

Julien Haillot ◽

Frédéric Guidec

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Ad Hoc ◽

Information Flows ◽

Opportunistic Networking ◽

Simulation Results ◽

Mobile Ad Hoc ◽

Hoc Networks ◽

Delay Tolerant ◽

Intermittently Connected

In content-based communication, information flows towards interested hosts rather than towards specifically set destinations. This new style of communication perfectly fits the needs of applications dedicated to information sharing, news distribution, service advertisement and discovery, etc. In this paper we address the problem of supporting content-based communication in partially or intermittently connected mobile ad hoc networks (MANETs). The protocol we designed leverages on the concepts of opportunistic networking and delay-tolerant networking in order to account for the absence of end-to-end connectivity in disconnected MANETs. The paper provides an overview of the protocol, as well as simulation results that show how this protocol can perform in realistic conditions.

Download Full-text

Performance Analysis of MANET Proactive and Reactive Routing Protocols Using Network Simulator 2

JELIKU (Jurnal Elektronik Ilmu Komputer Udayana) ◽

10.24843/jlk.2020.v08.i03.p06 ◽

2020 ◽

Vol 8 (3) ◽

pp. 251

Author(s):

I Wayan Adi Saputra ◽

I Komang Ari Mogi

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Routing Protocol ◽

Routing Protocols ◽

Ad Hoc ◽

Network Routing ◽

Propagation Model ◽

Simulation Results ◽

Mobile Ad Hoc ◽

Hoc Networks

The development of Mobile ad hoc networks (MANET) has the nature and character of a fast, costeffective. The development of Mobile ad hoc networks (MANET) has the nature and character of a fast, cost-effective deployment and able to manage the topology independently. This has caused in recent years, MANET to be an interesting and popular thing to study. MANET can be applied even in difficult areas, forest fire detection, military operations and even health monitoring. Changes in the topology dynamically on MANET, limited energy consumption, and built without existing infrastructure are a problem in MANET. Problems especially dynamic topology changes make routing very important in MANET design. This article aims to analyze AODV, DSDV and DSR routing protocols based on quality of service (QoS). The test scenario is based on the number of nodes, packet size, area of simulation, simulation time, simulation speed, mobility model, and propagation model. The simulation that has been done produces 4 graphs, each of which explains the packet delivery ratio, throughput, network routing load, and delay. Simulation results are obtained using NS2 network simulators through *. Tcl files and generate *. Tr (trace) and *.nam (animator) files. Simulation results show that the DSR routing protocol has better performance than AODV and DSDV in terms of pdr, throughput, network routing load, and delay. The average value of the DSR routing protocol is 657,498 on throughput and 0.244 milliseconds on delay.

Download Full-text

Secure opinion sharing for reputation-based systems in mobile ad hoc networks

Measurement and Control ◽

10.1177/0020294019900314 ◽

2020 ◽

Vol 53 (3-4) ◽

pp. 748-756

Author(s):

Abdur Rashid Sangi ◽

Jianwei Liu ◽

Mohammed S Alkatheiri ◽

Satish Anamalamudi

Keyword(s):

Game Theory ◽

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Network Performance ◽

Ad Hoc ◽

Limited Resources ◽

Virtual Currency ◽

Simulation Results ◽

Mobile Ad Hoc ◽

Hoc Networks

Due to the basic nature of mobile ad hoc networks, that is, infrastructure-less, it is prone to individual or collective misbehaviors by participating node(s). Participating nodes could act selfishly and does cause massive loss to network performance because of limited resources or belonging to a different administrative domain. Reputation-based solutions are widely used to mitigate selfishness. These solutions are to some extent depend on the feedback from participating nodes for any given node which required its secure exchange in an adverse environment. This paper introduces a secure opinion sharing based on network coding to ensure the effectiveness of any reputation against selfishness in an adverse environment. The proposed scheme addresses the threat to opinion exchange in any reputation-based solution with minor changes. In addition, it can be used to exchange secure data in an adverse environment, for example, virtual currency and feedback exchange for credit payment and game theory–based solutions, respectively. Simulation results proved that this scheme achieves excellent opinion exchange ratio, moderate delay, and affordable per cycle overhead.

Download Full-text