無線感測網路上網狀拓樸之雙路徑資料繞送演算法

Bi-Path Data Transmission Routing Algorithm with Meshed Topology in Wireless Sensor Networks

楊展岳(Jan-Yue Yang)

指導教授 ： 劉如生

元智大學/資訊學院/資訊工程學系/碩士(2004年)

摘要

無資料

關鍵字

無線感測網路 ； 網狀拓樸結構 ； 傳輸碰撞

並列摘要

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.

並列關鍵字

Wireless sensor networks ； Meshed topology ； Transfer collision

參考文獻

[1] De, S.; Chunming Qiao; Hongyi Wu, “Meshed multipath routing: an efficient strategy in sensor networks,” IEEE Wireless Communications and Networking, 2003. WCNC 2003., vol.3, Pages:1912 – 1917, March 2003

[2] Dulman, S.; Nieberg, T.; Wu, J.; Havinga, P. ”Trade-off between traffic overhead and reliability in multipath routing for wireless sensor networks,” IEEE Wireless Communications and Networking, 2003. WCNC 2003., vol.3, Pages:1918 – 1922, March 2003

[3] De, S.; Qiao, C., ” On throughput and load balancing of multipath routing in wireless networks,” IEEE Wireless Communications and Networking Conference, 2004. WCNC., Vol.3, Pages:1551 – 1556, March 2004

[4] Tsirigos, A.; Haas, Z.J., ” Multipath routing in mobile ad hoc networks or how to route in the presence of frequent topology changes,” IEEE Military Communications Conference, 2001. MILCOM 2001. Communications for Network-Centric Operations: Creating the Information Force., vol.2, Pages:878 – 883, Oct. 2001

[5] Lee, S.-J.; Gerla, M., “Split multipath routing with maximally disjoint paths in ad hoc networks,” IEEE Communications, 2001. ICC 2001., vol.10, Pages:3201 - 3205, June 2001