A Novel Algorithm for Channel and Rate Re assignment in ... · [email protected] 1, [email protected] 2, [email protected] 3 Abstract Wireless Mesh Network troubles in the

A Novel Algorithm for Channel and Rate Reassignment in Wireless Mesh

Network

T. Thanigasalam1, Research scholar, Bharath Institute of Higher Education & Research,Chennai.

Dr. V. Khanaa2, Dean Info. ,BIST, BIHER, Bharath University,Chennai.

Dr. R.M. Suresh3, Professor, Sri Lakshmi Ammal Engineering College.

[email protected], [email protected], [email protected]

Abstract Wireless Mesh Network troubles in the project of channels to radios is the case mesh routers are

prepared with a couple of radios. The multiracial arrangement is attractive progressively more

commonplace, as routers might additionally exploit the obtain ability of multiple radios to

instantaneously communicate and/or get hold of on specific channels. Consequently, it is viable to

lessen the interference and growth the throughput by way of carefully planning the challenge of

channels to radios. The trouble is to regulate the quantity of facts transmission on each route. The

reallocation of channel should be achieved each time the network paths alternate. In existing device

uses channel relocation algorithm. This present device offered the minimum variation channel and

price reassignment algorithm. To make bigger the MCVRA (Minimum Variation Channel and

Reassignment Algorithm) which takes the cutting-edge channel assignment and the brand new set of

drift prices into consideration and tries to decrease the most overall utilization over all of the collision

domain names With recognize to MVCRA, MVCRA-R (Minimum Variation Channel and Rate

Reassignment Algorithm) leverages the opportunity to adjust the link primarily based at the records

transmission rate and provides a few enhancements such as an stepped forward description of the link

significances, which increase security improvement in our enactment.

Keywords- Wireless Mesh Network, Channel Reassignment, MCVRA.

I. Introduction In a mesh network, every of the community node, pc and different gadgets, are consistent with each

other. Each node no longer simplest sends its very individual signals however also relays records from

extra nodes. In truth a real mesh topology is the only where each node is associated to every other

node within the community. This type of topology may be very high priced as there are many

dismissed influences, thus it is not on the whole used in laptop networks. It is usually utilized in wi-fi

networks. Flooding or routing performance is utilized in mesh topology[1-5].

Data can be communicated from unique devices instantaneously. This topology can resist excessive

site visitors. Even if one of the additives fails there may be always an opportunity present. So statistics

switch doesn’t get affected.

Expansion and change in topology can be accomplished without disrupting different nodes.

Wireless mesh networks provide some of advantages. In a mesh community, nodes join wirelessly to

transmit information. The nodes are much less costly to install than wired routers required for regular

wi-fi networks. The extra nodes there are, the bigger and quicker the wi-fi vicinity will become.

Wireless mesh networks are greater handy in regions which have boundaries which can reason

problems with "line of sight" wi-fi transmission. More nodes in big, busy locations method extra

International Journal of Pure and Applied MathematicsVolume 118 No. 18 2018, 45-56ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version)url: http://www.ijpam.euSpecial Issue ijpam.eu

45

probabilities to find a clear wi-fi sign. Mesh networks are self-configuring, self-restoration and are

very clean to install. In addition, they're a lot quicker due to the fact records can travel among nodes

without being sent returned to a critical server[6-9].

In cell computing platform statistics among processing gadgets flows via wireless channels. The

dispensation units are unfastened from chronological and spatial constraints. That is, a dispensation

unit is undone to transport about in the area at the same time as being linked to the server. The cell

connectivity among two nodes exists if they're continuously related thru wireless channel, and might

make use of the channel deprived of being subjected to spatial and temporal constraints. Information

processing has large applicability. In truth it isn't incorrect to say that the cellular computing is one of

the most important components of today's information generation which includes e-commerce, web,

and so forth[10-16].

Fig 1 A Nearly fully connected information space

Fig 1 area exemplifies the idea of a fully associated data area fashioned thru cellular

connectivity mode where each unit can speak to every other unit over wi-fi channel. The power of cell

connectivity has been known by using the studies network and also by way of the marketplace. To

absolutely take advantage of its inherent strength the following challenges need to be met.

In radio useful resource control for wireless and cell community, channel undertaking

schemes are required to allocate bandwidth and conversation channels to base stations, get admission

