会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 91. 发明授权
    • 데이터 손실이 없는 하드 핸드-오버 방법 및 시스템
    • 一种没有数据丢失的硬切换方法和系统
    • KR100486414B1
    • 2005-04-29
    • KR1020020083087
    • 2002-12-24
    • 한국전자통신연구원
    • 송재수김경수장성철김경식박지수박순기김주희
    • H04B7/26
    • 본 발명은 이동통신시스템에서 핸드-오버시 데이터 전송에 관한 것으로, 특히 주파수간 핸드-오버(Inter frequency Hand over)와 같은 하드 핸드-오버(Hard Hand Over)에서 기존 링크에서 새로운 링크로 통신경로를 바꾸는 과정에서 기존링크에 있던 전송되지 않은 데이터가 유실을 막고 신뢰성 있는 하드핸드-오버를 지원하기 위한 시스템 및 방법에 관한 것이다. 본 발명은 기지국과 제어국 사이에 새로운 신호를 정의하여 제어국에서는 핸드-오버가 발생한 시점을 기존 기지국에 알려주고 기존 기지국에서는 버퍼에 저장된 데이터가 모두 이동단말로 전송된 시점을 제어국에 알려주어서 기존 통신경로에 남아있던 데이터가 모두 이동단말에 전달되는 것을 보장할 수 있도록 한다. 또한 제어국에 핸드-오버용 버퍼를 두어서 새로운 통신경로를 구축하는 동안 수신되는 데이터를 저장하였다가 이동단말까지 새로운 통신경로가 완성되면 이 버퍼로부터 이동단말로 데이터를 전송함으로써, 이동통신망에서 하드 핸드-오버시 데이터의 유실을 막고 신뢰성 있는 핸드-오버를 지원할 수 있다.
    • 92. 发明公开
    • 차세대 이동통신 시스템에서의 핸드오버 방법
    • 先进手机通信系统中的切换方法
    • KR1020040056980A
    • 2004-07-01
    • KR1020020083731
    • 2002-12-24
    • 한국전자통신연구원
    • 송재수김주희장성철
    • H04B7/26
    • H04W36/0011H04W8/02H04W8/087H04W80/04
    • PURPOSE: A handover method in an advanced mobile communication system is provided to minimize the loss of packets generated in the process of an handover, to reduce handover processing delay, and to decrease network loads due to frequent registration procedures dependent on the location movement of mobile terminals. CONSTITUTION: An MN(Mobile Node) in an active state ignores a registration procedure, without executing it, even though an agent advertising message is received from a drift AS(Access Station). Instead, the MN transmits a measurement report message through an RRC connection with a serving AS. The serving AS reads channel status from the received message. If the serving AS determines the start of a handover procedure, the serving AS transmits a connection setup request message, containing physical layer configuration information and MAC configuration information for radio link setup, to the drift AS. Receiving the connection setup request message, the drift AS allocates a radio resource according to the received configuration information and executes MAC entity setup and radio link setup to support the transmission of data.
    • 目的:提供高级移动通信系统中的切换方法,以最小化在切换过程中产生的分组丢失,减少切换处理延迟,并且由于频繁的登记过程而导致的网络负载减少,这取决于移动的位置移动 终端。 构成:即使从漂移AS(接入站)接收到代理广告消息,处于活动状态的MN(移动节点)也忽略注册过程而不执行注册过程。 相反,MN通过与服务AS的RRC连接来发送测量报告消息。 服务AS从接收的消息中读取信道状态。 如果服务AS确定切换过程的开始,则服务AS向漂移AS发送包含用于无线电链路建立的物理层配置信息和MAC配置信息的连接建立请求消息。 接收到连接建立请求消息后,漂移AS根据接收到的配置信息分配无线资源,执行MAC实体建立和无线链路建立,支持数据传输。
    • 93. 发明公开
    • 이동통신에서의 호수락 제어 방법 및 그 프로그램이저장된 기록매체
    • 用于控制移动通信中的呼叫接收和记录中继存储程序以实现其的方法
    • KR1020040056979A
    • 2004-07-01
    • KR1020020083730
    • 2002-12-24
    • 한국전자통신연구원
    • 박순기김경수장성철김경식박지수송재수김주희
    • H04B7/26
    • H04W4/16H04B7/26H04W36/20H04W72/10
    • PURPOSE: A method for controlling call admission in mobile communication and a recording medium storing a program to realize the same are provided to efficiently use system resources and to execute discriminatory processing according to the traffic characteristics of mobile users in the case of system congestion. CONSTITUTION: If the service speed of an arrived call is fixed in case that the arrived call is a new call(S12,S13), a base station judges whether the call meets the first condition in which (Ipresent + ΔIi) is less than (Itotal - IGMreserved, new call)(S14). If the call satisfies the first condition, the base station approves the call request at a service speed of Ri(S15). However, in case that the call does not meet the first condition, the base station rejects the call(S16). Meanwhile, if the arrived call is a new call and the service speed is variable(S21), the base station judges whether the call meets the second condition in which (Ipresent + ΔImaxi) is less than (Itotal - IGMreserved, new call)(S22). In case that the call meets the second condition, the base station approves the call request at a service speed of Rmaxi(S23).
    • 目的:提供一种用于控制移动通信中的呼叫准入的方法和存储实现其的程序的记录介质,以在系统拥塞的情况下根据移动用户的业务特性来有效地使用系统资源和执行鉴别处理。 构成:如果到达呼叫是新呼叫(S12,S13),则到达呼叫的服务速度是固定的,则基站判断呼叫是否满足(Ipresent +ΔIi)小于(Ipresent +ΔIi)的第一条件 Itotal - IGMreserved,新电话)(S14)。 如果呼叫满足第一条件,则基站以Ri的服务速度(S15)批准呼叫请求。 然而,在呼叫不符合第一条件的情况下,基站拒绝该呼叫(S16)。 同时,如果到达的呼叫是新呼叫并且服务速度是可变的(S21),则基站判断呼叫是否满足(Ipresent +ΔImaxi)小于(Itotal-IGMreserved,新呼叫)的第二条件 S22)。 在呼叫满足第二条件的情况下,基站以Rmaxi的服务速度来批准呼叫请求(S23)。
    • 94. 发明公开
    • 데이터 손실이 없는 하드 핸드-오버 방법 및 시스템
    • 数据丢失的硬切换方法和系统
    • KR1020040056584A
    • 2004-07-01
    • KR1020020083087
    • 2002-12-24
    • 한국전자통신연구원
    • 송재수김경수장성철김경식박지수박순기김주희
    • H04B7/26
    • H04W36/02H04B7/26H04W36/08H04W72/06
    • PURPOSE: A hard handover method and system free from data loss is provided to increase service quality by preventing data loss in a hard hand-over and to efficiently operate a new hard handover method. CONSTITUTION: A base station controller(300) consists of an RRC(Radio Resource Control) layer(310) and an RLC(Radio Link Control) layer(320). The RRC layer(310) comprises a call control part(311). The RLC layer(320) comprises a buffer control part(321) and a handover buffer(322). The call control part(311) controls the buffer control part(321) with call setup and release. If a mobile terminal moves from the coverage of the first base station(100) to the coverage of the second base station(200), it is reported to the base station controller(300) through a measurement report message. Receiving the measurement report message, the base station controller(300) generates a handover. If a handover is generated, the call control part(311) stops the transmission of downlink data to the first base station(100) and directs the buffer control part(321) to store the data incoming from a core network(400) in the handover buffer(322). At the same time, the call control part(311) transmits a handover generation message to inform the first base station(100) that a hand-over has been generated.
    • 目的:提供硬切换方法和无数据丢失的系统,通过防止硬切换中的数据丢失并有效地操作新的硬切换方法来提高服务质量。 构成:基站控制器(300)由RRC(无线资源控制)层310和RLC(无线链路控制)层320组成。 RRC层(310)包括呼叫控制部(311)。 RLC层(320)包括缓冲器控制部分(321)和切换缓冲器(322)。 呼叫控制部(311)通过呼叫建立和释放来控制缓冲器控制部(321)。 如果移动终端从第一基站(100)的覆盖区移动到第二基站(200)的覆盖范围,则通过测量报告消息向基站控制器(300)报告。 接收到测量报告消息,基站控制器(300)产生切换。 如果生成切换,则呼叫控制部(311)停止向第一基站(100)发送下行链路数据,并指示缓冲器控制部(321)将来自核心网(400)的数据存储在 切换缓冲器(322)。 同时,呼叫控制部分(311)发送切换生成消息以通知第一基站(100)已经生成切换。
    • 95. 发明授权
    • 평면 트리 구조의 이중 상태관리를 통한 확산 코드 관리방법 및 그를 이용한 확산 코드 할당 및 해제 방법
    • 평면트리구조의이중상태관리를통한확산코드관리방법및그를이용한확산코드할당해해제방
    • KR100437646B1
    • 2004-06-25
    • KR1020010085663
    • 2001-12-27
    • 한국전자통신연구원유티스타콤코리아 유한회사
    • 김성경김주희김경수
    • H04J13/20
    • PURPOSE: A method for managing spreading codes through dual state management of a plane tree structure and a method for allocating and releasing the spreading codes by using the same are provided to adopt the plane tree structure storing an OVSF(Orthogonal Variable Spreading Factor) code tree in a one-dimensional array, and to perform the dual state management of OVSF codes, thereby eliminating the effort to search states of related codes upon allocation and release. CONSTITUTION: A state of each spreading code is divided into two fields, in order to meet an allocation rule of spreading codes. The first state field(5a) indicates a state(IDLE) of available spreading codes, a state(BUSY) of currently used spreading codes, and a state(QUASI-BUSY) showing that lower spreading codes connected to the same branch are unavailable due to use of upper spreading codes. The second state field(5b) indicates information on the number of spreading codes(#BUSY-CHILD) in a 'BUSY' state among lower spreading codes of corresponding spreading codes. Resources of a spreading code tree are managed in a plane tree structure with a one dimensional array. Accordingly, direct access into an array index is possible without passing a step of searching additional link information, when accessing the lower spreading codes and upper spreading codes.
    • 目的:提供一种通过对平面树结构进行双状态管理来管理扩频码的方法,以及使用该方法分配和释放扩频码的方法,以采用存储OVSF(正交可变扩频因子)码树的平面树结构 并且执行OVSF代码的双状态管理,从而消除了在分配和释放时搜索相关代码的状态的努力。 组成:每个扩展码的状态被分成两个字段,以满足扩频码的分配规则。 第一状态字段(5a)表示可用扩展码的状态(IDLE),当前使用的扩展码的状态(BUSY)和表示连接到同一分支的较低扩展码不可用的状态(QUASI-BUSY) 使用较高的扩展码。 第二状态字段(5b)指示相应扩展码的较低扩展码中处于“忙”状态的扩展码(#BUSY-CHILD)的数目的信息。 扩展码树的资源在具有一维数组的平面树结构中进行管理。 因此,当访问较低扩展码和较高扩展码时,可以直接访问数组索引,而不需要经过搜索附加链路信息的步骤。
    • 96. 发明授权
    • 통계적 다중화기를 적용한 광대역 전송로의 성능분석방법및 대역폭 결정방법
    • 통계적다중화기를적용한광대역전송로의성능분석방법및대역폭결정방통계적
    • KR100369937B1
    • 2003-02-05
    • KR1020000083020
    • 2000-12-27
    • 한국전자통신연구원
    • 유병한김주희장성철
    • H04L12/28
    • PURPOSE: A performance analyzing method and bandwidth determining method of a broadband transmission path adopting a statistical multiplier are provided to theoretically evaluate loss probability and transmission delay of a packet according to a given traffic situation, effectively operate a broadband transmission path and maintain a suitable transmission quality by evaluating a bandwidth of the transmission path according to a bandwidth determining method proposed in case that a loss probability and transmission delay of a required packet have not been previously determined. CONSTITUTION: A bandwidth satisfying a delay condition is determined(S31). A size of a transmission buffer of a broadband transmission path satisfying a maximum allowable delay time is determined(S31). A packet loss probability of a bandwidth is calculated in consideration of the maximum delay time(S33). A packet loss probability(Pd) and a packet loss probability(PL) requested for transmission are compared(S34). If Pd is greater than PL, a size of a buffer is increased one by one(S36) to calculate a packet loss probability of the bandwidth(S37), the obtained packet loss probability(Pd) and the packet loss probability(PL) requested for transmission are compared(S38), thereby finding a buffer size satisfying a QoS(quality of service) condition. A bandwidth satisfying the QoS is determined(S39).
    • 目的:提供一种采用统计乘法器的宽带传输路径的性能分析方法和带宽确定方法,以根据给定的业务情况从理论上评估分组的丢失概率和传输延迟,有效地操作宽带传输路径并保持适当的传输 通过根据在预先未确定所需分组的丢失概率和传输延迟的情况下提出的带宽确定方法来评估传输路径的带宽来确定质量。 构成:确定满足延迟条件的带宽(S31)。 确定满足最大可允许延迟时间的宽带传输路径的传输缓冲器的大小(S31)。 考虑最大延迟时间来计算带宽的分组丢失概率(S33)。 比较请求发送的分组丢失概率(Pd)和分组丢失概率(PL)(S34)。 如果Pd大于PL,则逐个增加缓冲器的大小(S36)以计算带宽的分组丢失概率(S37),获得的分组丢失概率(Pd)和请求的分组丢失概率(PL) 进行比较(S38),从而找到满足QoS(服务质量)条件的缓冲器大小。 确定满足QoS的带宽(S39)。