2011
DOI: 10.4236/wsn.2011.310038
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Energy Efficient Routing Protocol in Wireless Sensor Networks

Abstract: 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 Goss… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
3
3
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…FELGossiping (Fair Efficient-based Gossiping) is proposed to handle the energy consumption during the communication. The selection of the nodes based on the distance to the sink and residual energy [26]. Once a node identifies an event to send information, it finds its next hop based on the neighboring nodes' residual energy and hops counts.…”
Section: Background and Related Workmentioning
confidence: 99%
“…FELGossiping (Fair Efficient-based Gossiping) is proposed to handle the energy consumption during the communication. The selection of the nodes based on the distance to the sink and residual energy [26]. Once a node identifies an event to send information, it finds its next hop based on the neighboring nodes' residual energy and hops counts.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Using greedy algorithms are to minimize network capacity decreasing after each wavelength multicast. We have investigated two greedy algorithms [3] (static cost greedy (SCG) algorithm and dynamic cost greedy (DCG) algorithm). Ck is the cost of assigning wavelength λ to reach number of destinations.…”
Section: IImentioning
confidence: 99%
“…In the distributed DWA there are many controllers in the cell. Each one of the wavelength assignment schemes above has different algorithms to assign a wavelength (First Available, Locally Optimized, Maximum Usage, and Mean Square) [3]. The wavelength conversion (WC) has been used in the DWA with different technologies to develop any network.…”
Section: Introductionmentioning
confidence: 99%
“…To address the problems of Gossiping and its extensions the Fair Efficient Location-based Gossiping (FELGossiping) approach is proposed in [6]. This approach is able to increases the network energy and then improve the network life time in comparison to the others solutions studied in this work.…”
Section: Related Workmentioning
confidence: 99%