Abstract
It is well-known in hardwired networks that shortest path routing is optimum in regard to optimizing network performance such as maximizing network throughput for instance, but little is known in this regard in ad hoc networks routing due to the dynamic, changing topology of these networks. Via linear programming formulation of the optimum routing problem, we show shortest path is the best routing strategy as well when it comes to maximizing the mean network throughput in ad hoc networks provided that interference is neglected. However, the routing metrics in selecting routes (paths) should be dependent on links availability probabilities in these networks. Heuristic approaches were used in suggesting such metrics when the links capacities are equal and unequal.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Conference on Wireless Networks (ICWN 2012) |
| Pages | 451-457 |
| Publication status | Published - 2012 |
| Event | World Congress in Computer Science, Computer Engineering, and Applied Computing - Las Vegas, United States Duration: 16 Jul 2012 → 19 Jul 2012 Conference number: 7 https://world-academy-of-science.org/worldcomp12/ws/ |
Conference
| Conference | World Congress in Computer Science, Computer Engineering, and Applied Computing |
|---|---|
| Abbreviated title | WORLDCOMP'12 |
| Country/Territory | United States |
| City | Las Vegas |
| Period | 16/07/12 → 19/07/12 |
| Internet address |
Keywords
- Ad hoc networks
- Shortest path routing
- Linear programming
- Routing metric
- Mobility