Broadcasting is the process of sending a message from one node to all the other nodes in a network. Simple flooding is the simplest form of broadcasting in ad hoc wireless networks. Simple flooding provides important control, route discovery, and network information update functionality for unicast and multicast protocols. However, simple flooding generates too many broadcast message duplications in ad hoc wireless networks. Minimum spanning tree (MST)-based flooding has traditionally been used in networks to reduce the broadcast duplications by determining broadcast trees using global topology information. However, MST-based flooding still generates a lot of broadcast traffic duplications. In this paper, we propose an efficient type of flooding, called “minimizing re-transmissions” (MRT), to significantly reduce the broadcast duplications. The purpose of MRT is to minimize the number of retransmitting nodes in an ad hoc wireless network based on the network's link state information. This advantage of minimizing the number of retransmitting nodes significantly reduces broadcast message duplications in ad hoc wireless networks. The performance of MRT is analyzed, evaluated, and compared to that of the simple flooding and the MST-based flooding. Simulations are conducted using the OMNet++ Simulator in order to validate the traffic performance analysis. For our sample network, analytical and simulation results show that MRT reduces broadcast message duplications by about 80% compared to simple flooding and by about 68% compared to MST-based flooding, thus saving a significant amount of network bandwidth and energy. MRT can be used in static or mobile ad hoc wireless networks and in wired networks to implement scalable broadcast communications.

In ad hoc wireless networks, wireless terminals can autonomously construct and can maintain the network. They communicate with some neighbor terminals, exchange network information and determine routes for packets on the multi-hop wireless network. Flexible Radio Network (FRN), one of the ad hoc wireless network systems, adopts a proprietary protocol that provides a multiple routes management and a packet retransmission mechanism against packet transmission errors. This system is a commercial product that has been in use in a recent few years. In this paper, we first evaluate the performance through simulations for data-link protocol and routing protocol of the FRN to clarify its basic properties. Furthermore, we propose some techniques that enhance its performance and solve problems on the protocols. We show how they improve the system performance through simulations and analyses.

The emergence of nomadic applications have recently generated a lot of interest in wireless network infrastructures which support multimedia services. In this paper, we propose a bandwidth routing algorithm for multimedia support in a multihop wireless network. This network can be interconnected to wired networks (e. g. ATM or Internet) or stand alone. Our bandwidth routing includes bandwidth calculation and reservation schemes. Under such a routing algorithm, we can derive a route to satisfy bandwidth requirement for quality-of-service (QoS) constraint. At a source node, the bandwidth information can be used to decide to accept a new call or not immediately. This is specially important to carry out a fast handoff when interconnecting to an ATM backbone infrastructure. It enables an efficient call admission control. The simulation results show that the bandwidth routing algorithm is very useful in extending the ATM virtual circuit service to the wireless network. Different types of QoS traffic can be integrated in such a dynamic radio network with high performance.