Wireless sensor networks are employed in several applications, including military, medical, environmental and household. In all these applications, energy usage is the determining factor in the performance of wireless...Wireless sensor networks are employed in several applications, including military, medical, environmental and household. In all these applications, energy usage is the determining factor in the performance of wireless sensor networks. Consequently, methods of data routing and transferring to the base station are very important because the sensor nodes run on battery power and the energy available for sensors is limited. In this paper we intend to propose a new protocol called Fair Efficient Location-based Gossiping (FELGossiping) to address the problems of Gossiping and its extensions. We show how our approach increases the network energy and as a result maximizes the network life time in comparison with its counterparts. In addition, we show that the energy is balanced (fairly) between nodes. Saving the nodes energy leads to an increase in the node life in the network, in comparison with the other protocols. Furthermore, the protocol reduces propagation delay and loss of packets.展开更多
Many advances have been made in sensor technologies which are as varied as the applications;and many more are in progress. It has been reasonable to design and develop small size sensor nodes of low cost and low power...Many advances have been made in sensor technologies which are as varied as the applications;and many more are in progress. It has been reasonable to design and develop small size sensor nodes of low cost and low power. In this work, we have explored some energy-efficient routing protocols (LEACH, Directed Diffusion, Gossiping and EESR) and their expansions (enhancements), and furthermore, their tactics specific to wireless sensor network, such as data aggregation and in-network processing, clustering, different node role assignment, and data-centric methods. After that we have compared these explored routing protocols based on different metrics that affect the specific application requirements and WSN in general.展开更多
We offer a fast gossiping algorithm in Square mesh in this paper. We adopt H* model and assume that apacket can only travel across one edge in each timestep.
文摘Wireless sensor networks are employed in several applications, including military, medical, environmental and household. In all these applications, energy usage is the determining factor in the performance of wireless sensor networks. Consequently, methods of data routing and transferring to the base station are very important because the sensor nodes run on battery power and the energy available for sensors is limited. In this paper we intend to propose a new protocol called Fair Efficient Location-based Gossiping (FELGossiping) to address the problems of Gossiping and its extensions. We show how our approach increases the network energy and as a result maximizes the network life time in comparison with its counterparts. In addition, we show that the energy is balanced (fairly) between nodes. Saving the nodes energy leads to an increase in the node life in the network, in comparison with the other protocols. Furthermore, the protocol reduces propagation delay and loss of packets.
文摘Many advances have been made in sensor technologies which are as varied as the applications;and many more are in progress. It has been reasonable to design and develop small size sensor nodes of low cost and low power. In this work, we have explored some energy-efficient routing protocols (LEACH, Directed Diffusion, Gossiping and EESR) and their expansions (enhancements), and furthermore, their tactics specific to wireless sensor network, such as data aggregation and in-network processing, clustering, different node role assignment, and data-centric methods. After that we have compared these explored routing protocols based on different metrics that affect the specific application requirements and WSN in general.
文摘We offer a fast gossiping algorithm in Square mesh in this paper. We adopt H* model and assume that apacket can only travel across one edge in each timestep.
