In order to avoid transmission's collisions and improve network performances in wireless mesh networks (WMNs), a reliable and efficient medium access control (MAC) protocol and a good channel allocation are needed. Allowing multiple channels use in the same network is often presented as a possible way to improve the network capacity. As IEEE 802.11, IEEE 802.15 and IEEE 802.16 standards provide more than one channel, thus a trivial way to improve the network performances is to allow transmission on multiple channels in each network node. A lot of research work have been conducted in the area of multi-channel allocation in order to improve the aggregate bandwidth of the hole network. In this paper, we focus our attention on the proposals for solving the channel allocation problem for Multi-Transceiver per node in the backbone level using the IEEE 802.11s technology. We classify these proposals into three categories. The first one consists on channel allocation proposals done at the MAC level independently to the other layers. The second one consists on a channel allocation approaches done by a modified MAC collaborating with upper layers. Finally, the third category concerns channel allocation methods implemented in a new layer resulting from a common-layer design between MAC and Network layer. For each category, the existing multi-channel protocols and their channel allocation approaches are identified. A qualitative comparison is conducted according to the advantages that they present, the limitations and problems they are facing, and the performances they are claiming to offer.
In order enhance the network efficiency of Mobile ad hoc Networks (MANETs), an Power Unbiased Cooperative Media Access Control(PUC-MAC) protocol in MANETs was planned during this paper. It adopted the most effective partnership choice statement to select the cooperative node with higher channel condition, higher passing rate and additional balanced power consumption. Simulation results showed that PUC-MAC outperforms EC-MAC,Cooperative MAC (CoopMAC) and IEEE 802.11 Distributed Coordination perform (DCF) in terms of the packet release quantitative relation, network outturn and network lifespan beneath 2 distinct channel noise levels, particularly beneath the worst channel condition.
A Cross Layer Based Scalable Channel Slot Re-Utilization Technique for Wirele...csandit
Due to tremendous growth of the wireless based application services are increasing the demand
for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization
in multi-radio wireless mesh networks is a very challenging problem. WMNs have
been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX
(802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high
collision due to improper channel slot usage approximation error. To overcome this here the
author propose the cross layer optimization technique by designing a device classification
based channel slot re-utilization routing strategy which considers the channel slot and node
information from various layers and use some of these parameters to approximate the risk
involve in channel slot re-utilization in order to improve the QoS of the network. The simulation
and analytical results show the effectiveness of our proposed approach in term of channel slot
re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
IEEE 802.11n Based Wireless Backhaul Enabled by Dual Channel IPT (DCH-IPT) Fo...CSCJournals
Wireless backhaul has received much attention as an enabler of future broadband mobile communication systems because it can reduce deployment cost of pico-cells, an essential part of high capacity system. A high throughput with a minimum delay network is highly appreciated to sustain the increasing proliferation in multimedia transmissions. In this paper, we propose a backhaul network using the Multi-Input Multi-Output (MIMO) IEEE 802.11n standard in conjunction with the Dual Channel Intermittent Periodic Transmit IPT (DCH-IPT) packets forwarding protocol. By using these two techniques (IEEE 802.11n + DCH-IPT), wireless backhaul nodes can meet more demanding communication requirements such as higher throughput, lower average delay, and lower packet dropping rate than those achieved by the currently used backhaul. The current backhaul is based upon Single-Input Single-Output (SISO) IEEE 802.11a,b,g standards in conjunction with Single Channel Conventional (SCH-Conv) relaying protocol in which packets are transmitted continuously from source nodes using single channel. The proposed backhaul will accelerate introduction of picocell based mobile communication systems.
A Survey of Various Routing and Channel Assignment Strategies for MR-MC WMNsijsrd.com
One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. A WMN node needs to share a common channel with each of its neighbours in the communication range, requiring it to set up a virtual link. Moreover, to reduce network interference, a node should minimize the number of neighbours that it shares a common channel with. The objective of a channel assignment strategy is to ensure efficient utilization of the available channels (e.g., by minimizing interference) while maximizing connectivity in the network. However, since these two requirements are conflicting with each other, the goal is to achieve a balance between these two. The major constraints which need to be satisfied by a channel assignment scheme include fixed number of channels in the network, limited number of radios in mesh nodes, common channel between two communicating nodes, and limited channel capacity. Also, a channel assignment scheme should take the amount of traffic load supported by each mesh node into consideration.
This document summarizes LTE uplink transport channel processing and physical layer procedures. It discusses:
1. Uplink transport channel processing including channel coding and modulation for uplink shared channels and uplink control information.
2. Physical layer procedures including uplink reference signals, random access channels, HARQ, channel quality indicator feedback, and scheduling.
3. Specific topics covered include SC-FDMA modulation for the uplink, uplink reference signal structure, PUCCH formats for control information, and coding schemes for different control information types.
Performance Measurement of QoS Parameters of Throughput Enhanced Wireless in ...IRJET Journal
The document summarizes research on improving the performance of Throughput Enhanced Wireless in Local Loop (TWiLL) systems. It describes how existing TWiLL systems have low packet acceptance ratios and proposes designing an improved TWiLL system using multi-hop relaying and shortcut relaying. The performance of the proposed system is evaluated through simulations measuring packet acceptance ratio, packet drop, and throughput for different mean call holding times and mean inter-call arrival times. The results show the proposed system achieves higher packet acceptance ratios close to 1, lower packet drops, and throughputs up to 410 bps, representing improvements over existing TWiLL systems.
A DDRESSING T HE M ULTICHANNEL S ELECTION , S CHEDULING A ND C OORDINATION...pijans
We discuss a new multichannel coordination and sche
duling challenge called the Multichannel Scheduling
Cost (MSC). It is caused by the inability of the co
ntrol channel to schedule simultaneous transmission
s
resulting in data channels lying idle and their ban
dwidth underutilized. As a result, wasted bandwidth
increases as the number of data channels increases.
To address this challenge, a cyclic scheduling
Algorithm (CSA) is proposed. It employs one dedicat
ed signaling channel and 4 data channels. It is
premised on a proactive channel reservation scheme
which reduces the idleness of channels. The scheme
ensures that data channels are reserved while they
are still busy. The data channels are reserved whil
e
their remaining transmission duration is equal to t
he virtual carrier sensing duration. This gives the
next
pair sufficient time to reserve the current data ch
annel before it becomes available, limiting the MSC
to the
first cycle. The simulation results show a performa
nce benefit of the CSA scheme in addressing the eff
ects
of the MSC
WC & LTE 4G Broadband Module 2- 2019 by Prof.Suresha VSURESHA V
This document discusses multicarrier modulation techniques used in LTE, focusing on OFDM, OFDMA, and SC-FDMA. It covers the basics of OFDM including how it divides a high-rate data stream into multiple parallel low-rate substreams to mitigate intersymbol interference. The cyclic prefix is discussed as a guard interval to eliminate intercarrier interference. OFDMA and SC-FDMA are described as incorporating frequency division multiple access into OFDM. The document also reviews spatial diversity and multiplexing techniques used in LTE systems.
In order enhance the network efficiency of Mobile ad hoc Networks (MANETs), an Power Unbiased Cooperative Media Access Control(PUC-MAC) protocol in MANETs was planned during this paper. It adopted the most effective partnership choice statement to select the cooperative node with higher channel condition, higher passing rate and additional balanced power consumption. Simulation results showed that PUC-MAC outperforms EC-MAC,Cooperative MAC (CoopMAC) and IEEE 802.11 Distributed Coordination perform (DCF) in terms of the packet release quantitative relation, network outturn and network lifespan beneath 2 distinct channel noise levels, particularly beneath the worst channel condition.
A Cross Layer Based Scalable Channel Slot Re-Utilization Technique for Wirele...csandit
Due to tremendous growth of the wireless based application services are increasing the demand
for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization
in multi-radio wireless mesh networks is a very challenging problem. WMNs have
been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX
(802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high
collision due to improper channel slot usage approximation error. To overcome this here the
author propose the cross layer optimization technique by designing a device classification
based channel slot re-utilization routing strategy which considers the channel slot and node
information from various layers and use some of these parameters to approximate the risk
involve in channel slot re-utilization in order to improve the QoS of the network. The simulation
and analytical results show the effectiveness of our proposed approach in term of channel slot
re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
IEEE 802.11n Based Wireless Backhaul Enabled by Dual Channel IPT (DCH-IPT) Fo...CSCJournals
Wireless backhaul has received much attention as an enabler of future broadband mobile communication systems because it can reduce deployment cost of pico-cells, an essential part of high capacity system. A high throughput with a minimum delay network is highly appreciated to sustain the increasing proliferation in multimedia transmissions. In this paper, we propose a backhaul network using the Multi-Input Multi-Output (MIMO) IEEE 802.11n standard in conjunction with the Dual Channel Intermittent Periodic Transmit IPT (DCH-IPT) packets forwarding protocol. By using these two techniques (IEEE 802.11n + DCH-IPT), wireless backhaul nodes can meet more demanding communication requirements such as higher throughput, lower average delay, and lower packet dropping rate than those achieved by the currently used backhaul. The current backhaul is based upon Single-Input Single-Output (SISO) IEEE 802.11a,b,g standards in conjunction with Single Channel Conventional (SCH-Conv) relaying protocol in which packets are transmitted continuously from source nodes using single channel. The proposed backhaul will accelerate introduction of picocell based mobile communication systems.
A Survey of Various Routing and Channel Assignment Strategies for MR-MC WMNsijsrd.com
One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. A WMN node needs to share a common channel with each of its neighbours in the communication range, requiring it to set up a virtual link. Moreover, to reduce network interference, a node should minimize the number of neighbours that it shares a common channel with. The objective of a channel assignment strategy is to ensure efficient utilization of the available channels (e.g., by minimizing interference) while maximizing connectivity in the network. However, since these two requirements are conflicting with each other, the goal is to achieve a balance between these two. The major constraints which need to be satisfied by a channel assignment scheme include fixed number of channels in the network, limited number of radios in mesh nodes, common channel between two communicating nodes, and limited channel capacity. Also, a channel assignment scheme should take the amount of traffic load supported by each mesh node into consideration.
This document summarizes LTE uplink transport channel processing and physical layer procedures. It discusses:
1. Uplink transport channel processing including channel coding and modulation for uplink shared channels and uplink control information.
2. Physical layer procedures including uplink reference signals, random access channels, HARQ, channel quality indicator feedback, and scheduling.
3. Specific topics covered include SC-FDMA modulation for the uplink, uplink reference signal structure, PUCCH formats for control information, and coding schemes for different control information types.
Performance Measurement of QoS Parameters of Throughput Enhanced Wireless in ...IRJET Journal
The document summarizes research on improving the performance of Throughput Enhanced Wireless in Local Loop (TWiLL) systems. It describes how existing TWiLL systems have low packet acceptance ratios and proposes designing an improved TWiLL system using multi-hop relaying and shortcut relaying. The performance of the proposed system is evaluated through simulations measuring packet acceptance ratio, packet drop, and throughput for different mean call holding times and mean inter-call arrival times. The results show the proposed system achieves higher packet acceptance ratios close to 1, lower packet drops, and throughputs up to 410 bps, representing improvements over existing TWiLL systems.
A DDRESSING T HE M ULTICHANNEL S ELECTION , S CHEDULING A ND C OORDINATION...pijans
We discuss a new multichannel coordination and sche
duling challenge called the Multichannel Scheduling
Cost (MSC). It is caused by the inability of the co
ntrol channel to schedule simultaneous transmission
s
resulting in data channels lying idle and their ban
dwidth underutilized. As a result, wasted bandwidth
increases as the number of data channels increases.
To address this challenge, a cyclic scheduling
Algorithm (CSA) is proposed. It employs one dedicat
ed signaling channel and 4 data channels. It is
premised on a proactive channel reservation scheme
which reduces the idleness of channels. The scheme
ensures that data channels are reserved while they
are still busy. The data channels are reserved whil
e
their remaining transmission duration is equal to t
he virtual carrier sensing duration. This gives the
next
pair sufficient time to reserve the current data ch
annel before it becomes available, limiting the MSC
to the
first cycle. The simulation results show a performa
nce benefit of the CSA scheme in addressing the eff
ects
of the MSC
WC & LTE 4G Broadband Module 2- 2019 by Prof.Suresha VSURESHA V
This document discusses multicarrier modulation techniques used in LTE, focusing on OFDM, OFDMA, and SC-FDMA. It covers the basics of OFDM including how it divides a high-rate data stream into multiple parallel low-rate substreams to mitigate intersymbol interference. The cyclic prefix is discussed as a guard interval to eliminate intercarrier interference. OFDMA and SC-FDMA are described as incorporating frequency division multiple access into OFDM. The document also reviews spatial diversity and multiplexing techniques used in LTE systems.
WC and LTE 4G module 1- 2019 by Prof. Suresha VSURESHA V
1. The document discusses the evolution of cellular technologies from 1G to 5G. Key technologies enabling LTE's 4G capabilities included OFDM, which overcomes multipath interference using orthogonal subcarriers. OFDM also provides frequency diversity and enables efficient multi-user access schemes like OFDMA.
2. The module covers wireless fundamentals and key LTE enablers. Chapter 1 discusses cellular evolution and LTE network architecture. Chapter 2 covers cellular concepts, broadband wireless channels, fading, and techniques to mitigate it.
3. OFDM was chosen for LTE due to its ability to handle multipath interference elegantly and exploit frequency diversity. It also allows for scalable bandwidth and efficient multi-access
This document provides an overview of network models, including the OSI and TCP/IP models. It describes the seven layers of the OSI model and the functions of each layer. The four layers of the TCP/IP model are also explained, along with their relationship to the OSI layers. Key topics covered include data encapsulation, peer-to-peer communication between layers, and the responsibilities of the physical, data link, network, transport, and application layers.
Route Update Overhead Reduction in MANETS Using Node ClusteringEditor IJCATR
Most of the routing protocols used in Mobile Adhoc Networks (MANET) require update the route information to neighbour
or any other nodes. These route update overhead degrade the performance of routing algorithms as there is a significant routing overhead. Proposed is a technique to reduce route update overhead through the minimization of the routing delay. The aim is to reduce the network congestion and minimize the complexities that are commonly faced by Mobile Adhoc Networks. Here, a clustering mechanism is introduced, which clusters the arriving nodes in the Mobile Adhoc Network. The election strategy is required to elect a particular node from the group of nodes in the cluster to act as the cluster head, based on the resources that are possessed by that node. Experimental results indicate reduced time and routing packets in this scheme
Handover Behaviour of Transparent Relay in WiMAX NetworksIDES Editor
The knowledge on handover behaviour in WiMAX
network is essential for network management and planning
in order to achieve optimum system throughput. In this paper
we have analysed the handover behaviour of transparent relay
in several configurations for the IEEE 802.16j Mobile Multihop
Relay (MMR) WiMAX network. The simulation was
performed using NCTUns tool and adopted the hard handover
mechanism for three different relay network topologies with
varying mobile station speeds. The result shows the handover
for internal network is faster than the external network and
by appropriate relay deployment the system throughput can
be increased up to 14.39%.
Route Update Overhead Reduction in MANETS Using Node ClusteringEditor IJCATR
Most of the routing protocols used in Mobile Adhoc Networks (MANET) require update the route information to neighbour
or any other nodes. These route update overhead degrade the performance of routing algorithms as there is a significant routing
overhead. Proposed is a technique to reduce route update overhead through the minimization of the routing delay. The aim is to reduce the network congestion and minimize the complexities that are commonly faced by Mobile Adhoc Networks. Here, a clustering mechanism is introduced, which clusters the arriving nodes in the Mobile Adhoc Network. The election strategy is required to elect a particular node from the group of nodes in the cluster to act as the cluster head, based on the resources that are possessed by that node.
Experimental results indicate reduced time and routing packets in this scheme
The document proposes a hybrid architecture for channel allocation and routing in wireless mesh networks to improve quality of service. It uses a combination of static and dynamic channel allocation. Dynamic channel allocation (DCA) is optimized using an Adaptive DCA protocol (ADCA) that considers both throughput and delay. Static channels provide high throughput paths while dynamic channels improve connectivity and adaptability. Simulation results show the hybrid approach achieves lower delay and higher throughput than static-only or dynamic-only approaches. It also compares clustering which can further increase throughput and reduce delay compared to the hybrid method.
WC and LTE 4G Broadband module 3- 2019 by Prof.Suresha VSURESHA V
This document provides an overview of Module 3 which covers the channel structure of LTE. It discusses:
1. The channel structure in LTE includes logical channels, transport channels, and physical channels. Logical channels provide services to higher layers, transport channels to lower layers, and physical channels handle actual transmission.
2. The LTE network architecture consists of the radio access network (E-UTRAN) and core network (EPC). E-UTRAN includes eNodeBs while EPC includes MME, SGW, PGW, and PCRF.
3. The radio interface protocol stack separates into control and user planes. It consists of layers like RRC, PDCP, RLC, MAC
Performance Analysis of WiMAX Networks with Relay Stationidescitation
IEEE 802.16 is a Broadband Wireless Access (BWA)
network and thus it is considered to be an alternative solution
to wired broadband technologies. Relay station plays a
promising role of extending the range of Base station for long
distances in WiMAX networks. Relay station is suitable to
areas with limited infrastructure such as rural, hilly and lakes,
where it is difficult to install many Base stations with each
having wired connections and it is also suitable to those phases
where obstacles made the coverage limited. The Relay station
is placed in the network connectivity from Base stations and
extends the coverage of a single Base station. In this paper the
performance analysis of WiMAX technology including Relay
station has been done. This paper also focuses on increasing
number of nodes and distance from base station to the
performance of WiMAX networks.
Wireless mesh networks provide opportunities for broadband internet access, extending wireless LAN coverage, mobile internet access, emergency response, and more. They compare favorably to existing technologies due to lower upfront investments, good bandwidth and coverage, and ease of deployment in some cases. However, research challenges remain around the physical layer, medium access control, routing, security, and other areas. Ongoing work aims to improve performance through techniques like smart antennas, transmission power control, and use of multiple channels.
Some of the key driving forces behind the transition from the UMTS based cellular system to the Long Term Evolution Advanced (LTE-A) are to improve the mean and the cell-edge throughput, improve the user fairness, and improve the quality of service (QoS) satisfaction for all users. In the latter system, relays appear as one of the most prominent enabler for improving the cell-edge user experience while increasing the system’s fairness.
In this white paper, we present the basics of relay deployments in LTE-A networks. Moreover, we analyze resource allocation problem for Relay Nodes (RN) deployments and present some of the solutions for improvement in system resource usage and QoS satisfaction. Afterwards, we introduce the capabilities of NOMOR’s LTE-A system level simulator and evaluate the performance of LTE-A relay systems under the described solutions.
OVERVIEW AND LITERATURE SURVEY ON ROUTING PROTOCOLS FOR MOBILE COGNITIVE RADI...cscpconf
Ad hoc network is a collection of wireless mobile nodes that dynamically form a temporary
network without the use of any existing network infrastructure or centralized administration. A
cognitive radio is a radio that can change its transmitter parameters based on interaction with
the environment in which it operates. The basic idea of cognitive radio networks is that the
unlicensed devices (cognitive radio users or secondary users) need to vacate the spectrum band
once the licensed device (primary user) is detected. Cognitive capability and reconfigurability
are the key characteristics of cognitive radio. Routing is an important issue in Mobile
Cognitive Radio Ad Hoc Networks (MCRAHNs). In this paper, a survey of routing protocols for
mobile cognitive radio ad networks is discussed.
An Efficient Wireless Backhaul Utilizing MIMO Transmission and IPT ForwardingCSCJournals
Wireless backhaul has been received much attention as an enabler of future broadband mobile communication systems because it can reduce deployment cost of pico-cells, an essential part of high capacity system. A high performance network, high throughput, low average delay and low packet loss rate, is highly appreciated to sustain the increasing proliferation in multimedia transmissions. The critical issue reducing the performance of wireless backhaul is the interference occurred in the network due to simultaneous nodes transmissions. In this research, we propose a high performance wireless backhaul using the low interference sensitivity MIMO based nodes. MIMO transmission has a better BER performance over SISO one even with the same transmission rate and bandwidth, which means that MIMO can operate at lower SINR values than SISO and give the same performance. This MIMO robust performance against interference gives us a greater benefit when adopted as a wireless interface in wireless backhaul than SISO. These facts motivated us to use the IEEE 802.11n the current MIMO standard to design a MIMO based wireless backhaul. In addition and to justify our assumptions, we investigate the effect of MIMO channels correlation, a major drawback in MIMO transmission, upon the system performance, and prove the robustness of the scheme under different MIMO channels correlation values. After proving the effectiveness of MIMO as a wireless interface for wireless backhaul, we further improve the performance of this MIMO-backhaul using the high efficient Intermittent Periodic Transmit (IPT) forwarding protocol. IPT is a reduced interference packet forwarding protocol with a more efficient relay performance than conventional method in which packets are transmitted continuously form the source nodes. By using these two techniques (IEEE 802.11n (MIMO) + IPT), wireless backhaul nodes can meet more demanding communication requirements such as higher throughput, lower average delay, and lower packet dropping rate than those achieved by simply applying IEEE 802.11n to conventionally relayed backhaul. The proposed wireless backhaul will accelerate introduction of picocell based mobile communication systems.
DESIGN OF A COMPACT CIRCULAR MICROSTRIP PATCH ANTENNA FOR WLAN APPLICATIONS pijans
This paper presents the design of a compact circular microstrip patch antenna for WLAN applications which covers the band 5.15 to 5.825 GHz. The antenna is designed using 1.4mm thick FR-4 (lossy)substrate with relative permittivity 4.4 and a microstrip line feed is used. The radius of the circular patch is chosen as 7.62mm. To reduce the size and enhance the performance of the proposed antenna, a circular slot is loaded on circular patch and a square slot is etched on the ground plane of dimension 30mm×30mm. Design of the antenna is carried out using CST Microsoft Studio Sonimulation Software. The proposed antenna resonates at 5.5 GHz with a wider bandwidth of 702 MHz and it provides low return loss of -31.58 dB, good gain of 3.23 dB and directivity of 4.28 dBi and high efficiency of around 79% against the resonance frequency. The geometry of the proposed circular antenna with reduced size and its various performance parameters such as return loss, bandwidth, VSWR, gain, directivity, efficiency and radiation pattern plots are presented and discussed.
The document discusses various proposed solutions for enabling fair coexistence between LTE-U and Wi-Fi networks sharing the same unlicensed spectrum. It summarizes four main solutions: 1) Dynamic Channel Selection which has limitations in dense networks with no vacant channels, 2) Listen-Before-Talk which risks LTE-U oppressing Wi-Fi access, 3) Carrier Sensing Adaptive Transmission which may not preserve enough space for Wi-Fi in multi-operator small cells, 4) Adaptive User/Resource Allocation framework which has practical limitations in complex small cells with independent Wi-Fi networks. The document proposes a hybrid approach could address the weaknesses of each individual solution.
11.a review of improvement in tcp congestion control using route failure det...Alexander Decker
This summary provides an overview of a document that reviews several algorithms aimed at improving TCP congestion control and addressing route failures in mobile ad hoc networks (MANETs).
The document begins with an introduction to MANETs and the issues they present for TCP, as TCP was designed for wired networks and interprets all packet losses as congestion. It then analyzes and compares five different algorithms that have been proposed to help TCP distinguish between losses due to route failures versus congestion. These algorithms aim to improve network performance metrics like throughput, packet delivery ratio, and end-to-end delay. The document concludes that while these algorithms approach the problem of route failures and TCP performance degradation in different ways, their overall goal is the
Implementing database lookup method in mobile wimax for location management a...ijdpsjournal
This document summarizes a research paper that proposes implementing a database lookup method for location management in a mobile WiMAX network to reduce handover delay and improve bandwidth utilization and throughput. The paper introduces using location management areas (LMAs) within multicast and broadcast service (MBS) zones to minimize handover delay. Existing methods use paging groups to track user locations, increasing bandwidth usage and delay. The proposed method eliminates paging groups and instead stores user location data in a database accessed by an authentication, authorization, and accounting (AAA) server. Simulation results using the OPNET tool show the proposed method reduces handover delay and increases throughput compared to existing methods.
This document discusses different channel allocation schemes that can be used in wireless mesh networks to improve performance and reduce interference between nodes. It categorizes the schemes as static, dynamic, or hybrid. Static schemes permanently or semi-permanently assign channels. Dynamic schemes allow channel switching. Hybrid schemes use static allocation for some interfaces and dynamic for others. The document simulates different ratios of static to dynamic channels and finds that allocating an equal number to each performs best, balancing connectivity and flexibility. It concludes that a fully dynamic scheme with no division may further optimize performance.
This document discusses different channel allocation schemes that can be used in wireless mesh networks to improve performance and reduce interference between nodes. It categorizes the schemes as static, dynamic, or hybrid. Static schemes permanently or semi-permanently assign channels. Dynamic schemes allow channel switching. Hybrid schemes use static allocation for some interfaces and dynamic for others. The document simulates different ratios of static to dynamic channels and finds that allocating an equal number to each performs best, balancing connectivity and flexibility. It concludes that a purely dynamic scheme with no division may further optimize performance.
An Overview Of Channel Assignment Methods For Multi-Radio Multi-Channel Wirel...Darian Pruitt
This document provides an overview of channel assignment methods for multi-radio multi-channel wireless mesh networks. It begins with an introduction to wireless mesh networks and explains why the multi-radio multi-channel architecture has been adopted. It then identifies two key design issues for channel assignment approaches: interference and connectivity. Finally, it proposes a classification of channel assignment approaches and outlines the rest of the document which will examine individual approaches, provide comparisons, and discuss future research directions.
GTSH: A New Channel Assignment Algorithm in Multi-Radio Multi-channel Wireles...IJERA Editor
This document presents a new channel assignment algorithm called GTSH for multi-radio multi-channel wireless mesh networks. It combines the genetic algorithm and tabu search algorithm to maximize throughput. The genetic algorithm is used to generate initial solutions while tabu search explores neighbors of the best solution to avoid getting stuck in local optima. Simulation results using the NS2 simulator showed the hybrid GTSH method achieved significantly higher throughput than using genetic or tabu search alone.
With the increase of usage of wireless networks for purposes where the nodes are either stationary or minimally mobile, focus is also on increasing the network capacity of wireless networks. One such way is to use non-overlapping multiple channels provided by 802.11 by using multiple interfaces per node. Multiple non overlapped channels exist in the 2.4 GHz and 5 GHz spectrum. Under this scenario, several challenges need to be addressed before all the available channels can be fully utilized.
WC and LTE 4G module 1- 2019 by Prof. Suresha VSURESHA V
1. The document discusses the evolution of cellular technologies from 1G to 5G. Key technologies enabling LTE's 4G capabilities included OFDM, which overcomes multipath interference using orthogonal subcarriers. OFDM also provides frequency diversity and enables efficient multi-user access schemes like OFDMA.
2. The module covers wireless fundamentals and key LTE enablers. Chapter 1 discusses cellular evolution and LTE network architecture. Chapter 2 covers cellular concepts, broadband wireless channels, fading, and techniques to mitigate it.
3. OFDM was chosen for LTE due to its ability to handle multipath interference elegantly and exploit frequency diversity. It also allows for scalable bandwidth and efficient multi-access
This document provides an overview of network models, including the OSI and TCP/IP models. It describes the seven layers of the OSI model and the functions of each layer. The four layers of the TCP/IP model are also explained, along with their relationship to the OSI layers. Key topics covered include data encapsulation, peer-to-peer communication between layers, and the responsibilities of the physical, data link, network, transport, and application layers.
Route Update Overhead Reduction in MANETS Using Node ClusteringEditor IJCATR
Most of the routing protocols used in Mobile Adhoc Networks (MANET) require update the route information to neighbour
or any other nodes. These route update overhead degrade the performance of routing algorithms as there is a significant routing overhead. Proposed is a technique to reduce route update overhead through the minimization of the routing delay. The aim is to reduce the network congestion and minimize the complexities that are commonly faced by Mobile Adhoc Networks. Here, a clustering mechanism is introduced, which clusters the arriving nodes in the Mobile Adhoc Network. The election strategy is required to elect a particular node from the group of nodes in the cluster to act as the cluster head, based on the resources that are possessed by that node. Experimental results indicate reduced time and routing packets in this scheme
Handover Behaviour of Transparent Relay in WiMAX NetworksIDES Editor
The knowledge on handover behaviour in WiMAX
network is essential for network management and planning
in order to achieve optimum system throughput. In this paper
we have analysed the handover behaviour of transparent relay
in several configurations for the IEEE 802.16j Mobile Multihop
Relay (MMR) WiMAX network. The simulation was
performed using NCTUns tool and adopted the hard handover
mechanism for three different relay network topologies with
varying mobile station speeds. The result shows the handover
for internal network is faster than the external network and
by appropriate relay deployment the system throughput can
be increased up to 14.39%.
Route Update Overhead Reduction in MANETS Using Node ClusteringEditor IJCATR
Most of the routing protocols used in Mobile Adhoc Networks (MANET) require update the route information to neighbour
or any other nodes. These route update overhead degrade the performance of routing algorithms as there is a significant routing
overhead. Proposed is a technique to reduce route update overhead through the minimization of the routing delay. The aim is to reduce the network congestion and minimize the complexities that are commonly faced by Mobile Adhoc Networks. Here, a clustering mechanism is introduced, which clusters the arriving nodes in the Mobile Adhoc Network. The election strategy is required to elect a particular node from the group of nodes in the cluster to act as the cluster head, based on the resources that are possessed by that node.
Experimental results indicate reduced time and routing packets in this scheme
The document proposes a hybrid architecture for channel allocation and routing in wireless mesh networks to improve quality of service. It uses a combination of static and dynamic channel allocation. Dynamic channel allocation (DCA) is optimized using an Adaptive DCA protocol (ADCA) that considers both throughput and delay. Static channels provide high throughput paths while dynamic channels improve connectivity and adaptability. Simulation results show the hybrid approach achieves lower delay and higher throughput than static-only or dynamic-only approaches. It also compares clustering which can further increase throughput and reduce delay compared to the hybrid method.
WC and LTE 4G Broadband module 3- 2019 by Prof.Suresha VSURESHA V
This document provides an overview of Module 3 which covers the channel structure of LTE. It discusses:
1. The channel structure in LTE includes logical channels, transport channels, and physical channels. Logical channels provide services to higher layers, transport channels to lower layers, and physical channels handle actual transmission.
2. The LTE network architecture consists of the radio access network (E-UTRAN) and core network (EPC). E-UTRAN includes eNodeBs while EPC includes MME, SGW, PGW, and PCRF.
3. The radio interface protocol stack separates into control and user planes. It consists of layers like RRC, PDCP, RLC, MAC
Performance Analysis of WiMAX Networks with Relay Stationidescitation
IEEE 802.16 is a Broadband Wireless Access (BWA)
network and thus it is considered to be an alternative solution
to wired broadband technologies. Relay station plays a
promising role of extending the range of Base station for long
distances in WiMAX networks. Relay station is suitable to
areas with limited infrastructure such as rural, hilly and lakes,
where it is difficult to install many Base stations with each
having wired connections and it is also suitable to those phases
where obstacles made the coverage limited. The Relay station
is placed in the network connectivity from Base stations and
extends the coverage of a single Base station. In this paper the
performance analysis of WiMAX technology including Relay
station has been done. This paper also focuses on increasing
number of nodes and distance from base station to the
performance of WiMAX networks.
Wireless mesh networks provide opportunities for broadband internet access, extending wireless LAN coverage, mobile internet access, emergency response, and more. They compare favorably to existing technologies due to lower upfront investments, good bandwidth and coverage, and ease of deployment in some cases. However, research challenges remain around the physical layer, medium access control, routing, security, and other areas. Ongoing work aims to improve performance through techniques like smart antennas, transmission power control, and use of multiple channels.
Some of the key driving forces behind the transition from the UMTS based cellular system to the Long Term Evolution Advanced (LTE-A) are to improve the mean and the cell-edge throughput, improve the user fairness, and improve the quality of service (QoS) satisfaction for all users. In the latter system, relays appear as one of the most prominent enabler for improving the cell-edge user experience while increasing the system’s fairness.
In this white paper, we present the basics of relay deployments in LTE-A networks. Moreover, we analyze resource allocation problem for Relay Nodes (RN) deployments and present some of the solutions for improvement in system resource usage and QoS satisfaction. Afterwards, we introduce the capabilities of NOMOR’s LTE-A system level simulator and evaluate the performance of LTE-A relay systems under the described solutions.
OVERVIEW AND LITERATURE SURVEY ON ROUTING PROTOCOLS FOR MOBILE COGNITIVE RADI...cscpconf
Ad hoc network is a collection of wireless mobile nodes that dynamically form a temporary
network without the use of any existing network infrastructure or centralized administration. A
cognitive radio is a radio that can change its transmitter parameters based on interaction with
the environment in which it operates. The basic idea of cognitive radio networks is that the
unlicensed devices (cognitive radio users or secondary users) need to vacate the spectrum band
once the licensed device (primary user) is detected. Cognitive capability and reconfigurability
are the key characteristics of cognitive radio. Routing is an important issue in Mobile
Cognitive Radio Ad Hoc Networks (MCRAHNs). In this paper, a survey of routing protocols for
mobile cognitive radio ad networks is discussed.
An Efficient Wireless Backhaul Utilizing MIMO Transmission and IPT ForwardingCSCJournals
Wireless backhaul has been received much attention as an enabler of future broadband mobile communication systems because it can reduce deployment cost of pico-cells, an essential part of high capacity system. A high performance network, high throughput, low average delay and low packet loss rate, is highly appreciated to sustain the increasing proliferation in multimedia transmissions. The critical issue reducing the performance of wireless backhaul is the interference occurred in the network due to simultaneous nodes transmissions. In this research, we propose a high performance wireless backhaul using the low interference sensitivity MIMO based nodes. MIMO transmission has a better BER performance over SISO one even with the same transmission rate and bandwidth, which means that MIMO can operate at lower SINR values than SISO and give the same performance. This MIMO robust performance against interference gives us a greater benefit when adopted as a wireless interface in wireless backhaul than SISO. These facts motivated us to use the IEEE 802.11n the current MIMO standard to design a MIMO based wireless backhaul. In addition and to justify our assumptions, we investigate the effect of MIMO channels correlation, a major drawback in MIMO transmission, upon the system performance, and prove the robustness of the scheme under different MIMO channels correlation values. After proving the effectiveness of MIMO as a wireless interface for wireless backhaul, we further improve the performance of this MIMO-backhaul using the high efficient Intermittent Periodic Transmit (IPT) forwarding protocol. IPT is a reduced interference packet forwarding protocol with a more efficient relay performance than conventional method in which packets are transmitted continuously form the source nodes. By using these two techniques (IEEE 802.11n (MIMO) + IPT), wireless backhaul nodes can meet more demanding communication requirements such as higher throughput, lower average delay, and lower packet dropping rate than those achieved by simply applying IEEE 802.11n to conventionally relayed backhaul. The proposed wireless backhaul will accelerate introduction of picocell based mobile communication systems.
DESIGN OF A COMPACT CIRCULAR MICROSTRIP PATCH ANTENNA FOR WLAN APPLICATIONS pijans
This paper presents the design of a compact circular microstrip patch antenna for WLAN applications which covers the band 5.15 to 5.825 GHz. The antenna is designed using 1.4mm thick FR-4 (lossy)substrate with relative permittivity 4.4 and a microstrip line feed is used. The radius of the circular patch is chosen as 7.62mm. To reduce the size and enhance the performance of the proposed antenna, a circular slot is loaded on circular patch and a square slot is etched on the ground plane of dimension 30mm×30mm. Design of the antenna is carried out using CST Microsoft Studio Sonimulation Software. The proposed antenna resonates at 5.5 GHz with a wider bandwidth of 702 MHz and it provides low return loss of -31.58 dB, good gain of 3.23 dB and directivity of 4.28 dBi and high efficiency of around 79% against the resonance frequency. The geometry of the proposed circular antenna with reduced size and its various performance parameters such as return loss, bandwidth, VSWR, gain, directivity, efficiency and radiation pattern plots are presented and discussed.
The document discusses various proposed solutions for enabling fair coexistence between LTE-U and Wi-Fi networks sharing the same unlicensed spectrum. It summarizes four main solutions: 1) Dynamic Channel Selection which has limitations in dense networks with no vacant channels, 2) Listen-Before-Talk which risks LTE-U oppressing Wi-Fi access, 3) Carrier Sensing Adaptive Transmission which may not preserve enough space for Wi-Fi in multi-operator small cells, 4) Adaptive User/Resource Allocation framework which has practical limitations in complex small cells with independent Wi-Fi networks. The document proposes a hybrid approach could address the weaknesses of each individual solution.
11.a review of improvement in tcp congestion control using route failure det...Alexander Decker
This summary provides an overview of a document that reviews several algorithms aimed at improving TCP congestion control and addressing route failures in mobile ad hoc networks (MANETs).
The document begins with an introduction to MANETs and the issues they present for TCP, as TCP was designed for wired networks and interprets all packet losses as congestion. It then analyzes and compares five different algorithms that have been proposed to help TCP distinguish between losses due to route failures versus congestion. These algorithms aim to improve network performance metrics like throughput, packet delivery ratio, and end-to-end delay. The document concludes that while these algorithms approach the problem of route failures and TCP performance degradation in different ways, their overall goal is the
Implementing database lookup method in mobile wimax for location management a...ijdpsjournal
This document summarizes a research paper that proposes implementing a database lookup method for location management in a mobile WiMAX network to reduce handover delay and improve bandwidth utilization and throughput. The paper introduces using location management areas (LMAs) within multicast and broadcast service (MBS) zones to minimize handover delay. Existing methods use paging groups to track user locations, increasing bandwidth usage and delay. The proposed method eliminates paging groups and instead stores user location data in a database accessed by an authentication, authorization, and accounting (AAA) server. Simulation results using the OPNET tool show the proposed method reduces handover delay and increases throughput compared to existing methods.
This document discusses different channel allocation schemes that can be used in wireless mesh networks to improve performance and reduce interference between nodes. It categorizes the schemes as static, dynamic, or hybrid. Static schemes permanently or semi-permanently assign channels. Dynamic schemes allow channel switching. Hybrid schemes use static allocation for some interfaces and dynamic for others. The document simulates different ratios of static to dynamic channels and finds that allocating an equal number to each performs best, balancing connectivity and flexibility. It concludes that a fully dynamic scheme with no division may further optimize performance.
This document discusses different channel allocation schemes that can be used in wireless mesh networks to improve performance and reduce interference between nodes. It categorizes the schemes as static, dynamic, or hybrid. Static schemes permanently or semi-permanently assign channels. Dynamic schemes allow channel switching. Hybrid schemes use static allocation for some interfaces and dynamic for others. The document simulates different ratios of static to dynamic channels and finds that allocating an equal number to each performs best, balancing connectivity and flexibility. It concludes that a purely dynamic scheme with no division may further optimize performance.
An Overview Of Channel Assignment Methods For Multi-Radio Multi-Channel Wirel...Darian Pruitt
This document provides an overview of channel assignment methods for multi-radio multi-channel wireless mesh networks. It begins with an introduction to wireless mesh networks and explains why the multi-radio multi-channel architecture has been adopted. It then identifies two key design issues for channel assignment approaches: interference and connectivity. Finally, it proposes a classification of channel assignment approaches and outlines the rest of the document which will examine individual approaches, provide comparisons, and discuss future research directions.
GTSH: A New Channel Assignment Algorithm in Multi-Radio Multi-channel Wireles...IJERA Editor
This document presents a new channel assignment algorithm called GTSH for multi-radio multi-channel wireless mesh networks. It combines the genetic algorithm and tabu search algorithm to maximize throughput. The genetic algorithm is used to generate initial solutions while tabu search explores neighbors of the best solution to avoid getting stuck in local optima. Simulation results using the NS2 simulator showed the hybrid GTSH method achieved significantly higher throughput than using genetic or tabu search alone.
With the increase of usage of wireless networks for purposes where the nodes are either stationary or minimally mobile, focus is also on increasing the network capacity of wireless networks. One such way is to use non-overlapping multiple channels provided by 802.11 by using multiple interfaces per node. Multiple non overlapped channels exist in the 2.4 GHz and 5 GHz spectrum. Under this scenario, several challenges need to be addressed before all the available channels can be fully utilized.
INTERFERENCE-AWARE CHANNEL ASSIGNMENT FOR MAXIMIZING THROUGHPUT IN WMN pijans
Wireless Mesh network (WMN) is dynamically self-organizing and self-configured, with the nodes in the
network automatically establishing an ad-hoc network and maintaining the mesh connectivity. The ability
to use multiple-radios and multiple channels can be cashed to increase aggregate throughput of wireless
mesh network. Thus the efficient use of available interfaces and channels without interference becomes
the key factor. In this paper we propose interference aware clustered based channel assignment schemes
which minimizes the interference and increases throughput. In our proposed scheme we have given
priority to minimize interference from nearby mesh nodes in interference range than maximizing channel
diversity. We simulated our proposed work using NS-3 and results show that our scheme improves
network performance than BFSCA and Distributed Greedy CA.
AN EFFICIENT SPECTRUM SHARING METHOD BASED ON GENETIC ALGORITHM IN HETEROGENE...IJCNCJournal
With advances in wireless communication technologies, users can have rich contents not only via wired
networks but also via wireless networks such as Cellular, WiFi, and WiMAX. On the other hand, however, lack of spectrum resources becomes an important problem for future wireless networks. To overcome this problem, dynamic spectrum access technology receives much attention. In this paper, we propose a novel spectrum sharing method based on genetic algorithm in which a WiFi system temporarily uses a spectrum band of WiMAX system in WiFi/WiMAX integrated networks as a typical
heterogeneous wireless network. Finally, we confirm the effectiveness of the proposed method by simulation experiments
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ijwmn
This document proposes a new channel assignment method called ODCAM that aims to increase throughput and minimize delay in multi-channel multi-radio wireless mesh networks. ODCAM uses a channel diversity mechanism to select new channels along the path from source to destination. It stores channel information in a Channel Diversity Table. Simulation results show that ODCAM combined with the HWMP routing protocol increases average throughput by 12.78% and decreases average end-to-end delay compared to a hybrid channel assignment approach.
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ijwmn
The IEEE 802.11s Wireless Mesh Networks (WMN) is a new multi-hop technology increasing the coverage
of IEEE 802.11 Wireless Network and providing Internet access. In order to increase the mesh network
capacity, the WMN has evolved from single-radio single-channel architecture to Multi-Channel MultiRadios (MC-MR) architecture. In MC-MR the main challenge of the WMN is the channel assignment. In
this article, we propose a new channel assignment method based on channel diversity. This new method
named ODCAM (On Demand channel Assignment Method for channel diversity ) defines a channel
diversity mechanism used to select a new channel along the path between the source and the destination.
The best path between the source and the destination is provided by the HWMP (Hybrid Wireless Mesh
Protocol) protocol using MWCETT (Modified Weighted Cumulative Expected Transmission Time) an
extension of the WCETT metric. The simulation results show the ODCAM performance compared with an
hybrid approach.
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ijwmn
The document proposes a new channel assignment method called ODCAM that uses channel diversity to improve network capacity in multi-channel multi-radio wireless mesh networks. ODCAM selects channels along network paths to ensure channel diversity between hops. It stores channel information in a Channel Diversity Table and implements channel selection through the HWMP routing protocol. Simulation results show ODCAM increases average throughput by 12.78% and decreases average end-to-end delay compared to a hybrid channel assignment approach.
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM) ijwmn
The IEEE 802.11s Wireless Mesh Networks (WMN) is a new multi-hop technology increasing the coverage
of IEEE 802.11 Wireless Network and providing Internet access. In order to increase the mesh network
capacity, the WMN has evolved from single-radio single-channel architecture to Multi-Channel MultiRadios (MC-MR) architecture. In MC-MR the main challenge of the WMN is the channel assignment. In
this article, we propose a new channel assignment method based on channel diversity. This new method
named ODCAM (On Demand channel Assignment Method for channel diversity ) defines a channel
diversity mechanism used to select a new channel along the path between the source and the destination.
The best path between the source and the destination is provided by the HWMP (Hybrid Wireless Mesh
Protocol) protocol using MWCETT (Modified Weighted Cumulative Expected Transmission Time) an
extension of the WCETT metric. The simulation results show the ODCAM performance compared with an
hybrid approach.
A CROSS-LAYER BASED SCALABLE CHANNEL SLOT RE-UTILIZATION TECHNIQUE FOR WIRELE...cscpconf
Due to tremendous growth of the wireless based application services are increasing the demand for wireless communication techniques that use bandwidth more effectively. Channel slot reutilization in multi-radio wireless mesh networks is a very challenging problem. WMNs have been adopted as back haul to connect various networks such as Wi-Fi (802.11), WI-MAX (802.16e) etc. to the internet. The slot re-utilization technique proposed so far suffer due to high collision due to improper channel slot usage approximation error. To overcome this here the author propose the cross layer optimization technique by designing a device classification based channel slot re-utilization routing strategy which considers the channel slot and node information from various layers and use some of these parameters to approximate the risk involve in channel slot re-utilization in order to improve the QoS of the network. The simulation and analytical results show the effectiveness of our proposed approach in term of channel slot re-utilization efficiency and thus helps in reducing latency for data transmission and reduce
channel slot collision.
General Model for Single and Multiple Channels WLANs with Quality of Service...ijwmn
In this paper we develop an intergraded model for request mechanism and data transmission in the uplink
phase in the presence of channel noise. This model supports quality of service. The wireless channel is prone
to many impairments. Thus, certain techniques have to be developed to deliver data to the receiver. We
calculated the performance parameters for single and multichannel wireless networks, like the requests
throughput, data throughput and the requests acceptance probability and data acceptance probability. The
proposed model is general model since it can be applied to different wireless networks such as IEEE802.11a,
IEEE802.16e, CDMA operated networks and Hiperlan\2.
General Model for Single and Multiple Channels WLANs with Quality of Service ...ijwmn
In this paper we develop an intergraded model for request mechanism and data transmission in the uplink phase in the presence of channel noise. This model supports quality of service. The wireless channel is prone to many impairments. Thus, certain techniques have to be developed to deliver data to the receiver. We calculated the performance parameters for single and multichannel wireless networks, like the requests throughput, data throughput and the requests acceptance probability and data acceptance probability. The proposed model is general model since it can be applied to different wireless networks such as IEEE802.11a, IEEE802.16e, CDMA operated networks and Hiperlan\2.
Performance analysis of 802.11ac with frame aggregation using NS3 IJECEIAES
802.11ac is an interesting standard of IEEE bringing multiple advantages than its predecessor 802.11n. 802.11ac is faster and more scalable version of 802.11n offering the capabilities of wireless Gigabit Ethernet. 802.11ac will enable access points (AP) to support more STAs with a better experience for clients and more channel bonding increasing from a maximum of 40 MHz with 802.11n up to 80 or 160 MHz with 802.11ac standard. In this paper, we analyze and evaluate the 802.11ac performance using NS3 simulator (v3.26) relying on several features like channel bonding, modulation and coding schemes, guard interval and frame aggregation. Then, we presentthe effect of the variation of d istance between STAs and AP on the network performance in term of throughput. Finally, we capture the most relevant simulations outcomes and we indicate some research challenges for the future work.
Newton-raphson method to solve systems of non-linear equations in VANET perfo...journalBEEI
This document discusses using the Newton-Raphson method to solve systems of non-linear equations to optimize VANET performance. It selects three MAC protocol parameters - transmission power, bitrate, and contention window - as variables. Simulations are run with different values of these parameters. The results for energy consumption, packet delivery ratio, and delay are used to derive three non-linear equations. The Newton-Raphson method is then applied to find the coefficients a, b, and c to optimize the objective function of minimizing energy*delay/PDR. Tables 4-6 show the objective function results for different parameter configurations.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
Achieving Transmission Fairness in Distributed Medium Access Wireless Mesh Ne...ijwmn
Wireless mesh networking gained an international interest over the years as a result to high recognition in
the wireless industry as a cost effective, scalable, wider coverage and capacity capable wireless technology.
The contention based distributed medium access in wireless networks has advanced not only in supporting
the quality of multimedia but also achieving high throughput and to minimize packet delay overheads in
legacy systems. Unfortunately, the impact of such enhancement has not been fully justified with mesh
network environments yet. The medium access frames are required to be contended over multi-hops to
overcome the challenges of improving overall system performance through concurrent transmissions. The
goal of this paper is to discuss the issues and challenges of transmission fairness and the effect of
concurrent transmission on system performance. To mitigate transmission fairness issues, we review
existing open literature on mesh networking and provide guidelines for better system design and
deployment. Finally, we conclude the paper with future research directions. This study may help network
designer and planner to overcome the remaining challenging issues in the design and deployment of WMNs
worldwide.
ON THE SUPPORT OF MULTIMEDIA APPLICATIONS OVER WIRELESS MESH NETWORKS ijwmn
This document summarizes research on supporting multimedia applications over wireless mesh networks. It proposes an efficient routing algorithm and a QoS approach at the MAC layer. The routing algorithm aims to transport multimedia traffic with QoS requirements. The MAC layer approach improves 802.11e to better facilitate video transport over the mesh network. Related work on routing protocols, QoS solutions at the network and MAC layers, and clustering approaches are also reviewed.
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
Similar to Channel Allocation and Routing in Wireless Mesh Networks: A survey and qualitative comparison between schemes (20)
Using recycled concrete aggregates (RCA) for pavements is crucial to achieving sustainability. Implementing RCA for new pavement can minimize carbon footprint, conserve natural resources, reduce harmful emissions, and lower life cycle costs. Compared to natural aggregate (NA), RCA pavement has fewer comprehensive studies and sustainability assessments.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
International Conference on NLP, Artificial Intelligence, Machine Learning an...gerogepatton
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
A review on techniques and modelling methodologies used for checking electrom...nooriasukmaningtyas
The proper function of the integrated circuit (IC) in an inhibiting electromagnetic environment has always been a serious concern throughout the decades of revolution in the world of electronics, from disjunct devices to today’s integrated circuit technology, where billions of transistors are combined on a single chip. The automotive industry and smart vehicles in particular, are confronting design issues such as being prone to electromagnetic interference (EMI). Electronic control devices calculate incorrect outputs because of EMI and sensors give misleading values which can prove fatal in case of automotives. In this paper, the authors have non exhaustively tried to review research work concerned with the investigation of EMI in ICs and prediction of this EMI using various modelling methodologies and measurement setups.
Batteries -Introduction – Types of Batteries – discharging and charging of battery - characteristics of battery –battery rating- various tests on battery- – Primary battery: silver button cell- Secondary battery :Ni-Cd battery-modern battery: lithium ion battery-maintenance of batteries-choices of batteries for electric vehicle applications.
Fuel Cells: Introduction- importance and classification of fuel cells - description, principle, components, applications of fuel cells: H2-O2 fuel cell, alkaline fuel cell, molten carbonate fuel cell and direct methanol fuel cells.
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMSIJNSA Journal
The smart irrigation system represents an innovative approach to optimize water usage in agricultural and landscaping practices. The integration of cutting-edge technologies, including sensors, actuators, and data analysis, empowers this system to provide accurate monitoring and control of irrigation processes by leveraging real-time environmental conditions. The main objective of a smart irrigation system is to optimize water efficiency, minimize expenses, and foster the adoption of sustainable water management methods. This paper conducts a systematic risk assessment by exploring the key components/assets and their functionalities in the smart irrigation system. The crucial role of sensors in gathering data on soil moisture, weather patterns, and plant well-being is emphasized in this system. These sensors enable intelligent decision-making in irrigation scheduling and water distribution, leading to enhanced water efficiency and sustainable water management practices. Actuators enable automated control of irrigation devices, ensuring precise and targeted water delivery to plants. Additionally, the paper addresses the potential threat and vulnerabilities associated with smart irrigation systems. It discusses limitations of the system, such as power constraints and computational capabilities, and calculates the potential security risks. The paper suggests possible risk treatment methods for effective secure system operation. In conclusion, the paper emphasizes the significant benefits of implementing smart irrigation systems, including improved water conservation, increased crop yield, and reduced environmental impact. Additionally, based on the security analysis conducted, the paper recommends the implementation of countermeasures and security approaches to address vulnerabilities and ensure the integrity and reliability of the system. By incorporating these measures, smart irrigation technology can revolutionize water management practices in agriculture, promoting sustainability, resource efficiency, and safeguarding against potential security threats.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
Channel Allocation and Routing in Wireless Mesh Networks: A survey and qualitative comparison between schemes
1. Channel Allocation and Routing in Wireless Mesh Networks:
A survey and qualitative comparison between schemes
F. Kaabi1
, S. Ghannay2
, and F. Filali1
1
Mobile Communications Department
Eurécom 2229, route des Crêtes BP193, 06904 Sophia-Antipolis, France
E-mail:{kaabi, filali}@eurecom.fr
2
CRISTAL Laboratory, National School of Computer Sciences, Tunisia
E-mail:{sana.ghannay}@cristal.rnu.tn
Abstract
In order to avoid transmission's collisions and improve network performances in wireless mesh
networks (WMNs), a reliable and efficient medium access control (MAC) protocol and a good
channel allocation are needed. Allowing multiple channels use in the same network is often
presented as a possible way to improve the network capacity. As IEEE 802.11, IEEE 802.15
and IEEE 802.16 standards provide more than one channel, thus a trivial way to improve the
network performances is to allow transmission on multiple channels in each network node. A lot
of research work have been conducted in the area of multi-channel allocation in order to
improve the aggregate bandwidth of the hole network. In this paper, we focus our attention on
the proposals for solving the channel allocation problem for Multi-Transceiver per node in the
backbone level using the IEEE 802.11s technology. We classify these proposals into three
categories. The first one consists on channel allocation proposals done at the MAC level
independently to the other layers.
The second one consists on a channel allocation approaches done by a modified MAC
collaborating with upper layers. Finally, the third category concerns channel allocation methods
implemented in a new layer resulting from a common-layer design between MAC and Network
layer. For each category, the existing multi-channel protocols and their channel allocation
approaches are identified. A qualitative comparison is conducted according to the advantages
that they present, the limitations and problems they are facing, and the performances they are
claiming to offer.
Keywords: Channel allocation, Wireless Mesh Networks, Multi-Channel Multi-
Transceiver, Cross-layer design, Joint-layer design.
1 Introduction
As IEEE 802.11, IEEE 802.15 and IEEE 802.16 standards faces several deployment limitations
like the throughput degradation and the unfairness between network nodes, the IEEE
community decided to extend the actual standards in order to improve the network
performances and to extend its coverage area.
For wireless personal area network (WPAN), a new working group, i.e., IEEE 802.15.5, is
established to determine the necessary mechanisms in the physical and MAC layers to enable
mesh networking in wireless PANs [5]. For wireless metropolitan area networks (WMAN), i.e.,
IEEE 802.16 [3], a lot of proposals has been submitted for standardization [6, 7]. Also, for
wireless local area networks (WLAN), an extension called 802.11s that could be called IEEE
802.11-based Wireless Mesh Networks is still under discussions [4, 8].
2. Figure 1: Architecture of a wireless mesh network (WMN)
A Mesh Network is defined as being an infrastructure network working with an ad hoc mode.
The architecture shown in Figure 1 where dash and solid lines represents respectively wireless
and wired links, depicts the possibility of interconnecting several heterogeneous networks.
Communications in WMNs are multi-hop and multipoint-to-multipoint, the network is self-
organized and its performances are affected by mobility even if it is low that's why designing a
scalable MAC for WMNs is an issue. This scalability can be addressed by the MAC layer in two
ways. The first way is to enhance existing MAC protocols or to propose new MAC protocols to
increase end-to-end throughput when only single channel is available in a network node. When
several communication channels are available in the network, a second way is to allow
transmission on multiple channels in each network node.
As IEEE 802.11, IEEE 802.15 and IEEE 802.16 basic standards [1, 2, 3] provide the support of
multi-channel, IEEE (802.11, 802.15, 802.16)-based Wireless Mesh Networks may have single-
channel or multi-channel configuration. As shown in Figure 1, one node can have one or more
transceivers (backbone level).
The traffic in WMNs is mainly directed between nodes and the Internet but we believe that also
traffic exists between nodes themselves. High-bandwidth applications need sufficient network
capacity so it is challenging to make the network providing such capacity. In order to improve
WMNs capacity a good management of the available frequencies is necessary.
In this paper, we focus on multi-channel allocation techniques for WMNs. Enabling a network
node to work on multiple channels instead of only one fixed channel improves network
performances and increases network capacity for WMNs. Depending on hardware platforms,
different multi-channel allocation protocols are developed and can be classified into three
categories. The channel allocation for the first one is done without taking into account the
3. network needs and constraints, while the second one is given as a result of a cross-layer
design between MAC and network layers. Finally, the third category is made by a new layer
that is a common-layer between MAC and routing. Additionally, in this paper we will not
consider the case when there are multiple radios per node because in a such scenario, each
radio has its own MAC and physical layer. The communications using these radios are totally
independent and it is not in the scope of our work. Our work does not focus on the proposed
MAC protocols for wireless mesh network which are covered by other works like [9] and [10] but
the proposed techniques and approaches for channel allocations. The rest of this paper is
organized as follows. In Section 2, we present a short view of the channel spectrum use in
802.11, 802.15 and 802.16. Section 3 gives a description of the proposals for channel
allocation, over which a qualitative comparison is conducted after. Conclusions and future
directions are provided in Section 4
2 Channel spectrum use in 802.11, 802.15 and 802.16
2.1 Channel spectrum use in IEEE 802.11
This subsection tries to summarize the use of the available channel frequency spectrum in IEEE
802.11 [1]. The number of transmit and receive frequency channels used for operating the
Physical Medium Dependent (PMD) entity is 79 for the USA and Europe, and 23 for Japan. But
not all of these channels can be used simultaneously because of the overlapping problem. The
hop sequence for used channel is defined by the geographic features and is given by the
authorities of where will be implemented the network. In practice, IEEE 802.11 /b/g defines at
least 11 channels and of these, at least three are completely non-overlapping (channels 1 [2402
MHz, 2422 MHz], 6 [2427 MHz, 2447 MHz], and 11 [2452 MHz, 2472 MHz]) as depicted in
Figure 2. Now, the issue of medium contention arises only when we are using the same channel
or overlapping channels. An important observation in a wireless network is that if two links are
allocated independent (non-overlapping) channels, they can be scheduled independent of one
another. A node in WMNs can have one or more physical interfaces but the number of
interfaces per node (often 3 at maximum) is less than the number of the available channels in
the network. To each link, we associate a unique channel. The question now is how to optimize
the channel allocation in order to improve the performances of the network?
Section 3 describes the proposals for the issue of channel assignment in 802.11-based WMNs
and provides a qualitative comparison of these proposals.
Figure 2: Channel spectrum use in IEEE 802.11 [21]
2.2 Channel spectrum use in IEEE 802.15
In this subsection, we try to summarize the use of the available channels for the IEEE 802.15
[2], according to the two physical technologies approved for the medium use that are the Chirp
Spread Spectrum (CSS) and the Ultra Wide Band (UWB). When a CSS Physic is in concern, a
total of fourteen channels, numbered 0 to 13 are available across the 2.4 Ghz band as depicted
in Table 1. Different subsets of these frequency channels can be selected so that the non-
4. overlapping frequency channels are used. A channel frequency defines the center frequency of
each band for CSS.
Frequency channel number Frequency in megahertz
0 2412
1 2417
2 2422
3 2427
4 2432
5 2437
6 2442
7 2447
8 2452
9 2457
10 2462
11 2467
12 2472
13 2484
Table 1: Center frequency of CSS [2]
in megahertz, for
in megahertz, for
Where is the band number.
Fourteen different frequency bands in combination with four different subchip sequences from a
set of complex channels. When a UWB Physic is in concern, a total of sixteen
channels, divided into three bands, are defined as depicted in Table 2. A compliant UWB device
shall be capable of transmitting in at least one of the three specified bands. A UWB device that
implements the low band shall support channel 3. The remaining low-band is optional. A UWB
device that implements high band shall support channel 9. The remaining high-band channels
are optional. A total of complex channels are assigned for operation, two channels
in each of the 16 defined operating frequency bands. A compliant implementation should
support at least the two logical channels for one of the mandatory bands.
2.3 Channel spectrum use in IEEE 802.16
The first IEEE 802.16 [3] standard was approved in December 2001. It delivered a standard for
point to multipoint Broadband Wireless transmission in the 10-66 GHz band, with only a line-of-
sight (LOS) capability. It uses a single carrier (SC) physical (PHY) standard.
IEEE 802.16a was an amendment to 802.16 and delivered a point to multipoint capability in the
2-11 GHz band. For this to be of use, it also required a non-line-of-sight (NLOS) capability, and
the PHY standard was therefore extended to include Orthogonal Frequency Division Multiplex
(OFDM) and Orthogonal Frequency Division Multiple Access (OFDMA). IEEE 802.16a was
ratified in January 2003 and was intended to provide "last mile" fixed broadband access. IEEE
802.16e, another amendment to IEEE 802.16, uses Scalable OFDMA to carry data, supporting
5. channel bandwidths of between 1.25 MHz and 20 MHz, with up to 2048 sub-carriers. The most
promising, used and benefit channel allocation proposals is OFDMA.
Band group
(decimal)
Channel number Center frequency Bandwidth Mandatory/Optional
0 0 499.2 499.2 Mandatory below
1 1 3494.4 499.2 Optional
1 2 3993.6 499.2 Optional
1 3 4492.8 499.2 Mandatory in low band
1 4 3999.6 1331.2 Optional
2 5 6489.6 499.2 Optional
2 6 6988.8 499.2 Optional
2 7 6489.6 1081.6 Optional
2 8 7488.0 499.2 Optional
2 9 7987.2 499.2 Mandatory in high band
2 10 8486.4 499.2 Optional
2 11 7987.2 1331.2 Optional
2 12 8985.6 499.2 Optional
2 13 9484.8 499.2 Optional
2 14 9984.0 499.2 Optional
2 15 9484.8 1354.97 Optional
Table 2: UWB PHY band allocation [2]
The Orthogonal Frequency-Division Multiple Access (OFDMA) is a multi-user version of the
popular orthogonal frequency-division multiplexing (OFDM) digital modulation scheme. Multiple
access is achieved in OFDMA by assigning subsets of subcarriers to individual users as shown
in Figure 3. This allows simultaneous low data rate transmission from several users. Based on
feedback information about the channel conditions, adaptive user-to-subcarrier assignment can
be achieved. If the assignment is done sufficiently fast, this further improves the OFDM
robustness to fast fading and narrow-band co-channel interference, and makes it possible to
achieve even better system spectral efficiency. Different number of sub-carriers can be
assigned to different users, in view to support differentiated Quality of Service (QoS), i.e. to
control the data rate and error probability individually for each user. OFDMA resembles code
division multiple access (CDMA) spread spectrum, where users can achieve different data rates
by assigning a different code spreading factor or a different number of spreading codes to each
user. OFDMA can also be seen as an alternative to combining OFDM with time division multiple
access (TDMA) or time-domain statistical multiplexing, i.e. packet mode communication. Low
data rate users can send continuously with low transmission power instead of using a "pulsed"
high-power carrier. Constant delay, and shorter delay, can be achieved. However, OFDMA can
also be described as a combination of frequency domain and time domain multiple access,
where the resources are partitioned in the time-frequency space, and slots are assigned along
the OFDM symbol index as well as OFDM sub-carrier index.
3 Proposals for Channel Allocation in WMNs
A multi-channel allocation protocol can be implemented on different hardware platforms which
impacts the design of the MAC. Each node of the network can have one or more transceivers
but if cost and compatibility are the concern, one transceiver by node is a preferred hardware
platform that's why multi-transceivers are often implemented on nodes from the wireless mesh
6. backbone as depicted in Figure 1. However, when multi-channel wireless mesh nodes are
considered, new routing protocols are needed for two reasons.
Figure 3: Channel spectrum use in IEEE 802.16 using OFDMA [3]
(a) Layered scheme (b) Cross-layer scheme (c) Common-layer scheme
Figure 4: Approaches for channel allocation and dependency to routing protocols
First, the routing protocol needs to select not only the optimal path in-between different nodes,
but also the most appropriate communication channels on the path. Second, cross-layer and
common-layer design become a necessity because changes in routing paths involve channel
switching in a mesh node. Without considering cross-layer or common-layer design, the
switching process may be too slow to degrade the performance of WMNs. The existing routing
protocols treat all network nodes in the same way. However, such solutions may not be efficient
for WMNs, because mesh routers in WMNs backbone and mesh clients have significant
differences in power constraint and mobility. More efficient routing protocols that take into
account these differences are desired for WMNs. Several proposals concerning multi-channel
allocation strategies for multi-transceiver per node have been suggested and we can split them
into three categories with regard to their philosophical and technical approaches as depicted in
Figure 4. The following subsections review and compare the most recent and promising
proposals.
7. 3.1 Independent multi-channel allocation strategies for nodes with multi-
transceiver
Figure 5: Case of Multi-Transceivers per node
The first category shown in Figure 4.(a) concerns people who believe that we have only to
manage the channel allocation in a network while the routing comes after. As shown in Figure 5
where and represent the number of transceivers and the number of available channels in
the network, respectively, a node includes multiple parallel RF front-end chips and base-band
processing modules to support several simultaneous channels. On top of the physical layer,
only one MAC layer module is needed to coordinate the functions of multiple channels. A node
may operate on several channels simultaneously by affecting a different channel to each one of
its transceivers. Consequently, a strong collaboration between nodes is needed to avoid
channel interfering. In reality and as we mentioned in Section 2, IEEE 802.11 b/g provides three
non overlapping channels and hence, it is useless to have more than three transceivers per
node. Under this situation, distributed and centralized protocols have been proposed for
improving coordination and channel allocation. However, the theoretical capacity is achieved
with centralized algorithms, and assumptions of steady traffic. Developing an accurate
distributed protocol is still a challenge.
Several strategies have been proposed. In [15], the authors propose to statically configure the
interfaces of different nodes on pre-known channels. This approach simplifies protocol
implementation but it is too limited to static network. Also, a node can send (or receive) data
over only channels where is the number of its interfaces and, as a result, a network can
be splitted into non communicative sub-networks because, naively keeping interfaces fixed on
different channels may affect network connectivity.
A second possibility [11, 12], that can be considered as an improvement of the first one [15], is
to frequently switch the interfaces of a node among different channels. This approach requires
coordination between the sender and receiver nodes before transmission and a strong
synchronization between them is necessary. Also, switching from one channel to another incurs
delay.
A hybrid approach [16] keeps some interfaces of each node fixed, while others can switch
among channels. The Hybrid Multi-channel Protocol (HMCP) [16, 17] is a link-layer protocol
where the node's interfaces are either “fixed” or “switchable”. The fixed channels can be
explicitly advertised to neighbors by broadcasting “Hello” messages. Whenever a sender needs
8. to send packets to a receiver, it can switch its channel to the receiver's fixed channel and send
packets. Thus, once the fixed channel of a node is discovered through the reception of a “Hello”
message, explicit channel synchronization is not needed. This protocol is shown in [13] to be
efficient when the number of available channel increases. However, the increase of the number
of hops affects seriously the performances. Moreover, in this scheme, single broadcast
performances are limited since each node can listen to a different channel. A similar proposal is
the DCA [14] algorithm that needs at least two interfaces per node where one can be dedicated
to stay on a fixed channel and exchange control messages which can lead to a bottleneck
problem in this interface as shown in [11, 13] to be less efficient than protocols for a single
transceiver per node.
In [18], the authors consider the backbone level of the network, the problem studied is only
concerning the router or gateway's level where each router can have more than one network
interface card (NICs) because of cost constraint. They first, gave a model of the routers
communications using the graph theory tools with the constraint that we can not have more than
one logical link between each two routers. A logical link is modeled as vertices of a graph. If and
only if two communications represented by two vertices may interfere, then in the correspondent
graph, these vertices are connected with an edge. After that, they focused on the set of all
maximal cliques. A maximal clique in a graph is a maximal complete sub-graph where a
complete graph is a graph with all vertices fully connected to the others. This set of maximal
cliques denotes the possible interfering logical links. The maximum link layer flow capacity is
limited for a maximum clique such as the normalized flow rate remains feasible. This limitation is
strongly dependent on the characteristics of the set. However, to use clique capacity
constraints, we need to design and express the maximum cliques of the graph in term of
channel allocation and interfaces assignment. Besides, finding the maximal cliques in an
arbitrary graph is NP-Hard [19]. The main equation in channel allocation and channel
assignment in [18] is expressed as the limitation of the sum of time of all links chairing the same
channel by the link layer flow capacity that represents the possible transmission time on a
channel. This equation represents a TDMA-type management inside a maximal clique. The
mathematical formulations expressed in [18] and explained in the previous paragraph model the
relationship between the channel allocation, interface assignment, and MAC problems. [18]
proposes to extend the MAC framework proposed in [20] to obtain a joint channel allocation,
interface assignment, and MAC algorithm. This extension is formulated as non linear mixed-
integer problem which is not easy to solve. This problem's objective is to maximize the sum of
continuously differentiable, increasing and strictly concave utility function of the link-layer flow
rate per logical link. The problem is resolved according to two methods. The first one consists in
extracting binary linearization while the second uses an approximate dual decomposition. By
relaxing all the binary constraints, the problem becomes a strictly concave problem with a
unique maximum. This approach can lead to obtaining the global optimal solution of the joint
channel allocation, interface assignment and MAC problem in a centralized manner. Resolving
the dual problem of the original primal problem with practical assumptions makes the optimality
of the joint algorithm not granted. In [18], numerical tests are done and the simulation results
show that the proper value for the clique capacity parameter should be selected depending on
some specific characteristics of the network contention graph. In the experiments, the authors
conclude that their proposed schemes are efficient, regardless of the selected value for the
clique capacity and the average network utility changes as the clique capacity changes. In [18],
it is also observed that the multi-channel multi-interface deployment significantly increases the
network average utility for all different values of the clique capacity. In addition, the second
proposed joint design efficiently finds the optimal or near-optimal solutions. Finally, in [21], the
author considers a network composed by directional antennas and long distance point-to-point
communication. Then, he focuses on the channel assignment to each interface. Based on the
two phase MAC protocol which is a TDMA-style protocol in mesh network [22, 23], the author
9. formulates first the problem of minimizing the mismatch between link capacities desired by the
network operator and that achieved under a channel allocation using the graph theory. The
approach adopted is to translate the real problem to a problem of coloring-3-edges because
IEEE 802.11 provides three non overlapping channels where each edge corresponds to a
communication link and a channel. Then, by using the problem formulation of 3-coloring-edges,
the authors show that this problem is NP-hard. Finally, the authors explore several heuristics for
achieving Zero-Mismatch Channel Allocation (ZMCA) for a graph. A set heuristics achieve the
optimal allocation in most scenarios. Those heuristics are for color choice, edge ordering and
local search. For example in [21], heuristics for color choice are two. The Greedy-col heuristics
consists of, at each stage, to greedy try to pick a color that would add the minimum mismatch
cost to the graph. The second one is the Match-DF heuristic witch consists of preferring colors
according to the degree of match between edges. In [21], the author achieves simulations by
generating 100 random graphs with 50 nodes and concludes that the Match-DF heuristic
improves the network performances better than the Greedy-col heuristics and both are good. In
[21], the author proofs that solving the problem of channel allocation in WMNs is not a P-
problem but NP-hard and could not be solved without introducing heuristics but here, we are
facing another big problem which is how to choose heuristics?
A recent work [35], have been done for two interference models for channel scheduling that are
under the physical constraint and under the hop constraint. This interference models are
considered by the authors to be the most significant. The authors in [35] proof that channel
scheduling is NP-Hard for Multi-Radio (Multi-NIC per node) Multi-Channel and propose a
polynomial-time approximation scheme. This approximation is done by partitioning the network
space into small grids and doing computations over the obtained grids. As a result the authors
obtain a set of virtual communication links that can support simultaneous communications.
Table 3 provides a deeper analysis and comparison of the channel allocation techniques
described and discussed in this section.
3.2 Cross-layer design for Channel Allocation and Routing
As depicted in Figure 4.(b), the second category concerns people who believe that both link
layer and routing layer should coordinate. This category concerns either Single NIC or multiple
NICs per node. For this, several proposals have been done where a large amount of research
like [11, 25, 26, 27, 28, 29] are modifying the MAC layer to support multi-channel ad hoc
network. The common approach of these works is to find the best channel for a single packet
transmission with the collaboration with the network layer considering the importance of a cross
layer design. Even the performances of these works seem to be improving the network capacity,
but this improvement is not enough and the strategies adopted are shown to be strongly
suffering from the number of hops from source to destination. Also, the used MAC are either
protected or not free, so it is limiting the research knowledge to the simple modifications or
specially designed to a specific hardware and so the portability is limited. Another approach
called MESTIC [24] aims to improve the aggregate throughput of the network, where the
authors claim that they propose an innovative scheme which stands for mesh-based traffic and
interference aware channel assignment. The MESTIC is a fixed, rank-based, polynomial time
greedy algorithm for centralized channel assignment, which visits every node once. The node's
rank computation depends on its link traffic characteristics, topological properties, and number
of its network interface cards (NICs). For this, a common default channel, assigned to a
dedicated NIC on each node, is used for ensuring the connectivity and the network
management. The main idea of MESTIC is to assign channels to the transceivers based on the
rank of the node and the load expected on the links a priori between nodes. As MesTiC a rank-
based algorithm, thus nodes that are expected to carry heavy loads have more flexibility in
assigning channels. The gateway node in this configuration obtains the highest rank in order to
10. avoid congestion in the gateway as most of the expected traffic is in-between users and the
Internet where some works speak about 95%. We classified this approach as a cross-layer
design for channel allocation and routing because the expected load and traffic in the network is
done a priori and not dynamically. In fact, if a node decides to send data over the network using
a specific path to the destination, the channel allocation strategy will not be changed or
negotiated to ensure the optimal configuration scheme because even the collaboration exists
between MAC and network layer, it is not Strong enough to solve this problem and we can not
talk about a common-layer design between MAC and network layer. The authors claim that
there is a strong benefit in terms of improving the aggregate bandwidth is obtained by using the
MESTIC algorithm, however, their approach is strongly limited by the apriori known traffic. Table
4 provides a deeper analysis and comparison of the channel allocation techniques described in
this section.
3.3 Common-layer design for channel allocation and routing
The third and last category given in Figure 4.(c), concerns people who believe that, when multi-
channel wireless mesh nodes are considered, new routing protocols are needed for two
reasons. First, the routing protocol needs to select not only the optimal path in-between different
nodes, but also the most appropriate channels on the path. Second, a common-layer design
becomes a necessity because change of a routing path involves the channel switching in a
mesh node. Without considering a common-layer design, the switching process may be too
slow and degrade the performance of WMNs. Under this situation and consideration, several
works have been also done. Most of the previous works proposed solutions with a centralized
vision. An excellent knowledge of the network is so required for making their proposals realistic
and scalable. Promising works have been proposed in [30, 32, 33]. In [30], the authors propose
an excellent problem formulation on which they explain clearly their approach. In [30], the
authors propose two approaches that they claim are improving the aggregate bandwidth. Two
novel channel assignment algorithms for a given multi-channel wireless mesh network are given
therefore. The first algorithm “Neighbor Partitioning Scheme” performs channel assignment
based only on network topology. The second algorithm “Load-Aware Channel Assignment”
reaps the full potential of proposed architecture by further exploiting traffic load information. For
this, the authors argue first that the main constraints that a channel assignment algorithm needs
to satisfy are the limitation of the number of distinct channels that can be assigned to a wireless
mesh node to the number of NICs on it, a communication could occur between two nodes only if
at least one common channel is shared between one NICs from each node, the majoration by
the channel raw capacity of the sum of the expected load on the links interfering on it and the
total of available radio is limited. Then, they present the “Neighbor Partitioning Scheme” as the
first approach. This consists on starting with one node, partitioning its neighbors into groups
and assigning one group to each of its interfaces and then each of this node's neighbors, in
turn, partitions its neighbors into q groups. This process is repeated until all nodes have
partitioned their neighbors. The “Neighbor Partitioning Scheme” approach allow to use more
channels in the network than the number of NICs per node. However this scheme would work if
all the virtual link in the network have the same traffic load what is not always true in the reality.
This motivates the authors to think about introducing the traffic load as a constraint for the
channel allocation process and to introduce further the “Load-Aware Channel Assignment”
approach.
Taking a real common-layer design, let us introduce the problem, its constraints and the
objective to fulfill. The channel assignment phase should give more bandwidth to the link that
might need to support load traffic, and should depend on the expected load on each virtual link,
which depends in turn on routing. Moreover, given a set of communications node pairs, the
11. expected traffic between them, and the virtual link capacities, the routing algorithm determines
the route through the network for each communicating pair of nodes and the evaluation metric is
then to maximize the overall traffic goodput in the whole network.
The main idea of the “Load-Aware Channel Assignment” approach in [30] is to evaluate the
traffic profile between source and destination and then to assign channels over the logical link
between nodes. The paths are established using simple routing algorithms regardless to the
channel allocation constraints and taking into consideration the load balancing between
selected paths where an excellent survey on algorithms for convex multicommodity flow
problems [31] was proposed. In fact, in [30], the authors first defined the evaluation metric as
being the overall traffic goodput of the network that is formalized by using the cross-section
goodput X of a network which is defined as the sum of the useful network bandwidth assigned
between a pair of ingress-egress nodes (s, d) as defined in Eq.(1).
(1)
Because routing depends on the virtual Link's capacity, that is determined by channel
assignment, and channel assignment depends on the virtual Link's expected load, which is
affected by routing, there is a circular dependency between radio channel assignment and
packet routing and then to break this circular dependency, the authors propose an initial link
load estimation as the first step of their algorithm. For this, they assume that all interfering links
in the same neighborhood equally split the combined bandwidth of all radio channels as detailed
in Eq.(2) where is the capacity of a link , is the capacity of the channel number and
is the number of link interfering with the link including itself. Eq.(2) is computed regardless to
the number of NICs per node.
(2)
To compute initial expected link loads, the authors assume a perfect load balancing across all
acceptable paths between each communicating node pair. Then the expected load on a link is
given by Eq.(3), where is the number of acceptable paths between a pair of node ,
is the number of acceptable paths between a pair of node that pass a link ,
is the estimated load bandwidth between a pair of node and is the expected
load on a link .
(3)
While the resulting estimates of this approach are not 100% accurate, it provides a good starting
point to kick of the iterative refinement process. The next step of the algorithm given by the
authors concerns the channel assignment step and for this, the goal is to assign channels to
network interfaces such that the resulting available bandwidth on these interfaces is at least
equal to their expected traffic load. As the problem is proofed to be NP-hard, the authors
propose a greedy load-aware channel assignment algorithm. For evaluating the effectiveness of
a channel assignment algorithm, the computation of the capacity of each virtual link and its
comparison against the link expected load are needed. An approximation of a virtual link
capacity is done in Eq.(4) where is the expected load on link , is the set of all
12. virtual links in the interference zone of link , and is the substained radio channel capacity.
The accuracy of this formula decreases as approaches .
(4)
Besides, the characteristic of the load-aware channel assignment is that it can work with any
routing algorithm. Finally, the authors give how to combine the channel assignment and routing
algorithms as depicted in Figure 6. The aggregate throughput advertised by the authors [30]
yield a factor 8 of possible improvement which is higher compared to other approaches blamed
to not fulfilling the maximum potential of the offered hardware. A similar for broadband fixed
wireless access system approach is done in [32] and is presented in five steps but it has the
same principles than [30]. Finally, another approach consists on minimizing a convex function
[33], which depends on the networks flow and communication variable under the constraints of
the network flow and communications model. The objective function depends on the user needs
when designing the network and it is shown in [33] that this function can represent for example
the power transmission or the link utilization. The performance of the Simultaneous Routing and
Resource Allocation (SRRA) [33] are underlining the importance of the model for planning and
designing network. An enhancement of the previous described solutions is a distributed load
channel assignment solution [34]. The approach mechanism (Figure 7) is composed by to
phases.
Figure 6: Load aware channel assignment [30]
The first phase that is the initial phase consists on a distributed route discovery update protocol
developed to establish routes between multi-channel WMN nodes and wired Gateway. Then,
the second and periodic phase is the distributed load aware channel assignment. In fact, each
node separates its set of interfaces into UP-NIC(s) that will be affected by their parents and
DOWN-NIC(s) that involves only the node itself for affectation(s). To assign channel(s) to its
DOWN-NIC(s), each node periodically exchanges its individual channel usage information as a
CHNL_USAGE packet with all its interfering neighbors. The aggregated traffic load of a
particular channel is estimated by summing up the loads contributed by all the interfering
13. neighbors that happen to use this channel. A WMN node evaluates periodically its current
channel assignment based on the channel usage information it receives from neighboring
nodes. As soon as the node finds a relatively less loaded channel after accounting, it moves
one of its DOWN-NIC(s) operating on a heavy-loaded channel to use the less-loaded channel,
and send a message (CHNL_CHANGE) message with the new channel information to the
affected child nodes, which modify the channels of their UP-NICs accordingly. It also sends an
update CHNL_USAGE to its interfering neighbors to update their information about the usage of
channels. Even this approach [34] is not really a cross-layer design between Mac and Routing
layers, it remains, for the best of our knowledge, the closest to the third and last category given
in Figure 4.(c).
Finally, the differences between centralized and distributed approaches are done in the table 5.
Figure 7: Load-aware channel assignment done by each node
4 Conclusion and future directions
! " # " $ $ # $ $ " # % " $$ #
# # # # " #
# " &
# $$ # # # ! $ "
' ( )# ! # % ( &( (
( ! # ( ' # % !
$ ! " ($ ! $ ( # *
# " $ $ " # % # + #
# " + " $ " #
" + # # " +
$ $ " # " $ " # # !
$ " # % # # " ( + $ $ "
,-
. " , . + $ ( " + $ ( #
# " + /01 " $ ( ,-
.# " $ (
$ ( 2 + # # # # ( (
+ ( # ( " # $ # "
15. / ( + ,
9
?
. ! " ( $ + #
& " # (( 0 " + 54@ # " (
# % A
4 & " # (( 0 " + #
@ # " # % A
9 4 " " " " ( # + # # " ( #
#
# " + "A4 " "" 54 ( " # " B &
% # B # ( # ( # ! # +
( # A
: 4 # " " ! # ! ( #
4 2 " + ( 8 A1 # " A
C 4 ( " (0 ( + # % "
( # # + # A
$ " # +! $ $ ( # !
# # (( + (
References
[1] IEEE Standard for Information technology-Telecommunications and information exchange
between systems-Local and metropolitan area networks-Specific requirements - Part 11:
Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, 802.11-
2007.
[2] IEEE Standard for Information Technology - Telecommunications and information exchange
between systems - Local and metropolitan area networks specific requirement Part 15.4:
Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate
Wireless Personal Area Networks (WPANs), 802.15.4-2007.
[3] IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed
Broadband Wireless Access Systems 802.16 Standard, 802.16-2004.
[4] IEEE Standard Group Web Site. Available from: <http://www.ieee802.org/11/>.
[5] IEEE Standard Group Web Site. Available from: <http://www.ieee802.org/15/>.
[6] IEEE Standard Group Web Site. Available from: <http://www.ieee802.org/16/>.
[7] D. Beyer, N.V. Waes, and K. Eklund, Tutorial: 802.16 MAC Layer Mesh Extensions, IEEE
802.16 Standard Group Discussions, February 2002.
[8] J. Hauser, Draft PAR for IEEE 802.11 ESS Mesh, IEEE Document Number: IEEE 802.11-
03/759r2.
[9] Ian F. Akyildiz, X. Wang and W. Wang, “Wireless mesh networks: a survey”, Computer
Networks and ISDN Systems, v.47 n.4, 15 March 2005, pp.445-487.
16. [10] I. Akyildiz, and X. Wang, “A survey on wireless mesh networks”, IEEE Communications
Magazine, v. 43, n. 9, September 2005, s.23-30.
[11] J. So, and N. H. Vaidya, “Multi-channel MAC for Ad Hoc Networks: Handling Multi-Channel
Hidden Terminals using a Single Transceiver”, Proc. of MobiHoc '04.
[12] P. Bahl, R. Chandra, and J. Dunagan, “SSCH: Slotted Seeded Channel Hopping for
Capacity Improvement in IEEE 802.11 Ad-Hoc Wireless Networks”, Proc. of MobiCom '04.
[13] P. Kyasanur, J. So, C. Chereddi, and N. H. Vaidya ,”Multi-Channel Mesh Networks:
Challenges and Protocols”, in IEEE Wireless Communications, April 2006.
[14] S.-L. Wu, C.-Y. Lin, Y.-C. Tseng, and J.-P. Sheu, “A New Multi-Channel MAC Protocol with
On-Demand Channel Assignment for Multi-Hop Mobile Ad Hoc Networks”, International
Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), December 2000.
[15] R. Draves, J. Padhye, and B. Zill, “Routing in Multi-radio, Multi-hop Wireless Mesh
Networks”, Proc. of MobiCom '04.
[16] P. Kyasanur and N. H. Vaidya, “Routing and Interface Assignment in Multi-Channel Multi-
Interface Wireless Networks”, Proc. of IEEE WCNC '05.
[17] P. Kyasanur and N. H. Vaidya, “Routing and Link-layer Protocols for Multi-Channel Multi-
Interface Ad hoc Wireless Networks”, Tech. Rep., University of Illinois at Urbana-Champaign,
May 2005.
[18] A. H. M. Rad and V. W.S. Wong, “Joint Channel Allocation, Interface Assignment and MAC
Design for Multi-Channel Wireless Mesh Networks“, Proc. of Infocom '07.
[19] E. Balas and C. Yu, “Finding a maximum clique in an arbitrary graph”, SIAM Journal on
Computing, vol. 15, Nov. 1986, pp. 1054-1068.
[20] Z. Fang and B. Bensaou, “Fair bandwidth sharing algorithm based on game theory
framework for wireless ad-hoc networks”, Proc. of Infocom'04.
[21] B. Raman, “Channel Allocation in 802.11-based Mesh Networks”, Proc. of Infocom '06.
[22] B. Raman, and K. Chebrolu, “Revisiting MAC Design for an 802.11-based Mesh Network”,
HotNets-III, November 2004.
[23] B. Raman, and K. Chebrolu, “Design and Evaluation of a new MAC Protocol for Long-
Distance 802.11 Mesh Networks”, Proc. of MOBICOM '05.
[24] H. Skalli, S. Ghosh, S. K. Das, L. Lenzini, and M. Conti, “Channel Assignment Strategies for
Mutiradio Wireless Mesh Networks: Issues and Solutions”, IEEE Communication Magazine,
vol.1, Nov. 2007, pp. 86-95.
[25] A. Muir, and J. J. Garcia-Luna-Aceves, "A Channel Access Protocol for Multihop Wireless
Networks with Multiple Channels", Proc. of IEEE ICC '98.
17. ,?
. 04 1 + D E 8 E " 5 E 0F # <
5 G ( # 04 54 5"0
1 #E5 = / # * 6 ($ ( 4 (( # $$ 9 09
C
,H
.5 $ " 6 ; G <
5 # 46 5 54 / # $
= / # 888 4 4 7
I
I
,-
.; F # " F E 5# ! <
4 5! " # " ; $ 5#
#
# = / # # ( 7
,I
. 6 " 1 " <
5 04 54 / # 5"1 # =
/ # #7:
,
9 .5 ; D F $ " ' 4 <
4 2 " # + ( " +
+ ( ( 0# ( = / # 6+ 7:
,
9 .5 J / " / <
5 6 ! 5 + ( 4 ! & # (( "
/ ( = / # + ( 6
# # 7
,
9 .K D 6
1 D '5*5'5 6 DJ 6
1 "6 J J'J <
5 / $ 5" $ ! 4
5 # " ' # 8 + + 5 + ( 0 $ * " "
& " 5#
# = / # 888 4 79
,
9
9
.E L " 6 / * " <
6( ; + " ; # 5 #
G G # ($ = 888' # # (( # ! C H :
,
9
:
.5 ; "' 4 <
5 # # "5 + ( 888 - 0* " 0
4 = / # # ( 7C
,
9
C
. 4 + L 4 + ' 3 L E "3 E <
' # ($ & 4 6
# " +
0; " 04 = / # # ( 7I
,
9
?
.; E "E D # < 5 $ ; + = / #
# ( 7I
Techniques names Descriptions Advantages Drawbacks Performances evaluation
Static channel
allocation
[15]
For each interface
of each node
allocate a
channel statically
each node knows
the channel
allocated to each
interface of his
neighbors at a
given time,
easy to implement
May cause
division of the
network into
multiple non
communicating
sub-networks
If two interfaces have the same
channel, the performances
above the logical link are very
good, when different channels
are assigned to interfaces
they will never be able to
establish a logical link and
then communication between the
two nodes could never be
possible
Frequently switching
frequency
assignment
[11, 12]
nodes negotiate
frequently the
channel to use
depending on the
communication
adapted to
communication
needs, support of
broadcast
need of
collaboration
between nodes,
incurs delay
incurring delay,
performances
depend on the
number of nodes and
strongly affected
18. need by Multi-hop
Hybrid Multi-channel
Protocol (HMCP)
[16, 17]
interfaces can be
fixed or switchable
where the fixed are
used for receiving
and the switchable
for sending
information
Benefit when
number of
available channels
increase
Limited
broadcasting
Depends on the number
of available channels and
performance decrease with the
increase of hops
Maximizing link
layer
flow inside a set of
interfering channels
[18]
Resolving the
maximization of
the link layer flow in
each group of
interfering logical
links by extracting
binary linearization
and using an
approximate dual
decompositions
with practical
assumptions
extracting binary
linearization
provides a unique
maximum and the
optimality is
granted
with using an
approximate dual
decompositions
with practical
assumptions,
optimality is not
granted and
dependent on the
assumption choice
significant increase of the
network average utility for all
different values of the set of
interfering logical links capacity
Minimizing the zero-
mismatch channel
allocation
(ZMCA)
[21]
uses graph theory
for modeling the
network and the
zero-mismatch
channel allocation
and several
techniques
like the coloring
problem and
associated
heuristics
the (ZMCA) is
mathematically
expressed and
minimized for
each technique
resolution of the
problem of
minimizing ZMCA
is proofed to be
NP-hard and use
of heuristics is
mandatory
Performances depend on the
used heuristics but are improved
for any heuristic
Polynomial-time
approximation
scheme
[35]
portioning the
network space into
small grids and
doing computations
over the obtained
grids
No heuristics
needed
Obtained result
from an
approximation of
the problem
The obtained configuration is the
optimal
Table 3: Comparison between the proposed techniques in case of independent channel
allocation
Techniques names Descriptions Advantages Drawbacks Performances evaluation
Modifying MAC for
multi-channel
support
[11,25,26, 27, 28,29]
Adapting MAC
to support
multi-channel in
ad hoc mode
easy to
implement
adapted to
specific
scenario and
not scalable to
any network
improving the network
aggregate throughput with
a high factor
MESTIC [24]
Affecting of
channels to
NICs based on
the a priori
traffic
Good load
balancing
Not scalable
for dynamic
traffic changes
improves the network
performance with the high
factor for any configuration
Table 4: Comparison between the proposed techniques in case of cross layer design scheme
19. Techniques Descriptions Advantages Drawbacks Performances evaluation
Centralized channel
assignment and
routing
Load balancing
using multi-
channel and
routing
Find best and
scalable
solution
Centralized
Not realistic
Goodput could be
increased to a factor of 8
Distributed
algorithms for
channel assignment
and routing
Channel
assignment
over routing
Distributed
Scalable
Realistic
High overhead
Hard to
implement
Throughput can be
improved by a factor of 6
to 7
Table 5: Comparison between the proposed techniques for a common-layer design for channel
allocation and routing