2015
DOI: 10.1007/978-3-319-13731-5_32
|View full text |Cite
|
Sign up to set email alerts
|

Reactive Energy Aware Routing Selection Based on Knapsack Algorithm (RER-SK)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…We analyse and validate the performance of the proposed work through simulation and compared the results with existing residual-based sink node deployment mechanisms i.e., EMLP [1], namely Energy aware [6],…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We analyse and validate the performance of the proposed work through simulation and compared the results with existing residual-based sink node deployment mechanisms i.e., EMLP [1], namely Energy aware [6],…”
Section: Resultsmentioning
confidence: 99%
“…Existing literature presents various congestion control mechanisms to prevent buffer overflow in wired and wireless networks, yet these are not directly applicable to infrastructure-free networks like WSNs, where packet drops occur due to buffer overflow [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21]22]. An early congestion detection algorithm is needed to identify congestion at sensor nodes neighboring the sink, implemented at the network layer of the OSI model.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The paper consider these nodes as packet dropping nodes. The packet dropping nodes are black hole node, cooperative black hole node, and false reporting node, and also node drops the packet due to insufficient energy and overflow of buffer [2,3]. Existing work "Secure knowledge algorithm" [1] identified the different way of packet dropping in MANET either by system fault and malicious behavior.…”
Section: Existing Workmentioning
confidence: 99%
“…In our previous work [8,9], we uses the Chebyshev polynomial"s semi group property to provide authentication between communicating entities, which shown in below equation.…”
Section: B Chaotic Mapsmentioning
confidence: 99%
“…In this section we implement the RSA & Chaotic maps based key agreement between communicating entities above the underlying routing algorithms protocols such as AODV, AOMDV and DSR [7,9,10] and evaluated the performance of network with respect to end to end delay. As computational time of algorithm directly affect the end to end delay of communicating entities.…”
Section: B Computational Comparison Between Rsa and Chaos In Dynamicmentioning
confidence: 99%