A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented. The proposed network supports multimedia traffic and relies on both time division and code division access schemes. This radio network is not supported by a wired infrastructure as conventional cellular systems are. Thus, it can be instantly deployed in areas with no infrastructure at all. By using a distributed clustering algorithm, nodes are organized into clusters. The clusterheads act as local coordinators to resolve channel scheduling, perform power measurement/control, maintain time division frame synchronization, and enhance the spatial reuse of time slots and codes. Moreover, to guarantee bandwidth for real time traffic, the architecture supports virtual circuits and allocates bandwidth to circuits at call setup time. The network is scalable to large numbers of nodes, and can handle mobility. Simulation experiments evaluate the performance of the proposed scheme in static and mobile environments.

Multicluster, mobile, multimedia radio network

https://www.lk.cs.ucla.edu/data/files/Kermani/Virtual%20Cut-through%20A%20New%20Computer%20Communication%20Switching.pdf

Virtual cut-through: A new computer communication switching technique

The design and analysis of routing protocols is an important issue in dynamic networks such as packet radio and ad-hoc wireless networks Most conventional protocols exhibit their least desirable behavior for highly dynamic interconnection topologies We propose a new methodology for routing and topology information maintenance in dynamic networks The basic idea behind the protocol is to divide the graph into a number of overlapping clusters A change in the network topology corresponds to a change in cluster membership We present algorithms for creation of clusters, as well as algorithms to maintain them in the presence of various network events Compared to existing and conventional routing protocols, the proposed cluster-based approach incurs lower overhead during topology updates and also has quicker reconvergence The effectiveness of this approach also lies in the fact that existing routing protocols can be directly applied to the network --- replacing the nodes by clusters

A cluster-based approach for routing in dynamic networks

Packet switching offers attractive advantages over the more eonventional circuit-switched scheme, namely, flexibility in setting up user connections and more efficient use of resources after the connection is established. However, if user demands are allowed to exceed the system capacity, unpleasant congestion effects occur which rapidly neutralize the delay and efficiency advantages. Congestion can be eliminated by using an appropriate set of traffic monitoring and control procedures called flow control procedures. Flow control can be exercised at various levels in a packet network. The following levels are identified and discussed in this paper: hop level, entry-to-exit level, network access level, and transport level. For each level, the most representative techniques are surveyed and compared. Furthermore, the interaction between the different levels is discussed.

Flow Control: A Comparative Survey

Hierarchical routing for large networks Performance evaluation and optimization

: This research deals with the specification, analysis and evaluation of some routing and topology design procedures for large store and forward packet switched computer communication networks. The procedures studied are an extension of present techniques and rely on a hierarchical clustering of the network nodes.

Farouk Kamoun

Papers

Design considerations for large computer communication networks.