IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v5y2009i1p25-25.html
   My bibliography  Save this article

Intersection-Aware Channel Assignment and Routing in Multi-Channel Multi-Hop Wireless Networks with a Single Transceiver

Author

Listed:
  • Huang Chuanhe
  • Cheng Yong
  • Yang Ling
  • Shi Wenming
  • Zhou Hao

Abstract

This article proposes an intersection-aware channel assignment and routing protocol for wireless ad hoc networks with a single transceiver. This protocol increases the network capacity of an IEEE 802.11 network by exploiting frequency diversity. Using the proposed protocol, multiple communications can simultaneously take place in a region without interfering with each other. However, it must avoid a multi-channel hidden terminal problem for designing channel assignment and routing protocol. This paper considers issues regarding multiple channels at the network layer, assuming a single channel MAC protocol such as IEEE 802.11 DCF. Also, the proposed protocol assumes that each node in the network is equipped with a single transceiver. This set of assumptions is very practical, because most devices have a single wireless card implementing the IEEE 802.11 DCF protocol. Each node uses modular exponentiation congruence to represent the channel schedule, which assures that each pair of nodes has common channels for communication in every cycle. Each node switches across channels in such a manner that each pair of nodes works on the same channel when they desire to communicate; otherwise they work on a different channel, and hence do not interfere with each other. However, for the intersecting node, there is no benefit in using single radio multiple channels since the capacity around the intersection node can at most be O (W), W is the link capacity, regardless of the number of channels. The protocol lets the intersecting node always work on the same channel whereas the nonintersecting node can work on different channels. The two states for every node in the network are the state of an intersecting node and the state of non-intersecting node. Using the proposed protocol, nodes discover multiple routes to the destination node; the node selects the path with most intersecting nodes to avoid more nodes become intersecting nodes when the number of flows increases greatly. Once a node becomes an intersecting node, it will work on the same channel in a cycle. Simulation results show that the proposed protocol significantly increases the aggregate end-to-end throughput and network capacity greatly over a single-channel protocol and some other channel assignment and routing protocols in several wireless networking scenarios.

Suggested Citation

  • Huang Chuanhe & Cheng Yong & Yang Ling & Shi Wenming & Zhou Hao, 2009. "Intersection-Aware Channel Assignment and Routing in Multi-Channel Multi-Hop Wireless Networks with a Single Transceiver," International Journal of Distributed Sensor Networks, , vol. 5(1), pages 25-25, January.
  • Handle: RePEc:sae:intdis:v:5:y:2009:i:1:p:25-25
    DOI: 10.1080/15501320802520563
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320802520563
    Download Restriction: no

    File URL: https://libkey.io/10.1080/15501320802520563?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:5:y:2009:i:1:p:25-25. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.