Abstract: Disclosed herein are a dynamic scheduling method for guaranteeing Quality of Service QoS depending on network transmission traffic and a system using the same. The dynamic scheduling method includes assigning communication channels to respective nodes based on Identifications (IDs) of parent nodes corresponding to the respective nodes, setting priorities for assignment of time slots to the respective nodes in each quarter based on data traffic volumes corresponding to the respective nodes, and assigning time slots to the respective nodes in each quarter depending on the set priorities for assignment of the time slots.

Abstract: Disclosed herein are a dynamic scheduling method for guaranteeing Quality of Service QoS depending on network transmission traffic and a system using the same. The dynamic scheduling method includes assigning communication channels to respective nodes based on Identifications (IDs) of parent nodes corresponding to the respective nodes, setting priorities for assignment of time slots to the respective nodes in each quarter based on data traffic volumes corresponding to the respective nodes, and assigning time slots to the respective nodes in each quarter depending on the set priorities for assignment of the time slots.

Abstract: There is provided a network join method including transmitting a long beacon message including transmission timing information of a first short beacon message to a child node network device, transmitting a first short beacon message including information regarding an interval in which it is possible to transmit a message, to the child node network device according to a transmission timing of the first short beacon message, receiving a slot allocation request message from the child node network device according to the interval in which it is possible to transmit a message, and checking whether the child node network device joins a network, and transmitting a slot allocation confirmation message to the child node network device.

Abstract: There is provided a network join method including transmitting a long beacon message including transmission timing information of a first short beacon message to a child node network device, transmitting a first short beacon message including information regarding an interval in which it is possible to transmit a message, to the child node network device according to a transmission timing of the first short beacon message, receiving a slot allocation request message from the child node network device according to the interval in which it is possible to transmit a message, and checking whether the child node network device joins a network, and transmitting a slot allocation confirmation message to the child node network device.

Abstract: A method and an apparatus for visualizing a scheduling result in a multicore system. A method for visualizing a scheduling result of a plurality of tasks with respect to a plurality of cores in a multicore system includes extracting scheduling data in a time section to be visualized, determining whether the number of the extracted scheduling data exceeds a preset first threshold value, if the number of the extracted scheduling data exceeds the preset first threshold value, performing reduction of the extracted scheduling data, and visualizing and outputting the reduced scheduling data.

Abstract: Disclosed herein is an apparatus and method for zero-configuration interworking between devices, which solves an expandability problem and does not require a home gateway. The apparatus for zero-configuration interworking between devices includes: an operation mode input unit for receiving an operation mode select signal; a human life standard message generation unit for generating a human life standard message corresponding to the operation mode select signal; a message transmission unit for broadcasting the human life standard message to all other devices in a home; a message reception unit for receiving a human life standard message from the other devices in the home; a setting information storage unit storing information of a preset human life mode; and an operation processing unit for processing an operation corresponding to a human life mode within the received human life standard message, according to the information of the setting information storage unit.

Abstract: Provided is an apparatus and method for setting an operation of a sensor node based on an amount of energy of the sensor node. A sensor node of a wireless sensor network system may include an energy identifier to identify an amount of energy of the sensor node; and a node setting unit to set the sensor node as one of a router node that relays communication with a neighbor node and a leaf node that does not relay the communication, based on the amount of energy of the sensor node.

Abstract: A collision avoidance method and an apparatus thereof in a wireless network are provided. The collision avoidance method in the wireless network includes receiving first data from a source node, determining whether a history in which data has been previously received from the source node is present, and determining a data transmission period of the source node based on the history when the history is present, and the data transmission period is calculated when data is received from the source node. Accordingly, a collision probability can be reduced in an environment in which wireless data is periodically transmitted in a CSMA/CA manner.

Abstract: A system and method for providing web service for smart objects are provided. The system includes a smart object and a repeater. The smart object receives a web service request for the smart object from a service-requesting user, and transmits a message including information on a web server associated with the web service request to a repeater. The repeater receives the message including the information on the web server associated with the web service request from the smart object, transfers the web service request to the web server and, when a response for the request is received from the web server, transfers the response to the service-requesting user. Accordingly, the present invention can provide a web service to independent of n insufficient memory capacity of a smart object and a limited network.

Abstract: The present invention relates to an augmented reality-based device control apparatus and method using local wireless communication. The device control apparatus includes an ID registration unit for registering ID information about a control target device located near the device control apparatus, and requesting and registering detailed information about an image and function of the control target device. An image analysis unit analyzes an image of the control target device captured by a camera. A device recognition unit compares a result of analysis of the image with the detailed information about the control target device, thus recognizing the to control target device. A control unit requests current state information from the control target device using the ID information about the control target device and displays the current state information and the detailed information about the function of the control target device, together with the image of the control target device.

Abstract: An apparatus for providing a parking management service includes: a client terminal for providing a user with a parking management service in a parking lot by using communication environment; a first sensor node, installed in a parking area in the parking lot, for sensing whether there is a vehicle in the parking area; a second sensor node, installed at a vehicle movement section in the parking lot, for sensing a vehicle moving in the parking area; and a parking management server for receiving sensing information from the first and second sensor nodes, generating real-time parking lot information, and providing the generated real-time parking lot information to the client terminal. The apparatus further includes a network provided among the client terminal, the first sensor node, the second sensor node and the parking management server for transmitting information for a parking management.

Abstract: Provided is a method of dynamically reallocating a thread stack in a multi-threaded operating system, and more particularly, a method of dynamically allocating a thread stack of a multi-threaded operating system in an embedded system for wireless sensor nodes. The method includes the steps of: measuring sizes of data and non-data sections of a stack with respect to each thread; determining a new size of the non-data section of each stack based on the size of the data section of the stack measured with respect to each thread; and adjusting the size of the non-data section of each stack to the determined new size. According to the method, even without the source code analysis, an amount of memory spaces to be used can be reduced compared to that of a conventional static stack allocation method.

Abstract: Provided is a method of dynamically reallocating a thread stack in a multi-threaded operating system, and more particularly, a method of dynamically allocating a thread stack of a multi-threaded operating system in an embedded system for wireless sensor nodes. The method includes the steps of: measuring sizes of data and non-data sections of a stack with respect to each thread; determining a new size of the non-data section of each stack based on the size of the data section of the stack measured with respect to each thread; and adjusting the size of the non-data section of each stack to the determined new size. According to the method, even without the source code analysis, an amount of memory spaces to be used can be reduced compared to that of a conventional static stack allocation method.

Abstract: Provided is a method of allocating a stack in a multi-threaded sensor operating system environment. The method dynamically allocates as much stack space as is required by a thread, thereby enabling efficient use of stack space. The method includes the steps of: whenever a function is called while a thread is performing an operation, dynamically allocating a stack space to be used by the called function; and when execution of the function is finished, returning the allocated stack space.