Abstract
As a scalable, flexible access network to the Internet, we have studied the design optimization and the implementation of the Wireless Internet-access Mesh NETwork (WIMNET). WIMNET is composed of multiple access points (APs) that are connected with each other by wireless communications. At least one AP performs as the gateway (GW) to the Internet. Any host in the network can access to the Internet through this GW, after associating its neighbor AP and communicating with multihop wireless links between APs. The delay along the routing path degrades the performance of WIMNET. To avoid the bottleneck of communications by minimizing the maximum delay, we formulate the routing tree problem for AP communications, and prove the NP-completeness of its decision version. Then, we propose the greedy heuristic algorithm of sequentially selecting one link that minimizes the delay of the predicted tree containing the link. The effectiveness of our algorithm is verified through extensive simulations in instances with 25 APs using the WIMNET simulator.
| Original language | English |
|---|---|
| Title of host publication | RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies |
| Pages | 161-166 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - 2008 |
| Event | RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies - Ho Chi Minh City, Viet Nam Duration: Jul 13 2008 → Jul 17 2008 |
Other
| Other | RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies |
|---|---|
| Country | Viet Nam |
| City | Ho Chi Minh City |
| Period | 7/13/08 → 7/17/08 |
Fingerprint
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Networks and Communications
- Computer Vision and Pattern Recognition
Cite this
A minimum-delay routing tree algorithm for access-point communications in wireless mesh networks. / Funabiki, Nobuo; Uemura, Kanako; Nakanishi, Toru; Hassan, Walaa.
RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies. 2008. p. 161-166 4586349.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A minimum-delay routing tree algorithm for access-point communications in wireless mesh networks
AU - Funabiki, Nobuo
AU - Uemura, Kanako
AU - Nakanishi, Toru
AU - Hassan, Walaa
PY - 2008
Y1 - 2008
N2 - As a scalable, flexible access network to the Internet, we have studied the design optimization and the implementation of the Wireless Internet-access Mesh NETwork (WIMNET). WIMNET is composed of multiple access points (APs) that are connected with each other by wireless communications. At least one AP performs as the gateway (GW) to the Internet. Any host in the network can access to the Internet through this GW, after associating its neighbor AP and communicating with multihop wireless links between APs. The delay along the routing path degrades the performance of WIMNET. To avoid the bottleneck of communications by minimizing the maximum delay, we formulate the routing tree problem for AP communications, and prove the NP-completeness of its decision version. Then, we propose the greedy heuristic algorithm of sequentially selecting one link that minimizes the delay of the predicted tree containing the link. The effectiveness of our algorithm is verified through extensive simulations in instances with 25 APs using the WIMNET simulator.
AB - As a scalable, flexible access network to the Internet, we have studied the design optimization and the implementation of the Wireless Internet-access Mesh NETwork (WIMNET). WIMNET is composed of multiple access points (APs) that are connected with each other by wireless communications. At least one AP performs as the gateway (GW) to the Internet. Any host in the network can access to the Internet through this GW, after associating its neighbor AP and communicating with multihop wireless links between APs. The delay along the routing path degrades the performance of WIMNET. To avoid the bottleneck of communications by minimizing the maximum delay, we formulate the routing tree problem for AP communications, and prove the NP-completeness of its decision version. Then, we propose the greedy heuristic algorithm of sequentially selecting one link that minimizes the delay of the predicted tree containing the link. The effectiveness of our algorithm is verified through extensive simulations in instances with 25 APs using the WIMNET simulator.
UR - http://www.scopus.com/inward/record.url?scp=51949101385&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51949101385&partnerID=8YFLogxK
U2 - 10.1109/RIVF.2008.4586349
DO - 10.1109/RIVF.2008.4586349
M3 - Conference contribution
AN - SCOPUS:51949101385
SN - 9781424423798
SP - 161
EP - 166
BT - RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies
ER -