World Library  
Flag as Inappropriate
Email this Article

Wireless ad hoc network

Article Id: WHEBN0006624928
Reproduction Date:

Title: Wireless ad hoc network  
Author: World Heritage Encyclopedia
Language: English
Subject: Wireless mesh network, Wireless LAN, Multipoint relay, Adaptive quality of service multi-hop routing, Jit Bose
Collection: Wireless Networking
Publisher: World Heritage Encyclopedia

Wireless ad hoc network

A wireless ad hoc network (WANET) is a decentralized type of wireless network.[1][2] The network is ad hoc because it does not rely on a pre existing infrastructure, such as routers in wired networks or access points in managed (infrastructure) wireless networks. Instead, each node participates in routing by forwarding data for other nodes, so the determination of which nodes forward data is made dynamically on the basis of network connectivity. In addition to the classic routing, ad hoc networks can use flooding for forwarding data.

Wireless mobile ad hoc networks are self-configuring, dynamic networks in which nodes are free to move. Wireless networks lack the complexities of infrastructure setup and administration, enabling devices to create and join networks "on the fly" - anywhere, anytime. [3]


  • Introduction 1
  • History 2
  • Application 3
    • mobile ad hoc networks (MANET) 3.1
      • Vehicular Ad hoc Networks (VANETs) 3.1.1
      • Smart Phone Ad hoc Networks (SPANs) 3.1.2
      • Internet based mobile ad hoc networks (iMANETs) 3.1.3
      • Military / Tactical MANETs 3.1.4
  • Pros and Cons 4
    • Pros 4.1
    • Cons 4.2
  • Protocol stack 5
  • Routing 6
    • Proactive Routing 6.1
      • Distance Vector Routing 6.1.1
    • Reactive Routing 6.2
      • Flooding 6.2.1
    • Hybrid Routing 6.3
    • Position-based Routing 6.4
  • Technical requirements 7
  • Medium-access control 8
  • Mathematical models 9
  • Security 10
  • Simulation of wireless ad hoc networks 11
  • See also 12
  • References 13


A wireless ad-hoc network, also known as IBSS - Independent Basic Service Set, is a computer network in which the communication links are wireless. The network is ad-hoc because each node is willing to forward data for other nodes, and so the determination of which nodes forward data is made dynamically based on the network connectivity. This is in contrast to older network technologies in which some designated nodes, usually with custom hardware and variously known as routers, switches, hubs, and firewalls, perform the task of forwarding the data. Minimal configuration and quick deployment make ad hoc networks suitable for emergency situations like natural or human-induced disasters, military conflicts.[4]


The earliest wireless ad-hoc networks were called "packet radio" networks, and were sponsored by Defense Advanced Research Projects Agency (DARPA) in the early 1970s. Bolt, Beranek and Newman Technologies (BBN) and SRI International designed, built, and experimented with these earliest systems. Experimenters included Jerry Burchfield, Robert Kahn, and Ray Tomlinson of later TEN-EXtended (TENEX), Internet and email fame. Similar experiments took place in the Ham radio community. It is interesting to note that these early packet radio systems predated the Internet, and indeed were part of the motivation of the original Internet Protocol suite. Later DARPA experiments included the Survivable Radio Network (SURAN) project, which took place in the 1980s. Another third wave of academic activity started in the mid-1990s with the advent of inexpensive 802.11 radio cards for personal computers. Current wireless ad-hoc networks are designed primarily for military utility.[5]


The decentralized nature of wireless ad-hoc networks makes them suitable for a variety of applications where central nodes can't be relied on and may improve the scalability of networks compared to wireless managed networks, though theoretical and practical limits to the overall capacity of such networks have been identified. Minimal configuration and quick deployment make ad hoc networks suitable for emergency situations like natural disasters or military conflicts. The presence of dynamic and adaptive routing protocols enables ad hoc networks to be formed quickly. Wireless ad-hoc networks can be further classified by their application:

mobile ad hoc networks (MANET)

A mobile ad hoc network (MANET) is a continuously self-configuring, infrastructure-less network of mobile devices connected without wires.

Vehicular Ad hoc Networks (VANETs)

are used for communication between vehicles and roadside equipment. Intelligent vehicular ad hoc networks (InVANETs) are a kind of artificial intelligence that helps vehicles to behave in intelligent manners during vehicle-to-vehicle collisions, accidents.

