• 제목/요약/키워드: Mobile sensor network

검색결과 681건 처리시간 0.025초

이동 로봇을 이용한 센서 네트워크의 충전 (Sensor Network Charging Using a Mobile Robot)

  • 김재현;문찬우
    • 문화기술의 융합
    • /
    • 제6권4호
    • /
    • pp.747-752
    • /
    • 2020
  • 지역 모니터링에 사용되는 센서 네트워크는 광범위한 지역에 설치되므로, 시스템의 유지 관리가 문제가 되어 왔다. 이 연구에서는 로봇을 이용하여 센서 네트워크에 에너지를 공급하는 시스템을 제시하고, 센서 네트워크의 에너지 소모율, 로봇의 에너지 전달률, 로봇의 이동 거리 등을 변수로 하여 센서 네트워크의 유지 조건을 규명하였다. 수식을 이용한 수치 검증과 로봇 충전 시뮬레이션 검증을 통해, 도출된 시스템 유지 조건이 타당함을 보이고, 실제 충전 실험을 통해 로봇을 이용한 센서 네트워크 유지 관리 방법의 실현 가능성을 검증하였다.

센서 네트워크를 활용한 모바일 로봇의 Path Planning (Path Planning of a Mobile Robot Using RF Strength in Sensor Networks)

  • 위성길;김윤구;이기동;최정원;박주현;이석규
    • 한국정밀공학회지
    • /
    • 제26권2호
    • /
    • pp.63-70
    • /
    • 2009
  • This paper proposes a novel path finding approach of a mobile robot using RF strength in sensor network. In the experiments based on the proposed method, a mobile robot attempts to find its location, heading direction and the shortest path in the indoor environment. The experimental system consisting of mesh network shares node data and send them to base station. The triangulation and the proposed Grid method calculate the location and heading angle of the robot. In addition, the robot finds the shortest path by using the base station attached on it to receive data of environment around each node. Kalman filter reduces the straight line error when the robot estimates the strength of received signal. The experimental results show the effectiveness of the proposed algorithm.

센서 네트워크에서 다수의 이동 싱크로의 에너지 효율적인 데이터 전파에 관한 연구 (Proactive Data Dissemination Protocol on Distributed Dynamic Sink Mobility Management in Sensor Networks)

  • 황광일;엄두섭;허경
    • 한국통신학회논문지
    • /
    • 제31권9B호
    • /
    • pp.792-802
    • /
    • 2006
  • In this paper, we propose an energy-efficient proactive data dissemination protocol with relatively low delay to cope well with highly mobile sink environments in sensor networks. In order for a dissemination tree to continuously pursue a dynamic sink, we exploit two novel algorithms: forward sink advertisement and distributed fast recovery. In our protocol, the tree is shared with the other slave sinks so that we call it Dynamic Shared Tree (DST) protocol. DST can conserve considerable amount of energy despite maintaining robust connection from all sources to sinks, since tree maintenance of DST is accomplished by just distributed local exchanges. In addition, since the DST is a kindof sink-oriented tree, each source on the DST disseminates data with lower delay along the tree and it also facilitates in-network processing. Through simulations, it is shown that the presented DST is considerably energy-efficient, robust protocol with low delay compared to Directed Diffusion, TTDD, and SEAD, in highly mobile sink environment.

An Energy Efficient Distributed Approach-Based Agent Migration Scheme for Data Aggregation in Wireless Sensor Networks

  • Gupta, Govind P.;Misra, Manoj;Garg, Kumkum
    • Journal of Information Processing Systems
    • /
    • 제11권1호
    • /
    • pp.148-164
    • /
    • 2015
  • The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents are used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.

An Energy-Efficient Mobility-Supporting MAC Protocol in Wireless Sensor Networks

  • Peng, Fei;Cui, Meng
    • Journal of Communications and Networks
    • /
    • 제17권2호
    • /
    • pp.203-209
    • /
    • 2015
  • Although mobile applications are an essential characteristic of wireless sensor networks, most existing media access control (MAC) protocols focus primarily on static networks. In these protocols, fixed periodic neighbor discovery and schedule updating are used to connect and synchronize neighbors to provide successful data transmission; however, they cannot adapt to mobile speed variation and degrade the network performance dramatically. In this paper, we propose a mobile-supporting mechanism for MAC protocols, in which the decision to update the neighbors of a mobile node is made adaptively according to the mobile speed. Analysis and simulation results demonstrate that the mechanism efficiently avoids the disconnection of amobile node from its neighbors and achieves a better performance as compared with fixed periodic neighbor discovery.

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)
    • /
    • 제14권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.

