公开(公告)号：KR1020090065705A

公开(公告)日：2009-06-23

申请号：KR1020070133139

申请日：2007-12-18

Applicant: 한국전자통신연구원

Inventor： 김해용 ,  김상철 ,  유미선 ,  송준근 ,  마평수

IPC: H04B7/26

CPC classification number: H04W8/26 ,  H04L29/12283 ,  H04L61/2061 ,  H04W84/18 ,  H04W88/021

Abstract: A method for allocating a dynamic address using the communications of a neighbor terminal of the AD hoc network is provided to assign an overlapped and inherent address to a new terminal by using the communications of the neighbor terminal. A new terminal broadcasts an address block request message to neighbor terminals. An address block reply message is transmitted from the neighbor terminals. The new terminal transmits the address block acknowledgement message to 1 hop neighboring terminal(10a) in a normal state possessing the address block which the head of a family is great. The one-hop neighbor terminal transmits the address block complete message to the new terminal.

Abstract translation: 提供使用AD hoc网络的相邻终端的通信来分配动态地址的方法，通过使用邻居终端的通信来向新终端分配重叠和固有的地址。 新终端向相邻终端广播地址块请求消息。 从邻居终端发送地址块应答消息。 新终端在具有家庭的头部大的地址块的正常状态下向1跳相邻终端（10a）发送地址块确认消息。 一跳邻居终端向新终端发送地址块完成消息。

公开(公告)号：KR1020090062317A

公开(公告)日：2009-06-17

申请号：KR1020070129479

申请日：2007-12-12

Applicant: 한국전자통신연구원

Inventor： 송준근 ,  마평수 ,  김해용 ,  김진원

IPC: H04B7/24 ,  H04L12/24

Abstract: A system upgrade method in a multi-hop wireless network and a system thereof are provided to minimize the overhead caused by the topology of a network or a routing algorithm by transmitting updated data which is divided into the predetermined number of pieces based on at least one neighboring node which can be cooperated. A sync node transmits an update request message to a target node(S1). The target node broadcasts a collaboration request message to at least one neighboring node(S2). The neighboring nodes send a collaboration accept message to the sync node(S3). The sync node divides the update data into the predetermined number of packets, and then divided update data packets to the neighboring nodes(S4). The neighboring nodes send the divided update data packets to the target node(S6). The target node sends a response signal to a corresponding neighboring node(S7), and the performs the updating process(S8).

Abstract translation: 提供了一种多跳无线网络中的系统升级方法及其系统，以通过发送更新的数据来最小化由网络拓扑或路由算法引起的开销，所述更新数据基于至少一个 可以配合的相邻节点。 同步节点向目标节点发送更新请求消息（S1）。 目标节点向至少一个相邻节点广播协作请求消息（S2）。 相邻节点向同步节点发送协作接受消息（S3）。 同步节点将更新数据划分成预定数量的分组，然后将更新数据分组划分给相邻节点（S4）。 相邻节点将划分的更新数据分组发送到目标节点（S6）。 目标节点向对应的相邻节点发送响应信号（S7），并执行更新处理（S8）。

公开(公告)号：KR1020080054324A

公开(公告)日：2008-06-17

申请号：KR1020070029595

申请日：2007-03-27

Applicant: 한국전자통신연구원

Inventor： 김상철 ,  신창민 ,  장진호 ,  김해용 ,  조유근 ,  홍지만 ,  허준영 ,  이상호 ,  구본철 ,  민홍 ,  이승우

IPC: G06F9/06 ,  G06F9/46

Abstract: A method for allocation stack in a multi-threaded sensor OS(Operating System) environment is provided to allocate a thread stack with space efficiency in a sensor OS operated in a space restricted sensor platform and reduce usage of a memory space remarkably more than a usual static thread stack allocation method. A stack space used by a called function is allocated by estimating the size of the allocated stack space based on the size of local variables and the number of function factors used by the function when the function is called during execution of the thread(220). A stack pointer is moved to point the allocated stack space(230). A factor and a return address of the function are stored in the stack space(240). The function is returned when the function is terminated(270). The stack pointer is restored and the allocated stack space is returned(280).

Abstract translation: 提供了一种用于多线程传感器OS（操作系统）环境中的分配堆栈的方法，以在空间受限传感器平台中操作的传感器OS中分配具有空间效率的线程栈，并且显着地减少了存储器空间的使用 静态线程栈分配方法。 通过在执行线程（220）期间调用函数时，基于局部变量的大小和函数使用的函数因子的数量估计分配的​​堆栈空间的大小来分配由被调用函数使用的堆栈空间。 移动堆栈指针以指定分配的堆栈空间（230）。 函数的因子和返回地址存储在堆栈空间（240）中。 功能终止时返回该功能（270）。 堆栈指针被还原并返回分配的堆栈空间（280）。