scholarly journals A Dynamic TDMA Scheduling Strategy for MANETs Based on Service Priority

Sensors ◽  
2020 ◽  
Vol 20 (24) ◽  
pp. 7218
Author(s):  
Yufeng Ye ◽  
Xiangyin Zhang ◽  
Lanfeng Xie ◽  
Kaiyu Qin
Keyword(s):  
Mobile Ad Hoc Network ◽  
Frame Structure ◽  
Allocation Strategy ◽  
Slot Allocation ◽  
Scheduling Strategy ◽  
End To End Delay ◽  
Service Information ◽  
End To End ◽  
Tdma Scheduling ◽  
Service Priority

Physical resource allocation strategy is a key factor affecting the performance of a mobile ad hoc network (MANET), which serves as a network model widely used in the sensor and detection field. For various perceived service information, it is significant for the allocation strategy to adapt to the dynamic service requirements and prioritize resource access for the service information with high priority to guarantee its real-time performance. In this paper, a novel dynamic time division multiple access (TDMA) scheduling strategy is proposed for MANETs. Firstly, a service priority-based dynamic TDMA scheduling (SP-DS) algorithm is presented, which introduces the service priority as a reference factor for slot allocation and fully considers the transmission throughput and end-to-end delay performance. Moreover, for improving the slot use of the whole system, a modified distributed color constraint heuristic (MD-CCH) scheme is presented to optimize the frame structure. The SP-DS and MD-CCH algorithms are combined to form the novel strategy. Simulation results have demonstrated that the proposed strategy has better performance in the slot use, slot allocation efficiency, end-to-end delay and transmission throughput compared with the existing slot allocation algorithms.

scholarly journals Modifying the MANET Routing algorithm by GBR CNR-Efficient Neighbor Selection Algorithm

2019 ◽  
Vol 8 (10) ◽  
pp. 912-917
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Packet Transmission ◽  
Mobile Nodes ◽  
Routing Overhead ◽  
End To End Delay ◽  
Stay Time ◽  
End To End ◽  
Neighbor Selection

In today’s worlds, Mobile Ad-Hoc Network (MANET) plays most important role in the field networks technology in the world. The MANET has been rapidly rising and becoming significant from the last decade. A MANET is a kind of wireless network which has been set-up without requirement of fixed infrastructure where mobile nodes are connected over wireless link. Due to moving nature of the devices, the network topology is unstable and will change dynamically. That’s why stable routing in MANET cannot work properly. In this research paper, a new routing algorithm is proposed to get better routing performance in the MANET. The proposed algorithm designed based on the number of neighbors in the network. Planned algorithm is the improvement of GBR-CNR-LN (GBR-CNR with less neighbors) by calculating the stay time between the selected neighbor nodes and the transmission nodes. If the stay time of sender node is more than the packet transmission time then the selected node is the efficient neighbor selection. The algorithm is implemented and results are analyzed. The results of this paper show the usefulness of the proposed algorithm. The Evaluation of AODV protocol was carried out using Python and outcome of this evaluation showed that proposed Algorithm gave better results than GBR-CNR with less neighbor in terms of End-to-End delay, Number of control message transferred(Routing Overhead) and Network Load. The proposed Algorithm (GC-ENS) decrease Average End-to-End delay 52.54 %, reduce Average Routing Overhead 60.54% and decline the Average load on Network 61.17%.

scholarly journals Pencarian Rute yang Handal Berbasis Energi Menggunakan Algoritma EA-SHORT pada Protokol Routing ZRP di Jaringan MANET

2021 ◽  
Vol 3 (1) ◽  
pp. 31-42
Author(s):  
Mila Rosiana ◽  
Andy Hidayat Jatmika ◽  
Ariyan Zubaidi
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Energy Aware ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
End To End

Mobile Ad-Hoc Network (MANET) adalah jaringan wireless dari kumpulan node yang tidak memiliki router tetap. Setiap node dalam jaringan bertindak sebagai router yang bertanggung jawab untuk menemukan dan menangani rute antar node. Dalam penelitian ini, konsep energy aware menggunakan algoritma EA-SHORT diterapkan pada kerangka kerja Zone Routing Protocol (ZRP). EA-SHORT mencoba mendistribusikan beban jaringan ke semua node yang ada dengan memanfaatkan variasi jumlah energi dengan memilih node yang memiliki cukup energi yang dapat berpartisipasi dalam rute dan menghindari node yang memiliki energi rendah. Kinerja ZRP akan dibandingkan dengan EA-SHORT ZRP yang telah dimodifikasi dengan EA-SHORT yang diukur dari nilai parameter yang ditentukan. Dari simulasi, hasilnya menunjukkan, pada node 50, throughput meningkat sebesar 12,374%. Untuk 100 node, peningkatan sebesar 44.597%. Pada rata-rata average end to end delay , dengan 50 node, nilai EA-SHORT ZRP menurun sebesar 20.063%, 100 node EA-SHORT ZRP menurun sebesar 8.375%. Hasil PDR pada EA-SHORT ZRP dengan 50 node meningkat 0,545%, dan untuk EA-SHORT ZRP 100 node meningkat sebesar 21,301%

