Name
Abstract | ||
|---|---|---|
This paper introduces a method of designing optimized MAC layer algorithms using Genetic Programming. qv evolving entire algorithmic behaviour rather than optimizing a set of values to tune a parameterized design, a much wider space of behaviour can be explored automatically. This technique is illustrated using the variation of contention window size that is part of the Distributed Coordination Function of 802.11. When applied to the example of a variable sized network under saturated load this approach produces expressions that comfortably outperform the standard 802.11b behaviour. Also, despite being automatically generated, these solutions achieve the throughput performance of the best enhancements to this aspect of the protocol. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/VETECS.2006.1683037 | VTC Spring |
Keywords | Field | DocType |
access protocols,genetic algorithms,wireless LAN,IEEE 802.11 DCF,MAC layer algorithms,contention window size,distributed coordination function,genetic programming,medium access control,variable sized network,CSMA,Genetic Programming,Wireless LAN | Parameterized complexity,Expression (mathematics),Computer science,Computer network,Genetic programming,Distributed coordination function,Wireless lan,Throughput,Genetic algorithm,Distributed computing | Conference |
Volume | ISSN | Citations |
3 | 1090-3038 | 3 |
PageRank | References | Authors |
0.48 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tim Lewis | 1 | 3 | 0.48 |
| Neil Fanning | 2 | 5 | 0.87 |
| Gary Clemo | 3 | 39 | 7.51 |