• Title/Summary/Keyword: Wireless

Search Result 16,269, Processing Time 0.04 seconds

Channel Searching Method of IEEE 802.15.4 Nodes for Avoiding WiFi Traffic Interference (WiFi 트래픽 간섭을 피하기 위한 IEEE 802.15.4 노드의 채널탐색방법)

  • Song, Myong Lyol
    • Journal of Internet Computing and Services
    • /
    • v.15 no.2
    • /
    • pp.19-31
    • /
    • 2014
  • In this paper, a parallel backoff delay procedure on multiple IEEE 802.15.4 channels and a channel searching method considering the frequency spectrum of WiFi traffic are studied for IEEE 802.15.4 nodes to avoid the interference from WiFi traffic. In order to search the channels being occupied by WiFi traffic, we analyzed the methods measuring the powers of adjacent channels simultaneously, checking the duration of measured power levels greater than a threshold, and finding the same periodicity of sampled RSSI data as the beacon frame by signal processing. In an wireless channel overlapped with IEEE 802.11 network, the operation of CSMA-CA algorithm for IEEE 802.15.4 nodes is explained. A method to execute a parallel backoff procedure on multiples IEEE 802.15.4 channels by an IEEE 802.15.4 device is proposed with the description of its algorithm. When we analyze the data measured by the experimental system implemented with the proposed method, it is observed that medium access delay times increase at the same time in the associated IEEE 802.15.4 channels that are adjacent each other during the generation of WiFi traffic. A channel evaluation function to decide the interference from other traffic on an IEEE 802.15.4 channel is defined. A channel searching method considering the channel evaluations on the adjacent channels together is proposed in order to search the IEEE 802.15.4 channels interfered by WiFi, and the experimental results show that it correctly finds the channels interfered by WiFi traffic.

Performance Analysis of Siding Window based Stream High Utility Pattern Mining Methods (슬라이딩 윈도우 기반의 스트림 하이 유틸리티 패턴 마이닝 기법 성능분석)

  • Ryang, Heungmo;Yun, Unil
    • Journal of Internet Computing and Services
    • /
    • v.17 no.6
    • /
    • pp.53-59
    • /
    • 2016
  • Recently, huge stream data have been generated in real time from various applications such as wireless sensor networks, Internet of Things services, and social network services. For this reason, to develop an efficient method have become one of significant issues in order to discover useful information from such data by processing and analyzing them and employing the information for better decision making. Since stream data are generated continuously and rapidly, there is a need to deal with them through the minimum access. In addition, an appropriate method is required to analyze stream data in resource limited environments where fast processing with low power consumption is necessary. To address this issue, the sliding window model has been proposed and researched. Meanwhile, one of data mining techniques for finding meaningful information from huge data, pattern mining extracts such information in pattern forms. Frequency-based traditional pattern mining can process only binary databases and treats items in the databases with the same importance. As a result, frequent pattern mining has a disadvantage that cannot reflect characteristics of real databases although it has played an essential role in the data mining field. From this aspect, high utility pattern mining has suggested for discovering more meaningful information from non-binary databases with the consideration of the characteristics and relative importance of items. General high utility pattern mining methods for static databases, however, are not suitable for handling stream data. To address this issue, sliding window based high utility pattern mining has been proposed for finding significant information from stream data in resource limited environments by considering their characteristics and processing them efficiently. In this paper, we conduct various experiments with datasets for performance evaluation of sliding window based high utility pattern mining algorithms and analyze experimental results, through which we study their characteristics and direction of improvement.

VANET Privacy Assurance Architecture Design (VANET 프라이버시 보장 아키텍처 설계)

  • Park, Su-min;Hong, Man-pyo;Shon, Tae-shik;Kwak, Jin
    • Journal of Internet Computing and Services
    • /
    • v.17 no.6
    • /
    • pp.81-91
    • /
    • 2016
  • VANET is one of the most developed technologies many people have considered a technology for the next generation. It basically utilizes the wireless technology and it can be used for measuring the speed of the vehicle, the location and even traffic control. With sharing those information, VANET can offer Cooperative ITS which can make a solution for a variety of traffic issues. In this way, safety for drivers, efficiency and mobility can be increased with VANET but data between vehicles or between vehicle and infrastructure are included with private information. Therefore alternatives are necessary to secure privacy. If there is no alternative for privacy, it can not only cause some problems about identification information but also it allows attackers to get location tracking and makes a target. Besides, people's lives or property can be dangerous because of sending wrong information or forgery. In addition to this, it is possible to be information stealing by attacker's impersonation or private information exposure through eavesdropping in communication environment. Therefore, in this paper we propose Privacy Assurance Architecture for VANET to ensure privacy from these threats.

