Self-Organizing Network Introduction

Ad-hoc networks are a hybrid of mobile communication and computer networks, where information exchange employs packet switching mechanisms from computer networks. User terminals are portable and movable, with each terminal in the ad-hoc network serving both router and host functions. As a host, the terminal must run various user-facing applications, such as editors and browsers; as a router, it must run corresponding routing protocols, forwarding data packets and maintaining routes based on routing strategies and tables. This necessitates the node to implement suitable routing protocols. The goal of ad-hoc network routing protocols is to be fast, accurate, and efficient, requiring the quick discovery of accurate and usable routing information within the shortest possible time, while adapting to rapid changes in network topology. Additionally, they aim to minimize extra latency and the maintenance of routing control information, reducing the overhead of routing protocols to accommodate the limitations of mobile terminals in terms of computational power, storage space, and power supply.

The design of ad-hoc network routing protocols primarily involves three approaches: (1) Modify existing conventional routing protocols to meet the needs of ad-hoc networks, such as the DSDV (Destination Sequenced Distance Vector) protocol, which is derived from the common RIP protocol; (2) Employ on-demand routing principles, avoiding periodic broadcast of routing information to maintain routing tables. Requests for routing are only made when establishing routes are needed, effectively reducing consumption of network resources. Examples include Dynamic Source Routing (DSR) and AODV (Ad-hoc On-demand Distance Vector); (3) QoS-based routing, where nodes select a route most likely to meet user QoS requirements based on collected network resource information (not just hop count), such as LS-QoS (Link State QoS).Ink State-QoS Protocol

Table-driven routing protocols are suitable for conventional wired networks, but for wireless ad-hoc networks, due to the many inherent limitations of the network, periodic broadcast control packets consume a significant amount of bandwidth, and maintaining routing tables consumes substantial resources on mobile terminals. The rapid changes in topology cause many routing pieces to become outdated quickly, resulting in resource waste. Even when modifying table-driven protocols for wireless ad-hoc networks, several popular on-demand routing protocols remain prevalent. DSR employs source routing mechanisms, requiring complete path information in each packet header, significantly increasing the overhead of the routing protocol. When a link failure occurs and routing needs to be re-established, the broken link information must be sent back to the source node, which then initiates the routing discovery process anew, causing considerable delay. AODV addresses this issue by using hop-by-hop forwarding mechanisms, but it requires periodic Hello messages to maintain node connection states, adding to the overhead and, in case of link failures, it rebuilds routes in a manner similar to DSR. The TORA protocol, in addition to its high overhead, requires specialized hardware support, such as GPS devices for network-wide node time synchronization, and it needs two separate wireless channels for data and control, significantly limiting its application scope.

The characteristics of self-organized networks include:

Equivalence: All nodes have equal roles in the network, freely joining or leaving without notifying other nodes, without affecting the stability of the entire network.

Dynamic Topology Structure: As nodes can move freely and be turned on/off, the topology of self-organizing networks is typically dynamic, supporting various networking methods such as point-to-point, star, and mesh networks.

Decentralization: In self-organizing networks, there is no central controller; the behavior of all nodes is coordinated through layered protocols and distributed algorithms.

Resilience: Due to the independence and equality among nodes, a failure of a node in an ad-hoc network does not affect the operation of the entire network.