INTERFERENCE AWARE CHANNEL ASSIGNMENT WITH BANDWIDTH NETWORKS · INTERFERENCE AWARE CHANNEL...

INTERFERENCE AWARE CHANNEL ASSIGNMENT WITH BANDWIDTH

RESERVATION IN MULTI RADIO MULTI CHANNEL WIRELESS MESH

NETWORKS

D. Jasmine David1, V. Jegathesan

2

1 Assistant Professor, Electronics and CommunicationEngineering, Department of Electrical

Technology, Karunya Institute ofTechnology and Sciences, Coimbatore - 641 114, Tamil Nadu –

India, [email protected]

2 Associate Professor, Electrical and Electronics Engineering, Department of Electrical

Technology, Karunya Institute ofTechnology and Sciences, Coimbatore - 641 114, Tamil Nadu –

India, [email protected]

Abstract:

Wireless mesh networks (WMN) have arose as a technology for subsequent generation

wireless networks due to its cost effectiveness and effortless deployment. The performance of

wireless mesh networks can be considerably improved by multi-channel communication. The

existence of interference confines the use of channel assignment in wireless mesh networks.The

significance of inter-flow and intra-flow interference is ignored in existing solutions, so the

information is erroneous leads to inaccurate bandwidth estimation and reservation. All the

techniques to measure interference is measurement based that not holds good for practical

applications.This approach proposes a distributed and polynomial-time heuristic channel

assignment to minimize interference in WMNs. Inchannel allocation route delay restriction is

measured to avoid every node on the tree interfering with several other nodes.

Packettransmission will be affected by this interference. There will be a huge delay in packet

transmission resulting packet retransmission. The projectedschemediminishes the interference

properties on all prevailing multicast tree depends on the priority deliberation. This algorithm

takes in to account ofall the admitted flows and utilises all theexisting channels toachieve

channel allocation. This algorithm beats the previousmethodsin terms of packet delivery, end to

end delay, throughput and packet loss rate.

International Journal of Pure and Applied MathematicsVolume 119 No. 16 2018, 1643-1658ISSN: 1314-3395 (on-line version)url: http://www.acadpubl.eu/hub/Special Issue http://www.acadpubl.eu/hub/

1643

I. Introduction:

Among the rapidly evolving wireless technologieswireless mesh networks (WMNs)

become asignificant player. Wireless mesh network became agorgeousselection for wireless

communication because of its features it possesses.Self-directed, self-healing and self-

configuring are the natures of wireless mesh network. Once they have been setup they required

only minimal administrative intervention. Other advantage is that off-the-shelf equipment can be

used to build the wireless mesh network and they use unlicensed frequency spectrum. User

application requires QoS guaranteesfor meeting their needs by the fundamental communication

infrastructure. The wireless medium is common and random so,to provide QoS in wireless

networks is thought-provoking. For communication the features of mesh network made them an

attractive option, also they have certain challenges which are quite unique to them. For instance,

in mesh networks among users associated to mesh routers and the gateway nodes there isa

substantialpercentage of traffic (in case of wired internet connection) as a result congestion will

occurnear gateway. For mesh nodes in the similarterrestrial region, there is substantialinter-flow

and intra-flow interference. Due to these issues, over a multi hop end to-end path across the mesh

network QoS difficulties may occur.

To accomplish greater speed these multiple radios, operate on partially overlapped channels. The managerial involvement required is negligible after setting up the WMNs. Since the wireless medium is common and random, offering QoS in wireless networks is thought-provoking. Channel assignment turn out to be a major problem in multichannel multiradio WMN.

To maximize the performance of a network, each radio in the mesh node must be assigned with appropriate channel. The proposed algorithm formulates the channel assignment

problem by preventing interference in WMNs, and then for channel allocationproblem theoptimumresolutionis provided. The channel should be assigned intelligently to diminish interference within the mesh network, among the mesh networks and the co-located wireless networks. To achieve this, at each mesh router interference estimating technique is implemented.In interference estimation schemethe routers are used to estimate the interference level in their neighbouring nodes.

The Interference-Aware channel allocation with Bandwidth Reservation (IACA-BR)

scheme for per-flow bandwidth reservation in wireless mesh networks. This scheme proposes a

model-based tactictogracefullyarrest the intra-flow and interflow interference effect and tooffers

bandwidth approximation. In IACA-BR the band width of non-overlapping links is collected

over a wireless hop. It progresses the admission controlrelated to prevailing solutions. Lot of

practicesare available to measure interference and accordinglychoose the minimum interference