Smart Phone Ad hoc Networks (SPANs)

leverage the existing hardware (primarily Bluetooth and Wi-Fi) in commercially available smart phones to create peer-to-peer networks without relying on cellular carrier networks, wireless access points, or traditional network infrastructure.

Internet based mobile ad hoc networks (iMANETs)

are ad hoc networks that link mobile nodes and fixed Internet-gateway nodes. One implementation of this is Persistent System's CloudRelay.

Military / Tactical MANETs

are used by military units with emphasis on security, range, and integration with existing systems.

A mobile ad-hoc network (MANET) is an ad-hoc network but an ad-hoc network is not necessarily a MANET.

Pros and Cons


No expensive infrastructure must be installed

Use of unlicensed frequency spectrum

Quick distribution of information around sender


All network entities may be mobile ⇒ very dynamic topology

Network functions must have high degree of adaptability

No central entities ⇒ operation in completely distributed manner

Protocol stack

A major limitation with mobile nodes is that they have high mobility, causing links to be frequently broken and reestablished. Moreover, the bandwidth of a wireless channel is also limited, and nodes operate on limited battery power, which will eventually be exhausted. Therefore, the design of a mobile ad hoc network is highly challenging, but this technology has high prospects to be able to manage communication protocols of the future. The cross-layer design deviates from the traditional network design approach in which each layer of the stack would be made to operate independently. The modified transmission power will help that node to dynamically vary its propagation range at the physical layer. This is because the propagation distance is always directionally proportional to transmission power. This information is passed from the physical layer to the network layer so that it can take optimal decisions in routing protocols. A major advantage of this protocol is that it allows access of information between physical layer and top layers (MAC and network layer).


Proactive Routing

This type of protocols maintains fresh lists of destinations and their routes by periodically distributing routing tables throughout the network. The main disadvantages of such algorithms are:

1. Respective amount of data for maintenance.

2. Slow reaction on restructuring and failures.

Example: "Optimized Link State Routing Protocol" OLSR

Distance Vector Routing

As in a fix net nodes maintain routing tables. Distance-vector protocols are based on calculating the direction and distance to any link in a network. "Direction" usually means the next hop address and the exit interface. "Distance" is a measure of the cost to reach a certain node. The least cost route between any two nodes is the route with minimum distance. Each node maintains a vector (table) of minimum distance to every node. The cost of reaching a destination is calculated using various route metrics. RIP uses the hop count of the destination whereas IGRP takes into account other information such as node delay and available bandwidth.

Reactive Routing

This type of protocol finds a route on demand by flooding the network with Route Request packets. The main disadvantages of such algorithms are:

1. High latency time in route finding.

2. Excessive flooding can lead to network clogging.[6]

Example: "Ad hoc On-Demand Distance Vector" (AODV)


Is a simple routing algorithm in which every incoming packet is sent through every outgoing link except the one it arrived on. Flooding is used in bridging and in systems such as Usenet and peer-to-peer file sharing and as part of some routing protocols, including OSPF, DVMRP, and those used in Wireless ad hoc networks.

Hybrid Routing

This type of protocol combines the advantages of proactive and reactive routing. The routing is initially established with some proactively prospected routes and then serves the demand from additionally activated nodes through reactive flooding. The choice of one or the other method requires predetermination for typical cases. The main disadvantages of such algorithms are: 1. Advantage depends on number of other nodes activated. 2. Reaction to traffic demand depends on gradient of traffic volume.[7]

Example: "Zone Routing Protocol" (ZRP)

Position-based Routing

Position-based routing methods use information on the exact locations of the nodes. This information is obtained for example via a GPS receiver. Based on the exact location the best path between source and destination nodes can be determined.

Example: "Location-Aided Routing in mobile ad hoc networks" (LAR)

Technical requirements

An ad hoc network is made up of multiple “nodes” connected by “links.”

Links are influenced by the node's resources (e.g., transmitter power, computing power and memory) and behavioral properties (e.g., reliability), as well as link properties (e.g. length-of-link and signal loss, interference and noise). Since links can be connected or disconnected at any time, a functioning network must be able to cope with this dynamic restructuring, preferably in a way that is timely, efficient, reliable, robust, and scalable.

The network must allow any two nodes to communicate by relaying the information via other nodes. A “path” is a series of links that connects two nodes. Various routing methods use one or two paths between any two nodes; flooding methods use all or most of the available paths.[8]

