Overview and Challenges of Multi-Interface and Multi-Channel Multi-Hop Wireless Networks

Overview and Challenges of Multi-Interface and Multi-Channel Multi-Hop Wireless Networks

Carine Toham (Orange Labs, France) and François Jan (Orange Labs, France)
Copyright: © 2011 |Pages: 7
DOI: 10.4018/978-1-60566-250-3.ch003
OnDemand PDF Download:
No Current Special Offers


The throughput improvement problem in wireless networks is considered. The main causes of that issue is the shared wireless medium and node spatial problems which either prevent some nodes from transmitting or jam their transmissions. We consider the use of both nodes equipped with multiple network cards and multiple channels as means to improve the throughput in wireless networks. That approach implies to handle some challenges namely channel distribution between the node interfaces and routing in such channel-diverse networks. This chapter analyzes some solutions proposed to deal with these challenges so that the throughput is improved. Some possible orientations are also discussed based on the advantages and drawbacks observed in existing works.
Chapter Preview


Lets us firstly define some key terms which are used later.

A collision domain is a set of nodes that are in the interference range of each other. These neighbor nodes cannot use the channel simultaneously. So they compete for accessing it.

The channel assignment is the process of distributing channels between node network cards. It is run in a network in which multiple channels are available. Later, the term interface refers to a network card.

The deafness problem occurs when a node neighbor cannot join it on their expected communication channel.

Routing is the process of forwarding data packets from a source node to a destination one. The entity that handles this process is called a routing protocol. To convey the data, these routing protocols have to select a sequence of intermediate nodes (a path) based on different criteria. These paths are called routes and the criteria are the metrics. A metric example is the shortest-path which means that the used criterion is the minimum hop number.

Complete Chapter List

Search this Book: