• Title/Summary/Keyword: Hierarchical Transmission

Search Result 215, Processing Time 0.023 seconds

An Energy Effective Protocol for Clustering Ad Hoc Network

  • Lee, Kang-Whan;Chen, Yun
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.117-121
    • /
    • 2008
  • In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

Automated Design of Viterbi Decoder using Specification Parameters (사양변수를 이용한 비터비 복호기의 자동설계)

  • Kong, Myoung-Seok;Bae, Sung-Il;Kim, Jae-Seok
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.1
    • /
    • pp.1-11
    • /
    • 1999
  • In this paper, we proposed a design method of parameterized viterbi decoder, which automatically synthsizes the diverse viterbi deciders used in the digital mobile communication systems. It is designed to synthesize a viterbi decoder specified by user-provided parameters. Those parameters are constraint length, code rate generator polynomials of teh convolutional encoder, data rate and bits/frame of the data transmission, and soft decision bits of viterbi decoder. For the design of the parameterized viterbi decoder, we designed a user interface module C-language, and a viterbi decoder module in a hierarchical atructure using VHDL language and its generic statement. For the verification of the parameterized viterbi decoder, we compared our synthesized viterbi decoder with the conventional viterbi decoder which is designed for the IS-95 CDMA system. The proposed design method of the viterbi decoder will be a new method to obtain a required viterbi decoder in a very short time only by supplying the design parameters.

  • PDF

Joint Mode Selection and Resource Allocation for Mobile Relay-Aided Device-to-Device Communication

  • Tang, Rui;Zhao, Jihong;Qu, Hua;Zhu, Zhengcang;Zhang, Yanpeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.950-975
    • /
    • 2016
  • Device-to-Device (D2D) communication underlaying cellular networks is a promising add-on component for future radio communication systems. It provides more access opportunities for local device pairs and enhances system throughput (ST), especially when mobile relays (MR) are further enabled to facilitate D2D links when the channel condition of their desired links is unfavorable. However, mutual interference is inevitable due to spectral reuse, and moreover, selecting a suitable transmission mode to benefit the correlated resource allocation (RA) is another difficult problem. We aim to optimize ST of the hybrid system via joint consideration of mode selection (MS) and RA, which includes admission control (AC), power control (PC), channel assignment (CA) and relay selection (RS). However, the original problem is generally NP-hard; therefore, we decompose it into two parts where a hierarchical structure exists: (i) PC is mode-dependent, but its optimality can be perfectly addressed for any given mode with additional AC design to achieve individual quality-of-service requirements. (ii) Based on that optimality, the joint design of MS, CA and RS can be viewed from the graph perspective and transferred into the maximum weighted independent set problem, which is then approximated by our greedy algorithm in polynomial-time. Thanks to the numerical results, we elucidate the efficacy of our mechanism and observe a resulting gain in MR-aided D2D communication.

LLHS: Low Latency Handoff Scheme based on Buffering for Mobile Networks (이동망에서 버퍼링에 기반한 핸드오프 지연감소기법)

  • Rho, Kyung-Taeg;Chung, Dong-Kun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.5
    • /
    • pp.105-111
    • /
    • 2008
  • Mobility support for mobile networks will be important to minimize the packet overhead, to optimize routing, to reduce handoff latency, and to reduce the volume of handoff signals. Mobile IPv6 (MIPv6) and Hierarchical MIPv6 (HMIPv6) are one of mobility management protocols (MMPs) that provides network layer mobility over all access technologies. However, the communication quality of these candidates is severely degraded during handoffs. As another way to improve the handoff performance of a mobile network by conventional MMPs such as MIPv6 and HMIPv6, we propose a Low Latency Handoff Scheme (LLHS) combining Fast MIPv6 (FMIPv6) with HMIPv6 extension with buffering function, in which Mobility Anchor Points (MAPs) buffer packets destined to the Mobile Routers (MRs) or MNs within a mobile network during handoffs. The simulation results show that the proposed scheme reduces transmission delay and packet loss in UDP communication.

  • PDF

Performance Analysis of Scalable Video Coding between T-DMB and Advanced T-DMB on Bandwidth Allocation Method (대역폭 할당 방식에 따른 T-DMB와 AT-DMB간의 스케일러블 부호화 성능 분석)

  • Choi, Sung-Jin;Kim, Jin-Soo;Kim, Jae-Gon;Choi, Hae-Chul;Yoo, Jeong-Joo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.113-116
    • /
    • 2007
  • T-DMB (Terrestrial-DMB) service is now available in the metropolitan area, but due to the bandwidth limitation, it is allowed to provide up to CIF resolution. As users' requests for high-quality mobile multimedia services are rapidly increasing and additional bandwidth can be provided by adopting the hierarchical modulation transmission technology, the research on the Advanced Terrestrial-DMB(AT-DMB) service using the SVC(Scalable Video Coding) scheme is being actively studied. In this paper, through computer simulations, first, while keeping the current T-DMB service unchanged, the visual qualities of AT-DMB services are investigated by varying the additional bandwidth. Then, by considering the cases that the overall bandwidth can be allowed to dynamically allocate to the T-DMB/AT-DMB video services, the performance characteristics between two layers are compared over the different kinds of video sequences.

  • PDF

