scholarly journals Multi-Token Based MAC-Cum-Routing Protocol for WSN: A Distributed Approach

Author(s):  
Subhasis Dash ◽  
Saras Kumar ◽  
Manas Ranjan Lenka ◽  
Amulya Ratna Swain

A wireless sensor network is a collection of batterypowered sensor nodes distributed in a geographical area. Inmany applications, such networks are left unattended for along period of time. These networks suffer from the problemslike high energy consumption, high latency time, and end- to-end low packet delivery ratio. To design a protocol that findsa trade-off between these problems is a challenging task. Inorder to mitigate energy consumption issue, different existingMedia Access Control (MAC) protocols such as S-MAC, RMAC,HEMAC, and Congestion-less Single Token MAC protocols havebeen proposed which ensure better packet delivery but fail toensure energy efficiency due to high end-to-end latency. Theproblem of high end-to-end latency is resolved with the existingrouting protocols such as Fault Tolerant Multilevel Routingprotocol (FMS)and Enhanced Tree Routing (ETR) protocol.AS2-MAC and Multi Token based MAC protocol are able toimprove the end-to-end packet delivery ratio. However, thehierarchical network structure used in these protocols increasestime and energy consumption during network reconstruction.This problem was further resolved in Distributed HierarchicalStructure Routing protocol by constructing the network structurein a distributed manner. In all these existing protocols, efficienttoken management and reliable data delivery ratio was notproperly addressed, which in turn consume more energy. So,it is clear that MAC and routing protocols both together cangive better results related to data transmission in WSN. Inorder to achieve the same, in this paper, we propose a reliabledata transmission algorithm that satisfies both routing and MACprotocol to improve the end-to-end data delivery. The proposedprotocol uses different control message exchange that ensures datapacket delivery in each individual levels and it ultimately uses oftokens to ensure reliable data transmission along with reducedtraffic congestion during end-to-end data delivery. The algorithmconsiderably improves the packet delivery ratio along with reduceenergy consumption of each sensor node. Simulation studies ofthe proposed approach have been carried out and its performancehas been compared with the Multi Token based MAC protocol,AS-MAC protocol and ETR routing protocol. The experimentalresults based on simulation confirms that the proposed approachhas a higher data packet delivery ratio.

2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.


Author(s):  
RENDI DIAN PRASETIA ◽  
DOAN PERDANA ◽  
RIDHA MULDINA NEGARA

ABSTRAKSalah satu permasalahan di kota-kota besar adalah kemacetan lalu lintas yang disebabkan karena tidak mencukupinya ruas jalan, volume kendaraan yang begitu besar, persebaran kendaraan yang tidak merata dan lain-lain. Salah satu solusinya adalah para pengendara dapat menggunakan aplikasi peta digital pada smartphone-nya. Oleh karena itu perlu dilakukan pengimbangan beban trafik kendaraan. Pada penelitian ini akan dibahas mengenai kinerja VANET yang menggunakan protokol routing GPSR dan AODV dengan skema pengimbangan beban trafik kendaraan dengan pengaruh kepadatan node. Perancangan sistem simulasi terbagi menjadi dua subsistem yaitu subsistem mobilitas dan jaringan. Kemudian dilakukan pengimbangan beban trafik kendaraan, dan kinerja VANET akan diamati. Performansi dievaluasi dengan average end to end delay, throughput, dan packet delivery ratio. Nilai rata-rata throughput, PDR, delay untuk GPSR adalah 142.21 Kbps, 87.47 %, dan 82.83 ms. Sedangkan AODV adalah 119.81 Kbps, 86.67 %, dan 103.21 ms. Dari hasil penelitian nilai QoS performansi dari routing protocol GPSR lebih baik dari pada AODV pada VANET.Kata kunci: Vanet, Pengimbangan Beban, GPSR, AODV.ABSTRACTOne of the problems in big cities is congestion. The congestion is caused byinsufficient road segment, large volume of vehicles, unbalanced spread ofvehicles and others. One solution is that riders can use digital map applications on their smartphones. Therefore it is necessary to balancing the traffic load of vehicles. In this research will be discussed about VANET performance using GPSR and AODV routing protocol with vehicle traffic load balancing scheme with node density influence. The design of the simulation system is divided into two subsystems namely mobility and network subsystem. Then balancing the vehicle traffic load, and VANET performance will be observed. Performance is evaluated with the average end to end delay, throughput, and packet delivery ratio. The mean value of throughput, PDR, delay for GPSR respectively 142.21 Kbps, 87.47%, and 82.83 ms. While AODV is 119.81 Kbps, 86.67%, and 103.21 ms. From the simulation results can be concluded that the performance of GPSR is better than AODV on VANET. Keywords: Vanet, Load Balancing, GPSR, AODV.


