HCRL: A Hop-Count-Ratio based Localization in Wireless Sensor Networks

Yang, Sung Mo; Yi, Jiyoung; Cha, Hojung

doi:10.1109/sahcn.2007.4292815

Cited by 47 publications

(18 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yang et al [8] focus on developing a localization algorithm which provides both low-cost and accuracy. They have made a key assumption that the ratio of the Euclidean distance between a node and two anchor nodes is well approximated by the ratio of the corresponding hop distances.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Hop Count Routing Protocol for Wireless Ad Hoc Networks

Qian

Guo

et al. 2014

Int. J. Autom. Comput.

View full text Add to dashboard Cite

An efficient hop count route finding approach for mobile ad hoc network is presented in this paper. It is an adaptive routing protocol that has a tradeoff between transmission power and hop count for wireless ad hoc networks. During the route finding process, the node can dynamically assign transmission power to nodes along the route. The node who has received route request message compares its power with the threshold power value, and then selects a reasonable route according to discriminating algorithms. This algorithm is an effective solution scheme to wireless ad hoc networks through reasonably selected path to reduce network consumption. Simulation results indicate that the proposed protocol can deliver better performances with respect to energy consumption and end-to-end delay.

show abstract

Section: Related Workmentioning

confidence: 99%

An Efficient Hop Count Routing Protocol for Wireless Ad Hoc Networks

Qian

Guo

et al. 2014

Int. J. Autom. Comput.

View full text Add to dashboard Cite

show abstract

“…Several previous works have proposed ratio-based localization algorithms. Yang et al [30] proposed a ratio-based localization algorithm within wireless sensor networks for better energy efficiency, where distance information is straightforwardly approximated by hop-count from the sensor node to the landmark nodes. Li et al [17] proposed to localize by solving the non-linear least square problem formed by the ratio relationship.…”

Section: Related Workmentioning

confidence: 99%

Achieving robust wireless localization resilient to signal strength attacks

Chen

Yang

et al. 2011

Wireless Netw

View full text Add to dashboard Cite

Received signal strength (RSS) based algorithms have been very attractive for localization since they allow the reuse of existing communication infrastructure and are applicable to many commodity radio technologies. Such algorithms, however, are sensitive to a set of noncryptographic attacks, where the physical measurement process itself can be corrupted by adversaries. For example, the attacker can perform signal strength attacks by placing an absorbing or reflecting material around a wireless device to modify its RSS readings. In this work, we first formulate the all-around signal strength attacks, where similar attacks are launched towards all landmarks, and experimentally show the feasibility of launching such attacks. We then propose a general principle for designing RSS-based algorithms so that they are robust to all-around signal strength attacks. To evaluate our approach, we adapt a set of representative RSS-based localization algorithms according to our principle. We experiment with both simulated attacks and two sets of real attack scenarios. All the experiments show that our design principle can be applied to a wide spectrum of algorithms to achieve comparable performance with much better robustness.

show abstract

“…Second step: through the first step, unknown nodes store only one FM which contains the smallest HC for each anchor node and then use Apollonius Circle and hop-count ratio information to do position estimation [7].…”

Section: A Dv-based Localization Algorithmsmentioning

confidence: 99%

The Insights of DV-Based Localization Algorithms in the Wireless Sensor Networks with Duty-Cycled and Radio Irregular Sensors

Chen

Shu

et al. 2011

2011 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-Location information of nodes is the basis for many applications in wireless sensor networks (WSNs). However, most previous localization methods make the unrealistic assumptions: (i) all nodes in WSN are always awake and (ii) the radio range of nodes is an ideal circle. This overlooks the common scenario that sensor nodes are duty-cycled in order to save energy and the radio range of nodes is irregular. In this paper we revisit the Distance-Vector-based (DV-based) positioning algorithms, particularly, Hop-Count-Ratio based Localization (HCRL) algorithm and investigate the following problems: (i) how is the relationship between the number of sleeping neighbor sensor nodes and the localization accuracy and (ii) how is the relationship between the degree of irregularity (DOI, which is a parameter of radio range irregularity) and the localization accuracy. We conduct a large number of experiments in WSNs' simulator NetTopo, and find that the parameters: the number of waking nodes, DOI, anchor node density and localization error, are interactional, i.e., for a given deployed static WSN, there is an optimal number of waking nodes and an optimal anchor node density, which can minimize network energy consumption without losing much of the localization accuracy. Furthermore, waking up more sensor nodes cannot always help to increase the localization accuracy, which actually is different from our intuitive thinking: more waking nodes can help to increase the localization accuracy of DV-based localization algorithms at all time.

show abstract

HCRL: A Hop-Count-Ratio based Localization in Wireless Sensor Networks

Cited by 47 publications

References 10 publications

An Efficient Hop Count Routing Protocol for Wireless Ad Hoc Networks

An Efficient Hop Count Routing Protocol for Wireless Ad Hoc Networks

Achieving robust wireless localization resilient to signal strength attacks

The Insights of DV-Based Localization Algorithms in the Wireless Sensor Networks with Duty-Cycled and Radio Irregular Sensors

Contact Info

Product

Resources

About