• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권5호
• /
• pp.949-966
• /
• 2013

Recently, Wireless Body Area Network (WBAN) has promise to revolutionize human daily life. The need for multiple sensors and constant monitoring lead these systems to be energy hungry and expensive with short operating lifetimes. In this paper, we offer a review of existing work of WBAN and focus on energy-aware management in it. We emphasize that nodes computation, wireless communication, topology deployment and energy scavenging are main domains for making a long-lived WBAN. We study the popular power management technique Dynamic Voltage and Frequency Scaling (DVFS) and identify the impact of slack time in Dynamic Power Management (DPM), and finally propose an enhanced dynamic power management method to schedule scaled jobs at slack time with the goal of saving energy and keeping system reliability. Theoretical and experimental evaluations exhibit the effectiveness and efficiency of the proposed method.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 춘계학술발표대회
• /
• pp.855-857
• /
• 2007

In recent years, Wireless Mesh Network (WMN) is a compelling topic to many network researchers due to its low cost in deployment, ease and simplicity in installation and scalability and robustness in operation. In WMN, Gateway nodes (Access Point-AP) are in charge of steering the traffic from the external network (e.g. Internet...) to client devices or mesh clients. The limited bandwidth of wireless links between Gateways and intermediate mesh routers makes the Gateways becomes the bottleneck of the mesh network in both uplink stream and downlink stream. In this paper, we propose a mechanism to permit Gateways collaboratively work to manipulate the traffic to fit our network. They will move the traffic from congested links to the unused capacity on other links.

• Journal of information and communication convergence engineering
• /
• 제16권1호
• /
• pp.6-11
• /
• 2018

It is important to find the random estimation points in wireless sensor network. A link quality indicator (LQI) is part of a network management service that is suitable for a ZigBee network and can be used for localization. The current quality of the received signal is referred as LQI. It is a technique to demodulate the received signal by accumulating the magnitude of the error between ideal constellations and the received signal. This proposed model accepts any number of random estimation point in the network and calculated its nearest anchor centroid node pair. Coordinates of the LQI sphere are calculated from the pair and are added iteratively to the initially estimated point. With the help of the LQI and weighted centroid localization, the proposed system finds the position of target node more accurately than the existing system by solving the problems related to higher error in terms of the distance and the deployment of nodes.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.1189-1190
• /
• 2008

Wireless sensor networks (WSN) have attracted much attention in recent years due to their potential use in many applications such as border protection and combat field surveillance. Given the criticality of such applications, maintaining a dependable operation of the network is a fundamental objective. However, the resource constrained nature of sensor nodes and the ad-hoc formation of the network, often coupled with an unattended deployment, pose non-conventional challenges and motivate the need for special techniques for dependable design and management of WSN. In this article, we highlight the potential of careful positioning of the base station (BS), which acts as a sink resources.

• Journal of Information Processing Systems
• /
• 제9권3호
• /
• pp.477-488
• /
• 2013

Wireless Sensor Networks (WSNs) are comprised of sensor nodes that forward data in the shape of packets inside a network. Proficient packet forwarding is a prerequisite in sensor networks since many tasks in the network, together with redundancy evaluation and localization, depend upon the methods of packet forwarding. With the motivation to develop a fault tolerant packet forwarding scheme a Self-Localized Packet Forwarding Algorithm (SLPFA) to control redundancy in WSNs is proposed in this paper. The proposed algorithm infuses the aspects of the gossip protocol for forwarding packets and the end to end performance of the proposed algorithm is evaluated for different values of node densities in the same deployment area by means of simulations.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.667-676
• /
• 2014

Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.787-806
• /
• 2016

Traditional radio-based gesture recognition approaches usually require the target to carry a device (e.g., an EMG sensor or an accelerometer sensor). However, such requirement cannot be satisfied in many applications. For example, in smart home, users want to control the light on/off by some specific hand gesture, without finding and pressing the button especially in dark area. They will not carry any device in this scenario. To overcome this drawback, in this paper, we propose three algorithms able to recognize the target gesture (mainly the human hand gesture) without carrying any device, based on just Radio Signal Strength Indicator (RSSI). Our platform utilizes only 6 telosB sensor nodes with a very easy deployment. Experiment results show that the successful recognition radio can reach around 80% in our system.

• 항공우주시스템공학회지
• /
• 제8권1호
• /
• pp.36-41
• /
• 2014

KAFASAT is a CubeSat which has a high level mission of testing the possibility of establishing the LEO satellite constellation providing the role of communication nodes and quasi-realtime image recognition of battlefield in accordance with the aspect of future-war-environment. The high level mission is developed using the Pugh selection method, which is one of system engineering tools. In order to accomplish the high level mission objectives and deduce engineering level requirements, system engineering tools such as Analytic Hierarchy Process and Quality Function Deployment are used. The subsystem synthesis in the context of system engineering process is done using a developed integrated design environment. The paper also includes the conceptual design results of the KAFASAT, which can be used as a baseline for upcoming preliminary design.

• 산업경영시스템학회지
• /
• 제24권62호
• /
• pp.11-20
• /
• 2001

At the initial deployment of B-ISDN, the heterogeneity of services and the bandwidth requirement make dimensioning of B-ISDN much more complicated than the dimensioning of homogeneous circuit or packet switched networks. Therefore B-ISDN must be extended gradually according to future telecommunication technology or service demands. In this paper, we propose a mathematical formulation for dimensioning problem of B-ISDN extension, considering the characteristics of ATM(Asynchronous Transfer Mode) such as various quality of services, the statistical multiplexing effects of VPCs(Virtual Path Connections) and the modularity of transmission links allocated when new B-ISDN nodes are given. The algorithm based on the simultaneous linear approximation technique and Lagrangian relaxation method and some numerical results are also presented.

• 대한산업공학회지
• /
• 제24권4호
• /
• pp.571-578
• /
• 1998

In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deployment of Synchronous Optical Networks (SONET), a standard of transmission using optical fiber technology. The problem is to find a minimum weight cycle (ring) covering a subset of nodes in the network considering node and link weights. We have developed two mathematical models, one of which is stronger than the other in terms of LP bounds, whereas the number of constraints of the weaker one is polynomially bounded. In order to solve the problem optimally, we have developed some preprocessing rules and valid inequalities. We have also prescribed an effective heuristic procedure for providing tight upper bounds. Computational results show that the stronger model is better in terms of computation time, and valid inequalities and preprocessing rules are effective for solving the problem optimally.