Author(s):  
Geetanjali Rathee ◽  
Hemraj Saini

Secure routing is considered as one of a key challenge in mesh networks because of its dynamic and broadcasting nature. The broadcasting nature of mesh environment invites number of security vulnerabilities to come and affect the network metrics drastically. Further, any node/link failure of a routed path may reduce the performance of the entire network. A number of secure routing protocols have been proposed by different researchers but enhancement of a single network parameter (i.e. security) may affect another performance metrics significantly i.e. throughput, end to end delay, packet delivery ratio etc. In order to ensure secure routing with improved network metrics, a Secure Buffer based Routing Protocol i.e. SBRP is proposed which ensures better network performance with increased level of security. SBRP protocol uses buffers at alternate positions to fasten re-routing mechanism during node/link failure and ensures the security using AES encryption. Further the protocol is analyzed against mAODV protocol in both static and dynamic environment in terms of security, packet delivery ratio, end to end delay and network throughput.


Author(s):  
Irfan Ahmad ◽  
Fahad Masood ◽  
Arbab Wajid Ullah Khan

In Mobile Ad hoc Networks (MANET) nodes often change their location independently where neither fixed nor centralized infrastructure is present. Nodes communicate with each other directly or via intermediate nodes. The advantages of the MANET layout lead to self-structure and compatibility to most important functions such as traffic distribution and load balancing. Whenever the host moves rapidly in the network the topology becomes updated due to which the structure of MANET varies accordingly. In the literature, different routing protocols have been studied and compared by researchers. Still, there are queries regarding the performance of these protocols under different scenarios. MANETs are not based on a predesigned structure. In this paper, the performance assessment of the Quality of Services (QoS) for different protocols such as Ad hoc On-Demand Distance Vector (AODV), Temporally Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) in the existence of the various number of communicating nodes is studied. The performance matrices throughput, end – to – end delay and packet delivery ratio are considered for simulations. Ns 2.35 simulator is used for carrying out these simulations. Results are compared for AODV, TORA, and ZRP routing protocols. The results show that AODV and TORA perform well in end – to – end delay as compared to zone routing protocol. Zone routing protocol performs well in packet delivery ratio and throughput as compared to both the other protocols.


Author(s):  
Shamsul J Elias ◽  
M. Elshaikh ◽  
M. Yusof Darus ◽  
Jamaluddin Jasmis ◽  
Angela Amphawan

<p>Vehicular Ad hoc Networks (VANET) play a vital Vehicle to Infrastructure (V2I) correspondence frameworks where vehicle are convey by communicating and conveying data transmitted among each other. Because of both high versatility and high unique network topology, congestion control should be executed distributedly. Optimizing the congestion control in term of delay rate, packet delivery ratio (PDR) and throughput could limit the activity of data packet transmissions. These have not been examined altogether so far – but rather this characteristic will be fundamental for VANET system execution and network system performance. This paper exhibits a novel strategy for congestion control and data transmission through Service Control Channel (SCH) in VANET. The Taguchi strategy has been connected in getting the optimize value of parameter for congstion control in highway environment. This idea lessens the pointless activity of data transmission and decreases the likelihood of congested in traffic in view of execution for measuring the delay rate, packet delivery ratio (PDR) and throughput. The proposed execution performance is estimated with the typical VANET environment in V2I topology in highway driving conditions and the simulation results demonstrate and enhance network execution performance with effective data transmission capacity.</p>


2021 ◽  
Vol 13 (2) ◽  
pp. 81-97
Author(s):  
S. Suguna Devi ◽  
A. Bhuvaneswari

Route path identification on the Internet of Vehicles (IoV) is complicated due to the nature of high dynamic mobility, bandwidth constraints, and traffic load. A vehicle present on the IoV communicates with each other to find the status of the road and location of other vehicles for reliable data transmission. However, the existing routing algorithm does not effectively improve the packet delivery ratio and reduce the delay. To resolve these issues, A Quantile Regressive Fish Swarm Optimized Deep Convolutional Neural Learning (QRFSODCNL) technique is introduced reliable data transmission with minimum end to end delay in IoV. The Do Convolutional Neural Learning uses multiple layers such as one input layer, three hidden layers, and one output layer for vehicle location identification and optimal route path discovery. The different node characteristics of vehicle nodes are analyzed in the hidden layers using the quantile regression function. Depends on the regression analysis, the neighbouring node is identified with minimal time. To improve the throughput and reduce the packet loss rate, the artificial fish swarm optimization technique is applied to choose the best route among the population based on the fitness function. Simulation is carried out to analyze the performance of QRFSODCNL technique and existing methods with different metrics such as packet delivery ratio, packet loss rate, average end to end delay, and throughput. The discussed outcome proves that the QRFSODCNL technique outperforms well as compared to the stateof-the-art methods.


