• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.600-605
• /
• 2006

센서 네트워크는 데이터를 수집하는 싱크 주변에 있는 센서 노드가 극심한 에너지 소비를 보이는 문제가 있다. 이러한 싱크 주변 센서 노드의 에너지 소비 분산을 위해 모바일 싱크를 사용한 데이터 수집방법에 대한 연구가 최근 활발히 진행되고 있다. 모바일 싱크를 사용하여 데이터를 수집하기 위해서는 각 센서 노드별 데이터 수신 순서를 스케줄링하여 각 센서 노드에게 균등한 데이터 전송 기회를 부여하는 것이 중요하다. 본 논문에서는 싱글 홉 센서 네트워크에서 모바일 싱크를 이용한 균등한 데이터 수집을 위한 데이터 가중치 기반 스케줄링기법인 DWEDF를 제안한다. 또한 시뮬레이션을 통해 여러 다른 스케줄링 기법들에 비해 약 1.5배에서 3배가량 높은 성능을 보임으로써 그 효율성을 검증하였다.

• Journal of Sensor Science and Technology
• /
• v.14 no.3
• /
• pp.198-205
• /
• 2005

Recently, the systems using multiple sensors such as magnetic, acoustic and pressure sensor are used for detection of underwater objects or vehicles. Those systems have difficulty of maintenance and repair because they operate underwater. Thus, this paper describes a hybrid detection system with long term operating reliability. This has a multi-signal transmission structure to have a high reliability. First, a signal transmission & receiving part, which transfers data from underwater sensors to land and receive control message from land through optical cable, has 4 multi-path. Second, the nodes for signal transmission are connected dually each other with single-hop construction and sensors are connected to a couple of neighboring nodes. This enables the output signal to transmit from a node to the next node and the next but one node together. Also, the signal from a sensor can be transmitted to two nodes at the same time. Therefore, the system with this construction has high reliability in long term operation because it makes possible to transmit sensor data to another node which works normally although a transmission node or cable in system have some faults.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5282-5300
• /
• 2017

Multi-hop cellular networks (MCNs) reduce the transmit power and improve the system performance. Recently, several research studies have been conducted on MCNs. The mobile relay selection scheme is a rising issue in the design of MCNs that achieves these advantages. The conventional opportunistic relaying (OR) is performed on the single factor for maximum signal-to-interference-plus-noise ratio (SINR). In this paper, a comprehensive OR scheme based on Bi-Target is proposed to improve the system throughput and reduce the relay handover by constraining the amount of required bandwidth and SINR. Moreover, the proposed algorithm captures the variability and the mobility that makes it more suitable for dynamic real scenarios. Numerical and simulation results show the superiority of the proposed algorithm in both enhancing the overall performance and reducing the handover.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.317-322
• /
• 2006

This paper presents an efficient user-cooperation protocol associated with cyclic coding for WSNs (Wireless Sensor Networks) using LEACH(Low-Energy Adaptive Clustering Hierarchy). Since the proposed user-cooperation requires no CSI(Channel State Information) at both transmitter and receiver, and encoding and decoding of cyclic codes are simple, the processing complexity of sensor nodes is significantly reduced. Simulation results reveal such a combination can save the network energy up to 10dB over single-hop transmission at BER of $10^{-4}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3034-3055
• /
• 2014

Wireless Sensor Networks have extensively been utilized for ambient data collection from simple linear structures to dense tiered deployments. Issues related to optimal resource allocation still persist for simplistic deployments including linear and hierarchical networks. In this work, we investigate the case of dimensioning parameters for linear and tiered wireless sensor network deployments with notion of providing extended lifetime and reliable data delivery over extensive infrastructures. We provide a single consolidated reference for selection of intrinsic sensor network parameters like number of required nodes for deployment over specified area, network operational lifetime, data aggregation requirements, energy dissipation concerns and communication channel related signal reliability. The dimensioning parameters have been analyzed in a pipeline monitoring scenario using ZigBee communication platform and subsequently referred with analytical models to ensure the dimensioning process is reflected in real world deployment with minimum resource consumption and best network connectivity. Concerns over data aggregation and routing delay minimization have been discussed with possible solutions. Finally, we propose a node placement strategy based on a dynamic programming model for achieving reliable received signals and consistent application in structural health monitoring with multi hop and long distance connectivity.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.176-192
• /
• 2014