Mixed Mobile Education System using SIFT Algorithm (SIFT 알고리즘을 이용한 혼합형 모바일 교육 시스템)

  • Hong, Kwang-Jin;Jung, Kee-Chul;Han, Eun-Jung;Yang, Jong-Yeol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.2
    • /
    • pp.69-79
    • /
    • 2008
  • Due to popularization of the wireless Internet and mobile devices the infrastructure of the ubiquitous environment, where users can get information whatever they want anytime and anywhere, is created. Therefore, a variety of fields including the education studies methods for efficiency of information transmission using on-line and off-line contents. In this paper, we propose the Mixed Mobile Education system(MME) that improves educational efficiency using on-line and off-line contents on mobile devices. Because it is hard to input new data and cannot use similar off-line contents in systems used additional tags, the proposed system does not use additional tags but recognizes of-line contents as we extract feature points in the input image using the mobile camera. We use the Scale Invariant Feature Transform(SIFT) algorithm to extract feature points which are not affected by noise, color distortion, size and rotation in the input image captured by the low resolution camera. And we use the client-server architecture for solving the limited storage size of the mobile devices and for easily registration and modification of data. Experimental results show that compared with previous work, the proposed system has some advantages and disadvantages and that the proposed system has good efficiency on various environments.

  • PDF

A Priority Based Multipath Routing Mechanism in the Tactical Backbone Network (전술 백본망에서 우선순위를 고려한 다중 경로 라우팅 방안)

  • Kim, Yongsin;Shin, Sang-heon;Kim, Younghan
    • Journal of KIISE
    • /
    • v.42 no.8
    • /
    • pp.1057-1064
    • /
    • 2015
  • The tactical network is system based on wireless networking technologies that ties together surveillance reconnaissance systems, precision strike systems and command and control systems. Several alternative paths exist in the network because it is connected as a grid to improve its survivability. In addition, the network topology changes frequently as forces and combatants change their network access points while conducting operations. However, most Internet routing standards have been designed for use in stable backbone networks. Therefore, tactical networks may exhibit a deterioration in performance when these standards are implemented. In this paper, we propose Priority based Multi-Path routing with Local Optimization(PMPLO) for a tactical backbone network. The PMPLO separately manages the global and local metrics. The global metric propagates to other routers through the use of a routing protocol, and it is used for a multi-path configuration that is guaranteed to be loop free. The local metric reflects the link utilization that is used to find an alternate path when congestion occurs, and it is managed internally only within each router. It also produces traffic that has a high priority privilege when choosing the optimal path. Finally, we conducted a simulation to verify that the PMPLO can effectively distribute the user traffic among available routers.

PBFiltering: An Energy Efficient Skyline Query Processing Method using Priority-based Bottom-up Filtering in Wireless Sensor Networks (PBFiltering: 무선 센서 네트워크에서 우선순위 기반 상향식 필터링을 이용한 에너지 효율적인 스카이라인 질의 처리 기법)

  • Seong, Dong-Ook;Park, Jun-Ho;Kim, Hak-Sin;Park, Hyoung-Soon;Roh, Kyu-Jong;Yeo, Myung-Ho;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.36 no.6
    • /
    • pp.476-485
    • /
    • 2009
  • In sensor networks, many methods have been proposed to process in-network aggregation effectively. Unlike general aggregation queries, skyline query processing compares multi-dimensional data for the result. Therefore, it is very difficult to process the skyline queries in sensor networks. It is important to filter unnecessary data for energy-efficient skyline query processing. Existing approach like MFTAC restricts unnecessary data transitions by deploying filters to whole sensors. However, network lifetime is reduced by energy consumption for many false positive data and filters transmission. In this paper, we propose a bottom up filtering-based skyline query processing algorithm of in-network for reducing energy consumption by filters transmission and a PBFiltering technique for improving performance of filtering. The proposed algorithm creates the skyline filter table (SFT) in the data gathering process which sends from sensor nodes to the base station and filters out unnecessary transmissions using it. The experimental results show that our algorithm reduces false positives and improves the network lifetime over the existing method.

