An energy-efficient clustered distributed coding for large-scale wireless sensor networks

Peng, Yuexing; Li, Yonghui; Shu, Lei; Wang, Wenbo

doi:10.1007/s11227-012-0848-9

Cited by 4 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, in order to better complete the following tasks, the optimization protocol stipulates that only nodes with residual energy larger than the average residual energy have the opportunity to be selected as CH nodes. Before selecting CHs, we put the nodes with a residual energy greater than the average residual energy into a set Φ = fE residual ≥ E residual g. Then, the clustering results of each round are calculated by using the proposed PSOLB algorithm [30].…”

Section: Algorithm Design and Implementationmentioning

confidence: 99%

“…The ABC-SD algorithm exploits the biologically inspired fast and efficient searching features of the Artificial Bee Colony metaheuristic to build low-power clusters [37]. JCR in terms of energy consumption is the clustered routing protocol proposed in 2016 [30,31]. Since PSO-C does not include a multihop routing protocol, it adopts a greedy routing algorithm.…”

Section: System Simulation Analysismentioning

confidence: 99%

See 1 more Smart Citation

Hybrid PSO and Evolutionary Game Theory Protocol for Clustering and Routing in Wireless Sensor Network

Song

Liu

2020

Journal of Sensors

View full text Add to dashboard Cite

Compared with traditional networks, WSNs have more limited resources such as energy, communication, computing, and storage. The problem of how to achieve energy saving, extend network life cycle, and improve network performance under these limited resources has always been an issue of great interest in WSN research. However, existing protocols do not consider that sensor nodes within the BS threshold may not be clustered. These nodes can directly transmit data to the BS. This simplifies the cluster routing process of the entire WSN and saves more energy. This paper introduces an efficient, and energy-efficient, clustering and equalization routing protocol called the PSOLB-EGT protocol. This protocol introduces a new approach by combining improved particle swarm optimization (PSO) and evolutionary game theory (EGT) algorithms to address the problem of maximizing the network lifetime. The operation of the wireless sensor network is divided into an initialization phase and a data transmission phase. In the initialization phase of the wireless sensor network, the improved PSO algorithm is used to establish clusters and select CHs in areas other than the BS threshold. Entering the data transmission phase, we analyze this problem from the perspective of game theory. We use improved noncooperative evolutionary game theory to build models to solve the problem of the energy waste caused by routing congestion. The proposed PSOLB-EGT protocol is intensively experimented with a number of topologies in various network scenarios, and the results are compared with the well-known cluster-based routing protocols that include the swarm intelligence-based protocols. The obtained results prove that the proposed protocol has increased 9%, 8%, and 5% compared with the ABC-SD protocol in terms of network life, network coverage, and amount of data transmitted, respectively.

show abstract

Section: Algorithm Design and Implementationmentioning

confidence: 99%