The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kami menyiasat analisis kelewatan rangkaian jaringan wayarles berbilang hop (WMN) di mana nod mempunyai transceiver berbilang saluran dan berbilang untuk meningkatkan kapasiti rangkaian. Kefungsian transceiver berbilang saluran dan berbilang membolehkan seluruh WMN diuraikan menjadi zon berpisah dengan cara yang i) nod dalam zon berada dalam jarak satu lompatan, dan nod geganti dan nod hujung dengan berbeza CWminits bersaing untuk mengakses saluran berdasarkan IEEE 802.11e EDCA, ii) saluran yang berbeza diberikan kepada zon jiran untuk mengelakkan masalah nod tersembunyi, iii) nod geganti boleh menghantar dan menerima paket secara serentak dengan pelbagai saluran dan transceiver berbilang. Dengan penguraian rangkaian ini, kami menumpukan pada kelewatan pada satu zon dan kemudian kelewatan hujung ke hujung boleh diperolehi sebagai jumlah kelewatan zon. Untuk mempunyai kelewatan hujung-ke-hujung bebas lokasi ke get laluan tanpa mengira lokasi nod sumber, kami mencadangkan dua skim pengurusan paket, dipanggil dasar CW yang dibezakan dan juga dasar keutamaan yang ketat, pada setiap nod geganti di mana paket geganti dengan kiraan lompatan yang lebih panjang ditimbal dalam baris gilir keutamaan yang lebih tinggi mengikut kiraan lompatan berpengalaman mereka. Untuk dasar CW yang dibezakan, nod geganti mengguna pakai fungsi IEEE 802.11e EDCA di mana baris gilir keutamaan yang lebih tinggi mempunyai tetingkap perbalahan minimum yang lebih pendek. Kami memodelkan zon tipikal sebagai rangkaian IEEE 802.11e EDCA one-hop di bawah keadaan tidak tepu di mana baris gilir keutamaan mempunyai kadar ketibaan paket yang berbeza dan saiz tetingkap perbalahan minimum yang berbeza. Pertama, kita dapati PGF (fungsi penjanaan kebarangkalian) bagi kelewatan HoL paket pada barisan keutamaan dalam zon. Kedua, dengan memodelkan setiap baris gilir sebagai M/G/1 beratur dengan kelewatan HoL sebagai masa perkhidmatan, kami memperoleh kelewatan paket (jumlah kelewatan giliran dan kelewatan HoL) bagi setiap barisan keutamaan dalam zon. Ketiga, purata kelewatan hujung ke hujung paket yang dijana pada nod akhir dalam setiap zon diperoleh dengan merumuskan kelewatan paket pada setiap zon. Untuk dasar keutamaan yang ketat, kami menganggap nod geganti sebagai sistem baris gilir tunggal dengan baris gilir keutamaan berbilang di mana paket geganti dalam baris gilir keutamaan disampaikan mengikut urutan keutamaan yang ketat. Nod geganti mempunyai lebih kecil CWminit daripada nod akhir dan nod geganti bersaing dengan nod akhir dalam zon. Menggunakan PGF of HoL-delay paket pada nod geganti dan nod akhir, kami memperoleh kelewatan paket dalam zon. Purata kelewatan hujung ke hujung ke get laluan yang dijana pada nod hujung dalam setiap zon diperoleh. Akhir sekali, untuk kedua-dua dasar CW yang dibezakan dan dasar keutamaan yang ketat, dengan menyamakan semua kelewatan hujung ke hujung menjadi lebih kurang sama, kami mendapati saiz tetingkap perbalahan minimum bagi setiap baris gilir keutamaan secara berangka melalui kaedah percubaan dan kesilapan supaya hujung-ke- kelewatan akhir paket hampir sama tanpa mengira lokasi sumbernya, masing-masing. Keputusan berangka menunjukkan bahawa dua kaedah yang dicadangkan memperoleh kelewatan hujung-ke-hujung paket yang hampir sama tanpa mengira lokasi yang dijana dan hasil analisis kami ditunjukkan padanan dengan hasil simulasi.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Yun Han BAE, Kyung Jae KIM, Jin Soo PARK, Bong Dae CHOI, "Differentiated CW Policy and Strict Priority Policy for Location-Independent End-to-End Delay in Multi-Hop Wireless Mesh Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 7, pp. 1869-1880, July 2010, doi: 10.1587/transcom.E93.B.1869.
Abstract: We investigate delay analysis of multi-hop wireless mesh network (WMN) where nodes have multi-channel and multiple transceivers to increase the network capacity. The functionality of the multi-channel and multiple transceivers allows the whole WMN to be decomposed into disjoint zones in such a way that i) nodes in a zone are within one-hop distance, and relay node and end nodes with different CWmins contend to access the channel based on IEEE 802.11e EDCA, ii) different channels are assigned to neighbor zones to prevent the hidden node problem, iii) relay nodes can transmit and receive the packets simultaneously by multi-channel and multiple transceivers. With this decomposition of the network, we focus on the delay at a single zone and then the end-to-end delay can be obtained as the sum of zone-delays. In order to have the location-independent end-to-end delay to the gateway regardless of source nodes' locations, we propose two packet management schemes, called the differentiated CW policy and the strict priority policy, at each relay node where relay packets with longer hop count are buffered in higher priority queues according to their experienced hop count. For the differentiated CW policy, a relay node adopts the functionality of IEEE 802.11e EDCA where a higher priority queue has a shorter minimum contention window. We model a typical zone as a one-hop IEEE 802.11e EDCA network under non-saturation condition where priority queues have different packet arrival rates and different minimum contention window sizes. First, we find the PGF (probability generating function) of the HoL-delay of packets at priority queues in a zone. Second, by modeling each queue as M/G/1 queue with the HoL-delay as a service time, we obtain the packet delay (the sum of the queueing delay and the HoL-delay) of each priority queue in a zone. Third, the average end-to-end delay of packet generated at end node in each zone is obtained by summing up the packet delays at each zone. For the strict priority policy, we regard a relay node as a single queueing system with multiple priority queues where relay packets in priority queues are served in the order of strict priority. Relay node has smaller CWmin than end node has and relay node competes with end nodes in a zone. Using the PGF of HoL-delay of packet at relay node and end node, we obtain the packet delay in a zone. The average end-to-end delay to the gateway generated at end node in each zone is obtained. Finally, for both the differentiated CW policy and strict priority policy, by equating all end-to-end delays to be approximately equal, we find the minimum contention window sizes of each priority queue numerically by trial and error method so that end-to-end delays of packets are almost equal regardless of their source's location, respectively. Numerical results show that proposed two methods obtain almost same end-to-end delay of packets regardless of their generated locations and our analytical results are shown to be well matched with the simulation results.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.1869/_p
Salinan
@ARTICLE{e93-b_7_1869,
author={Yun Han BAE, Kyung Jae KIM, Jin Soo PARK, Bong Dae CHOI, },
journal={IEICE TRANSACTIONS on Communications},
title={Differentiated CW Policy and Strict Priority Policy for Location-Independent End-to-End Delay in Multi-Hop Wireless Mesh Networks},
year={2010},
volume={E93-B},
number={7},
pages={1869-1880},
abstract={We investigate delay analysis of multi-hop wireless mesh network (WMN) where nodes have multi-channel and multiple transceivers to increase the network capacity. The functionality of the multi-channel and multiple transceivers allows the whole WMN to be decomposed into disjoint zones in such a way that i) nodes in a zone are within one-hop distance, and relay node and end nodes with different CWmins contend to access the channel based on IEEE 802.11e EDCA, ii) different channels are assigned to neighbor zones to prevent the hidden node problem, iii) relay nodes can transmit and receive the packets simultaneously by multi-channel and multiple transceivers. With this decomposition of the network, we focus on the delay at a single zone and then the end-to-end delay can be obtained as the sum of zone-delays. In order to have the location-independent end-to-end delay to the gateway regardless of source nodes' locations, we propose two packet management schemes, called the differentiated CW policy and the strict priority policy, at each relay node where relay packets with longer hop count are buffered in higher priority queues according to their experienced hop count. For the differentiated CW policy, a relay node adopts the functionality of IEEE 802.11e EDCA where a higher priority queue has a shorter minimum contention window. We model a typical zone as a one-hop IEEE 802.11e EDCA network under non-saturation condition where priority queues have different packet arrival rates and different minimum contention window sizes. First, we find the PGF (probability generating function) of the HoL-delay of packets at priority queues in a zone. Second, by modeling each queue as M/G/1 queue with the HoL-delay as a service time, we obtain the packet delay (the sum of the queueing delay and the HoL-delay) of each priority queue in a zone. Third, the average end-to-end delay of packet generated at end node in each zone is obtained by summing up the packet delays at each zone. For the strict priority policy, we regard a relay node as a single queueing system with multiple priority queues where relay packets in priority queues are served in the order of strict priority. Relay node has smaller CWmin than end node has and relay node competes with end nodes in a zone. Using the PGF of HoL-delay of packet at relay node and end node, we obtain the packet delay in a zone. The average end-to-end delay to the gateway generated at end node in each zone is obtained. Finally, for both the differentiated CW policy and strict priority policy, by equating all end-to-end delays to be approximately equal, we find the minimum contention window sizes of each priority queue numerically by trial and error method so that end-to-end delays of packets are almost equal regardless of their source's location, respectively. Numerical results show that proposed two methods obtain almost same end-to-end delay of packets regardless of their generated locations and our analytical results are shown to be well matched with the simulation results.},
keywords={},
doi={10.1587/transcom.E93.B.1869},
ISSN={1745-1345},
month={July},}
Salinan
TY - JOUR
TI - Differentiated CW Policy and Strict Priority Policy for Location-Independent End-to-End Delay in Multi-Hop Wireless Mesh Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1869
EP - 1880
AU - Yun Han BAE
AU - Kyung Jae KIM
AU - Jin Soo PARK
AU - Bong Dae CHOI
PY - 2010
DO - 10.1587/transcom.E93.B.1869
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2010
AB - We investigate delay analysis of multi-hop wireless mesh network (WMN) where nodes have multi-channel and multiple transceivers to increase the network capacity. The functionality of the multi-channel and multiple transceivers allows the whole WMN to be decomposed into disjoint zones in such a way that i) nodes in a zone are within one-hop distance, and relay node and end nodes with different CWmins contend to access the channel based on IEEE 802.11e EDCA, ii) different channels are assigned to neighbor zones to prevent the hidden node problem, iii) relay nodes can transmit and receive the packets simultaneously by multi-channel and multiple transceivers. With this decomposition of the network, we focus on the delay at a single zone and then the end-to-end delay can be obtained as the sum of zone-delays. In order to have the location-independent end-to-end delay to the gateway regardless of source nodes' locations, we propose two packet management schemes, called the differentiated CW policy and the strict priority policy, at each relay node where relay packets with longer hop count are buffered in higher priority queues according to their experienced hop count. For the differentiated CW policy, a relay node adopts the functionality of IEEE 802.11e EDCA where a higher priority queue has a shorter minimum contention window. We model a typical zone as a one-hop IEEE 802.11e EDCA network under non-saturation condition where priority queues have different packet arrival rates and different minimum contention window sizes. First, we find the PGF (probability generating function) of the HoL-delay of packets at priority queues in a zone. Second, by modeling each queue as M/G/1 queue with the HoL-delay as a service time, we obtain the packet delay (the sum of the queueing delay and the HoL-delay) of each priority queue in a zone. Third, the average end-to-end delay of packet generated at end node in each zone is obtained by summing up the packet delays at each zone. For the strict priority policy, we regard a relay node as a single queueing system with multiple priority queues where relay packets in priority queues are served in the order of strict priority. Relay node has smaller CWmin than end node has and relay node competes with end nodes in a zone. Using the PGF of HoL-delay of packet at relay node and end node, we obtain the packet delay in a zone. The average end-to-end delay to the gateway generated at end node in each zone is obtained. Finally, for both the differentiated CW policy and strict priority policy, by equating all end-to-end delays to be approximately equal, we find the minimum contention window sizes of each priority queue numerically by trial and error method so that end-to-end delays of packets are almost equal regardless of their source's location, respectively. Numerical results show that proposed two methods obtain almost same end-to-end delay of packets regardless of their generated locations and our analytical results are shown to be well matched with the simulation results.
ER -