to factors and terminal system. The objective is to obtain most system spectral performance by way of

frequency reuse, but still guarantee a positive grade of service by using averting co-channel

interference and adjoining channel interference among close by cells or networks that share the

bandwidth.

A router is used to assign the route between the supply and destination nodes. The

International Journal of Pure and Applied Mathematics Special Issue

46

assignment of channels is dependent of the routing problem. In a wi-fi mesh community all nodes are

interconnected. Same channel have to be assigned within the neighboring nodes. It may have an effect

on the channel bandwidth and additionally have an effect on the facts in a community. The links are

affect the bandwidth primarily based on channel equal community. The channels are allocated

influences the quantity of bandwidth accessible on path, and consequently channel undertaking hassle

need to be collectively describe with the routing trouble[17-24].

Therefore, the proposals that lately regarded inside the current technology such combined

problem remedy the channel undertaking problem and the routing hassle one at a time. Enforcing the

new project will as a consequence necessitate changing the frequencies allotted to numerous radios.

Exchanging channel on an association breaks the system availability for an any lengthier time

than that compulsory by methods for the association equipment to move to the new recurrence. In this

manner, it is spotless that the more verbal trade switch channel, the higher the impact on the system

execution. For this rationale, we blessing a basic experiential that considers the front line channel task

and interests to alter at most a configurable wide assortment of channels to address an adaptation

inside the arrangement of coast charges in the fine way imaginable. Channel reassignment calculation,

as an option, begins from one such answer and rolls out a few improvements to find a higher

arrangement. Channel reassignment not just instated such arrangement it could be doled out each

other allotment of channel challenge[25].

Another idea is constrain the conspiracy expand the throughput cost on the grounds that the

goal of channel reassignment set of tenets. Likewise, that previously mentioned assessment grants us

to find aorientation cost for the greatest general use that guarantees that the system is unquestionably

ready to bring the provided site guests stack. Along these lines, the circumstance that the most

aggregate usage surpasses such orientation cost can be utilized as a sign that a channel relocation is

desired. We actualized such criterium in real guests strains, which affirmed that reassigning channels

by the utilization of our heuristic lets in a fantastic amount development with acknowledge to the

technique of departure the channel task unaltered[26].

FCRA is a grasping channel project empirical that excerpts all the links one-through-one and

allocates every link the channel that presently diminishes the most total application amongst all of the

impact domain names which include the extracted link.

II. Related Works

In this related works give a clarification for reference paper and depict the techniques of proposed

approach. A multi-channel remote work organize (WMN) structure(called Hyacinth) that prepares

each work group hub with various 802.Eleven people group interface cards (NICs). The significant

outline issues of this multi-channel WMN engineering are channel venture and directing. Demonstrate

that shrewd channel venture is vital to Hyacinth's execution, show dispensed calculations that use

handiest neighborhood guests stack actualities to progressively dole out channels and to course

parcels, and think about their general execution towards a concentrated arrangement of principles that

plays out the indistinguishable highlights[27].

In this related works give a clarification for reference paper and depict the techniques of proposed


47

approach. A multi-channel remote work organize (WMN) structure(called Hyacinth) that prepares

each work group hub with various 802.Eleven people group interface cards (NICs). The significant

outline issues of this multi-channel WMN engineering are channel venture and directing. Demonstrate

that shrewd channel venture is vital to Hyacinth's execution, show dispensed calculations that use

handiest neighborhood guests stack actualities to progressively dole out channels and to course

parcels, and think about their general execution towards a concentrated arrangement of principles that

plays out the indistinguishable highlights.

Broadness First Search Channel Assignment is the capacity inconvenience in remote work systems

might be lightened by furnishing the work switches with various radios tuned to non-covering

channels. Nonetheless, channel undertaking presents a mission since co-put wi-fi systems are

conceivably to be tuned to the equivalent channels. The resulting development in impedance can

antagonistically influence performance. The proposed arrangement shrewdly relegates channels to

radios to diminish obstruction inside the work organize and among the work group and co-situated wi-

fi systems. It uses a particular obstruction estimation approach actualized at each work switch.

Channel Assignment Algorithm in light of Superimposed Codes. Propelled by utilizing the comment

that channel undertaking for multiradio multi-channel work systems must help both unicast and

