On Optimizing Gateway Placement for Throughput in Wireless Mesh Networks
- Ping Zhou^{1},
- Xudong Wang^{2}Email author,
- BS Manoj^{3} and
- Ramesh Rao^{3}
DOI: 10.1155/2010/368423
© Ping Zhou et al. 2010
Received: 4 November 2009
Accepted: 24 February 2010
Published: 12 April 2010
Abstract
An innovative gateway placement scheme is proposed for wireless mesh networks (WMNs) in this paper. It determines the location of a gateway based on a new performance metric called multihop traffic-flow weight (MTW). The MTW computation takes into account many factors that impact the throughput of WMNs, that is, the number of mesh routers, the number of mesh clients, the number of gateways, traffic demand from mesh clients, locations of gateways, and possible interference among gateways. Thus, the proposed gateway placement scheme provides a framework of significantly improving throughput of WMNs through proper placement of gateways. To evaluate the performance of the new gateway placement scheme, a nonasymptotic throughput of WMNs is derived by considering TDMA scheduling. The derivations also provide a guideline for designing scheduling schemes of WMNs. Numeric results show that the proposed gateway placement scheme constantly outperforms other schemes by a large margin.
1. Introduction
Many research problems still remain open in WMNs [1]. Among them, gateway placement is one of the most challenging but problem. There are some analogous research results in wired or cellular networks. For example, a number of studies have been carried out to place web proxies or server replicas to optimize clients' performance [2–4]. Another example is the base station placement problem in cellular networks [5–7]. However, when wireless links replace wired links and multi-hop communications replace single-hop communications, a more comprehensive traffic modeling scheme is required to solve the backbone nodes placement problem in multi-hop wireless networks. More recently, Bejerano [8] studied gateway placement in multi-hop wireless networks where network nodes were partitioned into minimal number of disjoint clusters that satisfied throughput and delay constraints. Various gateway or backbone nodes placement algorithms were proposed for WMNs [9–12]. However, all the above investigation has been focused on network connectivity of WMNs by deploying the minimum number of backbone nodes.
Throughput is one of the most critical parameters that ensure the services of WMNs to meet the requirements of customers. Unlike all the above research work, in this paper, given a certain number of gateways, we aim to develop a gateway placement algorithm to significantly enhance throughput performance of WMNs. A very similar problem was addressed in [13], but in that study gateway locations are either prefixed or searched on a preselected grid in a brutal-force way. Moreover, uneven distributed traffic demand has not been studied. In our paper, optimal gateway locations can be quickly chosen by an intelligent algorithm, which applies for all the traffic distribution scenarios.
To develop a throughput-oriented gateway placement algorithm, we first derive a new performance metric called multi-hop traffic-flow weight (MTW) to take into account major factors that impact throughput of WMNs. Such factors include the number of mesh routers, mesh clients, and gateways as well as traffic demands from mesh clients, locations of gateways, and interference among gateways. Based on MTW, an iterative algorithm is proposed to determine the best location of a gateway. Each time a gateway is chosen to colocate with the mesh router that has the highest MTW.
To evaluate the performance of the MTW-based gateway placement scheme, a throughput computation model needs to be derived. However, throughput analysis of wireless networks is an extremely challenging research topic. Throughput capacity of multi-hop wireless networks has been studied in other papers. Gupta and Kumar [14, 15] derived the per-node throughput capacity for static ad hoc networks. The throughput capacity of mobile ad hoc networks was analyzed by Grossglauser and Tse [16]. The capacity of hybrid ad hoc networks was investigated in [17–19]. All such results of throughput analysis cannot be applied to WMNs, because the network architecture of WMNs is much different from either conventional ad hoc networks or hybrid ad hoc networks. The work of asymptotic analysis on the capacity of WMNs has been initiated in [20] where asymptotic throughput results are obtained by assuming that the size of the network goes to infinity. Since real networks always have limited size, these asymptotic results provide very limited information for practical network design. Thus, in this paper a nonasymptotic analytical model is derived to calculate the throughput of WMNs. TDMA scheduling is assumed to coordinate packet transmissions in mesh clients, mesh routers, and gateways.
Numerical results based on the throughput computation model show that the new gateway placement algorithm greatly enhances the throughput performance of WMNs. Comparison study is also carried out in this paper to compare the proposed scheme with other schemes such as random placement, regular placement, and busiest router placement. Results illustrate that our proposed gateway placement algorithm outperforms all these schemes by a large margin.
The rest of this paper is organized as follows. In Section 2, a typical WMN model is described and two throughput metrics for gateway placement are formulized. The new gateway placement algorithm is proposed in Section 3, while the throughput computation model needed by this algorithm is derived in Section 4. The numeric results are obtained in Section 5 to evaluate the performance of the proposed algorithm. This paper is concluded in Section 6.
2. System Model and Problem Formulation
2.1. Network Topology
Each mesh client is a data source and a data destination. All mesh clients are equivalent such that they always have the same amount of packets to send or receive during a certain time. Unlike mesh clients, mesh routers are neither data source nor data destination; they only route and forward data for mesh clients. All traffic is assumed to go through gateways. Each mesh router is associated with its nearest gateway such that it relays packets to or from it. Assuming that the shortest path routing is applied, the nearest gateway of a mesh router is defined as the gateway that the mesh router can access to by the minimal number of hops. In the situation that a mesh router has more than one nearest gateways, the router will load its traffic to all its nearest gateways by round robin. A mesh client is said to be associated with a gateway if its connected router is associated with the gateway. Hence, traffic load of a mesh client will also be shared by all its potentially associated gateways.
In this paper the following definitions of communications will be frequently used.
- (i)
Local communications: it is referred as the communications between a mesh router and a mesh client.
- (ii)
Backbone communications: it is referred as the communications between two mesh routers, which includes the communications between a gateway and a mesh router.
- (iii)
Downlink communications: it is referred as the communications from a gateway to a mesh client, in which a data packet is first relayed among mesh routers in backbone communications and is then sent by a mesh router to one of its connected mesh clients.
- (iv)
Uplink communications: it is referred as the communications from a mesh client to a gateway, in which a data packet is sent in the exact reverse direction as described in downlink communications.
2.2. Transmission Model
To help elaborate the new gateway placement scheme and its throughput computation, a transmission model is specified as follows.
Each mesh router is equipped with two radio interfaces: one transmitting at bits/s for backbone communications and the other transmitting at bits/s for local communications. Each mesh client transmits at bits/s in local communications. We assume that and are orthogonal so that local communications do not interfere with backbone communications. It should be noted the two radio interfaces of a mesh router can be two physical radio interfaces or two virtual radio interfaces. In the later case, only one physical radio interface is needed for a mesh router and switching channels in time slots for backbone or local communications achieves two virtual interfaces.
Moreover, mesh routers can receive packets from only one sender at a time. The same constraint is imposed on mesh clients. Transmission and reception can occur in either time-division duplex (TDD) or frequency division duplex (FDD), depending on how the physical and MAC layers are implemented.
In either local communications or backbone communications, simultaneous transmissions are coordinated by the Protocol Model as defined in [14]; that is, if a transmission from node to is successful, then the following conditions must be satisfied: ; for every other transmitting node , where and correspond, respectively, to the transmission range of node and and is a fixed positive constant that represents a guard zone in the Protocol Model.
2.3. Throughput
In order to evaluate the performance of gateway placement algorithms, the aggregate throughput and the worst-case per-client throughput need to be derived. In this subsection, two problems of throughput maximization are formulized, which leads to the definitions of two throughput metrics. The actual framework of computing the nonasymptotic value of these throughput metrics will be provided in Section 4.
Problem 1.
is maximized, where denotes the per-client throughput of the th mesh client when gateways are deployed.
Problem 2.
is maximized.
3. Multihop Traffic-Flow Weight Gateway Placement
Adding new gateways can increase throughput in backbone communications by effectively reducing the average number of hops each packet needs to access to gateways and reducing the traffic load on existing gateways. However, the above benefits can dramatically diminish due to inappropriate gateway placement, since new gateways will also result in more interference to existing gateways. Therefore, the best gateway placement algorithm should not only relieve traffic load in the network but also introduce minimal interference.
In general a gateway placement scheme must be adaptive to the deployed number of gateways. A relative small number of deployed gateways mean a large number of hops that a packet needs to traverse to gateways, which results in huge traffic load. Therefore, geometry-balanced placement algorithms, for example, regular placement, may achieve fairly good results since they can effectively reduce the average number of hops. In the opposite case, when a relatively large number of gateways are planned for deployment, placing the gateways in the areas with the most traffic load may be simply the best solution.
In this section, an innovative gateway placement algorithm is proposed. It holds all the above-mentioned benefits. In the algorithm, a traffic-flow weight, denoted by , is calculated iteratively on the mesh router , . Each time a new gateway will be placed on the router with the highest weight. The weight computation is adaptive to the following factors: the number of mesh routers and the number of gateways, that is, and ; traffic demands from mesh clients; the location of existing gateways in the network; and the interference from existing gateways. How factors to are captured in MTW will be discussed in Section 3.1, and the relationship between factor and MTW will be discussed in Section 3.2. The MTW-based gateway placement algorithm will be explained while the MTW is derived in Sections 3.1 and 3.2.
3.1. Adaptive Multihop Traffic-Flow Weight
The rationale of this estimation can be explained as follows. Considering that a square is divided equally by cells and cells, respectively, then drawing a horizontal line across the square will statistically meet cells and cells. For each -cell, the line will cross -cells. Therefore, if a gateway is placed in the center of each -cell and a mesh router is placed in the center of each -cell, we can estimate that a gateway needs hops to reach its farthest mesh router. It should be noted that only provides an estimation, which may not be always precise for every combination of and .
With , the first gateway will be placed on the router with the highest weight. An example in Figure 3 shows how and are combined to determine gateway placement according to MTW. In this example, there is only one gateway to be deployed, so . From (3), we have . Therefore, based on in Figure 3(a), the MTW is calculated as shown in Figure 3(b). Therefore, the gateway will be placed in the center mesh router of the WMN that has the highest MTW weight.
If more than one gateway is to be placed, two additional steps are needed. Firstly, will be readjusted with . Assuming that the gateway is placed at , the traffic demand value of and all its neighbors within ( ) hops away will be set as 0, and the value of 's -hop neighbors will be reduced to half. In this way, another gateway is less likely to be placed in a location near the existing gateway. Secondly, interfere among gateways should be counted in the computation of MTW, as discussed in the next subsection.
3.2. Sharing Efficiency of Gateways
Two gateways interfere with each other if they are within the distance of - hops. is defined as Interfering Distance of gateways. Interfering gateways have to share the same wireless channel in the backbone communications. An algorithm is developed in this subsection to derive the sharing efficiency of gateways. The algorithm holds the two distinct features: full fairness among gateways will be guaranteed; under the condition of , the efficiency for each gateway will be maximized.
Optimal sharing efficiency calculation.
Row no. | Non-overlapping interfering group | Sharing efficiency | ||||||
---|---|---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | 7 | ||
100% | 100% | 100% | 100% | 100% | 100% | 100% | ||
| 3 4 5 7 | 100% | 100% | 25% | 25% | 25% | 100% | 25% |
| 2 3 4 | 100% | 50% | 25% | 25% | 25% | 100% | 25% |
| 2 4 6 | 100% | 37.5% | 25% | 25% | 25% | 37.5% | 25% |
| 1 2 | 62.5% | 37.5% | 25% | 25% | 25% | 37.5% | 25% |
if the new one is smaller than its current value. The procedures of and are repeated until the end. In the example shown in Figure 4 and Table 1, gateways 3, 4, 5, and 7 are reassigned a percentage value of 25% in the computation of the first row; gateway 2 is reassigned a percentage value of 50% in the computation of the second row; gateways 2 and 6 are reassigned a percentage value of 37.5% in the computation of the third row; gateway 1 is reassigned a percentage value of 62.5% in the computation of the fifth row. The final results are shown in Figure 4(c).
The final percentage value assigned to each gateway in the above algorithm is defined as the optimal sharing efficiency, denoted by , because, firstly, it guarantees a full fairness among all the gateways, and secondly it always guarantees the existence of a traffic scheduling scheme for all the gateways, since in each interfering group, the sum of the sharing efficiency is always equal or smaller than 100%. In the scheduling scheme, time slots in backbone communications are assigned to all gateways such that successful simultaneous transmissions can be always carried out in each time slot. Each gateway can be guaranteed to have a number of time slots, which is equal to the total number of time slots multiplying the sharing efficiency. Figure 4(d) shows a TDMA scheduling scheme for the above example.
By taking into account the interference of gateways via the sharing efficiency, a new gateway can be placed into the network with the following procedures: from previous steps in Section 3.1, choosing the router with the highest weight as a potential location for gateway placement; reconstructing the table of non-overlapping interfering groups by adding the potential location into the consideration; computing the sharing efficiency for the potential gateway location; readjusting the highest weight by multiplying the sharing efficiency, that is, ; and if the new weight is still larger than the second highest weight, then place the gateway in the location. otherwise, repeat the above steps from to until obtaining the location.
4. Traffic Scheduling for Throughput Computation
In this section, a TDMA scheme is applied for traffic scheduling. One key benefit of using TDMA is that it guarantees collision free transmissions. In fact, various TDMA scheduling schemes are actually used in a few wide area wireless mesh network testbeds and network standards such as WiMAX. Based on TDMA scheduling, we provide a framework of non-asymptotic throughput derivation for WMNs.
Here is defined as the throughput of the th mesh client in backbone communications when there are gateways in the WMN and is defined as the throughput of the th mesh client in local communications. Note that is independent of in the WMN model. indicates that a feasible per-client throughput can be achieved by taking the smaller one of and .
Since and should be split for uplink and downlink communications, respectively, it is assumed that and are assigned to downlink communications, and and are assigned to uplink communications, where and c _{ 2 } are some constants between 0 and 1. Generally, throughput of a mesh client should be obtained as the sum of uplink throughput and downlink throughput. Choosing the value of and requires knowledge on actual applications running on clients, which is beyond the objectives of this paper. It is assumed in the following of this paper that downlink traffic is dominant in the WMN. Therefore, most of and will be assigned to downlink communications and throughput is decided by downlink throughput, which is constrained by and . This is not an uncommon case in today's applications of WMNs, for instance, in the application of Internet access. We shall note that the methodology proposed in this section can actually be used to obtain throughput of WMNs when both uplink traffic and downlink traffic are present. However, with the above simplified model, we can focus on the illustration of the key ideas without being distracted by trivial discussions.
4.1. Throughput in Backbone Communications
Time slots in backbone communications are first assigned to gateways so that no gateways interfere with each other. The TDMA scheduling scheme on gateways is assumed to satisfy the following two conditions: time slots are assigned to each gateway with full fairness; under the condition of , each gateway should have as much as possible time slots for successful transmissions. In Section 3.2, an algorithm to obtain the optimal sharing efficiency on all the gateways, denoted by , is provided and a traffic scheduling scheme satisfying the above two conditions is also constructed. In the scheme, the th gateway can be guaranteed to have a number of time slots, which is equal to the total number of all time slots times . Hence, the th gateway is guaranteed to have an aggregate throughput of in backbone communications. By the TDMA scheme, interfering gateways share the same wireless channel while noninterfering gateways can transmit simultaneously.
where denotes the number of the associated gateways with the mesh router .
The TDMA traffic scheduling scheme actually guarantees the full fairness among mesh clients for each gateway. Note that farther mesh clients from gateways are reserved more time slots for transmission so that their throughput is not throttled by closer ones.
The per-client throughput in backbone communications will be compared with the per-client throughput in local communications to decide the per-client throughput in the WMN. Note that if a mesh client is connected directly to a gateway, its throughput is decided only by the per-client throughput in local communications.
4.2. Throughput in Local Communications
With the above TDMA scheme, all the mesh clients associated with the same mesh router will have the same throughput in local communications, that is, , if clients and are associated with the same mesh router.
4.3. Feasible Throughput in WMN
and here i th mesh client is assumed to be connected with the mesh router . It is important to note that this non-asymptotic throughput estimation is more realistic than the asymptotic throughput that is estimated when the number of nodes approaches infinity.
The above upper bounds are independent of . Actually they are the maximal values that and can achieve for any number of gateways.
It should be noted that the throughput computation method is applicable to any gateway placement algorithm; that is, as long as a gateway placement is given, the results derived in this section can be used to calculate the throughput of WMNs.
5. Numeric Results and Discussion
Using the framework of throughput computation derived in Section 4, throughput of this WMN is studied. In all the experiments we assume , and ; that is, there are 200 mesh clients distributed in a square region of ; the square is split evenly into 36 small square cells and a mesh router is placed in the center of each cell. In addition, we assume , , and .
Comparison study is conducted between the proposed algorithm (MTWP) and the other three gateway placement algorithms.
(i)Random Placement (RDP): gateways choose their placement location randomly on mesh routers.
(ii)Busiest Router Placement (BRP): gateways choose their placement location on the mesh routers with the highest traffic demand defined by .
(iii)Regular Placement (RGP): as many as possible gateways are placed based on regular patterns and the rest of them choose their placement location on the same number of mesh routers with the highest traffic demand defined by . Table 2 gives an example of RGP on a 6-by-6 regular grid.
An example for RGP on a 6-by-6 regular grid.
| Gateway placement |
---|---|
1 | Choose the busiest router from the location of (3,3), (3,4), (4,3), and (4,4) |
2~4 | Choose the busiest routers from the location of (2,2), (2,5), (5,2), and (5,5) |
5~7 | Choose the first 4 gateways at the location of (2,2), (2,5), (5,2), and (5,5) and choose the rest on the other routers with the highest traffic demand |
8 | 36 routers are split into 4 groups. In each group, any two routers are at least 2-hops away, for example, (1,1), (1,3), (1,5), (3,2), (3,4), (3,6), (5,1), (5,3), and (5,5) are in one group. Choose the first gateway on the busiest router and choose the rest 7 gateways on the next 7 busiest routers in the same group with the first one |
9 | 36 routers are split into 4 groups as above. Choose the first gateway on the busiest router, then choose the next 8 gateways on the other routers in the same group with the first one, and choose the rest on the other routers with the highest traffic demand |
Given a certain placement algorithm, a number of gateways will be placed on the top of the best-fit mesh routers. For each algorithm, per-client throughput is calculated based on (14). Then the aggregate throughput and the worst-case per-client throughput are obtained as described in Section 2.3. The upper bounds of the above two throughputs are calculated based on (15) and (16), respectively. Since mesh clients in all cases follow a random distribution, the results in all plots are obtained as an average over 200 iterations.
In the first case, we study the relationship between channel capacity of mesh routers and the number of gateways. We assume that all mesh clients are uniformly distributed and each of them can transmit at 10 Mbps in downlink communications, that is, . The aggregate throughput of the WMN versus the number of gateways is shown in Figure 9, where gateways are placed by the proposed MTWP algorithm and the channel capacity of mesh routers varies from 10 Mbps to 25 Mbps with an increment of 5 Mbps. Our results confirm the fact that the number of gateways can be dramatically reduced by using more powerful mesh routers in the backbone; for example, 6 gateways with mesh router transmitting at 25 Mbps can achieve much better throughput performance than 15 gateways with mesh router transmitting at 10 Mbps.
In the second case, as shown in Figures 10 and 11, we compare throughput performance of four gateway placement algorithms in the WMN. We assume that all mesh clients are uniformly distributed and each mesh client and mesh router can transmit at 10 Mbps and 20 Mbps, respectively. The results show that the proposed MTWP algorithm clearly outperforms the other algorithms in both the aggregate throughput and the worst case throughput. The regular placement algorithm achieves the second best results because it is a geometry-balanced algorithm which can effectively reduce the average distance between a gateway and its associated mesh routers.
In both the second and third cases, as shown in Figures 10–13, the MTWP algorithm has the biggest improvement in throughput when the number of gateways is chosen from five to eight. An explanation is given as follows: with more than four gateways in a 6-by-6 grid backbone network, gateways start to interfere with each other. Comparing with the other three algorithms, MTWP algorithm has a unique mechanism to mitigate such interference among gateways. Thus, countering interference among gateways is very critical for a gateway placement algorithm.
6. Conclusion
The problem of gateway placement in WMNs for enhancing throughput was investigated in this paper. A gateway placement algorithm was firstly proposed based on multi-hop traffic weight. A non-asymptotic analytical model was also derived to determine the achieved throughput by a gateway placement algorithm. Based on such a model, the performance of the proposed gateway placement algorithm was evaluated. Numerical results illustrated the proposed algorithm achieved much better performance than other schemes. It was also proved to be a cost-effective solution.
It should be noted that the MTWP algorithm proposed in this paper did not consider the cross-optimization between gateway placement and throughput of WMNs. Thus, the throughput achieved by MTWP is not necessarily optimal and can be lower than the maximum throughput. Optimizing gateway placement together with throughput maximization is our next research goal.
Authors’ Affiliations
References
- Akyildiz IF, Wang X, Wang W: Wireless mesh networks: a survey. Computer Networks 2005, 47(4):445-487.MATHView Article
- Jamin S, Jin C, Kurc AR, Raz D, Shavitt Y: Constrained mirror placement on the Internet. Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '01), 2001 1: 31-40.
- Li B, Golin MJ, Italiano GF, Deng X, Sohraby K: On the optimal placement of web proxies in the Internet. Proceedings of the IEEE Conference on Computer Communications (INFOCOM '99), 1999 3: 1282-1290.
- Qiu L, Padmanabhan VN, Voelker GM: On the placement of Web server replicas. Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '01), 2001 3: 1587-1596.
- Hanly SV: Algorithm for combined cell-site selection and power control to maximize cellular spread spectrum capacity. IEEE Journal on Selected Areas in Communications 1995, 13(7):1332-1340. 10.1109/49.414650View Article
- Mathar R, Niessen T: Optimum positioning of base stations for cellular radio networks. Wireless Networks 2000, 6(6):421-428. 10.1023/A:1019263308849MATHView Article
- Tutschku K: Demand-based radio network planning of cellular mobile communication systems. Proceedings of IEEE Conference on Computer Communications (INFOCOM '98), 1998 3: 1054-1061.
- Bejerano Y: Efficient integration of multi-hop wireless and wired networks with QoS constraints. Proceedings of the 8th Annual International Conference on Mobile Computing and Networking (MOBICOM '02), September 2002
- Srinivas A, Zussman G, Modiano E: Mobile backbone networks—construction and maintenance. Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '06), 2006 166-177.View Article
- So A, Liang B: Minimum cost configuration of relay and channel infrastructure in heterogeneous wireless mesh networks. Proceedings of the International IFIP-TC6 Networking Conference, 2007 275-286.
- Wang J, Xie B, Cai K, Agrawal DP: Efficient mesh router placement in wireless mesh networks. Proceedings of IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS '07), 2007
- He B, Xie B, Agrawal DP: Optimizing the internet gateway deployment in a wireless mesh network. Proceedings of IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS '07), 2007
- Li F, Wang Y, Li X-Y: Gateway placement for throughput optimization in wireless mesh networks. Proceedings of IEEE International Conference on Communications (ICC '07), 2007 4955-4960.
- Gupta P, Kumar PR: The capacity of wireless networks. IEEE Transactions on Information Theory 2000, 46(2):388-404. 10.1109/18.825799MATHMathSciNetView Article
- Gupta P, Kumar PR: Internets in the sky: the capacity of three dimensional wireless networks. Communications in Information and Systems 2001, 1(1):33-49.MATHMathSciNetView Article
- Grossglauser M, Tse D: Mobility increases the capacity of ad-hoc wireless networks. Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '01), 2001 3: 1360-1369.
- Liu B, Liu Z, Towsley D: On the capacity of hybrid wireless networks. Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '03), 2003 2: 1543-1552.
- Kozat UC, Tassiulas L: Throughput capacity of random ad hoc networks with infrastructure support. Proceedings of the Annual International Conference on Mobile Computing and Networking (MOBICOM '03), 2003 55-65.View Article
- Zemlianov A, De Veciana G: Capacity of ad hoc wireless networks with infrastructure support. IEEE Journal on Selected Areas in Communications 2005, 23(3):657-667.View Article
- Zhou P, Wang X, Rao R: Asymptotic capacity of infrastructure wireless mesh networks. IEEE Transactions on Mobile Computing 2008, 7(8):1011-1024.View Article
- Robinson J, Knightly EW: A performance study of deployment factors in wireless mesh networks. Proceedings of IEEE International Conference on Computer Communications (INFOCOM '07), May 2007 2054-2062.
Copyright
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.