Topology Evolution of Wireless Sensor Networks among Cluster Heads by Random Walkers

Chen, Lijun; Liu, Ming; Chen, Daoxu; Xie, Luofeng

doi:10.3724/sp.j.1016.2009.00069

Cited by 17 publications

(14 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the existing evolution models are derived from B-A model or L-W model. Some researchers attempted to build scale-free topology of WSNs by using randomwalk (R-W) model [19,20]. Differently from the principle of preferential attachment in B-A model and L-W model, R-W model uses the times of the walker passing by to determine the probability of the existing nodes obtaining the new connections with new-joining nodes.…”

Section: Related Workmentioning

confidence: 99%

Evolution of Scale-Free Wireless Sensor Networks with Feature of Small-World Networks

Duan

et al. 2017

Complexity

View full text Add to dashboard Cite

Scale-free network and small-world network are the most impacting discoveries in the complex networks theories and have already been successfully proved to be highly effective in improving topology structures of wireless sensor networks. However, currently both theories are not jointly applied to have further improvements in the generation of WSN topologies. Therefore, this paper proposes a cluster-structured evolution model of WSNs considering the characteristics of both networks. With introduction of energy sensitivity and maximum limitation of degrees that a cluster head could have, the performance of our model can be ensured. In order to give an overall assessment of lifting effects of shortcuts, four placement schemes of shortcuts are analyzed. The characteristics of small-world network and scale-free network of our model are proved via theoretical derivation and simulations. Besides, we find that, by introducing shortcuts into scale-free wireless sensor network, the performance of the network can be improved concerning energy-saving and invulnerability, and we discover that the schemes constructing shortcuts between cluster heads and the sink node have better promoted effects than the scheme building shortcuts between pairs of cluster heads, and the schemes based on the preferential principle are superior to the schemes based on the random principle.

show abstract

Section: Related Workmentioning

confidence: 99%

Evolution of Scale-Free Wireless Sensor Networks with Feature of Small-World Networks

Duan

et al. 2017

Complexity

View full text Add to dashboard Cite

show abstract

“…Find the next hop (e.g., cluster head) from the clues in the minimum aggregation tree; (11) else (12) Find its cluster head from the candidate cluster heads; (13) end (14) end (15) for each member of a cluster in the network (16) Performing data transmission by single-hop mode; (17) end (18) for each CH in the network (19) Performing data forwarding; the Kruskal algorithm. Namely, only when 1 = 2 holds, Theorem 10 is correct.…”

Section: Theorem 10 the Generated Tree Conducted By The Kruskalbasementioning

confidence: 99%

“…However, the tree topology has an inherent deficiency in that each sensor has only one path to the sink, and the path is not necessarily optimal which results in that the traffic flow passing through these sensors may be unbalanced, thereby making some sensors run out of their energy quickly and even shortening the network lifetime [22]. On the other hand, the clustering routing algorithms [15,17] integrated the famous Dijkstra algorithm and used the Dijkstra algorithm to build the shortest path tree with minimum energy consumption for each CH to the sink node. Namely, the CHs could automatically form a number of multihop communication paths.…”

Section: Introductionmentioning

confidence: 99%

“…The related technique-efficient issues, such as clustering routing, topology control, and multihop transmission, are widely used to improve energy efficiency for WSNs [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. On the other hand, it is very important to note that hybridization combination of various approaches may affect total performance.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Evidence-Efficient Multihop Clustering Routing Scheme for Large-Scale Wireless Sensor Networks

Xin

2017

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Energy consumption and transmission reliability are the most common issues in wireless sensor networks (WSNs). By studying the broadcast nature of data transmission in WSNs, the mechanism of guaranteeing reliable transmission is abstracted as propagation of responsibility and availability. The responsibility and availability represent the accumulated evidence of nodes to support reliable transmission. Based on the developed mechanism, an evidence-efficient cluster head rotation strategy and algorithm are presented. Furthermore, backbone construction algorithm is studied to generate the minimum aggregation tree inside the candidate cluster heads. A minimum aggregation tree-based multihop routing scheme is also investigated, which allows the elected cluster heads to choose the optimally main path to forward data locally and dynamically. As a hybridization of the above, an evidence-efficient multihop clustering routing (EEMCR) method is proposed. The EEMCR method is simulated, validated, and compared with some previous algorithms. The experimental results show that EEMCR outperforms them in terms of prolonging network lifetime, improving transmission reliability, postponing emergence of death nodes, enhancing coverage preservation, and degrading energy consumption.

show abstract

“…By applying small-world theory in topology construction of WSNs, the network performance will be improved in querying data efficiency, energy efficiency, network lifetime, and so forth [7]. A scale-free network is a network whose node's 2 International Journal of Distributed Sensor Networks degree follows a power law distribution, and the scale-free topology characteristics have a higher robustness to endure the random failure [8]. However, few people study how to construct WSN topology with small-world and scale-free characteristics at the same time.…”

Section: Introductionmentioning

confidence: 99%

A Topology Construct and Control Model with Small-World and Scale-Free Concepts for Heterogeneous Sensor Networks

Liu

Xue

Xie

2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Topology construction and control is a vital technique in wireless sensor networks. In this paper, based on small-world and scale-free concepts of complex network theory and considering the characteristics of wireless sensor network, a topology model with smallworld and scale-free concepts for heterogeneous sensor network is presented. This work is achieved by applying heterogeneous sensors and preferential attachment mechanism. Furthermore, the topology evolution algorithm is designed. Finally, we simulate the network characteristics, and simulation results are consistent with the theoretic analysis and show that topologies of wireless sensor network built by this model have small-world and scale-free feathers and can significantly improve energy efficiency as well as enhance network robustness, leading to a crucial improvement of network performance.

show abstract

Topology Evolution of Wireless Sensor Networks among Cluster Heads by Random Walkers

Cited by 17 publications

References 9 publications

Evolution of Scale-Free Wireless Sensor Networks with Feature of Small-World Networks

Evolution of Scale-Free Wireless Sensor Networks with Feature of Small-World Networks

Evidence-Efficient Multihop Clustering Routing Scheme for Large-Scale Wireless Sensor Networks

A Topology Construct and Control Model with Small-World and Scale-Free Concepts for Heterogeneous Sensor Networks

Contact Info

Product

Resources

About