• Title/Summary/Keyword: Multiple sinks

Search Result 26, Processing Time 0.025 seconds

Local Update-based Multicasting Scheme for Mobile Sinks in Wireless Sensor Networks (무선 센서 망에서 이동싱크 지원을 위한 지역 수정 기반 멀티캐스팅 기법)

  • Lee, Jeong-Cheol;Park, Ho-Sung;Oh, Seung-Min;Jung, Ju-Hyun;Park, Soo-Chang;Lee, Eui-Sin;Kim, Sang-Ha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.1
    • /
    • pp.80-84
    • /
    • 2010
  • Data multicasting from a source to multiple sinks in wireless sensor networks is used to achieve both reducing communication costs and energy efficiency. Almost all existing schemes for the multicasting might be effectively performed by optimal construction of a multicasting tree between a source and multiple stationary sinks. However, in practical sensor applications, sinks could move around on the wireless sensor networks for own missions, such as scouting of soldiers and saving lives of victims by firefighters. Unfortunately, the sink mobility causes frequent entire reconstruction of the multicasting tree and thus it leads to exhaustion of battery power of sensors. Hence, we propose an energy-efficient multicast protocol to support multiple mobile sinks by the local multicast tree reconstruction, called Local Update-based geographic Multicasting for Mobile sinks (LUMM) for wireless sensor networks. Our simulation results show that our scheme for mobile sinks is more efficient in terms of energy resource management than other exist works.

Survey on Communication for Mobile Sinks in Wireless Sensor Networks: Mobility Pattern Perspective

  • Sangdae Kim;Beom-Su Kim;Babar Shah;Sana Ullah;Ki-Il Kim
    • Journal of Internet Technology
    • /
    • v.22 no.2
    • /
    • pp.297-309
    • /
    • 2021
  • Mobile sinks are being exploited for various purposes for solving the hotspot problem. Thus, the mobility support technique of mobile sinks is important, and it has been studied steadily. A survey was conducted of studies of mobile sinks in sensor networks having different movement patterns depending on the applications. The related techniques were divided into three main categories according to mobility pattern: predefined, random, and control. In addition, communications for mobile sinks are strongly affected by whether there is a single mobile sink or multiple ones. Based on this two-level categorization, an overview is presented of some state-of-the-art mobility support techniques researched during the past three years, and then the technique are analyzed according to various criteria. Finally, this survey concludes with a summary and a discussion of some future research challenges.

Self-organization Scheme of WSNs with Mobile Sensors and Mobile Multiple Sinks for Big Data Computing

  • Shin, Ahreum;Ryoo, Intae;Kim, Seokhoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.943-961
    • /
    • 2020
  • With the advent of IoT technology and Big Data computing, the importance of WSNs (Wireless Sensor Networks) has been on the rise. For energy-efficient and collection-efficient delivery of any sensed data, lots of novel wireless medium access control (MAC) protocols have been proposed and these MAC schemes are the basis of many IoT systems that leads the upcoming fourth industrial revolution. WSNs play a very important role in collecting Big Data from various IoT sensors. Also, due to the limited amount of battery driving the sensors, energy-saving MAC technologies have been recently studied. In addition, as new IoT technologies for Big Data computing emerge to meet different needs, both sensors and sinks need to be mobile. To guarantee stability of WSNs with dynamic topologies as well as frequent physical changes, the existing MAC schemes must be tuned for better adapting to the new WSN environment which includes energy-efficiency and collection-efficiency of sensors, coverage of WSNs and data collecting methods of sinks. To address these issues, in this paper, a self-organization scheme for mobile sensor networks with mobile multiple sinks has been proposed and verified to adapt both mobile sensors and multiple sinks to 3-dimensional group management MAC protocol. Performance evaluations show that the proposed scheme outperforms the previous schemes in terms of the various usage cases. Therefore, the proposed self-organization scheme might be adaptable for various computing and networking environments with big data.

