Australasian Telecommunication Networks and Applications Conference (ATNAC) 2012 2012
DOI: 10.1109/atnac.2012.6398049
|View full text |Cite
|
Sign up to set email alerts
|

Energy-balance routing for wireless sensor networks with scale-free characteristic

Abstract: In this paper, an energy-balance routing strategy is proposed for prolonging the network lifetime for wireless sensor networks with scale-free characteristic. In order to avoid the nodes with high traffic using up their energy too early and prolong the network lifetime, the new routing strategy adopts the shortest path routing algorithm on weighted wireless sensor networks, where the weight values are calculated based on betweenness centrality of the nodes. Since the nodes with large betweenness centrality con… 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

2015
2015
2017
2017

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…Authors in Li et al (2012) proposed an energy-balance routing algorithm for extending the network lifetime for wireless sensor networks with scale-free characteristic. In order to avoid the nodes with high traffic using up their energy too early and prolong the network lifetime, the new routing strategy adopts the shortest path routing algorithm on weighted wireless sensor networks, where the weight values are calculated based on betweenness centrality of the nodes.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Authors in Li et al (2012) proposed an energy-balance routing algorithm for extending the network lifetime for wireless sensor networks with scale-free characteristic. In order to avoid the nodes with high traffic using up their energy too early and prolong the network lifetime, the new routing strategy adopts the shortest path routing algorithm on weighted wireless sensor networks, where the weight values are calculated based on betweenness centrality of the nodes.…”
Section: Related Workmentioning
confidence: 99%
“…In the literature of recent studies (Li et al, 2012), Yan et al (2006), Guan et al (2011), it is known that betweenness centrality plays an important role in the traffic on a network. For a given network, the path operator calculus centrality (POCC) of a node v is defined as:…”
Section: Operator Calculus Approachmentioning
confidence: 99%