Power-aware routing, have been studied to avoid energy-scarce sensors and achieve network lifetime improvement but recently, it was noticed that sink mobility can also be used to improve network lifetime by avoiding e...
详细信息
ISBN:
(纸本)9781424455324
Power-aware routing, have been studied to avoid energy-scarce sensors and achieve network lifetime improvement but recently, it was noticed that sink mobility can also be used to improve network lifetime by avoiding excessive transmission overhead at nodes that are close to the location that would be occupied by a static sink. Also in many situations, a static sink may be unfeasible because of deployment or security constraints. In this paper, an energy-efficient method is introduced which can deliver data packets to mobile sink nodes. As can observed from simulation results, the mobile sink directed diffusion (MSDD) offers a magnificent way to upgrade directed diffusion algorithm to support sink mobility with minimum energy overhead and acceptable performance. Furthermore, in the proposed algorithm, no location service or predictable sink trajectory is assumed which is a common requirement in most of mobile sink routing algorithms. Simulation results show that MSDD algorithm can reach the packet delivery rate of over 55% in the worst case with the sink speed of 30 m/s with acceptable energy overhead.
Wireless Sensor Networks consists of a huge number of small self-contained devices with computational, sensing and wireless communication capabilities. LEACH is a classical clustering-based protocol in wireless sensor...
详细信息
ISBN:
(纸本)9783642316555;9783642316562
Wireless Sensor Networks consists of a huge number of small self-contained devices with computational, sensing and wireless communication capabilities. LEACH is a classical clustering-based protocol in wireless sensor network. In this paper, we propose an improved routing algorithm LEACH-WQ based on the analysis of LEACH protocol, which involves cluster head choosing, multi-hop routing and the building of its path. As a result the number of cluster head is constant and near optimal per round. Simulation results prove that the routing algorithm proposed by us has higher energy utilizing rate, and it helps prolonging the network lifetime.
Endowing mesh routers with multiple radios is a recent solution to improve the performance of wireless mesh networks. The approaches proposed in the literature to solve the problem how to assign channels to radio have...
详细信息
ISBN:
(纸本)9781424456383
Endowing mesh routers with multiple radios is a recent solution to improve the performance of wireless mesh networks. The approaches proposed in the literature to solve the problem how to assign channels to radio have mainly focused so far on reducing interference or maximizing the throughput. To the best of our knowledge, none of such approaches attempted to save network resources for the purpose of reducing energy consumption and RF emissions. In this paper, a channel assignment and routing algorithm is presented aiming to turn off as many radio interfaces as possible while providing a required level of performance. Simulation studies show that the proposed algorithm enables to achieve nearly the same performance of traditional algorithms while considerably reducing the number of radio interfaces turned on.
In this paper, a new deadlock-free dynamic turn model named VMCD (vertical-mesh-conscious-dynamic) is proposed for higher performance in 3D NoC. On vertical meshes and odd horizontal meshes, odd-even turn model is app...
详细信息
ISBN:
(纸本)9781479986415
In this paper, a new deadlock-free dynamic turn model named VMCD (vertical-mesh-conscious-dynamic) is proposed for higher performance in 3D NoC. On vertical meshes and odd horizontal meshes, odd-even turn model is applied, while xy routing is utilized on even horizontal meshes. According to the priority of vertical meshes and horizontal meshes, two VMCD routing algorithms are applied based on this turn model. Compared with the Z-odd-even (ZOE) and balanced-odd-even (BOE), the proposed VMCD algorithms take adaptiveness and network balance into account simultaneously and show better performance including average latency and throughput. Compared to ZOE on 8*8*2 and 8*8*4 mesh, the improvement of throughput can be up to 68.5% and 9.3% respectively for the random traffic and 14.3% and 20% respectively for the transpose traffic pattern. The performance improvement is much more remarkable compared with BOE routing algorithm.
routing strategy with effective and saving energy is an important problem in the research on the application of wireless sensor network into the farmland micro climate and soil moisture monitoring, it analyzed the dis...
详细信息
ISBN:
(纸本)9783038350125
routing strategy with effective and saving energy is an important problem in the research on the application of wireless sensor network into the farmland micro climate and soil moisture monitoring, it analyzed the disadvantage of the layered tree routing algorithm and ZigBee routing algorithms in energy saving, combined with ZigBee network topology, establishing an optimal node analysis model based on fuzzy decision, bringing forward a new routing algorithm which is suitable for large-scale farmland gradient environment, this new algorithm find out the quantitative relation between energy consumption and routing node selecting strategy, which can greatly decrease the route hop number by routing discovery mechanism and create an optimum goal group. Simulation results showed that compared with the layered tree and ZigBee routing algorithms, the new routing algorithms can significantly reduce the energy consumption of routing process.
Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. These routing algorithms increase the routing hops. To get better routing efficiency, a new routing algorithm named RIDC was...
详细信息
Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. These routing algorithms increase the routing hops. To get better routing efficiency, a new routing algorithm named RIDC was presented in this paper. It dynamically merges nodes into different clusters in a taxonomy hierarchy, and organizes the clusters into routing overlays. By this algorithm the network performance is greatly enhanced. Preliminary evaluation shows that RIDC achieves a good convergence on a large scale of nodes. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of [CEIS 2011]
In this paper, we are propose a cluster routing algorithm based on RSSI (Received Signal Strength Indication) for an efficient multi-hop data forwarding. The proposed a cluster routing algorithm determine a header by ...
详细信息
ISBN:
(纸本)9781467393089
In this paper, we are propose a cluster routing algorithm based on RSSI (Received Signal Strength Indication) for an efficient multi-hop data forwarding. The proposed a cluster routing algorithm determine a header by generate the cluster a random to between nodes of similar positions using the RSSI of each node to the sink node in the cluster-based wireless sensor network. And it are to the data transmission to the sink node to the multi-hop. In this paper, efficiency test results of proposed cluster routing algorithm was reduced energy consumption when increased the size and traffic in the sensors network by compared with LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol.
WSN can be applied to observe uranium tailings radionuclide contamination. Due to its energy constraint, a nice good clustering algorithm must use the network energy efficiently. For the lack of LEACH and GAF, an geog...
详细信息
ISBN:
(纸本)9781509019977
WSN can be applied to observe uranium tailings radionuclide contamination. Due to its energy constraint, a nice good clustering algorithm must use the network energy efficiently. For the lack of LEACH and GAF, an geographical adaptive routing algorithm based on overlapping area(GAOA) is proposed. The monitoring area is divided into a grid of circle according to location information of sensor node and intersecting circle structure. With residual energy and distance to the center within circle, the nodes will be selected as cluster heads. Then cluster heads choose the optimal next hop to transmit data to base station. As is shown in the experiment, the algorithm can save energy efficiently and prolong the network lifetime.
In this paper, we propose a new routing algorithm which calculates bandwidth-delay constrained routes in the fast and efficient manner. The algorithm is designed for the software-defined backbone networks, where the c...
详细信息
ISBN:
(纸本)9781467394864
In this paper, we propose a new routing algorithm which calculates bandwidth-delay constrained routes in the fast and efficient manner. The algorithm is designed for the software-defined backbone networks, where the control plane is separated from the data plane and logically centralized. Besides providing the required quality of service (QoS), the algorithm aims to maximize utilization of network resources, as that is the major interest of the infrastructure providers. To reduce the computational complexity of this complex traffic engineering task, we consider the control framework which classifies traffic flows in a finite number of categories based on the level of delay sensitivity. The simulation results show that the proposed approach to QoS provisioning, although relatively simple, leads to smaller amount of rejected QoS requests under a wide range of system parameters than the competitive complex solutions.
This paper proposes a decision model based on fuzzy logics to assign the route between source-destination nodes in elastic optical networks. The route is chosen dynamically based on the lowest cost criterion, which is...
详细信息
ISBN:
(纸本)9781509028399
This paper proposes a decision model based on fuzzy logics to assign the route between source-destination nodes in elastic optical networks. The route is chosen dynamically based on the lowest cost criterion, which is calculated based on a weighted summation of three metrics, called availability of contiguous slots on the route, average availability of slots on the route and physical length of the lightpath. To accomplish this task, we use the Takagi-Sugeno defuzzification process to calculate the cost of the route under analysis. By using our proposal in three different scenarios, we obtained a better network performance regarding blocking probability and an increase in the throughput when compared to other well-known routing algorithms, such as Shortest Path, Minimum Hop, Congested Aware Shortest Path and Spectrum Continuity based Shortest Path.
暂无评论