path. But they differ from IACA-BR which tries to calculate the bandwidth availability also

whileselecting the path.

The proposed algorithm diminishes the interference possessions for prevailing multicast sessions. This algorithm utilisesentire available channelsto achieve channel allocation. There are two main objectives in this algorithm 1. Priority-aware interference minimization for all prevailing trees 2. The delay restraintfulfilment for the new tree.

International Journal of Pure and Applied Mathematics Special Issue

1644

The path delay restraint of a tree developsnumerous channel assortmentstandards to feat all

accessible channels of the WMN. Using these every node on the tree can chose the finest channel

to encounter its node delay restraint and diminish the entire interference for all prevailing flow.

Rest of the paper is organized as follows:Section2 discusses the related work, Section3

presents the network model, problem description and problem formulation.Section4 describes the

proposed approach and algorithm overview section5 Explores on simulation results and finally

Section6 Concludes the article

II. Related work:

Few QoS solutions have been proposed for WMNs in which most of the research is towards

single-radio single-channel wireless mesh network [1, 2,3,4,5,6,7].For Channel estimation

measurement-based approach is mostly used QUORUM is a protocol used for Optimised routing

in WMN.It provides QoS properties by expecting delay and loss features of data traffic [4].

Estimation of bandwidth in allocating Channels is done either by measurement or by model

based approach. In measurement based approach channel estimation is not accurate due to

promiscuous listening. Channel estimation is mostly done based on measurement based

approach [1, 3, 11, 12].

Model-based channel estimation structure in [13,14] provide unpredictable end-to-end delay

guarantees. It is used in some hybrid structure for which measurements are provided as input.

Conflict graph model is used to provide interference free channel allocation in WMN by

recognizing mutually interfering link groups in[2].To estimate the aggregate flow rate on links,

the intra-flow interference are captured by conflict graph. In [9] to consider the interference from

far-off flows close to the border line, the carrier sensing range of radio is extended for channel

estimation.Admission control and channel estimation can be integrated with the on-demand

routing protocol called LUNAR.

If the network is deeply loaded the considerable amount of traffic is generated leading to

inaccurate results.In [8] to estimate the channel and interface selection channel idle time is used.

In [10], a threshold-triggered method is proposed for estimating channel wherethe dispute on the

path is detected by distributed call admission control mechanism. For effective load distribution

in multi-radio multi-channel mesh networks none of these approaches achieve the available link

diversity. Channel measurement is performed at lower layers to evaluate the accessible channel

bandwidth. The subsequent points have been concluded after the literature review. 1)Most of the resource-

reservation based approaches are considered for single-radio single-channel network. 2)Many of

the existing approaches do not fit in the intra-flow interference and channel estimation leading to imperfect channel estimation.3)Many of the approaches are measurement based, uses the idle time ratio to estimate the channel leading to imperfect channel estimation.The existing solutions do not fully utilize the link diversity and the capability of multi-link in multi-radio multi-channel mesh networks.

In this paper interference aware channel assignment with bandwidth reservation scheme for multi-radio multi-channel mesh networks is proposed. IACA-BR is a model-based scheme which attempts to estimate the available bandwidth by capturing the inter-flow and intra-flow interference. This algorithm fully utilizes all the available multiple links among the nodes. IACA-BR accomplishes the traffic by allocating the load over numerous simultaneous links.


1645

III. NETWORK MODEL

Wirelessmesh network with N nodes and Ri radio interface for each node i∈Nis considered.

thesuperiority (i, j) is the link in which the packet transmitted and indicates that the nodes i and j

can interconnect with each other till the nodes are they use a mutual channel.

In this network model we have taken 50 dynamic nodes. Among the 50 nodes few were made

as static and made this network as a hybrid network. These (both in hybrid and dynamic mode)

the nodes were increased from 50 to 250 nodes. The interference region is assumed to be twice

the transmission region. Every node broadcast HELLO packets to all nodes in its range. Every

other node will receive this HELLO packets from its neighbour in its interference range. This

allows a node to form a clique.

IV. IACA-BAflow diagram

NETWORK CREATION

COMPUTE AVERAGE TRANSMISSION DELAY

COMPUTE NODE DELAY

CHECK ACCUMULATED AVERAGE

INTERFERENCE

CHECK AVERAGE INTERFERENCE

COMPUTE INTER TREE INTERFERENCE

FLOW RATE ESTIMATION

BANDWIDTH ESTIMATION


1646

Fig 1. Flow diagram for IACA-BR

