-
公开(公告)号:KR101740707B1
公开(公告)日:2017-05-26
申请号:KR1020110045340
申请日:2011-05-13
Applicant: 연세대학교 산학협력단
CPC classification number: H04W72/1252 , H04W40/20 , H04W84/18
Abstract: 무선다중홉 네트워크에서전송스케줄링장치는무선다중홉 네트워크내 모든노드들의전송요구량을계산하고, 각노드의전송요구량을이용하여각 노드에타임슬롯을할당한다.
Abstract translation: 在无线多跳网络中,传输调度设备计算无线多跳网络中的所有节点的传输请求量,并且利用每个节点的传输请求量为每个节点分配时隙。
-
公开(公告)号:KR101849469B1
公开(公告)日:2018-04-16
申请号:KR1020160140013
申请日:2016-10-26
Applicant: 한국전자통신연구원 , 연세대학교 산학협력단
Abstract: 핸드오버결정방법및 장치가개시된다. 일실시예는이동체의셀 체류시간에기초하여타겟기지국을선택하는단계와, 참조심볼수신전력에기초하여상기타겟기지국으로핸드오버를시작하는단계를포함한다.
-
公开(公告)号:KR1020080051035A
公开(公告)日:2008-06-10
申请号:KR1020070102763
申请日:2007-10-11
Applicant: 한국전자통신연구원 , 연세대학교 산학협력단
CPC classification number: H04W40/20 , H04L41/0833 , H04L45/122 , H04W74/0841 , H04W84/18 , Y02D70/00
Abstract: A position-based routing method by using a cell in a wireless sensor network is provided to minimize the energy and to determine a path until a destination node easily by reducing the periodical communication for the position information confirmation. In a next-hop position calculation process, the virtual ONI(Optimal Next-hop Information) among the paths until the destination node is calculated. In a communication area division process(302), the communication area is divided into fixed cell sizes by using the calculated virtual ONI position. In a packet broadcasting process(303), a packet including the virtual ONI position and the cell sizes is broadcasted to the surrounding node in the communication area. In a next-hop node decision process(305), the firstly transmitted surrounding node is determined as the next-hop node after receiving a response message in regard to the broadcasted packet from the surrounding node. In the next-hop position calculation process, the position joined by the virtual segment for connecting the distance until the destination node and a virtual circle corresponding to one's own communication area is calculated and the calculating result is determined as the next hop position.
Abstract translation: 提供了一种通过使用无线传感器网络中的小区的基于位置的路由方法来最小化能量并且通过减少用于位置信息确认的周期性通信来容易地确定目的地节点之间的路径。 在下一跳位置计算处理中,直到计算目的地节点为止的路径中的虚拟ONI(最佳下一跳信息)。 在通信区域划分处理(302)中,通过使用计算出的虚拟ONI位置将通信区域分割成固定小区大小。 在分组广播处理(303)中,将包含虚拟ONI位置和小区大小的分组广播到通信区域中的周边节点。 在下一跳节点决策处理(305)中,首先发送的周围节点在接收到来自周围节点的广播分组的响应消息后被确定为下一跳节点。 在下一跳位置计算处理中,计算通过用于连接目的地节点的距离的虚拟段和与自己的通信区域对应的虚拟圆所连接的位置,并将计算结果确定为下一跳位置。
-
公开(公告)号:KR1020120127087A
公开(公告)日:2012-11-21
申请号:KR1020110045340
申请日:2011-05-13
Applicant: 연세대학교 산학협력단
CPC classification number: H04W72/1252 , H04W40/20 , H04W84/18 , H04W72/0446 , H04W40/04 , H04W72/04
Abstract: PURPOSE: A transmission scheduling apparatus in a wireless multiple hop network and method thereof are provided to solve packet overload problems in a specific node by allocating differentiated time slots to a scheduling table according to the calculated transmission demand. CONSTITUTION: A transmission scheduling apparatus initializes scheduling variables which are necessary to schedule the transmission of nodes in a wireless multiple hop network(S410). The transmission scheduling apparatus calculates the transmission demand of all nodes(S420). The transmission scheduling apparatus converts the calculated transmission demand into the number of guaranteed time slots(S430). The transmission scheduling apparatus allocates the time slot to the nodes(S440). [Reference numerals] (S410) Initializing scheduling variables; (S420) Calculating the transmission demand of all nodes; (S430) Converting the transmission demand into the number of guaranteed time slots; (S440) Allocating the time slots
Abstract translation: 目的:提供一种无线多跳网络中的传输调度装置及其方法,用于通过根据计算出的传输需求向调度表分配差分时隙来解决特定节点中的分组过载问题。 构成:发送调度装置初始化调度无线多跳网络中的节点传输所必需的调度变量(S410)。 发送调度装置计算所有节点的发送需求(S420)。 发送调度装置将计算出的发送需求转换为保证时隙数(S430)。 发送调度装置向节点分配时隙(S440)。 (参考号)(S410)初始化调度变量; (S420)计算所有节点的传输需求; (S430)将传输需求转换为保证时隙数; (S440)分配时隙
-
公开(公告)号:KR100954380B1
公开(公告)日:2010-04-26
申请号:KR1020070102763
申请日:2007-10-11
Applicant: 한국전자통신연구원 , 연세대학교 산학협력단
Abstract: A position-based routing method by using a cell in a wireless sensor network is provided to minimize the energy and to determine a path until a destination node easily by reducing the periodical communication for the position information confirmation. In a next-hop position calculation process, the virtual ONI(Optimal Next-hop Information) among the paths until the destination node is calculated. In a communication area division process(302), the communication area is divided into fixed cell sizes by using the calculated virtual ONI position. In a packet broadcasting process(303), a packet including the virtual ONI position and the cell sizes is broadcasted to the surrounding node in the communication area. In a next-hop node decision process(305), the firstly transmitted surrounding node is determined as the next-hop node after receiving a response message in regard to the broadcasted packet from the surrounding node. In the next-hop position calculation process, the position joined by the virtual segment for connecting the distance until the destination node and a virtual circle corresponding to one's own communication area is calculated and the calculating result is determined as the next hop position.
-
-
-
-