• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.409-414
• /
• 2008

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.233-246
• /
• 2005

To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

• Spatial Information Research
• /
• v.19 no.5
• /
• pp.63-74
• /
• 2011

Recently, there has been much interest in the spatial query which energy-efficiently acquires sensor readings from sensor nodes inside specified geographical area of interests. The centralized approach which performs the spatial query at a server after acquiring all sensor readings, though simple, it incurs high wireless transmission cost in accessing all sensor nodes. In order to remove the high wireless transmission cost, various in-network spatial indexing schemes have been proposed. They have focused on reducing the transmission cost by performing distributed spatial filtering on sensor nodes. However, these in-network spatial indexing schemes have a problem which cannot optimize both the spatial filtering and the wireless routing among sensor nodes, because these schemes have been developed by simply applying the existing spatial indexing schemes into the in-network environment. Therefore, we propose a new distributed spatial indexing scheme of the GR-tree. The GR-tree which form s a MBR-based tree structure, can reduce the wireless transmission cost by optimizing both the efficient spatial filtering and the wireless routing. Finally, we compare the existing spatial indexing scheme through extensive experiments and clarify our approach's distinguished features.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.61-69
• /
• 2012

Smart Grid is the next-generation intelligent power grid that maximizes energy efficiency with the convergence of IT technologies and the existing power grid. Smart Grid is created solution for standardization and interoperability. Smart Grid industry enables consumers to check power rates in real time for active power consumption. It also enables suppliers to measure their expected power generation load, which stabilizes the operation of the power system. Smart industy was ecolved actively cause Wireless communication is being considered for AMI system and wireless communication using ZigBee sensor has been applied in various industly. In this paper, we proposed efficient addressing scheme for improving the performance of the routing algorithm using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm has wasted address space. Therefore proposing x, y coordinate axes from divide address space of 16 bit to solve this problem. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verify performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduce multi hop than ZigBee distributed address assignment and another.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.274-280
• /
• 2011

Due to their rapid growth and new paradigm applications, wireless sensor networks(WSNs) are morphing into low power personal area networks(LoWPANs), which are envisioned to grow radically. The fragmentation and reassembly of IP data packet is one of the most important function in the 6LoWPAN based communication between Internet and wireless sensor network. However, since the 6LoWPAN data unit size is 102 byte for IPv6 MTU size is 1200 byte, it increases the number of fragmentation and reassembly. In order to reduce the number of fragmentation and reassembly, this paper presents a new scheme that can be applicable to 6LoWPAN. When a fragmented packet header is constructed, we can have more space for data. This is because we use 8-bits routing table ill instead of 16-bits or 54-bits MAC address to decide the destination node. Analysis shows that our design has roughly 7% or 22% less transmission number of fragmented packets, depending on MAC address size(16-bits or 54-bits), compared with the previously proposed scheme in RFC4944. The reduced fragmented packet transmission means a low power consumption since the packet transmission is the very high power function in wireless sensor networks. Therefore the presented fragmented transmission scheme is well suited for low-power wireless sensor networks.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.977-987
• /
• 2014

Many of the recent performance evaluation of clustering schemes in wireless sensor networks considered one sink node operation and fixed sink node location without mentioning about any network application requirements. However, application environments have variable requirements about their networks. In addition, network performance is sufficiently influenced by different sink node location scenarios in multi-hop based network. We also know that sink location can influence to the sensor network performance evaluation because of changed multipath of sensor nodes and changed overload spots in multipath based wireless sensor network environment. Thus, the performance evaluation results are hard to trust because sensor network is easily changed their network connection through their routing algorithms. Therefore, we suggest that these schemes need to evaluate with different sink node location scenarios to show fair evaluation result. Under the results of that, network performance evaluation results are acknowledged by researchers. In this paper, we measured several clustering scheme's performance variations in accordance with various types of sink node location scenarios. As a result, in the case of the clustering scheme that did not consider various types of sink location scenarios, fair evaluation cannot be expected.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.93-99
• /
• 2008

Most of the current research works on high-technology is being carried on to provide ubiquitous services to people. To make that possible, ubiquitous computing networks should be deployed in the first place, where ubiquitous sensor network (USN) will take a very big role. This paper is devoted to introduce a new transmission technique to make USN more independent and reliable as an infra-structure for ubiquitous services. The proposed scheme can elevate the network performance by ensuring the reliability of data transmission. Especially, the proposed scheme can reduce network traffic and communication cost by detecting data error without additional data and communication. In addition, it has an advantage of using the legacy routing protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2B
• /
• pp.120-129
• /
• 2012

Wireless mesh network (WMN) has recently emerged as a promising technology for tactical operation. If a platoon is organized with MPs, this system is suitable for tactical coverage is given for battle field where there is a shortage of wired infrastructure. However, MPs of typical WMN are generally fixed. This condition does not apply to diverse tactical scenarios. In this paper, it is considered that MPs have group mobility for flexible tactical networks. We propose cluster based multi-channel MAC scheme for mobilie WMN with single antenna condition. We have reduced the collision problems and message storming problems occur by mobility, so the reliability of WMN has been improved. Consequently, reliable communication is guaranteed by our framework in mobile WMN.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.05b
• /
• pp.1088-1092
• /
• 2005

하도에서의 홍수추적시 유역내의 지류 혹은 지표 및 지하수등은 추적대상이 되는 하도구간내에서 측방유입량의 되어 유출수문곡선의 첨두유량, 첨두시간, 수문곡선의 형태등에 영향을 주므로 정확한 산정이 필요하며, 직접유출수문곡선에서 측방유입량은 지표유출에 의해 발생하므로 강우발생시 유역에서 하도까지 걸리는 도달시간의 산정이나 측방유입속도의 결정이 필요하다. 기존의 강우-유출 수문모형은 지표수흐름의 복잡한 메카니즘 및 수리특성을 규명하는데 어려움이 있다. 본 연구에서는 관측유입수문곡선 및 유출수문곡선을 이용하여 측방유입량을 산정하고, 하도구간으로 유입되는 기지의 측방유입량으로부터 수리학적 홍수추적을 위한 지배방정식인 Saint-Venant방정식의 수치해법중 하나인 양해법에 diffusing scheme을 적용하였다. 또한 하도 전구간에 동일한 측방유입속도로 유입될 경우와 하도중심을 기점으로 상류부와 하류부로 구분하여 두 구간의 측방유입속도가 다른 두가지 경우에 대해 측방유입속도를 역추정하였으며, 계산 유출 수문곡선과 관측 유출수문곡선을 비교$\cdot$분석함으로써 구성한 홍수추적모형에 대한 정확성과 타당성, 적용 가능성등을 검증하고자 하였다.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.12-21
• /
• 2000

Arrangement graph has desirable properties for design requirements of a multihop lightwave network, such as node and edge symmetry, low diameter, simple routing, etc. In this paper, arrangement lightwave network based on arrangement graph model is proposed as new logical topology of multihop lightwave network. In the proposed scheme, multistar and grouping of network are used for improving reusability of wavelength and scalability. Also, this paper shows that the proposed scheme is an alternative logical topology for application requiring more nodes with limited wavelengths by evaluating performance with related works.