The Interference-Aware channel allocation with bandwidth reservation (IACA-BR) provides

resource-reservation for multi-radio multi-channel wireless mesh networks. Here each and every

node is furnished with number of radios. Each radio of a node is assigned to orthogonal channels

to minimize interference. The subsequent phases are followed in this algorithm

Randomly nodes are created and number of antenna and number of channel for each node

has been set. Then connectivity is performed for the nodes by connecting the nodes with their

neighbours. Every node should have their neighbourhood table and the nodes should furnished

with several radios tuned to orthogonal channels. Nodes occasionally broadcast HELLO packets.

These packets comprise node ID radio links that are accessible. Nodes in the transmission range

that received HELLO packets will notethe ID and the link.

Compute average transmission delay:

The systematic model of the average transmission delay (E[D]) can be calculated using

the equation E[D] = E[L] × E[X]. E[L] is the average length of a slot time, E[X] is the average

number of slot times required for effectively transmitting a new frame.

Compute inter tree interference:

In communication whateverthatchanges the signal as it travelsamong a source and a

receiver is named interference. Interference is not always distinguished from noise.The

subsequentcalculation is used to compute the total inter-tree interference cost of Tn under the

channel allocation case cs, as follows:

I(Tn(cs )

)= I i, j × pWjjϵSiiϵTn

Where Si is the set of inter-tree interfering nodes with respect to node i, and pWj is the

corresponding priority weight of node j.

Check average interference:

If a node has huge node delay restraint, there will be more delay in transmission of packet.

Before allocating the channel, the node will not know about the number of interfering nodes.

Sothe packet transmission delay (Di) can’t be exactlypredictable. Therefore,before allocating the

AGGREGATED BANDWIDTH ESTIMATION

REQUIRED BANDWIDTH ESTIMATION

CHANNEL ALLOCATION


1647

channel, the node delay restraint is mandatory to be set. Instead of Di, the average number of

interfering nodes (Ave_INi) of node i is used to set the node delay constraint of node i.

The average interference Ave_INican be estimated as follows.

Ave_INi= Max_INi

k

Max _IN ik=1 × k ×

p

q

k

× l

q

Max _IN i

where p/q and l/q specify the probabilities if the interference actuallyto be present between node

i and one of its probable interfering nodes or not, respectively.

Check accumulated average interference:

The accretion of Ave_IN (A_Ave_IN) offersorganizationdata to fairly set the node delay

constraints for the nodes on Tn. With the calculation of A_Ave_IN, each and every node can

recognize its largest weight path segment.

Compute node delay:

Node delay constraint N_DCi is calculated using the formula

N_DCi = Ave _IN i

A_Ave _IN i × DC − Tot_DCan ci

DC is the quantified path delay constraint to be fulfilled for Tn. The term (DC−Tot_DC anci )

represents the residual path delay constraint to be shared by node i and other nodes on its largest

weight path segment. The term Ave _IN i

A_Ave _IN i is the sharing ratio of node i.

Flow rate and bandwidth estimation:

For each link the flow rate that is the rate at which the packets have to be sent in that link

should be determined.Here the accessible bandwidth is evaluated by each and every node for all

the departing links by locally created conflict graphs by considering the interference from the

prevailing flows, and then the intra-flow.

Required bandwidth computation and QoS violation detection

For the packet to be sent the bandwidth required is calculated so that the path which has

both minimum expected interference and the path which has more residual bandwidth than the

required bandwidth is selected. If both of these are satisfied, link is created and request packet is

sent to that destination node, once if the node receives the destination packet the route replay is

sent through that established links. Once the source node accepts the route replay full path is

created and data packet is sent to the destination through this established path. The node which

does not have the required bandwidth and suppose if it involves in forwarding the packet it is a

violating node. These nodes are removed from the routing table and if in case violation detection

is found then routing table should be re-updated and the process should start from first.


1648

As an integral part of this method admission control, load balancing and resource

reservation have been accomplished. In admission control the present node checks if any hops

couldprovide the essential bandwidth for thearriving flow. If so, the route request packet is re-

broadcasted. If not the packet is throw down. To provide load matching the incoming flow is

distributed on multiple concurrent links within the Tree.

V. Performance evaluation:

Throughput vs. packet size :

Throughput is the rate of fruitful packets delivered over a communication channel. Itis

calculated in bits per second (bit/s or bps). Here throughput is measured in terms of data packets.

Fig2.Throughput vs. packet size in dynamic scenario

0

100000

200000

300000

400000

500000