Medium-access control

In most wireless ad hoc networks, the nodes compete for access to shared wireless medium, often resulting in collisions (interference). Using cooperative wireless communications improves immunity to interference by having the destination node combine self-interference and other-node interference to improve decoding of the desired signal.

Mathematical models

The traditional model is the random geometric graph.

A randomly constructed geometric graph drawn inside a square

These are graphs consisting of a set of nodes placed according to a point process in some usually bounded subset of the n-dimensional plane, mutually coupled according to a boolean probability mass function of their spatial separation (see e.g. unit disk graphs). One can then study network observables (such as connectivity,[9] centrality[10] or the degree distribution[11]) from a graph-theoretic perspective.


Microsoft does not allow advanced encryption and security protocols for wireless Ad hoc networks on Windows. In fact, the security hole provided by Ad hoc networking is not only the Ad hoc network itself, but the bridge it provides into other networks (see Ad hoc networks in the article Wireless security). Most ad hoc networks do not implement any network access control, leaving these networks vulnerable to resource consumption attacks where a malicious node injects packets into the network with the goal of depleting the resources of the nodes relaying the packets. To thwart or prevent such attacks, it is necessary to employ authentication mechanisms that ensure that only authorized nodes can inject traffic into the network.[12]

Simulation of wireless ad hoc networks

One key problem in Wireless Ad Hoc networks is foreseeing the variety of possible situations that can occur. As a result, Modeling and Simulation using extensive parameter sweeping and what-if analysis becomes an extremely important paradigm for use in ad hoc networks. Traditional M&S tools include NS2,(and recently NS3), OPNET Modeler, and NetSim.

However, these tools focus primarily on the simulation of the entire protocol stack of the system. Although this can be important in the proof-of-concept implementations of systems, the need for a more advanced simulation methodology is always there. Agent-based modeling and simulation offers such a paradigm. Not to be confused with multi-agent systems and intelligent agents, agent-based modeling[13] originated from social sciences, where the goal was to evaluate and view large-scale systems with numerous interacting "AGENT" or components in a wide variety of random situations to observe global phenomena. Unlike traditional AI systems with Intelligent agents, agent-based modeling is similar to the real world. Agent-based models are thus effective in modeling bio-inspired and nature-inspired systems. In these systems, the basic interactions of the components of the system, also called Complex Adaptive System, are simple but result in advanced global phenomena such as emergence.

See also


  1. ^ Chai Keong Toh Ad Hoc Mobile Wireless Networks, Prentice Hall Publishers , 2002.
  2. ^ C. Siva Ram Murthy and B. S. Manoj, Ad hoc Wireless Networks: Architectures and Protocols, Prentice Hall PTR, May 2004 [2]
  3. ^ 1. Chai Keong Toh. Ad Hoc Mobile Wireless Networks. United States: Prentice Hall Publishers, 2002.
  4. ^ Ozan, K. Tonguz, Gianluigi Ferrari, John Wiley & Sons. ed. Ad Hoc Wireless Networks: A Communication-Theoretic Perspective,2006
  5. ^ American Radio Relay League. "ARRL's VHF Digital Handbook", p 1-2, American Radio Relay League,2008
  6. ^ C. Perkins, E. Royer and S. Das: Ad hoc On-demand Distance Vector (AODV) Routing, RFC 3561
  7. ^ Roger Wattenhofer. Algorithms for Ad Hoc Networks.
  8. ^ Wu S.L., Tseng Y.C., "Wireless Ad Hoc Networking, Auerbach Publications", 2007 ISBN 978-0-8493-9254-2
  9. ^ M.D. Penrose. "Connectivity of Soft Random Geometric Graphs". 
  10. ^ A.P. Giles, O. Georgiou, C.P. Dettmann. "Betweenness Centrality in Dense Random Geometric Networks". 
  11. ^ M.D. Penrose (2003). "Random Geometric Graphs". Oxford University Press. 
  12. ^
  13. ^ Muaz Niazi, Amir Hussain (March 2009). "Agent based Tools for Modeling and Simulation of Self-Organization in Peer-to-Peer, Ad Hoc and other Complex Networks, Feature Issue" (PDF). IEEE Communications Magazine. 47 No.3. pp. 163–173. 
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.