The Experts below are selected from a list of 183 Experts worldwide ranked by ideXlab platform
C.-c.j. Kuo - One of the best experts on this subject based on the ideXlab platform.
-
WCNC - Power-aware topology control for wireless ad-hoc networks
IEEE Wireless Communications and Networking Conference 2006. WCNC 2006., 2006Co-Authors: Wonseok Baek, David S. L. Wei, C.-c.j. KuoAbstract:A power-aware approach in the context of topology control that allows the power consumption to be evenly distributed among network Nodes, and thereby prolongs the network lifetime, is proposed in this research. Unlike power-aware routing schemes, where exact traffic flow and residual energy level of each Node are required, our power-aware topology control only requires the residual energy levels and location information of the reachable Neighboring Nodes. When a Node is making a decision on whether a wireless link between itself and a reachable Neighboring Node should be preserved in the topology being constructed, the decision is made based on not only the distance from its Neighboring Nodes but also the residual energy levels of itself and its Neighboring Nodes. Also, the topology is restructured from time to time based on the residual energy level of each Node. The performance improvement by our power-aware topology control algorithm is shown through extensive simulations
-
Power-aware topology control for wireless multi-hop sensor networks
Digital Wireless Communications VII and Space Communication Technologies, 2005Co-Authors: Wonseok Baek, David S. L. Wei, C.-c.j. KuoAbstract:A power-aware approach that allows the power consumption to be evenly distributed among network Nodes and, thereby, prolongs the network lifetime is proposed in this research. To begin with, each Node has the same residual power level, and the algorithm employs the MST (minimum spanning tree)-based power-efficient topology control algorithm to obtain the first topology. Afterwards, when a Node is making a decision on whether a wireless link between itself and a reachable Neighboring Node should be preserved or not in the topology being constructed, the decision is made based on not only the distance from its Neighboring Nodes but also the residual power levels of itself and its Neighboring Nodes. In principle, the constructed topology will be the one in which the Node of a larger connectivity degree is the one of a higher residual power level. Also, from time to time, based on the residual power level of each Node, the topology may be restructured. A Node of degree one is a leaf Node, and those non-leaf Nodes and their attached links form the backbone of the virtual infrastructure.
Wonseok Baek - One of the best experts on this subject based on the ideXlab platform.
-
WCNC - Power-aware topology control for wireless ad-hoc networks
IEEE Wireless Communications and Networking Conference 2006. WCNC 2006., 2006Co-Authors: Wonseok Baek, David S. L. Wei, C.-c.j. KuoAbstract:A power-aware approach in the context of topology control that allows the power consumption to be evenly distributed among network Nodes, and thereby prolongs the network lifetime, is proposed in this research. Unlike power-aware routing schemes, where exact traffic flow and residual energy level of each Node are required, our power-aware topology control only requires the residual energy levels and location information of the reachable Neighboring Nodes. When a Node is making a decision on whether a wireless link between itself and a reachable Neighboring Node should be preserved in the topology being constructed, the decision is made based on not only the distance from its Neighboring Nodes but also the residual energy levels of itself and its Neighboring Nodes. Also, the topology is restructured from time to time based on the residual energy level of each Node. The performance improvement by our power-aware topology control algorithm is shown through extensive simulations
-
Power-aware topology control for wireless multi-hop sensor networks
Digital Wireless Communications VII and Space Communication Technologies, 2005Co-Authors: Wonseok Baek, David S. L. Wei, C.-c.j. KuoAbstract:A power-aware approach that allows the power consumption to be evenly distributed among network Nodes and, thereby, prolongs the network lifetime is proposed in this research. To begin with, each Node has the same residual power level, and the algorithm employs the MST (minimum spanning tree)-based power-efficient topology control algorithm to obtain the first topology. Afterwards, when a Node is making a decision on whether a wireless link between itself and a reachable Neighboring Node should be preserved or not in the topology being constructed, the decision is made based on not only the distance from its Neighboring Nodes but also the residual power levels of itself and its Neighboring Nodes. In principle, the constructed topology will be the one in which the Node of a larger connectivity degree is the one of a higher residual power level. Also, from time to time, based on the residual power level of each Node, the topology may be restructured. A Node of degree one is a leaf Node, and those non-leaf Nodes and their attached links form the backbone of the virtual infrastructure.
David S. L. Wei - One of the best experts on this subject based on the ideXlab platform.
-
WCNC - Power-aware topology control for wireless ad-hoc networks
IEEE Wireless Communications and Networking Conference 2006. WCNC 2006., 2006Co-Authors: Wonseok Baek, David S. L. Wei, C.-c.j. KuoAbstract:A power-aware approach in the context of topology control that allows the power consumption to be evenly distributed among network Nodes, and thereby prolongs the network lifetime, is proposed in this research. Unlike power-aware routing schemes, where exact traffic flow and residual energy level of each Node are required, our power-aware topology control only requires the residual energy levels and location information of the reachable Neighboring Nodes. When a Node is making a decision on whether a wireless link between itself and a reachable Neighboring Node should be preserved in the topology being constructed, the decision is made based on not only the distance from its Neighboring Nodes but also the residual energy levels of itself and its Neighboring Nodes. Also, the topology is restructured from time to time based on the residual energy level of each Node. The performance improvement by our power-aware topology control algorithm is shown through extensive simulations
-
Power-aware topology control for wireless multi-hop sensor networks
Digital Wireless Communications VII and Space Communication Technologies, 2005Co-Authors: Wonseok Baek, David S. L. Wei, C.-c.j. KuoAbstract:A power-aware approach that allows the power consumption to be evenly distributed among network Nodes and, thereby, prolongs the network lifetime is proposed in this research. To begin with, each Node has the same residual power level, and the algorithm employs the MST (minimum spanning tree)-based power-efficient topology control algorithm to obtain the first topology. Afterwards, when a Node is making a decision on whether a wireless link between itself and a reachable Neighboring Node should be preserved or not in the topology being constructed, the decision is made based on not only the distance from its Neighboring Nodes but also the residual power levels of itself and its Neighboring Nodes. In principle, the constructed topology will be the one in which the Node of a larger connectivity degree is the one of a higher residual power level. Also, from time to time, based on the residual power level of each Node, the topology may be restructured. A Node of degree one is a leaf Node, and those non-leaf Nodes and their attached links form the backbone of the virtual infrastructure.
Yuta Maruoka - One of the best experts on this subject based on the ideXlab platform.
-
performance evaluation of routing method based on Neighboring Node information in wmn
Network-Based Information Systems, 2015Co-Authors: Wataru Kobayashi, Kazunori Ueda, Yuta MaruokaAbstract:Because of developments of wireless technologies in recent years, wireless mesh networks have been focused. Our research group have proposed routing method Multiple Branch Collection Routing (MBCR) for wireless mesh networks to reduce control communications by using location information and new defined address. We have evaluated the performance of MBCR that has been extended in this paper. As results of simulations, we confirmed that MBCR with the new parameters achieved better performance than existing approaches.
-
NBiS - Performance Evaluation of Routing Method Based on Neighboring Node Information in WMN
2015 18th International Conference on Network-Based Information Systems, 2015Co-Authors: Wataru Kobayashi, Kazunori Ueda, Yuta MaruokaAbstract:Because of developments of wireless technologies in recent years, wireless mesh networks have been focused. Our research group have proposed routing method Multiple Branch Collection Routing (MBCR) for wireless mesh networks to reduce control communications by using location information and new defined address. We have evaluated the performance of MBCR that has been extended in this paper. As results of simulations, we confirmed that MBCR with the new parameters achieved better performance than existing approaches.
Glleen M Allan - One of the best experts on this subject based on the ideXlab platform.
-
modifikasi pemilihan forwarding Node pada dynamic source routing dsr berdasarkan tingkat kestabilan Neighboring Node di vanets
2018Co-Authors: Glleen M AllanAbstract:Vehicular Ad hoc Networks (VANETs) merupakan pengembangan dari Mobile Ad hoc Networks (MANETs), dimana Node memiliki karakteristik dengan mobilitas yang tinggi dan terbatas pada pola pergerakannya. Ada banyak routing protocol yang dapat diimplementasikan pada VANETs salah satunya adalah Dynamic Source Routing (DSR). DSR merupakan salah satu routing protocol yang termasuk dalam klasifikasi reactive routing protocol. Sebuah routing protocol yang hanya akan membuat rute ketika ada paket yang ingin dikirim. Modifikasi akan dilakukan pada proses pengiriman paket route request (RREQ), yaitu dengan cara mengeliminasi jumlah neighbor Node yang bertugas mengirim ulang (rebroadcast) paket RREQ. Hal ini dilakukan dengan cara melihat jumlah Node tetangga dari tiap Node tersebut, lalu jika Node tersebut memiliki jumlah Node tetangga lebih dari jumlah threshold, Node tersebut menjadi forwarding Node dan Node tersebut yang bisa melakukan proses rebroadcast. Jika paket RREQ sampai pada Node tujuan, maka Node tujuan akan mengirim paket route reply (RREP) ke Node asal. Lalu rute untuk pengiriman paket akan terbentuk. Modifikasi yang dilakukan akan menghasilkan routing overhead dan forwarded route request yang lebih kecil daripada routing protocol DSR yang asli. Pada tugas akhir ini, performa pada routing protocol DSR yang telah dimodifikasi menghasilkan performa yang lebih bagus. Dibuktikan dengan skenario real yang menghasilkan peningkatan rata-rata packet delivery ratio sebesar 5.41%, rata-rata penurunan routing overhead sebesar 50.72%, dan juga rata-rata penurunan forwarded route request sebesar 16.9%. ========================================================================================================= Vehicular Ad hoc Networks (VANETs) are development of Mobile Ad hoc Networks (MANETs), where the Node was characterized by high mobility and limited in its movement pattern. There are many routing protocol on VANETs, one of them is Dynamic Source Routing (DSR). DSR is classified to reactive routing protocol. A routing protocol that only make the route when there are pakets to be sent. In this thesis a solution have been made by modifying the delivery of route request (RREQ) process, which is eliminating the number of Neighboring Node that assigned to rebroadcast RREQ packet. By looking at the number of neighbor Node of each Node, and then if the number of neighbor Nodes more than threshold, the Node becomes a forwarding Node and the Node will rebroadcast the packet. If the RREQ packet has reached the destination Node, the destination Node will send back a route reply (RREP) packet to the source Node and the route will be formed on cache. The performance of the modified protocol has a better result than the original routing protocol DSR. It is proven that in real scenario, there is an enhancement of average packet delivery ratio by 5.41%, reduction of average routing overhead by 50.72%, and reduction of average forwarded route request by 16.9%