Energy and Delay-Efficient Multipath Routing Protocol for Supporting Mobile Sink in Wireless Sensor Networks (무선 센서 네트워크에서 이동 싱크를 지원하기 위한 다중 경로 라우팅 프로토콜)

  • Lee, Hyun Kyu;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.12
    • /
    • pp.447-454
    • /
    • 2016
  • The research on multipath routing has been studied to solve the problem of frequent path breakages due to node and link failures and to enhance data delivery reliability in wireless sensor networks. In the multipath routing, mobile sinks such as soldiers in battle fields and rescuers in disaster areas bring about new challenge for handling their mobility. The sink mobility requests new multipath construction from sources to mobile sinks according to their movement path. Since mobile sinks have continuous mobility, the existing multipath can be exploited to efficiently reconstruct to new positions of mobile sinks. However, the previous protocols do not address this issue. Thus, we proposed an efficient multipath reconstruction protocol called LGMR for mobile sinks in wireless sensor networks. The LGMR address three multipath reconstruction methods based on movement types of mobile sinks: a single hop movement-based local multipath reconstruction, a multiple hop movement-based local multipath reconstruction, and a multiple hop movement-based global multipath reconstruction. Simulation results showed that the LGMR has better performance than the previous protocol in terms of energy consumption and data delivery delay.

An Experiment on Heat Dissipation from Aluminum foam Heat Sinks in an Air Multi-Jet Impingement (다중 충돌 공기제트에서 발포 알루미늄 방열기의 방열 특성 실험)

  • Lee, Myeong-Ho;Kim, Seo-Yeong;Lee, Gwan-Su
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.26 no.8
    • /
    • pp.1115-1122
    • /
    • 2002
  • The present experiment investigates the effects of pore density f of aluminum foam heat sinks, the jet-to-jet spacing X and the nozzle plate-to-target surface spacing H of 3$\times$3 square impinging arrays on the averaged Nusselt number. The performance of the aluminum foam heat sinks and the rectangular plate heat sink is evaluated in terms of the enhancement factor. /equation omitted/. The multiple impinging jet with X/d=4.0 displays higher Nusselt numbers than single impinging jet for 12.0$\leq$H/d$\leq$20.0. With the variation of the jet-to-jet spacing, the aluminum foam heat sink of 10 PPI show higher Nusselt numbers than the 20 and 40 PPI aluminum foam heat sinks. Further, the 10 PPI aluminum foam heat sink demonstrates 26% higher enhancement factor than the rectangular plate heat sink in the range of 7000$\leq$Re$\leq$11000.

Data-Dissemination Mechanism used on Multiple Virtual Grids in Wireless Sensor Networks (무선센서 네트워크에서의 다중 가상 그리드를 이용한 데이터 전송 메커니즘)

  • Jin, Min-Sook;Lee, Eui-Sin;Park, Soo-Chang;Kim, Sang-Ha
    • The KIPS Transactions:PartC
    • /
    • v.16C no.4
    • /
    • pp.505-510
    • /
    • 2009
  • Sensor networks are composed of a great number of sensor nodes. Since all sensor nodes are energy-restricted and hard to recharge, it is very important.However, the energy consumption may significantly increase if mobile sources or sinks exist in sensor networks. The reason is that the routing information for mobile sources and sinks needs to be update frequently for efficientdata delivery. The routing algorithm supporting mobile sinks should consider not only continuous data delivery but also the energy consumption of sensor nodes. However, most of the existing research focuses on even energy consumption while the mobility of sinks and sources is rarely consider. In this paper, we propose an efficient routing protocol with multiple virtual grids to reduce energy consumption and improve packets delivery efficiency. Then this paper considers the mobility. Simulation results show that our algorithm can guarantee high data delivery ratio and lower average delivery delay, while consuming lower energy than existing routing protocols in sensor networks.

