An Algorithm to Reduce Transmission Time Delay for UAV Ad hoc Network

2021 ◽  
pp. 2061-2071
Author(s):  
Chen Ping ◽  
Huang Yan ◽  
Deng Yongjun
2014 ◽  
Vol 602-605 ◽  
pp. 3721-3726
Author(s):  
Wei Quan Wang ◽  
Zu Xun Song ◽  
Xiao Fei Mao

Nowadays, there are so many requirements for time-sensitive in designing Ad Hoc network. However, the existing protocols of MAC, such as ALOHA、CSMA、IEEE802.11 etc. which use the “back-off” to avoid collision, or use the “hand shaking” to order the channel bring the time-delay to MAC. The paper promote a MAC protocol named ISA-MAC which adopts FH-TH combine concatenated coding to relieve channel-collision, improve the efficiency of communication and provide the ability “sending at anytime”.


2015 ◽  
Vol 2015 ◽  
pp. 1-13
Author(s):  
Aslinda Hassan ◽  
Mohamed H. Ahmed ◽  
M. A. Rahman

In a sparse vehicular ad hoc network, a vehicle normally employs a carry and forward approach, where it holds the message it wants to transmit until the vehicle meets other vehicles or roadside units. A number of analyses in the literature have been done to investigate the time delay when packets are being carried by vehicles on both unidirectional and bidirectional highways. However, these analyses are focusing on the delay between either two disconnected vehicles or two disconnected vehicle clusters. Furthermore, majority of the analyses only concentrate on the expected value of the end-to-end delay when the carry and forward approach is used. Using regression analysis, we establish the distribution model for the time delay between two disconnected vehicle clusters as an exponential distribution. Consequently, a distribution is newly derived to represent the number of clusters on a highway using a vehicular traffic model. From there, we are able to formulate end-to-end delay model which extends the time delay model for two disconnected vehicle clusters to multiple disconnected clusters on a unidirectional highway. The analytical results obtained from the analytical model are then validated through simulation results.


2013 ◽  
Vol 11 (6) ◽  
pp. 2691-2702
Author(s):  
Mahmoud Mir Ali Al-Quzwini ◽  
Zeinab R. Khaleel

Mobile Ad-Hoc Networks (MANETS) is a collection of wireless mobile nodes that are able to dynamically form a temporary network without any aid from fixed infrastructure or centralized administration due to no wired backbone.Ad Hoc networks are formed spontaneously and the nodes are highly mobile.Thispaper presents performance evaluations, comparisons, andanalysis for three routing protocols (AODV, DSR, and OLSR)to bring out their relative meritsundervarying network size and mobilitywith  various speed and pause times. The simulation is carried out using OMNET++ simulator based on the quantitative basic parameters like throughput, Packet transmission Ratio (PTR),packet transmission time delay and protocol overhead .The  nodes are distributed randomly in a grid network topology and mobile nodes moving using Random Waypoint mobility models. The results demonstrate that, undervarious node speeds and pause timesfor different network size, AODVoutperforms DSR and OLSR protocols, with respect to networkthroughput (by 0.9% and 4.4%, respectively). For protocoloverhead,DSR has lower overhead than both AODV and OLSR protocols (by 13.4% and 65.5%, respectively). In contrast, thepacket transmission time delay when using OLSR is shorter than whenusing both AODV (by 81.7%) and DSR (by 76.7%). 


2019 ◽  
Vol 8 (2) ◽  
pp. 1298-1305

In WAHN nodes are ready to broadcast data packets frequently with maximum usage of energy, unsecure and nodes resource utilization is important they are not controlled bycertificate revocation scheme. Key mixing is difficult to take much time, so sometime the routing nodes, work as well and they are changed to fake mode depending on its behavior. It affects the security of packet transmission.Nodes transmission is broken by wrong link established by intruder nodes. Proposed an Improvedprovokingtrustworthy Routing (IPTR) schemetomeasure the nodes behavior, attacker works good else bad alternatively so they are easily identified based on historical information for particular node which are present in routing path.The warning packet arising algorithm is implemented to provide warning message to next neighbor node in routing path. Current node changes its operating mode to bad state gives a warning signal, so time delay is reduced and improve network lifetime


2012 ◽  
Vol 3 (5) ◽  
pp. 207-209
Author(s):  
Nayana K Nayana K ◽  
◽  
Dr.Sangeethaa Sukumaran
Keyword(s):  

Author(s):  
Zheng WEN ◽  
Di ZHANG ◽  
Keping YU ◽  
Takuro SATO
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document