• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.758-767
• /
• 2017

IoT paradigm which makes a information without direct intervention of a human and interworks with other objects, humans and systems is attracting attention. It will be expected the number of smart devices equipped with sensors and wireless communication capabilities is reached to about 260 billion by 2020. With the vast amount of sending data generated from rapidly increasing number of smart devices, it will bring up the traffic growth over internet and congestion in wireless networks. In this paper, we utilize the smart device as a sink node to collect and forward the sensing data periodically in IoT and propose a heuristic algorithm for a selection of sink nodes' set with each sink node satisfies the QoS its applications because a selection of optimal sink nodes' set is NP-hard problem. The complexity of proposed heuristic algorithm is $O(m^3)$ and faster than the optimal algorithm.

• Management Science and Financial Engineering
• /
• v.16 no.3
• /
• pp.85-93
• /
• 2010

Given an undirected network with a set of source-sink pairs, we are assumed to get a benefit if a pair of source and sink nodes are connected. The k-edge survivability of a network is defined as the total benefit secured after arbitrarily selected k edges are destroyed. The problem of computing k-edge survivability is known to be NP-hard and has applications of evaluating the survivability or vulnerability of a network. In this paper, we consider the k-edge survivability problem restricted to ring networks and develop an algorithm to solve it in O($n^3$|K|) time where n is the number of nodes and K is the set of source-sink pairs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4738-4753
• /
• 2018

Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

• Journal of Information Processing Systems
• /
• v.12 no.2
• /
• pp.275-294
• /
• 2016

A primary task in wireless sensor networks (WSNs) is data collection. The main objective of this task is to collect sensor readings from sensor fields at predetermined sinks using routing protocols without conducting network processing at intermediate nodes, which have been proved as being inefficient in many research studies using a static sink. The major drawback is that sensor nodes near a data sink are prone to dissipate more energy power than those far away due to their role as relay nodes. Recently, novel WSN architectures based on mobile sinks and mobile relay nodes, which are able to move inside the region of a deployed WSN, which has been developed in most research works related to mobile WSN mainly exploit mobility to reduce and balance energy consumption to enhance communication reliability among sensor nodes. Our main purpose in this paper is to propose a solution to the problem of deploying mobile data collectors for alleviating the high traffic load and resulting bottleneck in a sink's vicinity, which are caused by static approaches. For this reason, several WSNs based on mobile elements have been proposed. We studied two key issues in WSN mobility: the impact of the mobile element (sink or relay nodes) and the impact of the mobility model on WSN based on its performance expressed in terms of energy efficiency and reliability. We conducted an extensive set of simulation experiments. The results obtained reveal that the collection approach based on relay nodes and the mobility model based on stochastic perform better.

• The Journal of the Korea Contents Association
• /
• v.10 no.8
• /
• pp.51-58
• /
• 2010

In data collection using a mobile sink, the time that sensor nodes are included in its communication radius is not uniform. The data collection schedule in non-uniform time is needed between a mobile sink and sensor nodes for efficient data collection. The existing data collection schemes using a mobile sink considered staying time in its communication range and data collected by the mobile sink. However, they did not consider the characteristics of data collected in sensor networks. In this paper, we propose a TDMA based schedule scheme that consists of the data collection period by each sensor nodes and the data collection period between a mobile sink and sensor nodes. Moreover, we propose a data collection scheme considering the variability of data in sensor networks. The proposed data collection scheme collects only data that changed larger than the threshold set by the user. In order to show the superiority of the proposed scheme, we compare it with DWEDF that aims to collect data uniformly. As a result, our experimental results show that the proposed scheme reduces about 23% energy consumption and the data collection failure of sensor nodes over the DWEDF.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1707-1718
• /
• 1996

Given a signal net N=s, 1,...,n to be the set of nodes, with s the source and the remaining nodes sinks, an MRDPT (minimum-cost rectilinear Steiner distance -preserving tree) has the property that the length of every source to sink path is equal to the rectilinear distance between the source and sink. The minimum- cost rectilinear Steiner distance-preserving tree minimizes the total wore length while maintaining minimal source to sink length. Recently, some heuristic algorithms have been proposed for the problem offending the MRDPT. In this paper, we investigate an optimal structure on the MRDPT and present a theoretical breakthrough which shows that the min-cost flow formulation leads to an efficient O(n2logm)2) time algorithm. A more practical extension is also in vestigated along with interesting open problems.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.480-490
• /
• 2015

The reliability of sensor networks is generally dependent on the battery power of the sensor nodes that it employs; hence it is crucial for the sensor nodes to efficiently use their battery resources. This research paper presents a method to increase the reliability of sensor nodes by constructing a connected dominating tree (CDT), which is a subnetwork of wireless sensor networks. It detects the minimum number of dominatees, dominators, forwarder sensor nodes, and aggregates, as well as transmitting data to the sink. A new medium access control (MAC) protocol, called Homogenous Quorum-Based Medium Access Control (HQMAC), is also introduced, which is an adaptive, homogenous, asynchronous quorum-based MAC protocol. In this protocol, certain sensor nodes belonging to a network will be allowed to tune their wake-up and sleep intervals, based on their own traffic load. A new quorum system, named BiQuorum, is used by HQMAC to provide a low duty cycle, low network sensibility, and a high number of rendezvous points when compared with other quorum systems such as grid and dygrid. Both the theoretical results and the simulation results proved that the proposed HQMAC (when applied to a CDT) facilitates low transmission latency, high delivery ratio, and low energy consumption, thus extending the lifetime of the network it serves.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.9
• /
• pp.861-868
• /
• 2016

Dummy messages are usually generated for faking in preserving the location privacy of a sink or source against the global eavesdropping in wireless networks. In this paper, we propose a new method in which a certain number of nodes determined by considering the required privacy level are made to transit to the dormant state doing nothing so that the total number of dummy messages is reduced, while the paths from the sink to the sources are ensured. Through simulation we verify the success ratio of path establishments between the sink and a set of sources and the location privacy level of them.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1043-1049
• /
• 2009

Broadcast of sink node is used for network management, data collection by query and synchronization in wireless sensor networks. Simple flooding scheme induces the broadcast storm problem. The MPR based broadcast schemes reduce redundant retransmission of broadcast packets. MPR is a set of one hop neighbor nodes which have to relay broadcast message to cover all two hop neighbors. Though MPR can reduce redundant retransmission remarkably, it still suffers from energy waste problem caused by collision and duplicate packets reception. This paper proposes a new MPR based sink broadcast scheme using 3-channel. The proposed scheme reduces energy consumption by avoiding duplicate packet reception, while increases reliability by reducing collision probability remarkably. The results of analysis and simulation show that the proposed scheme is more efficient in energy consumption compared to the MPR based scheme. The result also shows that the proposed scheme reduces delivery latency by evading a contention with other relay nodes and improves reliability of broadcast message delivery by reducing collision probability.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1955-1963
• /
• 2009

In the application of wireless sensor networks to monitor valuable assets under concern, the appearance of a certain asset can be identified and reported simultaneously by several adjacent nodes, and this may dissipate the power of related nodes and network bandwidth as well. In the proposed method, a node that senses the appearance of some asset is allowed to send the sensing-reporting packet only after it has been being idle for a certain period without receiving any DRP(Don't Report Packet) from neighbors. It turns out that not only the cost of propagating DRPs but also that of reporting the events to the sink becomes minimal when depth of each DRP propagation is 2. In case of depth 1, at least, two routes are set up for the delivery of the sensing-reporting packet hence, reliable transfer to the sink is provided.