2015
DOI: 10.1155/2015/194532
|View full text |Cite
|
Sign up to set email alerts
|

Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

Abstract: Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2017
2017

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…Ant will move and find the optimal path in WSN environment first before packet submission process (Jabbar et al, 2015). This approach can reduce packet loss rate and at the same time can prevent dead node problem where only sensor nodes with high capabilities are being utilized during routing determination process.…”
Section: Advantages and Disadvantages Of Ant Colony Optimization In Wsnmentioning
confidence: 99%
“…Ant will move and find the optimal path in WSN environment first before packet submission process (Jabbar et al, 2015). This approach can reduce packet loss rate and at the same time can prevent dead node problem where only sensor nodes with high capabilities are being utilized during routing determination process.…”
Section: Advantages and Disadvantages Of Ant Colony Optimization In Wsnmentioning
confidence: 99%
“…Some more recent algorithms attempt to limit the number of broadcasts like SARA for MANETs [22] and ESARA for Wireless Sensor Networks [23]; they adopt a controlled neighbor broadcast mechanism in route discovery to avoid flooding the network with FANTs. Each node broadcasts the FANT to its direct neighbors, and only one of them further rebroadcasts the FANT to its neighbors.…”
Section: Routing Issues In Ad Hoc Network and Related Workmentioning
confidence: 99%