• Title/Summary/Keyword: Rendezvous node

Search Result 17, Processing Time 0.022 seconds

A Rendezvous Node Selection and Routing Algorithm for Mobile Wireless Sensor Network

  • Hu, Yifan;Zheng, Yi;Wu, Xiaoming;Liu, Hailin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4738-4753
    • /
    • 2018
  • Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

A Multi-Node Channel Rendezvous Algorithm in Cognitive Radio Ad-hoc Networks (인지 무선 애드혹 네트워크에서의 멀티노드 채널 랑데부 알고리즘)

  • Seong, Jin-uk;Lee, Bong-Hwan;Yang, Dongmin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.4
    • /
    • pp.453-461
    • /
    • 2019
  • In this paper, we focus on the study of multi-node rendezvous on one common channel among multiple channels before transmitting in CRAHNs (Cognitive Radio Ad-hoc Networks) for the efficient use of inefficient frequency resources. Most existing researches have dealt with the channel rendezvous between two nodes. But, it can be time-consuming to apply them to three or more nodes. In addition, it cab be impossible to communicate with each other. Therefore, in this paper, we propose a Multi-Node Sequence (MNSEQ), which allows three or more nodes to rendezvous on a single common channel in a short period of time. And, CSMA/CA was applied for data exchange after rendezvous. By performance evaluation through very extensive simulations, we have demonstrated that the proposed MNSEQ outperforms the existing scheme in terms of communication completion time and transmission efficiency.

A Rendezvous Point Replacement Scheme for Efficient Drone-based Data Collection in Construction Sites (공사현장에서 효율적인 드론 기반 데이터 수집을 위한 랑데부 포인트 교체 기법)

  • Kim, Taesik;Jung, Jinman;Min, Hong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.1
    • /
    • pp.153-158
    • /
    • 2017
  • Rendezvous point is used to gather the data from sensor nodes and send to sink node efficiently in selected area. It incurs a unbalanced energy consumption nearby the rendezvous point which can shorten the network life time shortly. Thus, it is very important to select the rendezvous point effectively among all sensors in order to not drain the battery of a sensor node in construction sites. In this paper, we propose a rendezvous point replacement mechanism which considers remaining energy of nodes to prolong the network lifetime. Also, for shortening the distance of drone at the same time, it increases the probability of the near-by drone node becoming rendezvous point. The simulation results show that the proposed scheme can significantly improve the network lifetime and the flight distance compared with the existing LEACH, L-LEACH algorithm.

Rendezvous in Cognitive Radio Networks without Common Control Channel

  • Htike, Zaw;Hong, Choong-Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06d
    • /
    • pp.230-231
    • /
    • 2011
  • In this paper, we propose a rendezvous mechanism for cognitive radio networks. In this mechanism, no prior knowledge of wireless nodes is required and it is totally distributed. Node can simply choose one of two strategies to rendezvous with its neighbors. The main benefit of this mechanism is eliminating the use of common control channel and centralized controller.

A Rendezvous Node Selection Scheme Considering a Drone's Trajectory for Reliable Data Collection (안정적인 데이터 수집을 위해 드론의 비행경로를 고려한 랑데부 노드 선정 기법)

  • Min, Hong;Jung, Jinman;Kim, Bongjae;Heo, Junyoung
    • KIISE Transactions on Computing Practices
    • /
    • v.24 no.2
    • /
    • pp.77-81
    • /
    • 2018
  • Many studies that improve the efficiency of data collection and a network's lifetime by using a mobile sink have been conducted using wireless sensor networks. If a drone is used as a mobile sink, the drone can collect data more efficiently than can existing mobile sinks operating on the ground because the drone can minimize the effects of obstacles and the terrain. In this paper, we propose a rendezvous node selection scheme which considers estimated drone's trajectory and data collection latency of sensor networks for reliable data collection, when a drone whose trajectory is not predetermined works with terrestrial wireless sensor networks. A selected rendezvous node on the ground collects data from the entire network and it sends then collected data to the drone via direct communication. We also verify that the proposed scheme is more reliable than previous schemes without considering the drone's trajectory and data collection latency.

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

  • Zhang, Jian;Tang, Jian;Wang, Zhonghui;Wang, Feng;Yu, Gang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1204-1227
    • /
    • 2020
  • 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.

