DV-Hop localization algorithm based on bacterial foraging optimization for wireless multimedia sensor networks

Zhou, Caiqiu; Yang, Yuwang; Wang, Yongjian

doi:10.1007/s11042-018-5674-5

Cited by 14 publications

(8 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the distance estimation technique, node localization can be categorized into two categories-range-free localization and range-based localization. The range-free localization method focuses on connectivity information and geometric distance, such as a hop count for node localization [22,23]. However, this method is a well-known cost-effective method that produces poor localization accuracy [22].…”

Section: Range-based Localizationmentioning

confidence: 99%

See 1 more Smart Citation

Singular Value Thresholding Algorithm for Wireless Sensor Network Localization

2020

View full text Add to dashboard Cite

Wireless Sensor Networks (WSN) are of great current interest in the proliferation of technologies. Since the location of the sensors is one of the most interesting issues in WSN, the process of node localization is crucial for any WSN-based applications. Subsequently, WSN’s node estimation deals with a low-rank matrix which gives rise to the application of the Nuclear Norm Minimization (NNM) method. This paper will focus on the localization of 2-dimensional WSN with objects (obstacles). Recent studies introduce Nuclear Norm Minimization (NNM) for node estimation instead of formulating the rank minimization problem. Common way to tackle this problem is by implementing the Semidefinite Programming (SDP). However, SDP can only handle matrices with a size of less than 100 × 100. Therefore, we introduce the method of Singular Value Thresholding (SVT) which is an iterative algorithm to solve the NNM problem that produces a sequence of matrices { X k , Y k } and executes a soft-thresholding operation on the singular value of the matrix Y k . This algorithm is a user-friendly algorithm which produces a low computational cost with low storage capacity required to give the lowest-rank minimum nuclear norm solution.

show abstract

Section: Range-based Localizationmentioning

confidence: 99%

“…On the other hand, the range-based localization method produces approximated results with a higher localization accuracy. This is due to the process of estimating the physical distance between any two sensor nodes [23]. Hence, this research will focus on range-based localization for the best localization accuracy.…”

Section: Range-based Localizationmentioning

confidence: 99%

Singular Value Thresholding Algorithm for Wireless Sensor Network Localization

2020

View full text Add to dashboard Cite

show abstract

“…Early multipath routing was proposed based on traditional wireless sensor networks (such as ad hoc networks). To be used in wireless sensor networks, it is necessary to consider the unique characteristics of wireless sensor networks (such as limited energy supply, computing power and memory capacity) and short-range wireless communications (such as signal fading and interference) [5][6][7].…”

Section: Relevant Researchmentioning

confidence: 99%

“…The interrupt time ensures that all node requests are processed only after RREQ messages have been received from all source nodes 4. The sink processes the source node queue, calculates the node weight according to a certain algorithm, assigns angles to each source node in the queue according to the weight ratio, and then sends RACK packets to all source nodes in turn 5. After all sources receive RACK packets, they start sending data.5.1.2.…”

mentioning

confidence: 99%

Multimedia Independent Multipath Routing Algorithms for Internet of Things Based on a Node Hidden Communication Model

Jian-hui

2019

Future Internet

View full text Add to dashboard Cite

In order to achieve a multi-path routing algorithm with time delay and energy consumption balance to alleviate the energy holes around a sink, a multimedia independent multipath routing algorithm for internet of things (IoT) based on node hidden communication model is proposed in this paper. On the premise of satisfying the application delay, a multi-source multi-path routing algorithm is proposed by using the idea of software definition and fitting multiple curves to form independent multi-path routing. Through a sink node centralized programming control source node routing, according to the priority of the source node, the dynamic angle of the source node can be allocated, which effectively reduces the energy consumption of the network. In addition, considering that the Internet of Things has more perceptive nodes, limited computing and storage capacity, frequent joining and exiting operations and other factors, a hidden communication model of nodes is designed for the IoT. It is helpful to improve the level of privacy protection in the IoT, and to effectively improve the ability of nodes to resist attacks in the IoT. The experimental results show that the proposed algorithm avoids the interference between paths and various network attacks to the greatest extent, and the energy consumption is relatively low under the requirement of quality of service (QoS) delay.

show abstract

“…Heuristic algorithms reduce the effort, time, and errors of conventional methods, such as the trial-and-error method and the experience of the design method. In Elsisi (2019) and Zhou, Yang, & Wang (2019) the performance of a proposed algorithm is compared with other wellknown algorithms through several Benchmark functions where it is stated that if the best solution with respect to the random initial is far from the optimal solution, the heuristic algorithm may take several iterations to reach the optimal solution.…”

Section: Related Workmentioning

confidence: 99%

Parametric Analysis of BFOA for Minimization Problems Using a Benchmark Function

et al. 2019

View full text Add to dashboard Cite

This paper presents the social foraging behavior of Escherichia coli (E. Coli) bacteria based on Bacteria Foraging Optimization algorithms (BFOA) to find optimization and distributed control values. The search strategy for E. coli is very complex to express and the dynamics of the simulated chemotaxis stage in BFOA is analyzed with the help of a simple mathematical model. The methodology starts from a detailed analysis of the parameters of bacterial swimming and tumbling (C) and the probability of elimination and dispersion (Ped), then an adaptive variant of BFOA is proposed, in which the size of the chemotherapeutic step is adjusted according to the current suitability of a virtual bacterium. To evaluate the performance of the algorithm in obtaining optimal values, the resolution was applied to one of the benchmark functions, in this case the Ackley minimization function, a comparative analysis of the BFOA is then performed. The simulation results have shown the validity of the optimal values (minimum or maximum) obtained on a specific function for real world problems, with a function belonging to the benchmark group of optimization functions.

show abstract

DV-Hop localization algorithm based on bacterial foraging optimization for wireless multimedia sensor networks

Cited by 14 publications

References 21 publications

Singular Value Thresholding Algorithm for Wireless Sensor Network Localization

Singular Value Thresholding Algorithm for Wireless Sensor Network Localization

Multimedia Independent Multipath Routing Algorithms for Internet of Things Based on a Node Hidden Communication Model

Parametric Analysis of BFOA for Minimization Problems Using a Benchmark Function

Contact Info

Product

Resources

About