Cooperative Relay Selection for Load Balancing With Mobility in Hierarchical WSNs: A Multi-Armed Bandit Approach

Zhang, Jian; Tang, Jian; Wang, Rui

doi:10.1109/access.2020.2968562

Cited by 36 publications

(18 citation statements)

References 31 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although this constraint is written in a general form, however we have considered only one base station in our model. -The total number of two hop connections of sources to base station through relays (the first summation in inequality (13)) and total number of direct connections of sources to the base station (the second summation in inequality (13)) is less than or equal to the total number of available channels for connection to the base station (Q B S).…”

Section: A Problem Formulationmentioning

confidence: 99%

“…Matching theory can provide an appropriate framework for analysis and designing the decentralized methods for interactions between the rational and selfish players [11]. There are some studies that have applied matching theory to model the relay selection problem [12], [13]. Some works have modeled the relay selection problem as a maximum weighted matching problem in bipartite weighted graphs and the Hungarian algorithm has been applied in the relay selection process, as a solution [12], [14]- [20].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Novel Relay Selection Algorithms for Machine-to-Machine Communications With Static RF Interfaces Setting

et al. 2020

View full text Add to dashboard Cite

Machine-to-Machine (M2M) communications play a significant role in the Internet of Things (IoT). Cooperation of machines in M2M communications can improve network performance when the quality of connections between sources and their destinations is poor. Careful selection of machines as relays can play an effective role in improving the quality of communication in dense networks. Furthermore, the possibility of simultaneous use of different Radio Frequency (RF) interfaces can increase the capacity of data transmission over the network. In this paper, two novel M2M relay selection algorithms are proposed namely Optimal Relay Selection Algorithm (ORSA) and Matching based Relay Selection Algorithm (MRSA). ORSA is a centralized algorithm that transforms the relay selection problem to a kcardinality assignment problem that can be solved using the Hungarian algorithm. MRSA is a decentralized algorithm that leverages concepts from matching theory to provide a stable relay assignment. In both proposed algorithms, static RF interfaces setting is applied to enable the simultaneous use of different interfaces. It is shown that ORSA results are optimal and MRSA results are stable. The simulations compare the capacity of data transmission of proposed and baseline algorithms. The results show that when the number of channels is not restricted, MRSA is only about 3% lower than ORSA and its results are higher than direct transmission and random relay selection, about 56% and 117%, respectively.

show abstract

Section: A Problem Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Novel Relay Selection Algorithms for Machine-to-Machine Communications With Static RF Interfaces Setting

et al. 2020

View full text Add to dashboard Cite

show abstract

“…In recent years, wireless sensor networks (WSNs) have gained increasing popularity in ubiquitous support of sensing system services [1] and the Internet of Things (IoT). WSNs attract worldwide attention in wide range of application domains including intelligent industrial monitoring, medical treatment, environmental monitoring, natural disaster prevention, smart home development, water quality controlling, and intelligent transportation systems [2]- [5].…”

Section: Introductionmentioning

confidence: 99%

“…Exhaustive energy consumption of sensor nodes and unbalanced energy distribution can seriously affect the operation of WSNs, resulting in limitations such as limited network lifetime [1]- [5], [39]- [41] and short-term SLP protection [30]. Therefore, to outperform the DissR and DistrR protocols, ReRR regulates the energy consumption of the sensor nodes by reducing the amount of packet traffic in the network.…”

Section: Introductionmentioning

confidence: 99%

Novel Approaches to Realize the Reliability of Location Privacy Protocols in Monitoring Wireless Networks

Mutalemwa

Shin

2021

IEEE Access

View full text Add to dashboard Cite

