Using Laplacian Eigenmap as Heuristic Information to Solve Nonlinear Constraints Defined on a Graph and Its Application in Distributed Range-Free Localization of Wireless Sensor Networks

Li, Shuai; Wang, Zheng; Li, Yangming

doi:10.1007/s11063-012-9255-8

Cited by 62 publications

(30 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By comparing (4,3,3,9,8,9,8,7,6,5), node updates its routing table as = (4, 3, 3, 5, 4, 3, 2, 2, 2, 2) and ℎ = ( , , , , , , , , , ), which in fact converges to minimum delays. When node receives the RMSG from node which contains two route entries (5, 7, 1, 4, 2) and (8, 8, 0, 2, 2), it derives ( ) = (8,7,6,5,4,3,3,3,10,9). Node compares ( ) with = (2, 2, 2, 2, 8, 7, 6, 5, 4, 3) and updates its routing table to = (2, 2, 2, 2, 4, 3, 3, 3, 4, 3) and ℎ = ( , , , , , , , , , ), which also converges to minimum delays.…”

Section: Algorithm Descriptionmentioning

confidence: 99%

“…In Figure 1, assume the sink starts MDR algorithm at slot 1, and sends a RMSG with one route entry (1, 10, 0, 0, 0) to node at slot 1, and to node at slot 7, [5,10], node has to wait to the slot 1 in the next cycle when node works, which incurs a waiting delay of = + 1 − . The packet will be transmitted to node at slot 1 in the next cycle and then forwarded by node at slot 2, and thus, ( ) 5, 0, 8, 7), and then, it sends this RMSG to node at slot 3, to node at slot 4, and to node at slot 5, respectively.…”

Section: Algorithm Descriptionmentioning

confidence: 99%

See 1 more Smart Citation

Routing in Duty-Cycled Surveillance Sensor Networks

Shen

Zhang

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In many surveillance sensor networks, sensors are scheduled to work in a duty-cycled mode (i.e., periodically switching between active states and sleeping states) in order to prolong the network lifetime. The duty-cycled mode saves sensors' energy but brings other issues. In surveillance applications (e.g., forest fire alarm or intruder detection), it is desired to report detected events to the sink node as soon as possible. However, the duty-cycled mode may increase the data delivery latency. In this paper, we study minimum-delay routing in duty-cycled surveillance sensor networks. As the minimum-delay routes are time dependent (i.e., they change with time) in duty-cycled sensor networks, routing becomes a challenging task. We propose a distributed routing algorithm to find the minimum-delay routes at any time from all nodes to the sink node. Further, all minimum-delay routes can be found in one execution of our routing algorithm. We further provide a distributed route maintenance algorithm for finding the minimum-delay routes when the network dynamically changes. We theoretically prove the correctness of the proposed algorithm, and extensive simulation results show that the performance of our algorithm outperforms other existing algorithms. IntroductionWireless sensor networks (WSNs) have been used in many surveillance applications such as traffic monitoring, forest fire detection, and target tracking. Typically, in surveillance system, sensors (or nodes) detect events and then report the events to the base station (or the sink node). To build longterm operating surveillance systems, sensors are expected to work for months or even years, but they only have limited battery energy. For example, the battery of a sensor can only last for a few days if running continuously. One viable technique is to schedule sensors switching between active mode and sleeping mode, while active sensors perform surveillance tasks. Energy-efficient scheduling algorithms [1][2][3][4][5][6][7] are proposed in the literature to prolong network lifetime, as well as to guarantee event detection. In these algorithms, sensors are scheduled to be active for a period of time and then to sleep for another period of time, which forms a duty-cycled WSN.As pointed out by [8], the effectiveness of a surveillance system lies in two aspects: accurately detecting events and timely reporting the events. The second aspect is highly related to routing problem. Routing in WSNs has been extensively studied and many routing algorithms or protocols are proposed. The research on routing evolves from early flooding-based protocols to location-based routing protocols (with the help of localization methods [9,10]) and to stateof-the-art gradient-based routing protocols [11]. Collection tree protocol (CTP) [12] and routing protocol for low-power and lossy networks (RPL) [13] are two well-known gradientbased routing protocols. CTP uses expected transmissions (ETX) as the gradient that indicates the expected number of transmissions needed for the packet to reach t...

