A minimum-delay routing tree algorithm for access-point communications in wireless mesh networks

Nobuo Funabiki, Kanako Uemura, Toru Nakanishi, Walaa Hassan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

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 languageEnglish
Title of host publicationRIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies
Pages161-166
Number of pages6
DOIs
Publication statusPublished - 2008
EventRIVF 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 2008Jul 17 2008

Other

OtherRIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies
CountryViet Nam
CityHo Chi Minh City
Period7/13/087/17/08

Fingerprint

Wireless mesh networks (WMN)
Internet
Communication
Gateways (computer networks)
Networks (circuits)
Heuristic algorithms
Computer networks
Telecommunication links
Simulators

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition

Cite this

Funabiki, N., Uemura, K., Nakanishi, T., & Hassan, W. (2008). A minimum-delay routing tree algorithm for access-point communications in wireless mesh networks. In RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies (pp. 161-166). [4586349] https://doi.org/10.1109/RIVF.2008.4586349

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 proceedingConference contribution

Funabiki, N, Uemura, K, Nakanishi, T & Hassan, W 2008, A minimum-delay routing tree algorithm for access-point communications in wireless mesh networks. in RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies., 4586349, pp. 161-166, 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, 7/13/08. https://doi.org/10.1109/RIVF.2008.4586349
Funabiki N, Uemura K, Nakanishi T, Hassan W. A minimum-delay routing tree algorithm for access-point communications in wireless mesh networks. In RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies. 2008. p. 161-166. 4586349 https://doi.org/10.1109/RIVF.2008.4586349
Funabiki, Nobuo ; Uemura, Kanako ; Nakanishi, Toru ; Hassan, Walaa. / A minimum-delay routing tree algorithm for access-point communications in wireless mesh networks. RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies. 2008. pp. 161-166
@inproceedings{5588c2742d204ce989586fc7f598719c,
title = "A minimum-delay routing tree algorithm for access-point communications in wireless mesh networks",
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.",
author = "Nobuo Funabiki and Kanako Uemura and Toru Nakanishi and Walaa Hassan",
year = "2008",
doi = "10.1109/RIVF.2008.4586349",
language = "English",
isbn = "9781424423798",
pages = "161--166",
booktitle = "RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies",

}

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

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 -