Channel Searching Sequence for Rendezvous in CR Using Sidel'nikov Sequence (시델니코프 수열을 활용한 인지통신의 Rendezvous를 위한 채널 탐색 수열)

  • Jang, Jiwoong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.11
    • /
    • pp.1566-1573
    • /
    • 2021
  • Rendezvous is a process that assists nodes in a Cognitive Radio Networks (CRNs) to discover each other. In CRNs where a common control channel is unknown and a number of channels are given, it is important how two nodes find each other in a known search region. In this paper, I have proposed and analyzed a channel hopping sequence using Sidel'nikov sequence by which each node visits an available number of channels. I analyze the expected time to-rendezvous (TTR) mathematically. I also verify the Rendezvous performance of proposed sequence in the view of TTR under 2 user environment compared with JS algorithm and GOS algorithm. The Rendezvous performance of proposed sequence is much better than GOS algorithm and similar with JS algorithm. But when M is much smaller than p, the performance of proposed sequence is better than JS algorithm.

Rendezvous Node Selection in Interworking of a Drone and Wireless Sensor Networks (드론과 무선 센서 네트워크 연동에서 랑데부 노드 선정)

  • Min, Hong;Jung, Jinman;Heo, Junyoung;Kim, Bongjae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.1
    • /
    • pp.167-172
    • /
    • 2017
  • Mobile nodes are used for prolonging the life-time of the entire wireless sensor networks and many studies that use drones to collected data have been actively conducted with the development of drone related technology. In case of associating a drone and tactical wireless sensor networks, real-time feature and efficiency are improved. The previous studies so focus on reducing drone's flight distance that the energy consumption of sensor nodes is unbalanced. This unbalanced energy consumption accelerates the network partition and increases drone's flight distance. In this paper, we proposed a new selection scheme considered drone's flight distance and nodes' life-time to solve this problem when rendezvous nodes that collect data from their cluster and directly communicate with a drone are selected.

Efficient Channel Management to Maximize Spectrum Holes in Cognitive Radio Networks (CR 네트워크에서의 유휴자원 증대를 위한 효율적인 채널 관리 방법)

  • Jeong, Pil-Jung;Shin, Yo-An;Lee, Won-Cheol;Yoo, Myung-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10B
    • /
    • pp.621-629
    • /
    • 2007
  • In cognitive radio (CR) network, the channels are generally classified into either the unavailable channels that are occupied by incumbent users or the available channels that are not occupied. The conventional channel classification scheme may result in poor utilization of spectrum holes since it does not take the spatial relationship between CR node and incumbent users into consideration. In this paper, we propose an efficient channel management scheme for the centralized CR network to maximize the spectrum holes by overcoming the shortcomings of conventional scheme. In addition, we mathematically analyze the effectiveness of proposed scheme. Based on the proposed channel management scheme, we also propose the rendezvous algorithm, which can establish the control channels between base station and CR node under the dynamically changing spectrum environment.

TDMA based Multi-channel MAC Protocol for Improving Channel Efficiency in Wireless Ad Hoc Networks (무선 애드혹 네트워크에서 채널 효율성 향상을 위한 TDMA 기반의 멀티채널 MAC 프로토콜)

  • Kim, Jun-Ho;Choi, Jae-Kark;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.2A
    • /
    • pp.153-164
    • /
    • 2010
  • In this paper, we propose a multi-channel MAC protocol to improve the channel efficiency and network performance in wireless ad hoc networks. There are two main problems encountered in designing multi-channel MAC protocols. The first problem is the rendezvous problem and the second is multi-channel hidden node problem. In order to solve these problems, most of previous researches that have considered multi-channel MAC protocols use a common control channel to exchange control packets. However, they have a bottleneck problem at common control channel as increasing the number of data channels. The proposed MAC protocol solves the multi-channel hidden node problem using a TDMA scheme and increases the network throughput because transmitting and receiving data at the same time is possible. Also, since there is no common control channel, the network does not suffer from the common control channel saturation problem. Moreover, it achieves energy savings by allowing nodes that are not involved in communication to go into sleep mode. Simulation results show that the proposed MAC protocol improves the network throughput and channel efficiency and provides energy savings.