600000

700000

800000

900000

200 300 400 500 600

thro

ugh

pu

t(b

ps)

packet size (byte)

THROUGHPUT

Throughput flow5 pbiabr

Throughput flow 5 iabr




Throughput flow3 iabr






1649

Jitter vs. packet size

Fig3.Jitter vs. Packet size in dynamic scenario

Average energy vs. Interval in dynamic scenario

0

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

200 300 400 500 600

jitt

er

(Se

c)

packet size (byte)

JITTER

jitter flow5 iabr

jitter flow 5 pbiabr

jitter flow4 iabr


jitter flow3 iabr

jitter flow3 pbiabr

jitter flow2 iabr

jitter flow2 pbiabr

jitter flow1 iabr

jitter flow1 pbiabr


1650

Fig 4. Average energy vs. Interval in dynamic scenario

Residual energy vs. Interval in dynamic scenario

0

0.05

0.1

0.15

0.2

0.25

50 60 70 80 90 100

avg

en

erg

y (j

ou

le)

interval (Sec)

AVG_ENERGY VS INTERVAL

avg_ene flow1 iabr

avg_ene flow1 pbiabr

avg_ene flow2 iabr


avg_ene flow3 iabr


avg_ene flow 4 iabr


avg_ene flow 5 iabr



1651

Fig 5.Residual energy vs. Interval in dynamic scenario

Analysis of Average energy and Residual energy is made in dynamic mode at different interval.

Both Average energy and Residual energy in proposed scheme is utilized properly compared to

the existing IABR algorithm because the channel is more efficiently allocated by considering

individual node delay than in IABR in dynamic mode.

ANALYSIS IN HYBRID SCENARIO

Throughput vs. packet size

.

99.65

99.7

99.75

99.8

99.85

99.9

99.95

100

100.05

50 60 70 80 90 100

resi

du

al

en

erg

y (

jou

le)

interval (Sec)

RESIDUAL_ENERGY VS INTERVAL

flow1 iabr

flow1 pbiabr

flow2 iabr

flow2 pbiabr

flow3 iabr

flow3 pbiabr

flow 4 iabr

flow4 pbiabr

flow 5 iabr

flow5 pbiabr


1652

Fig 6.Throughput vs. packet size in hybrid scenario

Jitter vs. packet size

Fig.7. Jitter vs. Packet size in hybrid scenario

0

50000

100000

150000

200000

250000

300000

350000

400000

200 300 400 600

thro

ug

hp

ut

(bp

s)

packet size (bytes)

THROUGHPUT











0

0.2

0.4

0.6

0.8

1

1.2

1.4

1.6

1.8

2

200 300 400 600

jitt

er (

sec)

packet size (bytes)

JITTER

jitter flow5 iabr


jitter flow4 iabr


jitter flow3 iabr

jitter flow3 pbiabr

jitter flow2 iabr

jitter flow2 pbiabr

jitter flow1 iabr

jitter flow1 pbiabr


1653

Average energy vs. Interval in hybrid scenario

Fig .8Average energy vs. Interval in hybrid scenario

Residual energy vs. Interval in hybrid scenario

0

0.05

0.1

0.15

0.2

0.25

0.3

0.35

0.4

0.45

0.5

100 110 120 130 140

Av

era

ge e

nerg

y (

Jo

ule

)

Interval(sec)

AVERAGE ENERGY VS. INTERVAL

avg_ene flow1 iabr


avg_ene flow2 iabr


avg_ene flow3 iabr


avg_ene flow 4 iabr


avg_ene flow 5 iabr



1654

Fig

9. Residual energy vs. Interval in hybrid scenario

VI. Conclusion:

Thus,a channel assignment algorithm is existing to minimize interference in WMNs. The

route delay restraint is well-thought-out in channel allocation to avoid each and every node on

the tree interfering with several other nodes. Differentfrom existing channel allocationschems,

the proposed scheme cautiouslyfeats partially overlapping channels in allocating channels in

addition to orthogonal channels. The bandwidth allocation is performed by providing excellent

load distribution and admission control for providing per flow end to end bandwidth guarantee

in multi-radio multi-channel wireless mesh network. Simulation results show a small

performance difference between the existing and the proposed schems.

REFERENCES [1] D. Gupta, P. Mohapatra, C. Chuah, Seeker, a bandwidth-based association control framework for wireless mesh networks, Wireless Networks 17 (2011)1287–1304.

[2] X. Cheng, P. Mohapatra, S. Lee, S. Banerjee, Maria: interference-aware admission control and QoS routing in wireless mesh networks, IEEE ICC (2008).

