File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TWC.2009.080174
- Scopus: eid_2-s2.0-65949084718
- WOS: WOS:000265373100021
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: J-CAR: An efficient joint channel assignment and routing protocol for IEEE 802.11-based multi-channel multi-interface mobile Ad Hoc networks
Title | J-CAR: An efficient joint channel assignment and routing protocol for IEEE 802.11-based multi-channel multi-interface mobile Ad Hoc networks |
---|---|
Authors | |
Keywords | Ieee 802.11 Joint Channel Assignment Multiple Channels Multiple Interfaces Routing |
Issue Date | 2009 |
Citation | Ieee Transactions On Wireless Communications, 2009, v. 8 n. 4, p. 1706-1715 How to Cite? |
Abstract | The capacity of an IEEE 802.11-based multi-hop wireless network is limited. By effectively utilizing multiple non-overlapping channels and multiple interfaces, collision and co-channel interference can be reduced. This allows more concurrent transmissions and thus enhances the network capacity. In this paper, we introduce an efficient distributed joint channel assignment and routing protocol, called J-CAR1. Unlike existing schemes, J-CAR allows a data interface to dynamically change its working mode between send and receive on a call-by-call basis, which enhances the utilization of both interface and channel. In J-CAR, channels are negotiated and assigned to active links in conjunction with the on-demand routing process. At each hop, J-CAR conducts a local optimization by selecting the least interfered channel according to the channel interference index. The channel interference index is designed by taking both the protocol and physical interference models into consideration. To find the least interfered path for network load balancing on a global scale, J-CAR employs a length-constrained widest-path routing. The width of a path is determined by the interference level of its bottleneck link. With an adjustable threshold on the path length (with respect to the shortest-path), the excessively long path can also be avoided. We show that with a comparable complexity as the existing schemes, J-CAR provides much higher system goodputs and shorter end-to-end packet delays. © 2006 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/155518 |
ISSN | 2023 Impact Factor: 8.9 2023 SCImago Journal Rankings: 5.371 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chiu, HS | en_US |
dc.contributor.author | Yeung, KL | en_US |
dc.contributor.author | Lui, KS | en_US |
dc.date.accessioned | 2012-08-08T08:33:54Z | - |
dc.date.available | 2012-08-08T08:33:54Z | - |
dc.date.issued | 2009 | en_US |
dc.identifier.citation | Ieee Transactions On Wireless Communications, 2009, v. 8 n. 4, p. 1706-1715 | en_US |
dc.identifier.issn | 1536-1276 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/155518 | - |
dc.description.abstract | The capacity of an IEEE 802.11-based multi-hop wireless network is limited. By effectively utilizing multiple non-overlapping channels and multiple interfaces, collision and co-channel interference can be reduced. This allows more concurrent transmissions and thus enhances the network capacity. In this paper, we introduce an efficient distributed joint channel assignment and routing protocol, called J-CAR1. Unlike existing schemes, J-CAR allows a data interface to dynamically change its working mode between send and receive on a call-by-call basis, which enhances the utilization of both interface and channel. In J-CAR, channels are negotiated and assigned to active links in conjunction with the on-demand routing process. At each hop, J-CAR conducts a local optimization by selecting the least interfered channel according to the channel interference index. The channel interference index is designed by taking both the protocol and physical interference models into consideration. To find the least interfered path for network load balancing on a global scale, J-CAR employs a length-constrained widest-path routing. The width of a path is determined by the interference level of its bottleneck link. With an adjustable threshold on the path length (with respect to the shortest-path), the excessively long path can also be avoided. We show that with a comparable complexity as the existing schemes, J-CAR provides much higher system goodputs and shorter end-to-end packet delays. © 2006 IEEE. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | IEEE Transactions on Wireless Communications | en_US |
dc.subject | Ieee 802.11 | en_US |
dc.subject | Joint Channel Assignment | en_US |
dc.subject | Multiple Channels | en_US |
dc.subject | Multiple Interfaces | en_US |
dc.subject | Routing | en_US |
dc.title | J-CAR: An efficient joint channel assignment and routing protocol for IEEE 802.11-based multi-channel multi-interface mobile Ad Hoc networks | en_US |
dc.type | Article | en_US |
dc.identifier.email | Yeung, KL:kyeung@eee.hku.hk | en_US |
dc.identifier.email | Lui, KS:kslui@eee.hku.hk | en_US |
dc.identifier.authority | Yeung, KL=rp00204 | en_US |
dc.identifier.authority | Lui, KS=rp00188 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1109/TWC.2009.080174 | en_US |
dc.identifier.scopus | eid_2-s2.0-65949084718 | en_US |
dc.identifier.hkuros | 163987 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-65949084718&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 8 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.spage | 1706 | en_US |
dc.identifier.epage | 1715 | en_US |
dc.identifier.isi | WOS:000265373100021 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Chiu, HS=7401986712 | en_US |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_US |
dc.identifier.scopusauthorid | Lui, KS=7103390016 | en_US |
dc.identifier.issnl | 1536-1276 | - |