Iso-density Surface Reconstruction using Hierarchical Shrink-Wrapping Algorithm (계층적 Shrink-Wrapping 알고리즘을 이용한 등밀도면의 재구성)

  • Choi, Young-Kyu;Park, Eun-Jin
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.6
    • /
    • pp.511-520
    • /
    • 2009
  • In this paper, we present a new iso-density surface reconstruction scheme based on a hierarchy on the input volume data and the output mesh data. From the input volume data, we construct a hierarchy of volumes, called a volume pyramid, based on a 3D dilation filter. After constructing the volume pyramid, we extract a coarse base mesh from the coarsest resolution of the pyramid with the Cell-boundary representation scheme. We iteratively fit this mesh to the iso-points extracted from the volume data under O(3)-adjacency constraint. For the surface fitting, the shrinking process and the smoothing process are adopted as in the SWIS (Shrink-wrapped isosurface) algorithm[6], and we subdivide the mesh to be able to reconstruct fine detail of the isosurface. The advantage of our method is that it generates a mesh which can be utilized by several multiresolution algorithms such as compression and progressive transmission.

Reliable Time Synchronization Protocol in Sensor Networks (센서 네트워크에서 신뢰성 있는 시각 동기 프로토콜)

  • Hwang So-Young;Jung Yeon-Su;Baek Yun-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3A
    • /
    • pp.274-281
    • /
    • 2006
  • Sensor network applications need synchronized time extremely such as object tracking, consistent state updates, duplicate detection, and temporal order delivery. This paper describes reliable time synchronization protocol (RTSP) for wireless sensor networks. In the proposed method, synchronization error is decreased by creating hierarchical tree with lower depth and reliability is improved by maintaining and updating information of candidate parent nodes. The RTSP reduces recovery time and communication overheads comparing to TPSN when there are topology changes owing to moving of nodes, running out of energy and physical crashes. Simulation results show that RTSP has about 20% better performance than TPSN in synchronization accuracy. And the number of message in the RTSP is $20%{\sim}60%$ lower than that in the TPSN when nodes are failed in the network. In case of different transmission range of nodes, the communication overhead in the RTSP is reduced up to 40% than that in the TPSN at the maximum.

A Study of node Authentication in Ad-hoc Network using Java Card (자바 카드를 이용한 Ad-hoc망의 노드 인증에 관한 연구)

  • Lee, Cheol-Seung;Shin, Myeong-Sook;Lee, Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.902-905
    • /
    • 2005
  • In this paper we challenge the mobile node Authentication using Java Card authentication protocol in Ad-hoc network environment. Ad-hoc network is a collection of wireless mobile nodes without the support of a stationary infrastructure. and DSR routing protocol, which is one of famous mobile ad-hoc rooting protocols, has the following network path problem. this paper is the security structure that defined in a mobile network and security and watches all kinds of password related technology related to the existing authentication system. It looks up weakness point on security with a problem on the design that uses Ad-hoc based structure and transmission hierarchical security back of a mobile network, and a server-client holds for user authentication of an application level all and all, and it provides one counterproposal. Java Card Authentication of mobile node can possibly be applied to the area of M-Commerce, Wireless Security, and Ubiquitous Computing and so on.

  • PDF

Improvement of Energy Efficiency of LEACH Protocol for Wireless Sensor Networks (무선센서 네트워크를 위한 LEACH 프로토콜의 에너지 효율 향상 방안)

  • Lee, Sang-Hoon;Suk, Jung-Bong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.2B
    • /
    • pp.76-81
    • /
    • 2008
  • LEACH (Low Energy Adaptive Clustering Hierarchy) has been proposed as a routing protocol with a hierarchical structure, in order to achieve the energy efficiency that is of primary importance in the wireless sensor networks. A wireless sensor network adopting LEACH is composed of a few clusters, each of which consists of member nodes that sense the data, and head nodes that deliver the collected data from member nodes to a sink node that is connected to a backbone network. A head node in a cluster allocates TDMA slots to its member nodes without taking into account whether they have data to transmit or not, thus resulting in inefficiency of energy usage of head node that remains in active mode during the entire round time. This motivates us to propose a scheme to improve the energy efficiency of LEACH, by assigning TDMA slots only to those member nodes who have data to send. As a result, the head node can remain sleep during the period of no data transmission from member nodes, leading to the substantial energy saving. By using the ns-2 simulator, we evaluate the performance of the proposed scheme in comparison with the original LEACH. Experimental results validate our scheme, showing a better performance than original LEACH in terms of the number of outliving nodes and the quantity of energy consumption as time evolves.

A Study for Implementation of HMIPv6 in all-IP WDM-PON (All-IP WDM-PON 액세스 네트워크에서 HMIP 실현 연구)

  • Lee, Sung-Keun;Lim, Tae-Hyong;Seo, Kyung-Rin;Park, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.243-252
    • /
    • 2008
  • In this paper, we propose the next-generation broadband wireless access network architecture, which is based on the wavelength division multiplexing-passive optical network(WDM-PON), and efficient mobility management scheme to support quality-of-service(QoS) of multimedia services in the next-generation wireless network. By adapting WDM-PON technology to wireless access network, the proposed scheme can realize broadband wireless access network. In addition, We utilize newly proposed local channels between optical network units(ONUs) or subnets in order to support the fast and efficient local data and handoff data transmission. We evaluate the performance of the proposed scheme in terms of handoff delay and packet loss thru computer simulation. Thru various computer simulation results, we verified the superior performance of the proposed scheme by comparing with the results of other schemes.