nearby broadcast1, must be impedance mindful, and should bring about low all inclusive exchanging

delay, high throughput, and low overhead, prescribe two adaptable confined channel undertaking

calculations in view of s-disjunct superimposed codes. These calculations help the nearby

communicate and unicast effectively, and obtain obstruction free channel wander under beyond any

doubt circumstances. Moreover, under the main impedance imperatives, the channel challenge

calculation for unicast can pick up a hundred percent throughput with a simple booking set of

guidelines, for example, the maximal weight unprejudiced set planning, and may completely stay

away from covered up/uncovered terminal issues underneath specific circumstances[28].

Brought together Tabu-principally based Algorithm is Consider multi-jump wi-fi work systems,

where each switch hub is outfitted with a few radio interfaces and a few channels are to be had for

discussion. Address the issue of doling out channels to verbal trade connects inside the system with

the target of limiting standard system impedance. Since the assortment of radios on any hub might be

significantly less than the scope of accessible channels, the channel undertaking must comply with the

requirement that the wide assortment of different channels appointed to the hyperlinks occurrence on

any hub is at most the amount of radio interfaces on that hub. The above enhancement issue is

believed to be NP-troublesome[29].

III. System Model

3.1 Design of MVCRA-R

User can register the details to mesh router. User can send data to the destination node. User

can specify the destination address. After that nodes can send data to the corresponding mesh router.

Mesh router can send data to another mesh router through a channel. The determination of mesh

router based on the destination user address. Any collision occurs in the channel if the channel should

be reassigned.. If the channel should be reassigned using MVCRA-R. After that data send to

destination mesh router. The data can be received by the destination user. Figure 2 shows the overall

architecture of Minimum Variation Channel Wireless Mesh Network.


48

Fig 2 Overall System Architecture

3.2 Network Formation In this module send the work switch and make client hub for every last work switches. Client

ought to make moderate way and dole out course esteems for each middle of the road way. Work

topology is a sort of system topology where every hub must catch and disperse its own information, as

well as fill in as a transfer for different hubs, that is, it must team up to engender the information in

the system. A work system can be planned utilizing a steering procedure. When utilizing a directing

system, the message is proliferated along a way, by jumping from hub to hub until the point that the


49

goal is come to. To guarantee every one of its ways' accessibility, a directing system must take into

account constant associations and reconfiguration around broken or blocked ways. A work organize

whose hubs are altogether associated with each other is a completely associated arrange[30].

3.3 Data Distribution

This module user can send and receive the data to one node to another node using

intermediate mesh routers. The user message is first reached to mesh router. After receiving the user

message mesh router assign the channel to current user as per the flow rate and traffic pattern[31].

Mesh router watch the status data forward or not. If the data not forward means minimum number

count is increased by 1 count.

3.4 Find Collusion Domain

At the time of data transmission any of the routers occurring the collusion, Mesh router first

checks minimum number rate count is exceeded or not to current collusion channel. If the Minimum

number counts is exceeded means that is the collusion domain. After finding the collusion domain,

path wise find maximum utilization of current collusion domain. After finding the collusion domain

reduce the collusion of current collusion domain.

3.5 Rate reassignment using MVCRA-R

After finding the collusion domain, revised the flow rate for maximum collusion path using

MVCRA-R algorithm. This algorithm first gets the collusion domain name, Path wise flow rate and

finds total number of path available for particular collusion domain[32]. After getting the details, in

highest flow rate’s path increase the flow rate additionally according to total number of path available

in current collusion domain. Fig 3 shows the process of rate reassignment using MVCRA-R.

IV Algorithm 4.1 MVCRA-R

To determine what radios need to be assigned a brand new channel, first compute the full utilization

of all of the collision domains as decided via the cutting-edge channel task and the new set of flow

costs. MVCRA-R is assumed the cutting-edge obligation of channels, the brand new set of waft fees

and the MaxNumChanges parameter, which regulates the maximum allowable quantity of

adjustments to the channels allotted to the radios. MVCRA include community records, information

drift fee, maximum number of channel mission cost. MVCRA contain network information,

information go with the flow rate, maximum quantity of channel project cost[33]. First compute the

whole utilization of collision area. All the links are inserted into the queue. Check the variety of

modifications is extra than maximum range of modifications. Links are extracted by using reducing.