[3] Q. Xue, A. Ganz, QoS routing in mesh-based wireless networks, International Journal of Wireless Information Networks 9 (2002) 179–190.

[4] V. Kone, S. Das, B.Y. Zhao, H. Zheng, Quorum–quality of service in wireless mesh networks, ACM Mobile Networking and Applications (2008).

99.3

99.4

99.5

99.6

99.7

99.8

99.9

100

100.1

100 110 120 130 140

Re

sid

ual

En

erg

y(jo

ule

)

INTERVAL(sec)

RESIDUAL ENERGY VS. INTERVAL

flow1 iabr

flow1 pbiabr

flow2 iabr

flow2 pbiabr

flow3 iabr

flow3 pbiabr

flow 4 iabr

flow4 pbiabr

flow 5 iabr

flow5 pbiabr


1655

[5] B. Wang, M. Mutka, QoS-aware fair rate allocation in wireless mesh networks,Elsevier Journal on Computer Communications 31 (9C) (2008).

[6]Jin, Junfeng, Baohua Zhao, Hao Zhou. Link-weighted and distance-constrained channel assignment in single-radio wireless mesh networks. Local Computer Networks, 2009. LCN 2009. IEEE 34th Conference on. IEEE, 2009. [7]Aryafar, Ehsan, Omer Gurewitz, and Edward W. Knightly. Distance-1 constrained channel assignment in single radio wireless mesh networks.INFOCOM 2008. The 27th Conference on Computer Communications. IEEE. IEEE, 2008. [8] S. Kajioka, N. Wakamiya, H. Satoh, K. Monden, M. Hayashi, S. Matsui, M.Murata, A QoS-aware routing mechanism for multi-channel multi-interface ad-hoc networks, Elsevier AdHoc Networks 9 (5) (2011) 911–927.

[9] M. Ergin, M. Gruteser, L. Liu, D. Raychaudhri, H. Liu, Available bandwidth estimation and admission control for QoS routing in wireless mesh networks, Elsevier Journal on Computer Communications 31 (9) (2008).

[10] T. Liu, W. Liao, Interference-aware QoS routing for multi-rate multiradio multi-channel IEEE 802.11 wireless mesh networks, IEEE Transactions on Wireless Communications 8 (1) (2009) 166–175.

[11] L. Chen, W. Heinzelman, QoS-aware routing based on bandwidth estimation in mobile ad hoc networks, IEEE Journal on Selected Areas in Communications (2005).

[12]Y. Yang, R. Kravets, Contention-aware admission control for ad hoc networks,University of Illinois at Urbana-Champaign, Technical Report 2003-2337,2003. [13] . Abdrabou, W. Zhuang, Statistical QoS routing for IEEE 802.11 multihop ad hoc networks, IEEE Transactions on Wireless Communications 8 (3) (2009) 1542–1552.

[14] P. Jacquet, A. Naimi, G. Rodolakis, Asymptotic delay analysis for cross-layer delay-based routing in ad hoc networks, Advances Multimedia (2007).

[15] D.S.J. De Couto, D. Aguayo, J. Bicket, R. Morris, A high-throughput path metric for multi-hop wireless routing, in: Proceedings of the 9th ACM International Conference on Mobile Computing and Networking, MobiCom, 2003.

[16] R. Draves, J. Padhye, B. Zill, Routing in multi-radio, multi-hop wireless mesh networks, in: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, 2004.

[17] M.M.B.P. Subramanian, S. Miller, Interference aware routing in multi-radio wireless mesh networks, in: IEEE Workshop on Wireless Mesh Networks (WiMesh), 2006.

[18] U. Ashraf, S. Abdellatif, G. Juanole, An interference and link-quality aware routing metric for wireless mesh networks, in: IEEE Vehicular Technology Conference, 2008.

[19] U. Ashraf, S. Abdellatif, G. Juanole, Route selection in IEEE 802.11 wireless mesh network, Springer Telecommunication Systems (2011), http:// dx.doi.org/10.1007/s11235-011-9493-5 (Special Issue on Mobile Computing and Networking Technologies, ISSN: 1018-4864, 2011.).


1656


1657

1658

Date post:	26-Jul-2020
Category:	Documents
Upload:	others
View:	4 times
Download:	0 times

INTERFERENCE AWARE CHANNEL ASSIGNMENT WITH BANDWIDTH NETWORKS · INTERFERENCE AWARE CHANNEL...

Documents