• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.13-19
• /
• 2008

Time synchronization of nodes in sensor network synchronizes sensor nodes to one time clock. This is very essential in sensor networks so that the information collected and reported from the sensor nodes becomes meaningful. If sensor nodes are not synchronized, disaster report with time information can be wrong analyzed and this may lead to big calamity. With the limitation of battery and computing power, time synchronization algorithm imported in sensor nodes has to be as simple as it doesn't need big complexity, nor generates many synchronization messages. To reduce the synchronization error, hop count should be kept small between reference node to initiate synchronization and sensor nodes to be synchronized. Therefore, multiple reference nodes are used instead of single reference node. The use of multiple reference nodes introduce the requirement of synchronization among reference nodes in the network. Several algorithms have been proposed till now, but the synchronization among reference nodes are not well considered. This paper proposes improved time synchronization for sensor networks by synchronizing multiple reference nodes inside the network. Through simulation, we validated the effects of new algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.26-36
• /
• 2009

ad-hoc network is self-constructed by mobile hosts without any infrastructure. And the hosts collaborate with each other for routing packet by means of multi-hop communication. But it is too hard to deploy ad hoc network at the large area because of the salability problem caused by low network throughput. network throughput decrease is due to contention on the air among the neighbor host and single interface limitation, and broadcast flooding through overall network. In this paper, to solve the ad hoc scalability problem, we propose mesh network based scalable hierarchical ad hoc architecture, and also propose the adaptation methods for inter-working with the host not including ad hoc functions and the legacy infra-network.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.5
• /
• pp.25-34
• /
• 1997

Relatively slow tuning speed of optical device causes the unwanted delay in high speed single-hop multiwavelength networks. To lessen the overhead, we present a channel access protocol with dynamjic message scheduling. Th eframe structure of proposed protocol adopts hybrid multiaccess scheme in which WDMA is used as a basic multiaccess technique and TDMA is used to provide subchannels within a wavelength band. This architecture has two merits : the network extention is not limited by available number of wavelengths, and the transmission delay caused by optical device tuning time can to minimize the number of tunings. It schedules messages that require same wavelength channels sequencely, so the total transmission delay is reduced by decreasement of wavelength changes. The performance of proposed protocol is evaluated through numerical analysis based on probability and queueing theory. The peformance of proposed protocol is evaluated through numerical analysis based on probability and queueing theory. The numeric results show that the peformance of proposed protocol is better than that of previous one.

• Journal of electromagnetic engineering and science
• /
• v.9 no.3
• /
• pp.111-117
• /
• 2009

This paper presents an energy-efficient and bandwidth-efficient 2-1-1 relaying scheme in which a sensor node(SN) assists two others in their data transmission to a clusterhead in WSNs(Wireless Sensor Networks) using LEACH (Low-Energy Adaptive Clustering Hierarchy). We derive the closed-form BER expression of this scheme which is also a general BER one for the decode-and-forward cooperative protocol and prove that the proposed scheme performs the same as the conventional relaying scheme but obtains higher channel utilization efficiency. A variety of numerical results reveal the relaying can save the network energy up to 11 dB over single-hop transmission at BER of $10^{-3}$.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.3
• /
• pp.137-153
• /
• 2009

In this paper, we present an analytic model that evaluates the performance of B-MAC protocol under contention transmission conditions of two senders in a single-hop wireless sensor network. Our model considers the impact of several important factors such as sleep cycle, the backoff mechanism and incoming traffic loads. After obtaining the service delay distribution of a sending node and expected delay of a receiving node, an iterative algorithm is presented for calculating the performance measures such as expected energy consumption usage per packet and latency. Simulation results show that the proposed analytic model can accurately estimate the performance measures under different traffic conditions.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.4
• /
• pp.248-256
• /
• 2009

In this paper, under saturated traffic condition in a single-hop wireless sensor network, we present an analytic model that evaluates the performance of asynchronous MAC protocol which uses a preamble technique. Our model considers the impact of several important factors such as sleep cycle, the backoff mechanism and the number of contending nodes. After obtaining the cumulative backoff time of a sending node and expected delay of a receiving node, an iterative algorithm is presented for calculating the performance measures such as expected energy consumption usage per packet and latency. Simulation results show that the proposed analytic model can accurately estimate the performance measures under saturated traffic conditions.

• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.186-193
• /
• 2008

A two-hop multiple-input multiple-output (MIMO) relay network which comprises a multiple antenna source, an amplify-and-forward MIMO relay and many potential users are studied in this paper. Consider the achievable sum rate as the performance metric, a joint design method for the processing units of the BS and relay node is proposed. The optimal structures are given, which decompose the multiuser MIMO relay channel into several parallel single-input single-output relay channels. With these structures, the signal-to-noise ratio at the destination users is derived; and the power allocation is proved to be a convex problem. We also show that high sum rate can be achieved by pairing each link according to its magnitude. The sum rate of three broadcast strategies, time division multiple access (TDMA) to the strongest user, dirty paper coding (DPC), and beamforming (BF) are investigated. The sum rate bounds of these strategies and the sum capacity (achieved by DPC) gain over TDMA and BF are given. With these results, it can be easily obtained that how far away TDMA and BF are from being optimal in terms of the achievable sum rate.

• 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 Korea Contents Association
• /
• v.9 no.9
• /
• pp.31-40
• /
• 2009

What are important in wireless sensor networks are reliable data transmission, energy efficiency of each node, and the maximization of network life through the distribution of load among the nodes. The present study proposed DSPR, a dynamic unique path routing machanism that considered these requirements in wireless sensor networks. In DSPR, data is transmitted through a dynamic unique path, which has the least cost calculated with the number of hops from each node to the sink, and the average remaining energy. At that time, each node monitors its transmission process and if a node detects route damage it changes the route dynamically, referring to the cost table, and by doing so, it enhances the reliability of the network and distributes energy consumption evenly among the nodes. In addition, when the network topology is changed, only the part related to the change is restructured dynamically instead of restructuring the entire network, and the life of the network is extended by inhibiting unnecessary energy consumption in each node as much as possible. In the results of our experiment, the proposed DSPR increased network life by minimizing energy consumption of the nodes and improved the reliability and energy efficiency of the network.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.1
• /
• pp.39-45
• /
• 2008

This paper considers the multi-objective optimization of a multi-service arrayed waveguide grating-based single-hop WDM network with the two conflicting objectives of maximizing throughput while minimizing delay. This paper presents a genetic algorithm based methodology for finding the optimal throughput-delay tradeoff curve, the so-called Pareto-optimal frontier. Genetic algorithm based methodology provides the network architecture parameters and the Medium Access Control protocol parameters that achieve the Pareto-optima in a computationally efficient manner. The numerical results obtained with this methodology provide the Pareto-optimal network planning and operation solution for a wide range of traffic scenarios. The presented methodology is applicable to other networks with a similar throughput-delay tradeoff.