Presentation 2007-10-19
A Proposal of a Routing Tree Generation Algorithm for Minimizing the Maximum Delay in Wireless Mesh Networks
Kanako UEMURA, Nobuo FUNABIKI, Toru NAKANISHI, Tamer FARAG,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We have studied the Wireless Internet-access Mesh NETwork (WIMET) as a scalable wireless network to access the Internet. WIMNET is composed of multiple access points (APs) that have wireless connections with each other where at least one AP performs as the gateway AP (GW-AP) to the Internet. Each host can access to the Internet through a GW-AP after multihop wireless communications between APs from its associated AP. Thus, the increases of the transmission delay at communication links around the GW-AP and the propagation delay through the routing path between an AP and a GW-AP can degrade the performance of WIMNET. In this paper, we formulate the routing tree generation problem for AP communications to minimize the maximum delay for the bottleneck solution, and propose its heuristic algorithm. We show the effectiveness of our algorithm through simulations in two instances by using the WIMNET simulator.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) wireless mesh network / AP communication / routing tree generation problem / delay / NP-complete / algorithm
Paper # NS2007-90
Date of Issue

Conference Information
Committee NS
Conference Date 2007/10/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Network Systems(NS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Proposal of a Routing Tree Generation Algorithm for Minimizing the Maximum Delay in Wireless Mesh Networks
Sub Title (in English)
Keyword(1) wireless mesh network
Keyword(2) AP communication
Keyword(3) routing tree generation problem
Keyword(4) delay
Keyword(5) NP-complete
Keyword(6) algorithm
1st Author's Name Kanako UEMURA
1st Author's Affiliation Department of Communication Network Engineering, Okayama University()
2nd Author's Name Nobuo FUNABIKI
2nd Author's Affiliation Department of Communication Network Engineering, Okayama University
3rd Author's Name Toru NAKANISHI
3rd Author's Affiliation Department of Communication Network Engineering, Okayama University
4th Author's Name Tamer FARAG
4th Author's Affiliation Department of Communication Network Engineering, Okayama University
Date 2007-10-19
Paper # NS2007-90
Volume (vol) vol.107
Number (no) 261
Page pp.pp.-
#Pages 6
Date of Issue