Impact of gateways placement on clustering algorithms in wireless mesh networks
dc.contributor.author | Waharte, Sonia | en_GB |
dc.contributor.author | Boutaba, Raouf | en_GB |
dc.contributor.author | Anelli, Pascal | en_GB |
dc.date.accessioned | 2013-03-15T11:34:51Z | |
dc.date.available | 2013-03-15T11:34:51Z | |
dc.date.issued | 2009 | |
dc.identifier.citation | Waharte, S., Boutaba, R., Anelli, P., (2009) 'Impact of Gateways Placement on Clustering Algorithms in Wireless Mesh Networks,' Communications, ICC '09, IEEE International Conference on@ 1-5 | en_GB |
dc.identifier.isbn | 9781424434350 | |
dc.identifier.doi | 10.1109/ICC.2009.5305932 | |
dc.identifier.uri | http://hdl.handle.net/10547/272952 | |
dc.description.abstract | Abstract—In wireless mesh networks, designing algorithms that efficiently balance the traffic loads among a given set of network gateways is a challenging problem. Links interfere, transfer capacity is limited, and traffic demands vary overtime. The position of the gateways also affects the overall network performance as a result of its direct impact on the way routers are associated to gateways. In this paper, we investigate the performance of several routers-to-gateways association heuristics in relation with different gateway placement algorithms.We show that if bounds on the number of hops between routers and gateways exist, load-based heuristics perform the best. In general cases however, interference-based approaches provide better load balancing. | |
dc.language.iso | en | en |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | en_GB |
dc.relation.url | http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5305932 | en_GB |
dc.subject | algorithm design and analysis | en_GB |
dc.subject | wireless mesh networks | en_GB |
dc.title | Impact of gateways placement on clustering algorithms in wireless mesh networks | en |
dc.type | Conference papers, meetings and proceedings | en |
html.description.abstract | Abstract—In wireless mesh networks, designing algorithms that efficiently balance the traffic loads among a given set of network gateways is a challenging problem. Links interfere, transfer capacity is limited, and traffic demands vary overtime. The position of the gateways also affects the overall network performance as a result of its direct impact on the way routers are associated to gateways. In this paper, we investigate the performance of several routers-to-gateways association heuristics in relation with different gateway placement algorithms.We show that if bounds on the number of hops between routers and gateways exist, load-based heuristics perform the best. In general cases however, interference-based approaches provide better load balancing. |