Bi-Path Data Transmission Routing Algorithm with Meshed Topology in Wireless Sensor Networks
碩士 === 元智大學 === 資訊工程學系 === 93 === In large scale wireless sensor networks, in order to transmit all the detected data to sink, the specific source must set up a routing path to the sink. Basically, each sensor has very limited power. In case that the power of any sensor node in the routing path is e...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/51435603816626293035 |
id |
ndltd-TW-093YZU00392010 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-093YZU003920102016-06-08T04:13:15Z http://ndltd.ncl.edu.tw/handle/51435603816626293035 Bi-Path Data Transmission Routing Algorithm with Meshed Topology in Wireless Sensor Networks 無線感測網路上網狀拓樸之雙路徑資料繞送演算法 Jan-Yue Yang 楊展岳 碩士 元智大學 資訊工程學系 93 In large scale wireless sensor networks, in order to transmit all the detected data to sink, the specific source must set up a routing path to the sink. Basically, each sensor has very limited power. In case that the power of any sensor node in the routing path is exhausted, the routing path will be broken and a new one must be reconstructed immediately. Then, the additional overhead will occur due to more power consumption and transmission delaying time. Therefore, the meshed topology of wireless sensor network was proposed to solve this problem. In meshed topology, there are multiple choices for each sensor node in the routing path to transfer data back to sink. When the routing path is broken, local redeemable path can be easily performed instantly. The first approach in meshed topology was using a single path to transfer data. Due to a lot of transmitting data, this method may cause the sensor nodes of the routing path to be overused and power exhausted soon. To improve these deficits, another approach was proposed. It provided a mechanism of data path selection, and every data packet may use different transferring path. In this way, the power consumption can be dispersed on many nodes. However, the way of selection data path was random and different packets might be transferred by neighboring nodes. Then, the probability of collisions may be increased, and more powers & transmission times are needed. In order to solve the above problem, in this paper, we propose a mechanism on meshed topology called Bi-Path Data Transmission Routing Algorithm. This mechanism divides the large number of data from source into two parts and transfers them by two different data paths. Then, these two un-neighbor paths can reduce the probability of collisions and transmission delay time, and disperse the consumption of power into two un-neighbor paths. It also extends the life of the network. Ru-Sheng Liu 劉如生 2005 學位論文 ; thesis 42 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 元智大學 === 資訊工程學系 === 93 === In large scale wireless sensor networks, in order to transmit all the detected data to sink, the specific source must set up a routing path to the sink. Basically, each sensor has very limited power. In case that the power of any sensor node in the routing path is exhausted, the routing path will be broken and a new one must be reconstructed immediately. Then, the additional overhead will occur due to more power consumption and transmission delaying time. Therefore, the meshed topology of wireless sensor network was proposed to solve this problem. In meshed topology, there are multiple choices for each sensor node in the routing path to transfer data back to sink. When the routing path is broken, local redeemable path can be easily performed instantly.
The first approach in meshed topology was using a single path to transfer data. Due to a lot of transmitting data, this method may cause the sensor nodes of the routing path to be overused and power exhausted soon. To improve these deficits, another approach was proposed. It provided a mechanism of data path selection, and every data packet may use different transferring path. In this way, the power consumption can be dispersed on many nodes. However, the way of selection data path was random and different packets might be transferred by neighboring nodes. Then, the probability of collisions may be increased, and more powers & transmission times are needed.
In order to solve the above problem, in this paper, we propose a mechanism on meshed topology called Bi-Path Data Transmission Routing Algorithm. This mechanism divides the large number of data from source into two parts and transfers them by two different data paths. Then, these two un-neighbor paths can reduce the probability of collisions and transmission delay time, and disperse the consumption of power into two un-neighbor paths. It also extends the life of the network.
|
author2 |
Ru-Sheng Liu |
author_facet |
Ru-Sheng Liu Jan-Yue Yang 楊展岳 |
author |
Jan-Yue Yang 楊展岳 |
spellingShingle |
Jan-Yue Yang 楊展岳 Bi-Path Data Transmission Routing Algorithm with Meshed Topology in Wireless Sensor Networks |
author_sort |
Jan-Yue Yang |
title |
Bi-Path Data Transmission Routing Algorithm with Meshed Topology in Wireless Sensor Networks |
title_short |
Bi-Path Data Transmission Routing Algorithm with Meshed Topology in Wireless Sensor Networks |
title_full |
Bi-Path Data Transmission Routing Algorithm with Meshed Topology in Wireless Sensor Networks |
title_fullStr |
Bi-Path Data Transmission Routing Algorithm with Meshed Topology in Wireless Sensor Networks |
title_full_unstemmed |
Bi-Path Data Transmission Routing Algorithm with Meshed Topology in Wireless Sensor Networks |
title_sort |
bi-path data transmission routing algorithm with meshed topology in wireless sensor networks |
publishDate |
2005 |
url |
http://ndltd.ncl.edu.tw/handle/51435603816626293035 |
work_keys_str_mv |
AT janyueyang bipathdatatransmissionroutingalgorithmwithmeshedtopologyinwirelesssensornetworks AT yángzhǎnyuè bipathdatatransmissionroutingalgorithmwithmeshedtopologyinwirelesssensornetworks AT janyueyang wúxiàngǎncèwǎnglùshàngwǎngzhuàngtàpǔzhīshuānglùjìngzīliàoràosòngyǎnsuànfǎ AT yángzhǎnyuè wúxiàngǎncèwǎnglùshàngwǎngzhuàngtàpǔzhīshuānglùjìngzīliàoràosòngyǎnsuànfǎ |
_version_ |
1718297052960522240 |