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.
An improved PDSL cluster routing algorithm based on LEACH protocol is put forward, by which data owing different priority are provided for differential services and the cluster routing of LEACH protocol is optimized. ...
详细信息
ISBN:
(纸本)9781467344999;9780769548814
An improved PDSL cluster routing algorithm based on LEACH protocol is put forward, by which data owing different priority are provided for differential services and the cluster routing of LEACH protocol is optimized. By making cluster head nodes dynamically select single-hop routing or multi-hop routing, the consumption of network energy is balanced. Simulation result shows that life cycle of PDSL cluster routing algorithm is longer than that of LEACH, and life cycle is increased 11% and network robustness is promoted 1.4% than that of LEACH.
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]
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.
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.
The real time communication networks are designed to support multimedia applications requiring quality of services (QoS). The multicasting is needed when number of users want to communicate simultaneously. This paper ...
详细信息
ISBN:
(纸本)9781424438051
The real time communication networks are designed to support multimedia applications requiring quality of services (QoS). The multicasting is needed when number of users want to communicate simultaneously. This paper present an approach based on evolutionary programming to solve the QoS constrained multicast routing problem, which is a NP complete problem. The multicast tree is obtained corresponding to optimum (minimum) routing cost subjected to end-to-end delay constraints. The algorithm is tested to obtain optimum multicast trees for different sets of source and destinations on 8-node undirected and 10-node directed networks. The convergence of the proposed algorithm is fast because it relies on mutation and selection and the optimum solution is obtained for both undirected and directed graphs.
Energy balance is an important performance index in the design of routing algorithm for wireless sensor networks. A swarm intelligence optimization based routing algorithm for Wireless Sensor Networks is proposed, who...
详细信息
ISBN:
(纸本)9781424423101
Energy balance is an important performance index in the design of routing algorithm for wireless sensor networks. A swarm intelligence optimization based routing algorithm for Wireless Sensor Networks is proposed, whose kernel idea is taking less hop numbers into consideration and choosing the nodes with less pheromone as next hop to avoid some nodes' prematurely exhausting their energy because of too concentrated routes through the nodes. The experiments show that the algorithm proposed in this paper is better than the Directed Diffusion routing protocol both in end-to-end delay and global energy balance and can effectively balance the global energy consumption and prolong the network lifetime.
RBMC-a novel routing algorithm based on multi-parameter constraints for wireless sensor network was proposed. The algorithm found out the minimum cost path from source sensor to sink by ants with multi-parameter, and ...
详细信息
ISBN:
(纸本)9783037854488
RBMC-a novel routing algorithm based on multi-parameter constraints for wireless sensor network was proposed. The algorithm found out the minimum cost path from source sensor to sink by ants with multi-parameter, and the source sensor could transmit information along the shortest path. Thus the transmission path length and the corresponding network delay could be efficiently reduced. We analyzed the performance of RBMC through compared with the existing other routing algorithms in simulation experiment. Results show that the proposed method can reduce energy cost and balance the energy load effectively.
It is especially important to save energy and prolong the network lifetime because the WSN nodes energy is limited. Optimizing the routing algorithm for WSN is one of the important ways to reduce energy consumption. L...
详细信息
ISBN:
(纸本)9783038350194
It is especially important to save energy and prolong the network lifetime because the WSN nodes energy is limited. Optimizing the routing algorithm for WSN is one of the important ways to reduce energy consumption. LEACH routing protocol is the first cluster-based routing protocol for wireless sensor networks. But LEACH have some deficiencies, such as agreement of uneven clustering, the nodes energy imbalance, frequent clustering and consume too much energy. The paper proposes an improved LEACH protocol to solve the above problem. It takes the residual energy of the nodes into account when nodes selected the cluster-head so that the nodes that hold high-energy have the high possibility to be selected as cluster-head. The improved algorithm uses the incomplete clustering which does not need to cluster every round but interval cluster. Simulation results show that the improved LEACH protocol effectively increases the nodes energy utilization and extends the network lifetime.
Power management in wireless sensor networks has always been a concern for network engineers and hardware manufacturers. Wireless sensor nodes are supposed to operate for extended periods of time, perhaps years, witho...
详细信息
ISBN:
(纸本)9781467325912;9781467325899
Power management in wireless sensor networks has always been a concern for network engineers and hardware manufacturers. Wireless sensor nodes are supposed to operate for extended periods of time, perhaps years, without physical interaction from human beings. Replacing batteries is also not possible or is an inconvenience in most of these networks. Thus, in order to extend the life of entire wireless sensor network system, either higher capacity of batteries needs to be used on each node or the energy consumption of batteries itself needs to be reduced. Energy consumption, from a software point of view, may be reduced both logically and physically by minimizing the involvements of nodes while transferring data from source to destination, which is decided by the routing protocol. This paper proposes a routing protocol that is based on coordinate mathematics. The path selected to transfer the data from source to destination is almost the shortest active path. Generally, this routing protocol at maximum, only sends the information to two of its neighboring nodes, while not influencing other neighboring nodes in idle state. Beside this, location of all the nodes are previously assigned, so the physical location of source node can be easily located for further procedure. This paper, in summary, proposes a routing protocol designed to sort out two key issues of wireless sensor networks namely power conservation and locating the nodes that have detected information that needs to update.
暂无评论