A Beaconless Minimum Interference Based Routing Protocol to Minimize End-to-End Delay per Packet for Mobile Ad hoc Networks

2010 ◽  
Vol 2 (1) ◽  
pp. 12-26 ◽  
Author(s):  
Natarajan Meghanathan ◽  
Meena Sugumar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Data Packet ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
End To End ◽  
Index Value ◽  
Minimum Interference

The authors propose a beaconless, on-demand, mobile ad hoc network routing protocol called minimum interference based routing protocol (MIF) that minimizes the end-to-end delay per data packet. During route discovery, each node inserts its identification and location information before broadcasting the Route-Request (RREQ) message in its neighborhood. The weight of a link, called the interference index, is the number of interfering links surrounding it. Two links are said to interfere with each other, if the distance between the mid points of the two links is within the interference range. The interference index of a path is the sum of the interference index values of the constituent links. The destination selects the path with the minimum interference index value and notifies the source through the Route-Reply packet. Simulation results demonstrate that MIF incurs a significant reduction in the end-to-end delay per data packet vis-à-vis the interference-aware load balancing routing protocol.

A Beaconless Minimum Interference Based Routing Protocol to Minimize End-to-End Delay per Packet for Mobile Ad hoc Networks

2012 ◽  
pp. 11-26
Author(s):  
Natarajan Meghanathan ◽  
Meena Sugumar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Data Packet ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
End To End ◽  
Hoc Networks ◽  
Index Value ◽  
Minimum Interference

The authors propose a beaconless, on-demand, mobile ad hoc network routing protocol called minimum interference based routing protocol (MIF) that minimizes the end-to-end delay per data packet. During route discovery, each node inserts its identification and location information before broadcasting the Route-Request (RREQ) message in its neighborhood. The weight of a link, called the interference index, is the number of interfering links surrounding it. Two links are said to interfere with each other, if the distance between the mid points of the two links is within the interference range. The interference index of a path is the sum of the interference index values of the constituent links. The destination selects the path with the minimum interference index value and notifies the source through the Route-Reply packet. Simulation results demonstrate that MIF incurs a significant reduction in the end-to-end delay per data packet vis-à-vis the interference-aware load balancing routing protocol.

Securing Energy Routing Protocol against Black Hole Attacks in Mobile Ad-Hoc Network

2020 ◽  
Vol 13 ◽  
Author(s):  
Rajendra Prasad P ◽  
Shiva Shankar
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Packet Delivery ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
End To End

Introduction: The aim of the securing energy routing protocol, is to provide the countermeasures to the attacks par-ticularly to the black hole in mobile ad-hoc network, and enhancing the network performance metric throughput al-so reducing the end-to-end delay between the nodes in the network.To build the protocol that enhances the perfor-mance of the network by modifying the existing DSR protocol by introducing new route discovery mechanism in the proposed protocol. Method: The proposed protocol implementation has two phases, route request/reply phase and route confirm phas-es. During the route discovery process, the route discovery from the source to destination process are described by sending the RREQ packet from the source hub as shown in Fig. 1(a), when it does not have one accessible and crav-ings a route to a destination. The source node transmits the RREQ to its associate nodes and the destination node re-ply with RREP. When the source receives reply message, the source node respond with reverse path with a confirm RCON message and providing security to the nodes in the network. Results: To verify the performance of the proposed protocol against the existing DSR protocol are compared with respect to various network metrics like end-to-end delay and packet delivery ratio and validated the result by com-paring both routing algorithm using Network Simulator 2. Conclusion: The results of the proposed SERP strongly safeguard against the attacks in the network and the packet delivery ratio is increased compared with the DSR also the end-to-end delay is reduced in the proposed protocol. Discussion: Mobile ad-hoc networks are being dynamic in nature, it associates with issues relating to secure routing, energy and are generally vulnerable to several types of attacks. The DSR is one of the widely used reactive proto-cols available for the mobile ad-hoc network and the proposed work enhancing the security of the network in the existing pro

Two Variants of Secure Routing Algorithms in Mobile Ad Hoc Network

2019 ◽  
Vol 9 (1) ◽  
pp. 80-110
Author(s):  
Sulata Mitra ◽  
Priyodarshini Dhar
Keyword(s):  
Mobile Ad Hoc Network ◽  
Routing Algorithms ◽  
Packet Delivery Ratio ◽  
Data Packet ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Second Phase ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End

Background and Objective: Two different variants of secure routing algorithms are proposed in the present work. In both the variants a stable route is established between source and destination. Methods: The selected route is associated with the nodes having sufficient energy to establish the route and to transmit the data packets, minimum velocity to reduce the frequency of link failure, maximum distance from the source node to reduce the number of hops in the selected route, minimum number of neighbors to reduce the routing overhead. Each variant has two phases. In the first phase it is assumed that the selected route has no attackers. The first phase is made more realistic in the second phase by considering the presence of attacker in the selected route. In the first variant a node associated with the selected route overhears the transmission of the next forwarder node to detect an attacker node in the routing path. But a node may fail to overhear its next hop in presence of hidden node, due to limited overhear range etc. Such problem is eliminated in the second variant. In the second variant each node associated with the selected route searches its data packet buffer for the reception of the next data packet from its predecessor node associated with the same route and suspects the predecessor node as an attacker in case the next data packet is not found in the buffer. The performance of both the variants is compared on the basis of packet delivery ratio, throughput and average end-to-end delay. Results: The throughput and packet delivery ratio are higher in the second variant than the first variant whereas the average end-to-end delay is less in the second variant than the first variant. Conclusion: Moreover both the variants outperform the existing schemes in terms of packet delivery ratio, throughput and average end-to-end delay.