모바일 센서 네트워크에서 최단거리 멀티홉 전송을 위한 강한연결 클러스터 기법 (Strong Connection Clustering Scheme for Shortest Distance Multi-hop Transmission in Mobile Sensor Networks)

  • 우매리
    • 한국멀티미디어학회논문지
    • /
    • 제21권6호
    • /
    • pp.667-677
    • /
    • 2018
  • Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

실시간 소셜 네트워크 서비스를 위한 사용 가능한-통합적-유비쿼터스 (U3) 웹 서비스에서의 모바일 상호작용 (Mobile Interaction in a Usable-Unified-Ubiquitous (U3) Web Service for Real-time Social Networking Service)

  • 김영복;김철수
    • 정보처리학회논문지B
    • /
    • 제15B권3호
    • /
    • pp.219-228
    • /
    • 2008
  • 실시간 소셜(Social) 네트워킹 서비스를 위해서, 사용 가능한-통합적-유비쿼터스 (U3) 웹 서비스에서의 모바일 상호작용을 연구하였다. 실시간 소셜 네트워크를 위한 편리한 모바일 HCI로서, 또한 유비쿼터스 웹 서비스에서의 메타데이터 정보 색인 키로서, 다국어 한 글자 도메인 명(예, 김.net, 이.net, 가.net, ㄱ.net, ㄴ.net, ㅎ.net, ㅏ.net, ㅔ.net, ㄱ.com, ㅎ.com) 은 소셜 정보를 검색하고 또한 등록할 때 편리한 모바일 인터페이스이다. U3 웹 서비스의 예로서, 실시간 소셜 네트워킹 서비스 구현과 함께 모바일 상호작용을 위해 스케치된 디자인 목표와 한국, 일본, 중국에서의 모바일 상호작용 경험을 소개한다. 또한, 소셜 네트워킹과 센서 네트워킹 서비스에서 통합 정보관리를 위해, IP 기반의 센서네트워크 (IP-USN)에서 메타데이터 디렉터리 서비스에의 응용 확장 가능성도 소개한다.

Optimal Price Strategy Selection for MVNOs in Spectrum Sharing: An Evolutionary Game Approach

  • Zhao, Shasha;Zhu, Qi;Zhu, Hongbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권12호
    • /
    • pp.3133-3151
    • /
    • 2012
  • The optimal price strategy selection of two bounded rational cognitive mobile virtual network operators (MVNOs) in a duopoly spectrum sharing market is investigated. The bounded rational operators dynamically compete to sell the leased spectrum to secondary users in order to maximize their profits. Meanwhile, the secondary users' heterogeneous preferences to rate and price are taken into consideration. The evolutionary game theory (EGT) is employed to model the dynamic price strategy selection of the MVNOs taking into account the response of the secondary users. The behavior dynamics and the evolutionary stable strategy (ESS) of the operators are derived via replicated dynamics. Furthermore, a reward and punishment mechanism is developed to optimize the performance of the operators. Numerical results show that the proposed evolutionary algorithm is convergent to the ESS, and the incentive mechanism increases the profits of the operators. It may provide some insight about the optimal price strategy selection for MVNOs in the next generation cognitive wireless networks.

A Study on NEMO-partially DMM based E2E Seamless Data Integration Transmission Scheme in SOC Public Infrastructures

  • Ryu, Wonmo;Caytiles, Ronnie D.;Park, Byungjoo
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제12권4호
    • /
    • pp.33-41
    • /
    • 2020
  • Nowadays, distributed mobility management (DMM) approaches have been widely adopted to address the limitations of centralized architectural methods to support seamless data transmission schemes in wireless sensor networks. This paper deals with the end-to-end (E2E) integration of Network Mobility (NEMO) basic support protocol in distributed wireless sensor network systems in structural health and environmental monitoring of social overhead capital (SOC) public infrastructures such as bridges, national highways, tunnels, and railroads. The proposed scheme takes advantage of the features of both the NEMO basic support protocol and partially distributed network-based DMM framework in providing seamless data transmission and robust mobility support. The E2E seamless data transmission scheme allows mobile users to roam from fixed-point network access locations and mobile platforms (i.e., vehicles such as cars, buses, and trains) without disconnecting its current sessions (i.e., seamless handover).