The precedence of a hyperlink is given by using its float to capacity ratio times the wide variety of

hyperlinks whose collision domain consists of and has a total usage above a assumed threshold Figure

four.1 Pseudocode MVCRA-R is describe set of rules for MVCRA-R.

MIN_UTOT function is implemented is used to decrease the collision. CHANGE_IF function is

appearing to assign the channel. MIN_DISTRUPT feature returns the minimum weight channel.

MVCRA ends the queue of the link is empty accordingly all of the hyperlinks have allocated a

channel and hereafter the community topology is conserved.


50

MIN_UTOT restores the channel that limits and the cost chose for that channel. In one of a kind, so as

never again to take decisions that would bother the entire use of various crash space names, the

MIN_UTOT trademark moreover deliberates, for each channel inside the set, the full application of

the impact area of the greater part of the hyperlinks which could have in their impact area.

ADJUST_RATE trademark is summoned. Such a capacity begins off evolved by considering the best

charge feasible after which continues by methods for iteratively endeavoring lower expenses.

The amount of float at the pending connections is basic as appropriately, in light of the fact that a

pending connection may be appointed a channel that limits likewise interruptions set up of one that

limits the most aggregate use over the majority of the impact space names that comprise of it.

MIN_DISRUPT restores the channel with the base weight which at that point needs to get supplanted

through on hub[34]. Therefore, every one of the connections on that had been utilizing channel must

be doled out another channel.

Mesh Router

Get Collusion Domain Name, Path

Wise Flow Rate & Total Path Available

Reassign Flow Rate

Using MVCRA-R

Fig 3 Rate reassignment using MVCRA-R

( ( ) { ( )} )

( ) ∑

( )

( )

( )

{ }

(

)

( → ) ( )

( ( → )) ( )

( )

( )

E { → } { → }

( ) ( )

( ) ( )


51

∑ ( ) ∑ ( )

( )

( )

( ( → )) ( )

( )

( ) E { → } { → } Figure 4.1 Pseudocode MVCRA-R.

CHANGE_IF is titled to completely allot the chose channel to one of the radios on s and t. Obviously,

1 or infinity of those calls (contingent upon whether or no longer s and t communal a not surprising

channel) backpedal at the present time, because of the reality one or each of the quit hubs as of now

have a radio on the picked channel. MVCRA-R closes, the line of the pending hyperlinks is void,

accordingly guaranteeing that each one the hyperlinks have been allocated a channel besides hence

the group topology is safeguarded.

V. Conclusion and Future Work

5.1 Conclusion

MVCRA-R set of rules, which receipts the modern channel venture and the brand new set of

go with the flow quotes into consideration and tries to limit the maximum general operation over all

the accident provinces while constraining the range of radios that can be assigned a new channel.

With admiration to MVCRA, MVCRA-R leverages the opportunity to alter the link programme prices

and provides a few improvements which includes an improved definition of the link priorities.

Implementation is established that MVCRA-R kind of meets the restriction on the most allowed range

of radio vicissitudes and outdoes the whole current channel project algorithm in phrases of most

overall usage and network through put[35].

5.2 Future Work

Main goal is find collusion domain and rate reassignment only using MVCRA-R algorithm.

In addition work of this process is providing security enhancement on each and every user data. That

module after uploading the user text file converted into a cyber text file using hashing algorithm and

provide the key to concern user[36]. End user receive cyber text file and converted into actual format

using received key. In that process any of the intermediate not misuse the original data.

REFERENCES

1. Hameed Hussain J., Anbazhgan G., Improve of the cop of vapour compression refrigeration

system by using thermoelectric cooler, International Journal of Pure and Applied

Mathematics, V-116, I-14 Special Issue, PP-585-589, 2017

2. Nakkeeran S., Hussain J.H., Innovative technique for running a petrol engine with diesel as a

fuel, International Journal of Pure and Applied Mathematics, V-116, I-18 Special Issue, PP-41-

44, 2017


52

3. Naveenchandran P., Vijayaragavan S.P., A sensor less control of SPM using fuzzy and ANFIS

technique, International Journal of Pure and Applied Mathematics, V-116, I-13 Special Issue,

PP-43-50, 2017

4. Hameed Hussain J., Nakkeeran S., Design and development of pepper plucking equipment,

