• Title/Summary/Keyword: sink mobility

Search Result 49, Processing Time 0.044 seconds

Efficient Context-Aware Scheme for Sensor Network in Ubiquitous Devices

  • Shim, Jong-Ik;Sho, Su-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.12
    • /
    • pp.1778-1786
    • /
    • 2009
  • Many sensor network applications have been developed for smart home, disaster management, and a wide range of other applications. These applications, however, generally assume a fixed base station as well as fixed sensor nodes. Previous research on sensor networks mainly focused on efficient transmission of data from sensors to fixed sink nodes. Recently there has been active research on mobile sink nodes, sink mobility is one of the most comprehensive trends for information gathering in sensor networks, but the research of an environment where both fixed sink nodes and mobile sinks are present at the same time is rather scarce. This paper proposes a scheme for context-aware by ubiquitous devices with the sink functionality added through fixed sinks under a previously-built, cluster-based multi-hop sensor network environment. To this end, clustering of mobile devices were done based on the fixed sinks of a previously-built sensor network, and by using appropriate fixed sinks, context gathering was made possible. By mathematical comparison with TTDD routing protocol, which was proposed for mobile sinks, it was confirmed that performance increases by average 50% in energy with the number of mobile sinks, and with the number of movements by mobile devices.

  • PDF

Energy-Efficient Division Protocol for Mobile Sink Groups in Wireless Sensor Network (무선 센서 네트워크에서 이동 싱크 그룹의 분리를 지원하기 위한 라우팅 프로토콜)

  • Jang, Jaeyoung;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.1
    • /
    • pp.1-8
    • /
    • 2017
  • Communications for mobile sink groups such as rescue teams or platoons bring about a new challenging issue for handling mobility in wireless sensor networks. To do this, many studies have been proposed to support mobile sink groups. When closely looking at mobile sink groups, they can be divided into (multiple) small groups according to the property of applications. For example, a platoon can be divided into multiple squads to carry out its mission in the battle field. However, the previous studies cannot efficiently support the division of mobile sink groups because they do not address three challenging issues engendered by the mobile sink group division. The first issue is to select a leader sink for a new small mobile sink group. The efficient data delivery from a source to small mobile sink groups is the second issue. Last, the third issue is to share data between leader sinks of small mobile sink groups. Thus, this paper proposes a routing protocol to efficiently support the division of mobile sink groups by solving the three challenging issues. For the first issue, the proposed protocol selects a leader sink of a new small mobile sink group which provide a minimum summation of the distance between the new leader sink and the previous leader sink and the distance from the new leader sink to all of its member sinks. For the efficient data delivery from a source to small mobile sink groups in the second issue, the proposed protocol determines the path to minimize the data dissemination distance from source to small mobile sink group by calculating with the location information of both the source and the leader sinks. With regard to the third issue, the proposed protocol exploits member sinks located among leader sinks to provide efficient data sharing among leaders sinks by considering the location information of member sinks. Simulation results verified that the proposed protocol is superior to the previous protocol in terms of the energy consumption.

Data Dissemination Protocol Supporting the Mobility for Tightly Coupled Sink Groups in Wireless Sensor Networks (무선 센서 망에서의 밀집 싱크 그룹을 위한 이동성 보장 데이터 전달 프로토콜)

  • Choi, Young-Hwan;Yu, Fu-Cai;Park, Soo-Chang;Lee, Eui-Sin;Kim, Sang-Ha
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10d
    • /
    • pp.160-165
    • /
    • 2007
  • 무선 센서 망에서 다중싱크 이동성에 관련된 연구는 단순히 독립된 단일싱크 이동성 확장에 기인한다. 하지만, 다중 싱크의 경우 싱크 상호간의 이동 결집도에 따라 두 가지 그룹으로 분류될 수 있다: 싱크간의 산재된 싱크그룹(loosely coupled sink group)과 밀집된 싱크그룹(tightly coupled sink group)이다. 전자는 기존 다중싱크 연구에서 가정하고 있는 일반적인 모델이다. 반면, 후자의 예로는 전쟁터에서 동일한 작전을 수행하는 작은 분대 단위의 군인들의 이동성 등이 있다. 본 논문은 밀집된 싱크그룹 이동성을 갖는 다중 싱크를 위한 데이터전달 프로토콜을 제안한다.

  • PDF