Realization of Route Reconstructing Scheme for Mobile Ad hoc Network

2011 ◽  
pp. 62-79 ◽  
Author(s):  
Qin Danyang ◽  
Ma Lin ◽  
Sha Xuejun ◽  
Xu Yubin
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Heavy Traffic ◽  
Route Maintenance ◽  
End To End Delay ◽  
Communication Links ◽  
Mobile Ad Hoc ◽  
End To End ◽  
The Stability

Mobile Ad Hoc Network (MANET) is a centerless packet radio network without fixed infrastructure. In recent years tremendous attentions have been received because of capabilities of self-configuration and self-maintenance. However, attenuation and interference caused by node mobility and wireless channels sharing weaken the stability of communication links especially in ubiquitous MANET. A mathematical exploring model for next-hop node has been established. The negative impact of wireless routes discontinuity on pervasive communication is alleviated by a novel route reconstructed scheme proposed in this paper based on restricting the route requirement zone into a pie slice region on intermediate nodes according the solution of the exploring equation. The scheme is an effective approach to increase survivability and reduce average end-to-end delay during route maintenance as well as allowing continuous packet forwarding for fault resilience so as to support mobile multimedia communication. The ns-2 based simulation results show remarkable packets successful delivery rate and end-to-end delay improvements of source-initiated routing protocol with route reconstructing scheme, and especially in the case of high dynamic environments with heavy traffic loads, more robust and scalable performance will be obtained.

scholarly journals Performance Analysis of Mobile Ad Hoc Unmanned Aerial Vehicle Communication Networks with Directional Antennas

2010 ◽  
Vol 2010 ◽  
pp. 1-14 ◽  
Author(s):  
Abdel Ilah Alshbatat ◽  
Liang Dong
Keyword(s):  
Communication Networks ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Medium Access Control Protocol ◽  
Directional Antennas ◽  
Medium Access ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
End To End

Unmanned aerial vehicles (UAVs) have the potential of creating an ad hoc communication network in the air. Most UAVs used in communication networks are equipped with wireless transceivers using omnidirectional antennas. In this paper, we consider a collection of UAVs that communicate through wireless links as a mobile ad-hoc network using directional antennas. The network design goal is to maximize the throughput and minimize the end-to-end delay. In this respect, we propose a new medium access control protocol for a network of UAVs with directional antennas. We analyze the communication channel between the UAVs and the effect of aircraft attitude on the network performance. Using the optimized network engineering tool (OPNET), we compare our protocol with the IEEE 802.11 protocol for omnidirectional antennas. The simulation results show performance improvement in end-to-end delay as well as throughput.

An Improved Depth-Based TDMA Scheduling Algorithm for Industrial WSNs to Reduce End-to-end Delay

2015 ◽  
Vol 42 (4) ◽  
pp. 530-540 ◽  
Author(s):  
Hwakyung Lee ◽  
Sang-Hwa Chung ◽  
Ik-Joo Jung
Keyword(s):  
Scheduling Algorithm ◽  
End To End Delay ◽  
End To End ◽  
Tdma Scheduling

scholarly journals Mitigation of Blackhole Attack on MANETs using ABC and ANN Algorithm

2019 ◽  
Vol 8 (9) ◽  
pp. 1893-1898
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Optimization Technique ◽  
Delivery Ratio ◽  
Bee Colony ◽  
End To End Delay ◽  
Important Field ◽  
End To End ◽  
Secure Network ◽  
Artificial Neural Network Ann

Mobile ad hoc network (MANET) is an important field of research that comprises of moveable nodes. These nodes communicate with each other through wireless links. Therefore, it becomes essential to design a secure network as it finds applications in different fields where data and communication are important like that in defense areas and disaster rescue operations. This paper focuses on detecting Blackhole nodes in MANETs and preventing it from the same. In this work, Ad hoc On-Demand Distance Vector (AODV) is employed as a routing mechanism and a secure network is established using Artificial Bee Colony (ABC) algorithm as an optimization technique in combination with Artificial Neural Network (ANN) as a classification algorithm to identify the Blackhole nodes. Simulations are carried out in MATLAB and the efficiency of the network in terms of Throughput, Packet Delivery Ratio (PDR), End-to-End Delay and Energy Consumption are measured. Throughput and PDR have been increased by 11.11%, 4.9 %, whereas end- to- end delay has been reduced by 4.93% as compared to existing work proposed by Ashish et al.[6].

Sign in / Sign up

Export Citation Format

Share Document