Distributed k-connected fault-tolerant topology control algorithms with PSO in future autonomic sensor systems

Guo, Wenzhong; Xiong, Naixue; Vasilakos, Athanasios V.; Chen, Guolong; Yu, Chaolong

doi:10.1504/ijsnet.2012.047720

Cited by 80 publications

(47 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This structure consists of multiple clusters. Each cluster includes one cluster head (CH) and a limited number of cluster members [39,40,41]. The CH s and cluster members are all regular MH s .…”

Section: Ad Hoc Network Structure and Hybrid Checkpointing Modelmentioning

confidence: 99%

Design and Analysis of an Efficient Energy Algorithm in Wireless Social Sensor Networks

Xiong

Zhang

et al. 2017

Sensors

Self Cite

View full text Add to dashboard Cite

Because mobile ad hoc networks have characteristics such as lack of center nodes, multi-hop routing and changeable topology, the existing checkpoint technologies for normal mobile networks cannot be applied well to mobile ad hoc networks. Considering the multi-frequency hierarchy structure of ad hoc networks, this paper proposes a hybrid checkpointing strategy which combines the techniques of synchronous checkpointing with asynchronous checkpointing, namely the checkpoints of mobile terminals in the same cluster remain synchronous, and the checkpoints in different clusters remain asynchronous. This strategy could not only avoid cascading rollback among the processes in the same cluster, but also avoid too many message transmissions among the processes in different clusters. What is more, it can reduce the communication delay. In order to assure the consistency of the global states, this paper discusses the correctness criteria of hybrid checkpointing, which includes the criteria of checkpoint taking, rollback recovery and indelibility. Based on the designed Intra-Cluster Checkpoint Dependence Graph and Inter-Cluster Checkpoint Dependence Graph, the elimination rules for different kinds of checkpoints are discussed, and the algorithms for the same cluster checkpoints, different cluster checkpoints, and rollback recovery are also given. Experimental results demonstrate the proposed hybrid checkpointing strategy is a preferable trade-off method, which not only synthetically takes all kinds of resource constraints of Ad hoc networks into account, but also outperforms the existing schemes in terms of the dependence to cluster heads, the recovery time compared to the pure synchronous, and the pure asynchronous checkpoint advantage.

show abstract

Section: Ad Hoc Network Structure and Hybrid Checkpointing Modelmentioning

confidence: 99%

Design and Analysis of an Efficient Energy Algorithm in Wireless Social Sensor Networks

Xiong

Zhang

et al. 2017

Sensors

Self Cite

View full text Add to dashboard Cite

show abstract

“…The advantages of PSO over many other optimization algorithms are its implementation simplicity and ability to converge to a reasonably good solution quickly. In the past several years, PSO has been successfully applied in many researches and application areas (Carlos et al 2004;Liu et al 2010;Guo et al 2011;Shen et al 2011;Costas et al 2012;Guo et al 2012;Agrawal and Silakari 2013;Rada-Vilela et al 2013). It has been demonstrated that PSO can get better results in a faster and cheaper way compared with other methods.…”

Section: Basic Psomentioning

confidence: 99%

A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reduction

et al. 2014

Self Cite

View full text Add to dashboard Cite

Constructing a timing-driven Steiner tree is very important in VLSI performance-driven routing stage. Meanwhile, non-Manhattan architecture is supported by several manufacturing technologies and now well appreciated in the chip manufacturing circle. However, limited progress has been reported on the non-Manhattan performance-driven routing problem. In this paper, an efficient algorithm, namely, TOST_BR_MOPSO, is presented to construct the minimumcost spanning tree with a minimum radius for performancedriven routing in Octilinear architecture (one type of the non-Manhattan architecture) based on multi-objective particle swarm optimization (MOPSO) and Elmore delay model. Edge transformation is employed in our algorithm to make the particles have the ability to achieve the optimal solution while Union-Find partition is used to prevent the generation of invalid solution. For the purpose of reducing the number of bends which is one of the key factors of chip manuCommunicated by V. Loia. facturability, we also present an edge-vertex encoding strategy combined with edge transformation. To our best knowledge, no approach has been proposed to optimize the number of bends in the process of constructing the non-Manhattan timing-driven Steiner tree. Moreover, the theorem of Markov chain is used to prove the global convergence of our proposed algorithm. Experimental results indicate that the proposed MOPSO is worthy of being studied in the field of multiobjective optimization problems, and our algorithm has a better tradeoff between the wire length and radius of the routing tree and has achieved a better delay value. Meanwhile, combining edge transformation with the encoding strategy, the proposed algorithm can significantly reduce nearly 20 % in the number of bends.

show abstract

“…On the one hand, people enjoy the convenience brought by the abundant information on the network; on the other hand, they are also suffering from the puzzle of information explosion. For example, if you are not good at filtering useless information when searching for the information you need from within a large amount of information, a considerable amount of time is spent in filtering information [4][5][6][7], which leads to a significant increase in retrieval time.…”

Section: Introductionmentioning

confidence: 99%

Design and analysis of a general vector space model for data classification in Internet of Things

Sang

Pang

Zha

et al. 2019

J Wireless Com Network

View full text Add to dashboard Cite

The amount of information increases explosively in Internet of Things, because more and more data are sensed by large amount of sensors. The explosive growth of information makes it difficult to access information efficiently, so it is an effective method to decrease the amount of information to be transferred on network by text classification. This paper proposes a new text classification algorithm based on vector space model. This algorithm improves the feature selection and weighting methods by introducing synonym replacement to traditional text classification algorithms. The experimental results show that the proposed classification algorithm has considerably improved the precision and recall of classification.

show abstract

Distributed k-connected fault-tolerant topology control algorithms with PSO in future autonomic sensor systems

Cited by 80 publications

References 31 publications

Design and Analysis of an Efficient Energy Algorithm in Wireless Social Sensor Networks

Design and Analysis of an Efficient Energy Algorithm in Wireless Social Sensor Networks

A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reduction

Design and analysis of a general vector space model for data classification in Internet of Things

Contact Info

Product

Resources

About