• Title/Summary/Keyword: wireless-powered communication networks

Search Result 44, Processing Time 0.023 seconds

Analysis of the Bogus Routing Information Attacks in Sensor Networks (센서 네트워크에서 AODV 라우팅 정보 변조공격에 대한 분석)

  • Lee, Myung-Jin;Kim, Mi-Hui;Chae, Ki-Joon;Kim, Ho-Won
    • The KIPS Transactions:PartC
    • /
    • v.14C no.3 s.113
    • /
    • pp.229-238
    • /
    • 2007
  • Sensor networks consist of many tiny sensor nodes that collaborate among themselves to collect, process, analyze, and disseminate data. In sensor networks, sensor nodes are typically powered by batteries, and have limited computing resources. Moreover, the redeployment of nodes by energy exhaustion or their movement makes network topology change dynamically. These features incur problems that do not appear in traditional, wired networks. Security in sensor networks is challenging problem due to the nature of wireless communication and the lack of resources. Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop suity mechanisms that can survive malicious attacks from "insiders" who have access to the keying materials or the full control of some nodes. In order to protect against insider attacks, it is necessary to understand how an insider can attack a sensor network. Several attacks have been discussed in the literature. However, insider attacks in general have not been thoroughly studied and verified. In this paper, we study the insider attacks against routing protocols in sensor networks using the Ad-hoc On-Demand Distance Vector (AODV) protocol. We identify the goals of attack, and then study how to achieve these goals by modifying of the routing messages. Finally, with the simulation we study how an attacker affects the sensor networks. After we understand the features of inside attacker, we propose a detect mechanism using hop count information.

A Bottom up Filtering Tuple Selection Method for Continuous Skyline Query Processing in Sensor Networks (센서 네트워크에서 연속 스카이라인 질의 처리를 위한 상향식 필터링 투플 선정 방법)

  • Sun, Jin-Ho;Chung, Chin-Wan
    • Journal of KIISE:Databases
    • /
    • v.36 no.4
    • /
    • pp.280-291
    • /
    • 2009
  • Skyline Query processing is important to wireless sensor applications in order to process multi-dimensional data efficiently. Most skyline researches about sensor network focus on minimizing the energy consumption due to the battery powered constraints. In order to reduce energy consumption, Filtering Method is proposed. Most existing researches have assumed a snapshot skyline query processing and do not consider continuous queries and use data generated in ancestor node. In this paper, we propose an energy efficient method called Bottom up filtering tuple selection for continuous skyline query processing. Past skyline data generated in child nodes are stored in each sensor node and is used when choosing filtering tuple. We also extend the algorithms, called Support filtering tuple(SFT) that is used when we choose the additional filtering tuple. There is a temporal correlation between previous sensing data and recent sensing data. Thus, Based on past data, we estimate current data. By considering this point, we reduce the unnecessary communication cost. The experimental results show that our method outperforms the existing methods in terms of both data reduction rate(DRR) and total communication cost.

The Loss Prevention System of Smart Device Using by iBeacon (iBeacon을 이용한 스마트 디바이스 분실 방지 시스템)

  • Nam, ChoonSung;Jung, HyunHee;Shin, DongRyeol
    • Journal of Internet Computing and Services
    • /
    • v.15 no.6
    • /
    • pp.27-34
    • /
    • 2014
  • Todays, the rapid technical progress of smart device has been used for various social (wall-fare) services in our lives. Especially, most of these services are based on the Local-based Services (LBS) and this technology is getting popular more and more compared with before. Basically, LBS is able to support various types of geographical services such as vehicles' navigation services, Augmented reality services as using extensional local information such as GPS. However, LBS has serious mathematical vulnerability on the services frequently because of its miscalculated GPS data under interior and ambiguous geographical environment such like shadowed area. So, to overcome this limitation, iBeacon, which would be able to mitigate LBS miscalculation process, has been proposed recently among network experts. Compared with other wireless technologies, iBeacon is able to determine the accurate geographical data of certain local positions easily because it is not only designed based on low-powered data transmitting technology, but also, it can be much easy to be deployed. As users' dependency of smart devices are getting higher and higher and the use of smart device is also getting complex more and more, the users prefer to use various types of smart devices at one time. Therefore, in this paper, we propose the loss prevention system that is able to interwork smart devices networks as using iBeacon technology for users' better conveniences.

A Centralized Deployment Protocol with Sufficient Coverage and Connectivity Guarantee for WSNs (무선 센서 네트워크에서 유효 커버리지 및 접속성 보장을 위한 중앙 집중형 배치 프로토콜)

  • Kim, Hyun-Tae;Zhang, Gui-Ping;Kim, Hyoung-Jin;Joo, Young-Hoon;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.6
    • /
    • pp.683-690
    • /
    • 2006
  • Reducing power consumption to extend network lifetime is one of the most important challenges in designing wireless sensor networks. One promising approach to conserving system energy is to keep only a minimal number of sensors active and put others into low-powered sleep mode, while the active sensors can maintain a connected covet set for the target area. The problem of computing such minimum working sensor set is NP-hard. In this paper, a centralized Voronoi tessellation (CVT) based approximate algorithm is proposed to construct the near optimal cover set. When sensor's communication radius is at least twice of its sensing radius, the covet set is connected at the same time; In case of sensor's communication radius is smaller than twice of its sensing radius, a connection scheme is proposed to calculate the assistant nodes needed for constructing the connectivity of the cover set. Finally, the performance of the proposed algorithm is evaluated through theoretical analysis and extensive numerical experiments. Experimental results show that the proposed algorithm outperforms the greedy algorithm in terms of the runtime and the size of the constructed connected cover set.