Adaptive, Fuzzy Logic, Load Balanced and Fast Routings for Ad Hoc and Sensor Wireless Networks
博士 === 國立成功大學 === 工程科學系碩博士班 === 96 === Since the advent of packet radio network, numerous protocols have been developed for ad hoc network. The network is a collection of mobile nodes. Usually, it has no centralized or fixed infrastructure. Within past few years, the researches on this field grow ra...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/47072396767960819497 |
id |
ndltd-TW-096NCKU5028013 |
---|---|
record_format |
oai_dc |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
博士 === 國立成功大學 === 工程科學系碩博士班 === 96 === Since the advent of packet radio network, numerous protocols have been developed for ad hoc network. The network is a collection of mobile nodes. Usually, it has no centralized or fixed infrastructure. Within past few years, the researches on this field grow rapidly because wireless devices are inexpensive and widely available. The challenges of ad hoc network include mobility, power limitation, narrow bandwidth and high error rates. The dissertation gives an overview of ad hoc network and wireless sensor networks and explores the routing protocols, (I) “Adaptive Shortcut Geographic Routing (ASGR) for Ad Hoc Networks Even with Topology Voids and Islands”, (II) “Fuzzy Logic Weighted Multi-Criteria of Dynamic Route Lifetime for Reliable Multicast Routings in Ad hoc Networks”(FMAR), (III) “Localized and Load-Balanced Clustering (LLBC) for Energy Saving in Wireless Sensor Networks”, and (IV) “Rose (ROSE) Algorithm for Fast and Even Routing in Sensor Networks”.
ASGR has the features of beaconless greedy forwarding, loop-freeing, backtracking, backward handling, short-cutting, limited memory requirement, route recovery algorithm and guaranteed packet delivery, so that a forwarding node can forward packets efficiently to the destination for topologies even with voids and islands. Since the short-cut rule is applied to shorten the path to the destination, the found short-cut path approaches the shortest path. ASGR can be also applied to multi-path, where sources can explore their own paths or take the advantage of the historical paths to reach the same destination.
FMAR is a fuzzy logic modified AODV routing protocol for multicast routing in ad hoc networks. Since the evaluation of dynamic route lifetime is challenging in the wireless networks, the fuzzy logic weighted multi-criteria of the protocol is used to dynamically evaluate the active route lifetime in order to determine the appropriate routes. In FMAR, multiple routing paths are established to provide extra schemas of video streaming or multicast transmission and enhance the robust transmission against unreliability and limited bandwidth of wireless links.
LLBC is a protocol for the energy savings and the lifetime increase of wireless sensor networks. LLBC contains two approaches. One is ICHR (improved cluster head rotation) and the other is MSC (modified static clustering). ICHR use the present cluster heads to select most energetic sensors as the next-round cluster heads and avoids the margin cluster heads being selected as cluster heads repeatedly. MSC is suitable when the network has a few very high energetic sensors. It only needs to perform a few cluster head rotations so the rotation overhead is reduced. It uses the method of inter-cluster load balance to adjust the cardinality of each cluster as close to the average cardinality as possible.
ROSE is proposed for fast and even routing in sensor networks. The algorithm uses the concepts of the differences of sets and the node relative degree to find the paths from the sink to all nodes in the network. It is developed in the manner of a rose blossoming. The protocol forms a tree-architecture to organize the sensors as hierarchical sets governed by their set-heads. Therefore, the sink can conveniently and quickly follows the tree structure to find its destinations. The set-heads perform data fusion / aggregation to reduce bandwidth consumption, media access delay and power consumption in communication. Rose Algorithm is proved to be packet delivery guaranteed. If a set-head failed, its children become orphan nodes. The broken fragments can be quickly glued back to the tree using the upstream local recovery method.
ASGR, FMAR, LLBC and ROSE could be extended (as increasing network security) or combined for very efficient routings in ad hoc wireless networks / wireless sensor networks.
|
author2 |
Yueh-Min Huang |
author_facet |
Yueh-Min Huang Bey-Ling Su 蘇碧玲 |
author |
Bey-Ling Su 蘇碧玲 |
spellingShingle |
Bey-Ling Su 蘇碧玲 Adaptive, Fuzzy Logic, Load Balanced and Fast Routings for Ad Hoc and Sensor Wireless Networks |
author_sort |
Bey-Ling Su |
title |
Adaptive, Fuzzy Logic, Load Balanced and Fast Routings for Ad Hoc and Sensor Wireless Networks |
title_short |
Adaptive, Fuzzy Logic, Load Balanced and Fast Routings for Ad Hoc and Sensor Wireless Networks |
title_full |
Adaptive, Fuzzy Logic, Load Balanced and Fast Routings for Ad Hoc and Sensor Wireless Networks |
title_fullStr |
Adaptive, Fuzzy Logic, Load Balanced and Fast Routings for Ad Hoc and Sensor Wireless Networks |
title_full_unstemmed |
Adaptive, Fuzzy Logic, Load Balanced and Fast Routings for Ad Hoc and Sensor Wireless Networks |
title_sort |
adaptive, fuzzy logic, load balanced and fast routings for ad hoc and sensor wireless networks |
publishDate |
2008 |
url |
http://ndltd.ncl.edu.tw/handle/47072396767960819497 |
work_keys_str_mv |
AT beylingsu adaptivefuzzylogicloadbalancedandfastroutingsforadhocandsensorwirelessnetworks AT sūbìlíng adaptivefuzzylogicloadbalancedandfastroutingsforadhocandsensorwirelessnetworks AT beylingsu suíyìyǔgǎncèwúxiànwǎnglùzhīshìyīngmóhúluójíjūnzàijíkuàisùzhīlùyóu AT sūbìlíng suíyìyǔgǎncèwúxiànwǎnglùzhīshìyīngmóhúluójíjūnzàijíkuàisùzhīlùyóu |
_version_ |
1718268899229696000 |
spelling |
ndltd-TW-096NCKU50280132016-05-16T04:10:17Z http://ndltd.ncl.edu.tw/handle/47072396767960819497 Adaptive, Fuzzy Logic, Load Balanced and Fast Routings for Ad Hoc and Sensor Wireless Networks 隨意與感測無線網路之適應、模糊邏輯、均載及快速之路由 Bey-Ling Su 蘇碧玲 博士 國立成功大學 工程科學系碩博士班 96 Since the advent of packet radio network, numerous protocols have been developed for ad hoc network. The network is a collection of mobile nodes. Usually, it has no centralized or fixed infrastructure. Within past few years, the researches on this field grow rapidly because wireless devices are inexpensive and widely available. The challenges of ad hoc network include mobility, power limitation, narrow bandwidth and high error rates. The dissertation gives an overview of ad hoc network and wireless sensor networks and explores the routing protocols, (I) “Adaptive Shortcut Geographic Routing (ASGR) for Ad Hoc Networks Even with Topology Voids and Islands”, (II) “Fuzzy Logic Weighted Multi-Criteria of Dynamic Route Lifetime for Reliable Multicast Routings in Ad hoc Networks”(FMAR), (III) “Localized and Load-Balanced Clustering (LLBC) for Energy Saving in Wireless Sensor Networks”, and (IV) “Rose (ROSE) Algorithm for Fast and Even Routing in Sensor Networks”. ASGR has the features of beaconless greedy forwarding, loop-freeing, backtracking, backward handling, short-cutting, limited memory requirement, route recovery algorithm and guaranteed packet delivery, so that a forwarding node can forward packets efficiently to the destination for topologies even with voids and islands. Since the short-cut rule is applied to shorten the path to the destination, the found short-cut path approaches the shortest path. ASGR can be also applied to multi-path, where sources can explore their own paths or take the advantage of the historical paths to reach the same destination. FMAR is a fuzzy logic modified AODV routing protocol for multicast routing in ad hoc networks. Since the evaluation of dynamic route lifetime is challenging in the wireless networks, the fuzzy logic weighted multi-criteria of the protocol is used to dynamically evaluate the active route lifetime in order to determine the appropriate routes. In FMAR, multiple routing paths are established to provide extra schemas of video streaming or multicast transmission and enhance the robust transmission against unreliability and limited bandwidth of wireless links. LLBC is a protocol for the energy savings and the lifetime increase of wireless sensor networks. LLBC contains two approaches. One is ICHR (improved cluster head rotation) and the other is MSC (modified static clustering). ICHR use the present cluster heads to select most energetic sensors as the next-round cluster heads and avoids the margin cluster heads being selected as cluster heads repeatedly. MSC is suitable when the network has a few very high energetic sensors. It only needs to perform a few cluster head rotations so the rotation overhead is reduced. It uses the method of inter-cluster load balance to adjust the cardinality of each cluster as close to the average cardinality as possible. ROSE is proposed for fast and even routing in sensor networks. The algorithm uses the concepts of the differences of sets and the node relative degree to find the paths from the sink to all nodes in the network. It is developed in the manner of a rose blossoming. The protocol forms a tree-architecture to organize the sensors as hierarchical sets governed by their set-heads. Therefore, the sink can conveniently and quickly follows the tree structure to find its destinations. The set-heads perform data fusion / aggregation to reduce bandwidth consumption, media access delay and power consumption in communication. Rose Algorithm is proved to be packet delivery guaranteed. If a set-head failed, its children become orphan nodes. The broken fragments can be quickly glued back to the tree using the upstream local recovery method. ASGR, FMAR, LLBC and ROSE could be extended (as increasing network security) or combined for very efficient routings in ad hoc wireless networks / wireless sensor networks. Yueh-Min Huang 黃悅民 2008 學位論文 ; thesis 111 en_US |