scholarly journals Distribution of the Maximum Waiting time of a Hello Message in Ad hoc Networks

2012 ◽  
Vol 47 (14) ◽  
pp. 1-5 ◽  
Author(s):  
Karima Adel-Aissanou ◽  
Djamil Aissani ◽  
Nathalia Djellab
Keyword(s):  
Ad Hoc Networks ◽  
Waiting Time ◽  
Ad Hoc ◽  
Distribution Of The Maximum ◽  
Hello Message ◽  
Hoc Networks

THEORETICAL ANALYSIS OF MEAN WAITING TIME FOR MESSAGE DELIVERY IN LATTICE AD HOC NETWORKS

2010 ◽  
Vol 19 (08) ◽  
pp. 1711-1741
Author(s):  
AKIRA OTSUKA ◽  
KEISUKE NAKANO ◽  
KAZUYUKI MIYAKITA
Keyword(s):  
Ad Hoc Networks ◽  
Waiting Time ◽  
Ad Hoc ◽  
Waiting Times ◽  
Traffic Patterns ◽  
Mobile Nodes ◽  
Approximate Methods ◽  
Mean Waiting Time ◽  
The Mean ◽  
Hoc Networks

In ad hoc networks, the analysis of connectivity performance is crucial. The waiting time to deliver message M from source S to destination D is a measure of connectivity that reflects the effects of mobility, and some approximate methods have been proposed to theoretically analyze the mean waiting time in one-dimensional ad hoc networks that consist of mobile nodes moving along a street. In this paper, we extend these approximate methods to analyze the mean waiting time in two-dimensional networks with a lattice structure with various flows of mobile nodes. We discuss how the mean waiting times behave in such complicated street networks and how to approximate two kinds of mean waiting times. We show that our approximate methods can successfully compute the mean waiting times for even traffic patterns and roughly estimate them for uneven traffic patterns in two-dimensional lattice networks. In these analyses, we consider two shadowing models to investigate how shadowing affects the waiting time. We also discuss the effect of different positions of S on the mean waiting time.

scholarly journals Regular-hexagon-equilateral-triangle area grouping–based broadcast protocol for safety message in urban vehicular ad hoc networks

2017 ◽  
Vol 13 (1) ◽  
pp. 155014771668382
Author(s):  
Xiufeng Wang ◽  
Mingcheng Qu ◽  
Gang Cui ◽  
Moshe Yan ◽  
Nwe Nwe Htay Win ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Waiting Time ◽  
Equilateral Triangle ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Relay Node ◽  
Regular Hexagon ◽  
Grouping Method ◽  
Hoc Networks ◽  
Broadcast Protocol

Road-based directional broadcast protocols are proposed in the literatures to offset efficiency of message dissemination of traditional broadcast protocol in urban vehicular ad hoc networks. However, these protocols cannot provide enough reliability and efficiency for vehicles’ misclassification at intersection or on straight road. Therefore, we present regular-hexagon-equilateral-triangle area grouping–based broadcast protocol for urban vehicular ad hoc networks. The area covered by relay node is averagely divided using regular-hexagon-equilateral-triangle, and vehicles are grouped according to the area that they reside. The algorithm for constructing regular-hexagon-equilateral-triangle is proposed. We adopt same vehicles’ grouping method at intersection and on straight road, and no neighbor list is maintained to identify road intersection. We design waiting time formula to calculate time for node forwarding message. It is ruled that node with waiting time dropping to zero first is defined as the relay node, and this relay node transmits message. So there is only one relay node which forwards message in each group. It also rules in regular-hexagon-equilateral-triangle area grouping–based broadcast protocol that each relay node forwards the same message only once, therefore, it limits redundant message retransmission. Using the vehicles’ grouping method and selection strategy of relay node as mentioned above, the proposed protocol enables message to be transmitted in different directions along different roads at the same time. Simulation indicates that our protocol has a better performance

Sign in / Sign up

Export Citation Format

Share Document