Performance of multisink geographic routing with different distance metrics

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.

Get full-text (via PubEx)

Congestion Control based on Geographic Routing Algorithm for Wireless Sensor Networks

IECON 2020 The 46th Annual Conference of the IEEE Industrial Electronics Society ◽

10.1109/iecon43393.2020.9254665 ◽

2020 ◽

Author(s):

Lin Tang ◽

Quansheng Guan ◽

Shengming Jiang

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Congestion Control ◽

Routing Algorithm ◽

Geographic Routing ◽

Wireless Sensor

Get full-text (via PubEx)

Clustering electricity market participants via FRM models

Intelligent Decision Technologies ◽

10.3233/idt-200092 ◽

2020 ◽

pp. 1-12

Author(s):

Ayla Gülcü ◽

Sedrettin Çalişkan

Keyword(s):

Electricity Market ◽

Distance Metrics ◽

Agglomerative Clustering ◽

Timely Manner ◽

Short Term ◽

Clustering Techniques ◽

Market Participants ◽

Cosine Distance ◽

Collateral Mechanism

Collateral mechanism in the Electricity Market ensures the payments are executed on a timely manner; thus maintains the continuous cash flow. In order to value collaterals, Takasbank, the authorized central settlement bank, creates segments of the market participants by considering their short-term and long-term debt/credit information arising from all market activities. In this study, the data regarding participants’ daily and monthly debt payment and penalty behaviors is analyzed with the aim of discovering high-risk participants that fail to clear their debts on-time frequently. Different clustering techniques along with different distance metrics are considered to obtain the best clustering. Moreover, data preprocessing techniques along with Recency, Frequency, Monetary Value (RFM) scoring have been used to determine the best representation of the data. The results show that Agglomerative Clustering with cosine distance achieves the best separated clustering when the non-normalized dataset is used; this is also acknowledged by a domain expert.

Get full-text (via PubEx)

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

Wireless Networks ◽

10.1007/s11276-021-02569-3 ◽

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.

Get full-text (via PubEx)