• Title/Summary/Keyword: neighborhood network

Search Result 163, Processing Time 0.026 seconds

Adaptive Postprocessing Algorithm for Reduction of Blocking Artifacts Using Wavelet Transform and NNF

  • Kwon, Kee-Koo;Park, Kyung-Nam;Kim, Byung-Ju;Lee, Suk-Hwan;Kwon, Seong-Geun;Lee, Kuhn-Il
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1424-1427
    • /
    • 2002
  • This paper proposes a novel postprocessing algorithm for reducing the blocking artifacts in low bit rate block-based transform coded images, that use adaptive neural network filter (NNF) in wavelet transform domain. n this algorithm, after performing a 2-level wavelet transform of the decompressed image, the existence of locking artifacts is determined using statistical characteristic of neighborhood blocks. And then a different one-dimensional (1-D) or 2-D NNF is used to reduce the locking artifacts according to the classified regions. That is, for HL and LH subbands regions with the blocking artifacts, a different 1-D NNF is used. And 2-D NNF is used in HH subband. Experimental results show that the proposed algorithm produced better results than those of conventional algorithms both subjectively and objectively.

  • PDF

PEC: A Privacy-Preserving Emergency Call Scheme for Mobile Healthcare Social Networks

  • Liang, Xiaohui;Lu, Rongxing;Chen, Le;Lin, Xiaodong;Shen, Xuemin (Sherman)
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.102-112
    • /
    • 2011
  • In this paper, we propose a privacy-preserving emergency call scheme, called PEC, enabling patients in life-threatening emergencies to fast and accurately transmit emergency data to the nearby helpers via mobile healthcare social networks (MHSNs). Once an emergency happens, the personal digital assistant (PDA) of the patient runs the PEC to collect the emergency data including emergency location, patient health record, as well as patient physiological condition. The PEC then generates an emergency call with the emergency data inside and epidemically disseminates it to every user in the patient's neighborhood. If a physician happens to be nearby, the PEC ensures the time used to notify the physician of the emergency is the shortest. We show via theoretical analysis that the PEC is able to provide fine-grained access control on the emergency data, where the access policy is set by patients themselves. Moreover, the PEC can withstandmultiple types of attacks, such as identity theft attack, forgery attack, and collusion attack. We also devise an effective revocation mechanism to make the revocable PEC (rPEC) resistant to inside attacks. In addition, we demonstrate via simulation that the PEC can significantly reduce the response time of emergency care in MHSNs.

A Study on the Planning for Rural Village Development Projects in Korea - Focused on Gamgok Chungbuk - (농촌마을 종합개발사업의 계획방향에 관한 연구 - 충북 감곡을 중심으로 -)

  • Kim, Seong-Keun
    • Journal of the Korean Institute of Rural Architecture
    • /
    • v.7 no.3
    • /
    • pp.19-26
    • /
    • 2005
  • In this study treats 'Rural Village Development Project'. The ministry of Agriculture and Forestry and Korea Agricultural & Rural Infrastructure Corporation are enforcing this from 2004. A purpose of 'Rural Village Development Project' is as follows. Repairs a function of production farms-residing rest tourism generally after connecting a neighborhood village having the same nature in a small scale unit. Too local human resources and material resources is utilized, and develops various types with specialization. As a result, it is to improve with the quality of life of a farmer. This study finds problems to have broken out in Rural Village Development Project. Therefore, recognize whether it is on to be devoted to rural village and rural community inhabitants to solve the problem how. And analyze a policy characteristic of Rural Village Development Project and basic course. Therefore, provide with materials when decides on plan course of Rural Village Development Project through this. As a result, it is a purpose to give help to Rural Village Development Project. The results of study are follows; First, A state inhabitants, professional group, administration understand an agricultural village, and to be able to learn must be prepared first. Second, the enough time that can carry out study is necessary. Third, must present the guidebook which expresses a local characteristic well. Fourth, it is specialist database construction and network formation.

  • PDF

An Energy Efficient Interference-aware Routing Protocol for Underwater WSNs

  • Khan, Anwar;Javaid, Nadeem;Ali, Ihsan;Anisi, Mohammad Hossein;Rahman, Atiq Ur;Bhatti, Naeem;Zia, Muhammad;Mahmood, Hasan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4844-4864
    • /
    • 2017
  • Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