Wireless sensor network (WSN) technology presents significant advantages in the Internet of Things (IoT). WSNs are designed to operate in unattended, harsh, and complex environments. However, WSNs are resource-constrained. Due to the operating environment settings, there exist great challenges in the privacy and reliability of WSN communications. To achieve secure and reliable WSN communications, it is necessary to design reliable routing protocols and provide a method to evaluate the performance of the protocols. To guarantee location privacy of source nodes, numerous source location privacy (SLP) routing protocols have been presented in the literature. However, the SLP reliability of the protocols has not been evaluated. In this article, we achieve three main objectives. First, a new relay ring routing (ReRR) protocol is proposed to address some limitations of two fake packet-based SLP routing protocols. The routing algorithm of ReRR is specifically designed to provide long-term SLP protection. Second, unlike previous articles that focus solely on measuring the magnitude of the SLP protection using performance metrics such as safety period, capture ratio, attack success rate, and capture probability, this article proposes a novel approach to measure the SLP reliability of the protocols. In the third objective, we conduct a series of experiments to analyze the performance of ReRR and the fake packet-based protocols. Using the proposed approach, the SLP reliability of the protocols is evaluated. Experiment results reveal that the proposed ReRR protocol exhibits conducive performance features. It is observed that the fake packet-based routing protocols achieve strong SLP protection by integrating multiple routing techniques such as packet flooding and random distribution of fake packet traffic. However, the achieved SLP protection is short-term and less reliable. On the other hand, the proposed ReRR protocol employs an energy-efficient routing algorithm to guarantee reliability and long-term SLP protection. In addition, it is shown that the ReRR protocol guarantees improved network lifetime.

show abstract

“…Wireless sensor networks (WSNs) have drawn significant attentions for past decade due to their pervasive applications and low deployment cost [1], which have provided practical solutions for a wide range of applications as an accessible information collection system [2,3], such as military surveillance, habitat monitoring, etc. However, designing data collection approach is a challenge, because sensor nodes are often powered by batteries with limited energy resources and if without careful design, wireless communication in data collection can energy-efficient issues and others [4][5][6]. For example, sensor nodes in multi-hop WSNs with MEs are utilized to continuously update the current location of Sink to maintain an accurate trajectory and balance energy consumption, which leads to more information exchange as well as more energy consumption [7].…”

Section: Introductionmentioning

confidence: 99%

Load-Balancing Rendezvous Approach for Mobility-Enabled Adaptive Energy-Efficient Data Collection in WSNs

2020

KSII TIIS

View full text Add to dashboard Cite

The tradeoff between energy conservation and traffic balancing is a dilemma problem in Wireless Sensor Networks (WSNs). By analyzing the intrinsic relationship between cluster properties and long distance transmission energy consumption, we characterize three node sets of the cluster as a theoretical foundation to enhance high performance of WSNs, and propose optimal solutions by introducing rendezvous and Mobile Elements (MEs) to optimize energy consumption for prolonging the lifetime of WSNs. First, we exploit an approximate method based on the transmission distance from the different node to an ME to select suboptimal Rendezvous Point (RP) on the trajectory for ME to collect data. Then, we define data transmission routing sequence and model rendezvous planning for the cluster. In order to achieve optimization of energy consumption, we specifically apply the economic theory called Diminishing Marginal Utility Rule (DMUR) and create the utility function with regard to energy to develop an adaptive energy consumption optimization framework to achieve energy efficiency for data collection. At last, Rendezvous Transmission Algorithm (RTA) is proposed to better tradeoff between energy conservation and traffic balancing. Furthermore, via collaborations among multiple MEs, we design Two-Orbit Back-Propagation Algorithm (TOBPA) which concurrently handles load imbalance phenomenon to improve the efficiency of data collection. The simulation results show that our solutions can improve energy efficiency of the whole network and reduce the energy consumption of sensor nodes, which in turn prolong the lifetime of WSNs.

show abstract

Cooperative Relay Selection for Load Balancing With Mobility in Hierarchical WSNs: A Multi-Armed Bandit Approach

Cited by 36 publications

References 31 publications

Novel Relay Selection Algorithms for Machine-to-Machine Communications With Static RF Interfaces Setting

Novel Relay Selection Algorithms for Machine-to-Machine Communications With Static RF Interfaces Setting

Novel Approaches to Realize the Reliability of Location Privacy Protocols in Monitoring Wireless Networks

Load-Balancing Rendezvous Approach for Mobility-Enabled Adaptive Energy-Efficient Data Collection in WSNs

Contact Info

Product

Resources

About