A Study of Location Based Services Using Location Data Index Techniques (위치데이터인덱스 기법을 적용한 위치기반서버스에 관한 연구)

  • Park Chang-Hee;Kim Jang-Hyung;Kang Jin-Suk
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.5
    • /
    • pp.595-605
    • /
    • 2006
  • In this thesis, GPS and the electronic mapping were used to realize such a system by recognizing license plate numbers and identifying the location of objects that move at synchronous times with simulated movement in the electronic map. As well, throughout the study, a camera attached to a PDA, one of the mobile devices, automatically recognized and confirmed acquired license plate numbers from the front and back of each car. Using this mobile technique in a wireless network, searches for specific plate numbers and information about the location of the car is transmitted to a remote server. The use of such a GPS-based system allows for the measurement of topography and the effective acquisition of a car's location. The information is then transmitted to a central controlling center and stored as text to be reproduced later in the form of diagrams. Getting positional information through GPS and using image-processing with a PDA makes it possible to estimate the correct information of a car's location and to transmit the specific information of the car to a control center simultaneously, so that the center will get information such as type of the car, possibility of the defects that a car might have, and possibly to offer help with those functions. Such information can establish a mobile system that can recognize and accurately trace the location of cars.

  • PDF

A Cluster-Organizing Routing Algorithm by Diffusing Bitmap in Wireless Sensor Networks (무선 센서 네트워크에서의 비트맵 확산에 의한 클러스터 형성 라우팅 알고리즘)

  • Jung, Sangjoon;Chung, Younky
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.2
    • /
    • pp.269-277
    • /
    • 2007
  • Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.

  • PDF

The Channel Scheduler based on Water-filling Algorithm for Best Effort Forward Link Traffics in AMC/TDM/CDM System (AMC/TDM/CDM 다중접속방식에서의 Best Effort 순방향 서비스를 위한 Water-filling Based 채널 스케줄러)

  • Ma, Dongl-Chul;Ki, Young-Min;Kim, Dong-Ku
    • Journal of Advanced Navigation Technology
    • /
    • v.7 no.1
    • /
    • pp.59-71
    • /
    • 2003
  • The channel scheduler is suggested the radio resource management method in order to provide service with guaranteeing fairness and throughput to the users who use limited wireless channel. Proportional fairness scheduling algorithm is the channel scheduler used in the AMC(Adaptive Modulation and Coding)/TDM system, and this algorithm increases the throughput considering the user's time fairness. In this paper is suggested the channel scheduler combining CDM scheme available in AMC/TDM/CDM system. Unlike the system which only uses TDM which provide the only one user at the same slot, this scheduler can service a lot of users since this uses the CDM scheme with multi-cord channel. At every moment, allocation of transmission power to multi-channel users is problematic because of CDM scheme. In this paper, we propose a water-filling scheduling algorithm to solve the problem. Water-filling fairness(WF2) scheduling algorithm watches the average channel environment. So, this modified method guarantees fairness for each user in terms of power and service time.

  • PDF

Internetworking strategy between MANET and WLAN for Extending Hot-Spot of WLAN based on HMIPv6 (HMIPv6를 기반으로 한 무선 랜과 이동 애드 혹 네트워크 간의 인터네트워킹 기법)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.1
    • /
    • pp.38-48
    • /
    • 2006
  • For extending of hot-spot of WLAN, (2) proposes internetworking scheme between wireless LAN (WLAN) and mobile ad-hoc network (MANET), which employ the same layer-2 protocol with different mode. Compared to internetworking schemes between UMTS (Universal Mobile Telecommunications Systems) and WLAN (3-4), the scheme from (2) has relatively low overhead and latencies because WLAN and MANET are physically and logically similar to each other. However, the mode switching algorithm proposed in r2] for internetworking between WLAN and MANET only considers signal strength and determines handoff, and mobile nodes following a zigzag course in pollution area may perform handoff at short intervals. Furthermore, (2) employs mobile IPv6 (MIPv6) at base, which brings still high delay on handoff and overhead due to signal message exchange. In this paper, we present optimized internetworking scheme between WLAN and MANET, modified from (2). To settle ping-pong handoff from (2), we propose adaptive mode switching algorithm. HMIPv6 is employed for IP connectivity and mobility service in WLAN, which solves some shortcomings, such as high handoff overhead and vulnerable security. For routing in MANET, OLSR is employed, which is a proactive Protocol and has optimally reduced signal broadcasting overhead. OLSR operates with current P protocol compatibly with no change or modification. The proposed internetworking scheme based on adaptive mode switching algorithm shows better performance than scheme from (2).