International Journal of Pure and Applied Mathematics, V-116, I-14 Special Issue, PP-573-

576, 2017

5. Naveenchandran P., Vijayaragavan S.P., A high performance inverter fed energy efficient

cum compact microcontroller based power conditioned distributed photo voltaic system,


169, 2017

6. Golden RenjithNimal R.J., Hussain J.H., Stress analysis of gear tooth using metal,


322, 2017

7. Hameed Hussain J., Hariharan R., Development of temperature-time and pressure-time

diagrams for diffusion bonding ti-aa7075 dissimilar materials, International Journal of Pure

and Applied Mathematics, V-116, I-14 Special Issue, PP-493-499, 2017

8. Udayakumar R., Khanaa V., Saravanan T., Saritha G., Cross layer optimization for wireless

network (WIMAX), Middle - East Journal of Scientific Research, V-16, I-12, PP-1786-1789,

2013

9. Khanaa V., Thooyamani K.P., Udayakumar R., Cognitive radio based network for ISM band

real time embedded system, Middle - East Journal of Scientific Research, V-16, I-12, PP-1798-

1800, 2013

10. Khanaa V., Mohanta K., Saravanan T., Comparative study of uwb communications over fiber

using direct and external modulations, Indian Journal of Science and Technology, V-6, I-

SUPPL.6, PP-4845-4847, 2013

11. Kumarave A., Udayakumar R., Web portal visits patterns predicted by intuitionistic fuzzy

approach, Indian Journal of Science and Technology, V-6, I-SUPPL5, PP-4549-4553, 2013

12. Thooyamani K.P., Khanaa V., Udayakumar R., An integrated agent system for e-mail

coordination using jade, Indian Journal of Science and Technology, V-6, I-SUPPL.6, PP-4758-

4761, 2013

13. Sengottuvel P., Satishkumar S., Dinakaran D., Optimization of multiple characteristics of EDM

parameters based on desirability approach and fuzzy modeling, Procedia Engineering, V-64,

PP-1069-1078, 2013

14. Udayakumar R., Khanaa V., Saravanan T., Synthesis and structural characterization of thin

films of sno2 prepared by spray pyrolysis technique, Indian Journal of Science and

Technology, V-6, I-SUPPL.6, PP-4754-4757, 2013

15. Udayakumar R., Kumarave A., Rangarajan K., Introducing an efficient programming paradigm

for object-oriented distributed systems, Indian Journal of Science and Technology, V-6, I-

SUPPL5, PP-4596-4603, 2013

16. KeranaHanirex D., Kaliyamurthie K.P., Multi-classification approach for detecting thyroid

attacks, International Journal of Pharma and Bio Sciences, V-4, I-3, PP-B1246-B1251, 2013

17. Udayakumar R., Khanaa V., Kaliyamurthie K.P., Performance analysis of resilient ftth

architecture with protection mechanism, Indian Journal of Science and Technology, V-6, I-

SUPPL.6, PP-4737-4741, 2013

18. Udayakumar R., Khanaa V., Kaliyamurthie K.P., Optical ring architecture performance

evaluation using ordinary receiver, Indian Journal of Science and Technology, V-6, I-SUPPL.6,

PP-4742-4747, 2013


53

19. Udayakumar R., Khanaa V., Saravanan T., Chromatic dispersion compensation in optical fiber

communication system and its simulation, Indian Journal of Science and Technology, V-6, I-

SUPPL.6, PP-4762-4766, 2013

20. Sundarraj M., Study of compact ventilator, Middle - East Journal of Scientific Research, V-16,

I-12, PP-1741-1743, 2013

21. Udayakumar R., Khanaa V., Saravanan T., Analysis of polarization mode dispersion in fibers

and its mitigation using an optical compensation technique, Indian Journal of Science and


22. Gopalakrishnan K., PremJeya Kumar M., SundeepAanand J., Udayakumar R., Thermal

properties of doped azopolyester and its application, Indian Journal of Science and


23. Udayakumar R., Khanaa V., Kaliyamurthie K.P., High data rate for coherent optical wired

communication using DSP, Indian Journal of Science and Technology, V-6, I-SUPPL.6, PP-

4772-4776, 2013

24. KeranaHanirex D., Kaliyamurthie K.P., Kumaravel A., Analysis of improved tdtr algorithm for

