scholarly journals An Upper Bound on Network Size in Mobile Ad-Hoc Networks

2008 ◽  
Author(s):  
Michael Pascoe ◽  
Javier Gomez ◽  
Victor Rangel ◽  
Miguel Lopez-Guerrero
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Upper Bound ◽  
Ad Hoc ◽  
Network Size ◽  
Mobile Ad Hoc ◽  
Hoc Networks

scholarly journals Number of Node Estimation in Mobile Ad Hoc Networks

2017 ◽  
Vol 11 (6) ◽  
pp. 65
Author(s):  
Saher Manaseer ◽  
Ibrahem Alhabash
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Network Size ◽  
Centralized Control ◽  
Hop Count ◽  
Mobile Ad Hoc ◽  
Hoc Networks

<p class="0keywords">Mobile Ad hoc networks do not have any form of centralized control as per their definition. Therefore, many challenges face the development of efficient protocols for such networks. One of the main challenges is the difficulty of extracting the total number of nodes in the network, this paper aims to find an estimate for this number using the average hop count for messages exchanged in the network. Experiments of this paper are conducted on Ad Hoc networks under DSR and AODV routing protocols. Results show a relation between network size and average hop count that can be used to predict the number of nodes in the network.<strong></strong></p>

scholarly journals An upper bound for the capacity of distributed MIMO mobile Ad Hoc networks

2006 ◽  
Author(s):  
Renato M. de Moraes ◽  
Bartolomeu F. Uchoa Filho ◽  
Hamid R. Sadjadpour ◽  
J.J. Garcia-Luna-Aceves
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Upper Bound ◽  
Ad Hoc ◽  
Mobile Ad Hoc ◽  
Hoc Networks

scholarly journals Progressive AODV: A Routing Algorithm Intended for Mobile Ad-Hoc Networks

2019 ◽  
Vol 9 (2) ◽  
pp. 70-74
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Network Size ◽  
Base Station ◽  
Ad Hoc Routing ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc networks are an independent wireless network that is built without permanent infrastructure and base station support. Each node in the network uses a wireless connection for connections and acts not only as an end system but also as a path to accelerating packets. Meanwhile, the network nodes are mobile and can move in each path with changing steps, creating a great dynamic of the network. Therefore, the protocols set for general ad hoc networks are inappropriate for such a situation. In addition, the performance of ad hoc routing protocols decreases with increasing network size. In this context, suggest a new way to extend the recital of routing in MANETs: the on-demand Progressive Distance Vector (PAODV). It is a modified variant of the standard AODV routing protocol, which shrinks the dynamic path when an optimal path exists and switches the traffic to it. Simulation studies with NS2 show that the proposed method improves network performance as network size, weight, or flexibility increase.

Classification of Attacks Against the Mobile AD Hoc Networks

2012 ◽  
Vol 2 (3) ◽  
pp. 77-80
Author(s):  
V. Karamchand Gandhi ◽  
◽  
D.P.Jeyabalan D.P.Jeyabalan
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Passive Coding-Based Epidemic Routing in Sparsely Populated Mobile Ad hoc Networks

2012 ◽  
Vol E95-B (1) ◽  
pp. 169-177
Author(s):  
Yasushi YAMAWAKI ◽  
Takahiro MATSUDA ◽  
Tetsuya TAKINE
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Epidemic Routing ◽  
Mobile Ad Hoc ◽  
Hoc Networks
Sign in / Sign up

Export Citation Format

Share Document