SISTEMASI ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 215
Author(s):  
Fajar Baihaqy

MANET merupakan tipe jaringan khusus yang mampu melibatkan banyak orang atau peralatan komunikasi tanpa ketergantungan terhadap suatu infrastruktur. AODV dan DSDV merupakan contoh routing protocol yang efisien untuk jaringan Ad Hoc pada tipe routing protocol masing-masing. AODV untuk tipe routing protocol reactive dan DSDV untuk tipe routing protocol proactive. Setiap routing protocol tentunya memiliki kemampuan masing-masing, sehingga Quality of Service (QoS) untuk setiap routing protocol akan berbeda juga. Dalam penelitian melakukan analisis QoS pada routing protocol AODV dan DSDV dengan parameter yang di uji adalah Packet Delivery Ratio, Throughput, dan end-to-end Delay. Hasil pengujian memperlihatkan bahwa masing-masing routing protocol yang diteliti, routing protocol AODV memiliki waktu yang lebih cepat dalam proses pengiriman packet ke node selanjutnya. Untuk jumlah paket yang terkirim routing protocol AODV lebih baik dibandingkan DSDV.


2019 ◽  
Vol 1 (1) ◽  
pp. 77-85
Author(s):  
Yunia Puspita Wulandari ◽  
Andy Hidayat Jatmika ◽  
Fitri Bimantoro

Mobile Ad-Hoc Network (MANET) is a development of the Ad-Hoc Network, where the nodes of this network have dynamic mobility. There are several types of routing protocols in MANET, one of which is AOMDV. Route discovery on the AOMDV routing protocol is done by calculating the distance based on the number of hops. If the number of hops increased, it may cause a considerable delay and a decrease in throughput. This study compares the performance of the AOMDV routing protocol with the Path Aware-AOMDV (PA-AOMDV) routing protocol. PA-AOMDV routing protocol is obtained through modifications to the performance of the AOMDV protocol with the Path Aware SHORT algorithm. The Path Aware SHORT algorithm is a method to reduce the number of hops. SHORT improves routing optimization by monitoring routes and optimizing these routes that have better paths. The performance of both protocols will be seen based on four parameters, namely throughput, average end-to-end delay, packet delivery ratio, and routing overhead. Result shows that the throughput increased for 50 nodes is 61,84% and for 100 nodes is 45,2%, average end-to-end delay decreased for 50 nodes is 0,066% and for 100 nodes 0,12%, packet delivery ratio increased for 50 nodes is 60,87% and for 100 nodes 82,02%, and routing overhead decreased for 50 nodes is 67,07% and 100 nodes 45,36%.


Author(s):  
Anitha S, Et. al.

The efficiency of selecting the cluster head plays a major role in resolving the complexities faced in network management aiming to improve the longevity of sensors in the network. The clustering process is followed by selecting proper cluster heads with the consideration of energy conservation among participant nodes. While coming to security concept on WSN, the trust based cluster head selection is significant with the assumption of cooperation of all sensor nodes. In view of this assumption, the traditional methods could not help in defining the ideal cluster head of the network. This work proposes Voronoi Clustered Secure Contextual Cryptographic Algorithm (VC-SCCA) by combining Voronoi method for clustering process and cryptographic algorithm for secure data transmission. This is considered as two-tier architecture whereas, clustering takes place in first tier and encryption along with decryption takes place in the second tier. The proposed algorithm is compared with two state-of-art methods such as, Secured WSN (SeC‐WSN) and Taylor based Cat Salp Swarm Algorithm (Taylor C-SSA) in terms of energy consumption, Packet Delivery Ratio (PDR), network lifetime, encryption time and decryption time. As a result, the proposed VC-SCCA achieves 53.2% of energy consumption, 98.6% of packet delivery ratio, 97.5% of network lifetime, 62.8sec of encryption time and 71.2sec decryption time.


Sign in / Sign up

Export Citation Format

Share Document