A Genetic Algorithm for Network Clustering in Underwater Acoustic Sensor Networks (해양 센서 네트워크에서 네트워크 클러스터링을 위한 유전 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.12
    • /
    • pp.2687-2696
    • /
    • 2011
  • A Clustering problem is one of the organizational problems to improve network lifetime and scalability in underwater acoustic sensor networks. This paper propose an algorithm to obtain an optimal clustering solution to be able to minimize a total transmission power for all deployed nodes to transmit data to the sink node through its clusterhead. In general, as the number of nodes increases, the amount of calculation for finding the solution would be too much increased. To obtain the optimal solution within a reasonable computation time, we propose a genetic algorithm to obtain the optimal solution of the cluster configuration. In order to make a search more efficient, we propose some efficient neighborhood generating operations of the genetic algorithm. We evaluate those performances through some experiments in terms of the total transmission power of nodes and the execution time of the proposed algorithm. The evaluation results show that the proposed algorithm is efficient for the cluster configuration in underwater acoustic sensor networks.

A Tabu Search Algorithm for Controller Placement Problem in Software Defined Networks (소프트웨어 정의 네트워크에서 제어기 배치 문제를 위한 타부 서치 알고리즘)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.3
    • /
    • pp.491-498
    • /
    • 2016
  • The software defined networks implement a software network control plane, which is physically separated from the data plane. For wide area software defined network deployments, multiple controllers are required, and the placement of these controllers influences importantly the performance of the software defined networks. This paper proposes a Tabu search algorithm, which is one of the meta heuristic algorithms, for an efficient controller placement in software defined networks. In order to efficiently obtain better results, we propose new neighborhood generating operations, which are called the neighbor position move and the neighbor number move, of the Tabu search algorithm. We evaluate the performances of the proposed algorithm through some experiments in terms of the minimum latency and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms the existing genetic algorithm and random method under various conditions.

Adaptive Blocking Artifacts Reduction in Block-Coded Images Using Block Classification and MLP (블록 분류와 MLP를 이용한 블록 부호화 영상에서의 적응적 블록화 현상 제거)

  • Kwon, Kee-Koo;Kim, Byung-Ju;Lee, Suk-Hwan;Lee, Jong-Won;Kwon, Seong-Geun;Lee, Kuhn-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.4
    • /
    • pp.399-407
    • /
    • 2002
  • In this paper, a novel algorithm is proposed to reduce the blocking artifacts of block-based coded images by using block classification and MLP. In the proposed algorithm, we classify the block into four classes based on a characteristic of DCT coefficients. And then, according to the class information of neighborhood block, adaptive neural network filter is performed in horizontal and vertical block boundary. That is, for smooth region, horizontal edge region, vertical edge region, and complex region, we use a different two-layer neural network filter to remove blocking artifacts. Experimental results show that the proposed algorithm gives better results than the conventional algorithms both subjectively and objectively.

A Study on the Countermeasure of Traffic Terror (대중교통테러의 대응방안)

  • Kim, Jin-Hyeok
    • Korean Security Journal
    • /
    • no.14
    • /
    • pp.109-123
    • /
    • 2007
  • Traffic terror is one of the terror types subject on transportation means. However, unlike the aircraft or ship, there is no case of negotiating with passengers as hostage but to unconditionally attack that the human casualty would be much greater. In act, the terror on subway or bus would have much bigger damage than the terror on aircraft or ship. Because of such fact, there is a need for full preparation thereto, however, there is no preparation of advance preventive measure, particularly, when comparing to the cases involving aircraft. In addition, the passengers who use railway and others in the position of citizens do not have any defense mechanism against any terror activity to make the problem even more serious. Therefore, in order to prevent traffic terror, the first thing is to implement the identity confirmation of passengers, followed by the through search of cargos of the passengers, supplement the capability against the terror by the security team members, strengthen the responsive capability of citizens, thorough check on facilities, expansion of social security network and others. All terrors are within the reach of our neighborhood at the time when we neglect it, and the most secured and safe way to prevent the terror is to check and prepare at all times beginning from our familiar facilities or means.

  • PDF

On the QoS Support in Medium Access Control for Medical Sensor Networks (의료용 센서 네트워크에서 QoS 지원의 매체접속제어)

  • Ashrafuzzaman, Kazi;Kwak, Kyung-Sup
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.6
    • /
    • pp.151-158
    • /
    • 2010
  • In line with the requirement of appropriate protocol support for such mission-critical wireless sensor network (WSN) applications as patient monitoring, we investigate the framework for designing medium access control (MAC) schemes. The data traffic in medical systems comes with inherent traffic heterogeneity as well as strict requirement of reliability according to the varied extents of devise-wise criticality in separate cases. This implies that the quality-of-Service (QoS) issues are very distinctly delicate requiring specialized consideration. Besides, there are features in such systems that can be exploited during the design of a MAC scheme. In a monitoring or routine surveillance application, there are degrees of regularity or predictability in traffic as coordinated from a node of central control. The coordinator thus takes on the role of marshaling the resources in a neighborhood of nodes deployed mostly for upstream traffic; in a collision-free scheme, it schedules the time slots for each superframe based on the QoS specifications. In this preliminary study, we identify the key artifacts of such a MAC scheme. We also present basic performance issues like the impact of superframe length on delay incurred, energy efficiency achieved in the network operation as obtained in a typical simulation setup based on this framework.

A Tabu Search Algorithm for Minimum Cost Localization Problem in Underwater Sensor Networks (수중 센서 네트워크에서 최소 비용 위치 결정 문제를 위한 타부 서치 알고리즘)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.5
    • /
    • pp.929-935
    • /
    • 2017
  • All sensor nodes generally determine their positions using anchor nodes that are located in underwater sensor networks. This paper proposes a Tabu search algorithm to determine the minimum number of anchor nodes for the location of all sensor nodes in underwater sensor networks. As the number of the sensor nodes increases in the network, the amount of calculation that determines the number of anchor nodes would be too much increased. In this paper, we propose a Tabu search algorithm that determines the minimum number of anchor nodes within a reasonable computation time in a high dense network, and propose an efficient neighborhood generating operation of the Tabu search algorithm for efficient search. The proposed algorithm evaluates those performances through some experiments in terms of the minimum number of anchor nodes and execution time. The proposed algorithm shows 5-10% better performance than the conventional algorithm.