scholarly journals A CSMA Mechanism with Variable Collision Control and Priority Provision in Multichannel Mobile Ad Hoc Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Hongwei Ding ◽  
Mingliang Li ◽  
Jun Zhang

Toward making the conventional carrier sense multiple access (CSMA) protocol transmit and control mobile ad hoc network systems, as well as reducing energy consumption, an adaptive multichannel multipriority two-dimensional probability detection and 1-stick joint control strategy carrier sense multiple access with variable collision duration and three-way handshake mechanisms (iCSMA for short) is proposed. Based on the conventional two-slot model of the CSMA protocol, iCSMA introduces a concept of collision duration (b), which divides the system’s timeslot into the duration of successful packet transmission (1 + a), the duration of collision (b + a), and the duration of the idle state (a) of the system. By employing iCSMA, the loss of the system could be reduced with a fine-tuned collision duration (b), which leads to improved performance compared to the conventional 1P-persistent CSMA protocol. Furthermore, a three-way handshake mechanism is introduced for monitoring the entire network system at a minimal cost of throughput. Toward a higher channel utilization rate, a multichannel and multipriority function is employed in the implementation of multiservice communication for the system. Besides, with an adaptive mechanism, the transmission probabilities p 1 and p 2 are reasonably set so that the system will not produce a complete collision under the condition of high load, and the throughput can also be stabilized. Based on the battery model, the lifetime of the system nodes (T) is extended. Both theoretical analysis and experimental results confirm the accuracy of the theoretical derivation.

A Mobile Ad Hoc Network (MANET) is a hotchpotch of nodes with mobility feature, the established network utilization is dynamically outlined based on temporary architecture. In MANETs, the challenging and vital role is played by the routing protocols performance factors under different condition and environments. The routing protocols are liable to handle many nodes with limited resources. There exits many routing protocols in MANETs, one of the main key note that has to be considered in designing a routing protocol is to observe that the designed routing protocol is having an proportionate effect on network performance. The existence of obstacles may lead to many geographical routing problems like excess consumption of power and congestion of data. The aim of this paper is to take the assistance of A* algorithm that finds the walk-able path avoiding the concave obstacle in the path relaying on the gaming-theory model[29]. This algorithm decreases the delays in packet transmission and in turn increases the success rate of transmission. We take into consideration path length, penalty for node availability as probability of forwarding criteria and processes effective packet transmission. The simulated results analyse the performance of our protocol over other conventional algorithms based on congestion cost, path length, node availability penalty, delay, packet loss, throughput.


MULTINETICS ◽  
2019 ◽  
Vol 5 (2) ◽  
pp. 21-29
Author(s):  
Nurul Faizah ◽  
Siti Ummi Masruroh ◽  
Ivan Gustra Manca Armenia

Transmission package delivery can be a problem of routes on the network, one of them is the Wireless network. Mobile Ad-Hoc Network (MANET) topology is often used on Wireless networks. The existence of a malicious node is a threat to MANET. Package delivery uses AODV and AOMDV Protocol Routing in TCP and UDP packet transmission. This study uses a simulation method using NS2, NAM and AWK. The Quality of Service (QoS) parameters used are throughput, packet loss, and jitter. Simulations are carried out using malicious nodes, the results on the AOMDV TCP graph have the highest input values and the best packets but are difficult to minimize energy, while for the TCP jitter values graph is best because it has a flow control function that can adjust the trajectory. The results in AOMDV TCP have the highest input value and the best packet loss but it is difficult to minimize energy, while for TCP value jitters it is best because it has a flow control function that can adjust the trajectory


Author(s):  
RAJESWARI. M ◽  
P.UMA MAHESWARI ◽  
BHUVANESHWARI. S

Secure group communication is a challenging task with respect to MANET’s. Since its introduction as a communication medium, wireless technology found broad application on the battlefield. Robust and reliable group communication plays a major role in developing distributed mobile application in which unannounced disconnections will occur frequently due to the mobility of the nodes which take part in mobile applications. Accompanying dramatic advances in wireless technology and the capabilities associated with small computing devices, the demand for advanced mechanisms to employ wireless technology in the battlefield continues to grow. The main objective here is to achieve robust and reliable group communication in mobile ad hoc network .Performance of the group communication is compared with the given protocols through simulation in NS-2. The analysis is made with respect to the throughput, packet transmission between source and destination. We propose four Ad hoc Routing Protocols AODV, DSR, and have given the comparative study.


Author(s):  
D. Moltchanov ◽  
A. Vinel ◽  
J. Jakubiak ◽  
Y. Koucheryavy

In this paper, the authors propose a simple concept for emergency information dissemination in vehicular ad-hoc networks. Instead of competing for the shared wireless medium when transmitting the emergency information, the authors’ proposed method requires nodes to cooperate by synchronizing their transmissions. The proposed scheme is backward compatible with IEEE 802.11p carrier sense multiple access with collision avoidance. The authors also briefly address some of the implementation issues of the proposed scheme.


Sign in / Sign up

Export Citation Format

Share Document