An Energy-Efficient Routing Protocol based on Static Grid in Wireless Sensor Networks (무선 센서 네트워크에서 정적 그리드 기반의 에너지 효율적 라우팅 프로토콜)

  • Choi, Jae-Min;Mun, Hyung-Jin;Jeong, Yoon-Su;Lee, Sang-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8A
    • /
    • pp.791-800
    • /
    • 2010
  • Recently wireless sensor networks as a field of ubiquitous computing technology was in the limelight. To use and collect the necessary information, Sink node mobility is essential. TTDD(Two-Tier Data Dissemination) proposed most common technique associated with Mobile sink node in wireless sensor networks, but issues exist that the use of many control packet falls into the energy efficiency. The technique for solving problems is Cluster-Based Energy-efficient Routing protocol (CBPER). But CBPER does not transmit the data correctly to sink node or source node. In this paper, we propose An Energy-Efficient Routing Protocol based on Static Grid using mobile sink nodes in order to solve the data transmission failure and reduce the energy consumption in Wireless Sensor Networks. We have evaluated it with the NS-2 simulator. Our results show that the proposed protocol saves the energy consumption up to 34% in comparison with CBPER. We also prove that the proposed protocol can transmit more accurate data to the sink de than CBPER.

Sink-Initiated Geographic Multicasting Protocol for Mobile Sinks in Wireless Sensor Networks (무선 센서 망에서 이동 싱크를 위한 위치기반 멀티캐스팅 프로토콜)

  • Lee, Jeong-Cheol;Park, Ho-Sung;Oh, Seung-Min;Jung, Ju-Hyun;Yim, Yong-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4A
    • /
    • pp.377-385
    • /
    • 2010
  • In this paper, we propose a SInk-initiated geographic Multicast (SIM) protocol to reduce frequent location updates from mobile sinks to a source and to achieve fast multicast tree construction and data delivery. The proposed protocol allows sinks to construct their own data delivery paths to a source node and a multicast tree to be atomically constructed by merging the paths. Then, the source forwards data to the destinations down the multicast tree. This paper also propose a round-based virtual infrastructure with a radial shape for increasing the merging probability of data delivery paths and reducing reconstruction ratio of the multicast tree due to mobility of sinks. Simulation results show that the proposed protocol is superior to previous SOurce-initiated geographic Multicast (SOM) protocols in term of average data delivery delay and average energy consumption.

The DIO Interval Adjustment to Enhance Mobility in RPL (RPL에서 이동성 향상을 위한 DIO 전송 간격 조절)

  • Shin, Yejin;Seol, Soonuk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.12
    • /
    • pp.1679-1686
    • /
    • 2019
  • The main purpose of this research is to propose an approach for solving the packet loss problem by quickly adapting to topology change when nodes move in RPL-based IoT environment. In order to enhance mobility, every node is aware of the mobility of its neighbor nodes and quantifies the mobility level based on the number of control messages and all received packets. According to the mobility level, the DIO timer is changed. The proposed approach allows nodes to change their DIO timers according to their mobility levels to adapt topology changes and update paths to the sink. The performance of the proposed approach is evaluated using a Contiki-based Cooja simulator in various moving speeds. The simulation results show that the proposed approach copes with mobility scenarios better than the standard RPL by ascertaining that the packet delivery ratio is improved by 31.03%.

Data Dissemination Protocol based on Predictable Mobility of Sinks in Wireless Sensor Networks (무선 센서 네트워크에서 예측 가능한 싱크 이동성을 기반으로 한 데이타 전달 프로토콜)

  • Park, Soo-Chang;Lee, Eui-Sin;Jin, Min-Sook;Choi, Young-Hwan;Kim, Sang-Ha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.276-280
    • /
    • 2008
  • Many dissemination protocols on the mobility support in wireless sensor networks have been designed based on the assumption that the movement trace of sinks, such as soldiers and fire fighters, is random. However, the mobility of the sinks in many applications, for example, the movement trace of a soldier on operation in a battle field, can be determined in advance. In this paper, we propose a Predictable Mobility-based Data Dissemination protocol that enables data to directly route from source nodes to moving sinks by taking into consideration predictable movement behavior of the sinks. We also show the superiority of the predictable mobility-based data dissemination protocol through the performance comparison with the random mobility-based data dissemination protocols.

Sink Mobility Strategy for Maximizing Network Lifetime in Wireless Sensor Networks (무선센서네트워크의 수명 최대화를 위한 모바일싱크 배치전략)

  • Kim, Younghun;Lee, Keontaek;Han, Seungjae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.1658-1661
    • /
    • 2010
  • 유비쿼터스 시대가 도래하면서 인프라 중 하나인 센서네트워크에 대한 연구가 활발하게 진행되고 있다. 배터리를 사용하는 센서들의 특성상 네트워크 수명을 최대화하는 것이 주요 이슈 중 하나인데, 모바일 싱크를 이용하여 패킷 전송에 소비되는 에너지 로드 밸런싱을 통해 효율적인 결과를 얻을 수 있었다. 전체 센서들의 잔여 에너지와 그 평균과의 편차를 싱크를 움직이는 기준으로 하는 휴리스틱 알고리즘을 제안하였고 최적에 가까운 결과를 얻었다.

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.