The realization of Wireless Multimedia Sensor Networks (WMSNs) has been fostered by the availability of low cost and low power CMOS devices. However, the transmission of bulk video data requires adequate bandwidth, which cannot be promised by single path communication on an intrinsically low resourced sensor network. Moreover, the distortion or artifacts in the video data and the adherence to delay threshold adds to the challenge. In this paper, we propose a two stage Quality of Service (QoS) guaranteeing scheme called Prioritized Multipath WMSN (PMW) for transmitting H.264 encoded video. Multipath selection based on QoS metrics is done in the first stage, while the second stage further prioritizes the paths for sending H.264 encoded video frames on the best available path. PMW uses two composite metrics that are comprised of hop-count, path energy, BER, and end-to-end delay. A color-coded assisted network maintenance and failure recovery scheme has also been proposed using (a) smart greedy mode, (b) walking back mode, and (c) path switchover. Moreover, feedback controlled adaptive video encoding can smartly tune the encoding parameters based on the perceived video quality. Computer simulation using OPNET validates that the proposed scheme significantly outperforms the conventional approaches on human eye perception and delay.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.6
• /
• pp.499-505
• /
• 2009

Main design issues for MAC (Medium Access Control) protocol in underwater sensor networks are long propagation delay caused by the low speed of sound, difficult synchronization, and energy-limited node's life. We aimed to mitigate the problems of strict synchronization and channel inefficiency of TDMA and also the throughput degradation induced by unavoidable collisions in contention based MAC protocols. This proposed protocol improved not only the energy efficiency by adopting a sleep-mode, but also the throughput by reducing collisions and increasing channel efficiency.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.33-41
• /
• 2007

The IEEE 802.11 DCF channel access function allows single transmission inside two-hop network in order to avoid collisions and eliminate the hidden and exposed terminal problems. Singular transmission capability causes data frames waiting for the entire roundtrip time in the transmitter neighborhood, and results in increased frame latency and lower network throughput. Real-time and pervasive applications are severely affected for the lower medium utilization; especially with high network traffic. This work proposes a new scheme with the help of Frame Aggregation technique in IEEE802.11n and overcomes the single transmission barrier maintaining the basic DCF functionality. Proposed scheme allows parallel transmissions in non-interfering synchronized slots. Parallel transmissions bypass the conventional physical carrier sense and random Backoff time for several cases and reduce the frame latency and increase the medium utilization and network capacity.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.589-598
• /
• 2009

In wireless sensor networks, a node that reports information gathered from adjacent assets should relay packets appropriately so that its location context is kept private, and thereby helping ensure the security of the assets that are being monitored. Unfortunately, existing routing methods that counter the local eavesdropping-based tracing deal with a single asset, and most of them suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. In this paper, we propose a routing method, greedy perimeter stateless routing-based source-location privacy with crew size w (GSLP-w), that enhances location privacy of the packet-originating node (i.e., active source) in the presence of multiple assets. GSLP-w is a hybrid method, in which the next-hop node is chosen in one of four modes, namely greedy, random, perimeter, and retreat modes. Random forwarding brings the path diversity, while greedy forwarding refrains from taking an excessively long path and leads to convergence to the destination. Perimeter routing makes detours that avoid the nodes near assets so that they cannot be located by an adversary tracing up the route path. We study the performance of GSLP-w with respect to crew size w (the number of packets being sent per path) and the number of sources. GSLP-w is compared with phantom routing-single path (PR-SP), which is a notable routing method for source-location privacy and our simulation results show that improvements from the point of the ratio of safety period and delivery latency become significant as the number of source nodes increases.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.29-39
• /
• 2008

Greedy routing which is easy to apply to geographic wireless sensor networks is frequently used. Greedy routing works well in dense networks whereas in sparse networks it may fail. When greedy routing fails, it needs a recovery algorithm to get out of the communication void. However, additional recovery algorithm causes problems that increase both the amount of packet transmission and energy consumption. Communication void is a condition where all neighbor nodes are further away from the destination than the node currently holding a packet and it therefore cannot forward a packet using greedy forwarding. Therefore we propose a VODUA(Virtually Ordered Distance Upgrade Algorithm) as a novel idea to improve and solve the problem of void. In VODUA, nodes exchange routing graphs that indicate information of connection among the nodes and if there exist a stuck node that cannot forward packets, it is terminated using Distance Cost(DC). In this study, we indicate that packets reach successfully their destination while avoiding void through upgrading of DC. We designed the VODUA algorithm to find valid routes through faster delivery and less energy consumption without requirement for an additional recovery algorithm. Moreover, by using VODUA, a network can be adapted rapidly to node's failure or topological change. This is because the algorithm utilizes information of single hop instead of topological information of entire network. Simulation results show that VODUA can deliver packets from source node to destination with shorter time and less hops than other pre-existing algorithms like GPSR and DUA.