show abstract

Section: Algorithm Descriptionmentioning

confidence: 99%

Section: Algorithm Descriptionmentioning

confidence: 99%

Routing in Duty-Cycled Surveillance Sensor Networks

Shen

Zhang

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…(21) else (22) Remove B from B. of our approach. In particular, lower threshold guarantees to catch all wormhole nodes, but causes more false positives, which will increase the workload of refinement process.…”

Section: Outputmentioning

confidence: 99%

MDS-Based Wormhole Detection Using Local Topology in Wireless Sensor Networks

Dong

Liao

2012

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Wormhole attack is a severe threat to wireless sensor networks (WSNs), which has received considerable attentions in the literature. However, most of the previous approaches either require special hardware devices or depend on rigorous assumptions on the network settings, which greatly limit their applicability. In this work, we attempt to relax the limitations in prior work, and propose a novel approach to detect wormhole attacks by only local topology information in WSNs. The basic idea is as follows. Each node locally collects its neighborhood information and reconstructs the neighborhood subgraph by multidimensional scaling (MDS). Potential wormhole nodes are detected by validating the legality of the reconstruction. Then, a refinement process is introduced to filter the suspect nodes and to remove false positives. Our approach solely relies on the local connectivity information and is extremely simple and lightweight, which makes it applicable in practical systems. Extensive simulations are conducted, and the results demonstrate the effectiveness and superior performance of our approach.

show abstract

“…A wireless sensor network (WSN) enables its sensor nodes to localize themselves exploiting the node-to-node ranging, which is essential for its promising applications in different fields B Xinrong Zhang nn33@163.com Weili Xiong greenpre@163.com Baoguo Xu xbg@jiangnan.edu.cn 1 School of Internet of Things Engineering, JiangNan University, Wuxi 214122, China such as target tracking system, environmental monitoring network, vehicular networks and public safety applications [1][2][3]. The popularity and wide use of WSN are increasingly dependent on localization.…”

Section: Introductionmentioning

confidence: 99%

A Computationally Efficient Received Signal Strength Based Localization Algorithm in Closed-Form for Wireless Sensor Network

Zhang

Xiong

Bao-guo

2017

Neural Process Lett

View full text Add to dashboard Cite

Ranging error is known to degrade significantly the target node localization accuracy. This paper investigates the use of computationally efficient positioning solution of least square (LS) in closed-form, to reduce localization accuracy loss caused by ranging error. For range-based node localization, the LS solution based on least square criterion has been confirmed to exhibit capability of optimum estimation but extensively achieve at a very complex calculation. In this paper we consider the problem how to acquire such LS solution provided with estimation performance at low complex calculation. In this paper, we use the Gauss noise model and use the weighted least squares criterion and the effective calculation method to solve the linearized equation derived from the RSS measurement, and put forward a new approach to estimate the performance of the target node location estimation. Based on the Fisher information matrix, the Cramér-Rao lower bound of target position estimation is derived based on received signal strength. We obviously indicate that the proposed algorithm can approximately achieve the LS solution in estimation performance at a markedly low complex calculation. Simulations are performed to show the improvement of the proposed algorithm.

show abstract

Using Laplacian Eigenmap as Heuristic Information to Solve Nonlinear Constraints Defined on a Graph and Its Application in Distributed Range-Free Localization of Wireless Sensor Networks

Cited by 62 publications

References 30 publications

Routing in Duty-Cycled Surveillance Sensor Networks

Routing in Duty-Cycled Surveillance Sensor Networks

MDS-Based Wormhole Detection Using Local Topology in Wireless Sensor Networks

A Computationally Efficient Received Signal Strength Based Localization Algorithm in Closed-Form for Wireless Sensor Network

Contact Info

Product

Resources

About