Logical coordinate assignment for geographic routing in wireless sensor networks

2008 ◽  
Vol 3 (3) ◽  
pp. 274-288 ◽  
Author(s):  
Jang‐Ping Sheu ◽  
Yu‐Chia Chang ◽  
Gang‐Hua Song
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Geographic Routing ◽  
Wireless Sensor ◽  
Coordinate Assignment

scholarly journals Fuzzy Logic-Based Geographic Routing Protocol for Dynamic Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (1) ◽  
pp. 196 ◽  
Author(s):  
Xing Hu ◽  
Linhua Ma ◽  
Yongqiang Ding ◽  
Jin Xu ◽  
Yan Li ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Fuzzy Logic ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Geographic Routing ◽  
Wireless Sensor ◽  
Location Information ◽  
Destination Node ◽  
Routing Overhead ◽  
Geographic Routing Protocol

The geographic routing protocol only requires the location information of local nodes for routing decisions, and is considered very efficient in multi-hop wireless sensor networks. However, in dynamic wireless sensor networks, it increases the routing overhead while obtaining the location information of destination nodes by using a location server algorithm. In addition, the routing void problem and location inaccuracy problem also occur in geographic routing. To solve these problems, a novel fuzzy logic-based geographic routing protocol (FLGR) is proposed. The selection criteria and parameters for the assessment of the next forwarding node are also proposed. In FLGR protocol, the next forward node can be selected based on the fuzzy location region of the destination node. Finally, the feasibility of the FLGR forwarding mode is verified and the performance of FLGR protocol is analyzed via simulation. Simulation results show that the proposed FLGR forwarding mode can effectively avoid the routing void problem. Compared with existing protocols, the FLGR protocol has lower routing overhead, and a higher packet delivery rate in a sparse network.

scholarly journals Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks

2021 ◽  
Author(s):  
Khanh-Van Nguyen ◽  
Chi-Hieu Nguyen ◽  
Phi Le Nguyen ◽  
Tien Van Do ◽  
Imrich Chlamtac
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Geographic Routing ◽  
Routing Algorithms ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Effective Manner

AbstractA quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+$$\epsilon$$ ϵ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.

EMGR: Energy-efficient multicast geographic routing in wireless sensor networks

2017 ◽  
Vol 129 ◽  
pp. 51-63 ◽  
Author(s):  
Haojun Huang ◽  
Junbao Zhang ◽  
Xu Zhang ◽  
Benshun Yi ◽  
Qilin Fan ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Geographic Routing ◽  
Wireless Sensor

Sensor Data Geographic Forwarding in Two-Dimensional and Three-Dimensional Spaces

2017 ◽  
pp. 317-352
Author(s):  
Habib M. Ammari ◽  
Amer Ahmed
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Geographic Routing ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Two Dimensional ◽  
Geographic Forwarding ◽  
Limited Power

A wireless sensor network is a collection of sensor nodes that have the ability to sense phenomena in a given environment and collect data, perform computation on the gathered data, and transmit (or forward) it to their destination. Unfortunately, these sensor nodes have limited power, computational, and storage capabilities. These factors have an influence on the design of wireless sensor networks and make it more challenging. In order to overcome these limitations, various power management techniques and energy-efficient protocols have been designed. Among such techniques and protocols, geographic routing is one of the most efficient ways to solve some of the design issues. Geographic routing in wireless sensor networks uses location information of the sensor nodes to define a path from source to destination without having to build a network topology. In this paper, we present a survey of the existing geographic routing techniques both in two-dimensional (2D) and three-dimensional (3D) spaces. Furthermore, we will study the advantages of each routing technique and provide a discussion based on their practical possibility of deployment.

Improving DV-Hop-Based Localization Algorithms in Wireless Sensor Networks by Considering Only Closest Anchors

2020 ◽  
Vol 14 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Amanpreet Kaur ◽  
Padam Kumar ◽  
Govind P. Gupta
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Geographic Routing ◽  
Location Based Services ◽  
Wireless Sensor ◽  
Localization Error ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Significant Attention

Localization problem has gained a significant attention in the field of wireless sensor networks in order to support location-based services or information such as supporting geographic routing protocols, tracking events, targets, and providing security protection techniques. A number of variants of DV-Hop-based localization algorithms have been proposed and their performance is measured in terms of localization error. In all these algorithms, while determining the location of a non-anchor node, all the anchor nodes are taken into consideration. However, if only the anchors close to the node are considered, it will be possible to reduce the localization error significantly. This paper explores the effect of the close anchors in the performance of the DV-Hop-based localization algorithms and an improvement is proposed by considering only the closest anchors. The simulation results show that considering closest anchors for estimation of the location reduces localization error significantly as compared to considering all the anchors.

Sign in / Sign up

Export Citation Format

Share Document