mining frequent itemsets using dengue virus type 1 dataset: A combined approach,

International Journal of Pharma and Bio Sciences, V-6, I-2, PP-B288-B295, 2015

25. Thooyamani K.P., Khanaa V., Udayakumar R., Using integrated circuits with low power multi

bit flip-flops in different approch, Middle - East Journal of Scientific Research, V-20, I-12, PP-

2586-2593, 2014

26. Gopalakrishnan K., SundeepAanand J., Udayakumar R., Electrical properties of doped

azopolyester, Middle - East Journal of Scientific Research, V-20, I-11, PP-1402-1412, 2014

27. Thooyamani K.P., Khanaa V., Udayakumar R., Partial encryption and partial inference control

based disclosure in effective cost cloud, Middle - East Journal of Scientific Research, V-20, I-

12, PP-2456-2459, 2014

28. Sundar Raj M., Saravanan T., Srinivasan V., Design of silicon-carbide based cascaded

multilevel inverter, Middle - East Journal of Scientific Research, V-20, I-12, PP-1785-1791,

2014

29. Thooyamani K.P., Khanaa V., Udayakumar R., Wide area wireless networks-IETF, Middle -

East Journal of Scientific Research, V-20, I-12, PP-2042-2046, 2014

30. Kanniga E., Srikanth S.M.K., Sundhararajan M., Optimization solution of equal dimension

boxes in container loading problem using a permutation block algorithm, Indian Journal of

Science and Technology, V-7, PP-22-26, 2014

31. Arulselvi S., Sundararajan M., Smart control system in traffic analysis using RTK-GPS

standards, International Journal of Pure and Applied Mathematics, V-116, I-15 Special Issue,

PP-349-352, 2017

32. Arulselvi S., Karthik B., Sundararajan M., A frame work for road network extraction from

remotely sensed high resolution images, International Journal of Pure and Applied

Mathematics, V-116, I-15 Special Issue, PP-355-360, 2017

33. Arulselvi S., Karthik B., Sundararajan M., Super resolution method for Thumbnail Web image,


373, 2017

34. Arulselvi S., Karthik B., Sundararajan M., Linear framework free rewriting systems,


367, 2017

35. Kanniga E., Selvaramarathnam K., Sundararajan M., Kandigital bike operating system, Middle

- East Journal of Scientific Research, V-20, I-6, PP-685-688, 2014


54

36. Lakshmi C., Ponnavaikko M., Sundararajan M., Improved kernel common vector method for

face recognition varying in background conditions, Lecture Notes in Computer Science

(including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in

Bioinformatics), V-6026 LNCS, PP-175-186, 2010

37. M. Rajesh, K.Sathesh Kumar, K.Shankar, M. Ilayaraja., SENSITIVE DATA SECURITY IN CLOUD

COMPUTING AID OF DIFFERENT ENCRYPTION TECHNIQUES, Journal of Advanced Research in

Dynamical and Control Systems, Volume 18, PP-2888-2899, 2017

38. M. Rajesh, A signature based information security system for vitality proficient information

accumulation in wireless sensor systems, International Journal of Pure and Applied

Mathematics, Volume 118, Issue 9, Pages 367-387

39. M. Rajesh, A Review on Excellence Analysis of Relationship Spur Advance in Wireless Ad Hoc

Networks, International Journal of Pure and Applied Mathematics, Volume 118, Issue 9,

Pages 407-412

40. Rajesh, M., and J. M. Gnanasekar. "Path Observation Based Physical Routing Protocol for

Wireless Ad Hoc Networks." Wireless Personal Communications 97.1 (2017): 1267-1289.

41. Rajesh, M., and J. M. Gnanasekar. "Congestion Control Scheme for Heterogeneous Wireless

Ad Hoc Networks Using Self-Adjust Hybrid Model." International Journal of Pure and Applied

Mathematics 116 (2017): 537-547.

42. Rajesh, M., and J. M. Gnanasekar. "Get-Up-And-Go Efficientmemetic Algorithm Based

Amalgam Routing Protocol." International Journal of Pure and Applied Mathematics 116

(2017): 537-547.


55

56

A Novel Algorithm for Channel and Rate Re assignment in ... · [email protected] 1, [email protected] 2, [email protected] 3 Abstract Wireless Mesh Network troubles in the

Documents