Designing a Path Management Method in Large-scale Multiple Sensor Networks (대규모 다중 센서 네트워크에서 효과적인 경로 관리 기법)

  • Lim, Yu-Jin;Park, Jae-Sung;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.15C no.3
    • /
    • pp.205-212
    • /
    • 2008
  • In the environment with multiple heterogeneous wireless sensor networks with a single point of sensed data collection or a gateway (GW), relay points (RPs) may be required for the energy efficient delivery of sensed data from static or mobile sinks to the GW. The optimal placement of RPs becomes an even more difficult problem if static sinks are dynamically added or the trajectory of mobile sinks can not be known in advance. In order to resolve this problem, we propose a mechanism to deploy RPs in a grid pattern and to use the tree-based relaying network for reducing the cost of the RP and for reducing the control overhead incurred by the route setup from sinks to the GW. For the performance evaluation of our proposed mechanism, we have carried out a numerical analysis on a single route setup from a sink to the GW and, for more general performance evaluations, ns-2 based simulations have been carried out. According to the performance evaluation results, our tree-based relaying network mechanism outperforms that based on AODV in terms of the data delivery time, the network service time and the control overhead.

Performance Evaluation of Tree Routing in Large-Scale Wireless Sensor Networks (대규모 센서네트워크에서의 트리라우팅 성능평가)

  • Beom-Kyu Suh;Ki-Il Kim
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.18 no.2
    • /
    • pp.67-73
    • /
    • 2023
  • Tree routing is one of appropriate routing schemes in wireless sensor network because the complexity of this approach is relatively low. But, congestion at a specific node may happen because a parent node toward a sink node is usually selected in one hop way, specially where large number of node are deployed. As feasible solution for this problem, multiple paths and sinks schemes can be applied. However, the performance of these schemes are not proved and analyzed yet. In this paper, we conduct diverse simulaton scenarios performance evaluation for these cases to identify the improvement and analyze the impact of schemes. The performance is measured in the aspects of packet transmission rate, throughput, and end-to-end delay as a function of amount of network traffic.

Augmenting Quasi-Tree Search Algorithm for Maximum Homogenous Information Flow with Single Source/Multiple Sinks

  • Fujita, Koichi;Watanabe, Hitoshi
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.462-465
    • /
    • 2002
  • This paper presents a basic theory of information flow from single sending point to multiple receiving points, where new theories of algebraic system called "Hybrid Vector Space" and flow vector space play important roles. Based on the theory, a new algorithm for finding maximum homogenous information flow is proposed, where homogenous information flow means the flow of the same contents of information delivered to multiple clients at a time. Effective multi-routing algorithms fur tree-shape delivery rout search are presented.

  • PDF

Optimal fin planting of splayed multiple cross-sectional pin fin heat sinks using a strength pareto evolutionary algorithm 2

  • Ramphueiphad, Sanchai;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • v.6 no.1
    • /
    • pp.31-42
    • /
    • 2021
  • This research aims to demonstrate the optimal geometrical design of splayed multiple cross-sectional pin fin heat sinks (SMCSPFHS), which are a type of side-inlet-side-outlet heat sink (SISOHS). The optimiser strength Pareto evolutionary algorithm2 (SPEA2)is employed to explore a set of Pareto optimalsolutions. Objective functions are the fan pumping power and junction temperature. Function evaluations can be accomplished using computational fluid dynamics(CFD) analysis. Design variablesinclude pin cross-sectional areas, the number of fins, fin pitch, thickness of heatsink base, inlet air speed, fin heights, and fin orientations with respect to the base. Design constraints are defined in such a way as to make a heat sink usable and easy to manufacture. The optimum results obtained from SPEA2 are compared with the straight pin fin design results obtained from hybrid population-based incremental learning and differential evolution (PBIL-DE), SPEA2, and an unrestricted population size evolutionary multiobjective optimisation algorithm (UPSEMOA). The results indicate that the splayed pin-fin design using SPEA2 issuperiorto those reported in the literature.