• Journal of Internet of Things and Convergence
• /
• v.8 no.2
• /
• pp.1-6
• /
• 2022

This paper presents a regionalized time slotted channel hopping (TSCH) slotframe-based aerial data collection using wake-up radio. The proposed scheme aims to minimize the delay and energy consumption when an unmanned aerial vehicle (UAV) collects data from sensor devices in the large-scale service area. To this end, the proposed scheme divides the service area into multiple regions, and determines the TSCH slotframe length for each region according to the number of cells required by sensor devices in each region. Then, it allocates the cells dedicated for data transmission to the TSCH slotframe using the ID of each sensor device. For energy-efficient data collection, the sensor devices use a wake-up radio. Specifically, the sensor devices use a wake-up radio to activate a network interface only in the cells allocated for beacon reception and data transmission. The simulation results showed that the proposed scheme exhibited better performance in terms of delay and energy consumption compared to the existing scheme.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.171-178
• /
• 2007

In mobile ad hoc networks, an application scenario requires mostly group mobility behavior in the mix of group moving nodes and individually moving nodes. The nodes of those applications tend to belong to the movement group with similar movement behavior. Group mobility is one of the good methods to improve scalability, and reduces the protocol overhead. In this paper, we propose the multicast architecture which regards nodes that have equal group mobility in the heterogeneous group mobility network as the single entity with the multiple interfaces and composes multicast tree, The logical cooperative entity-based multicast architecture accommodates the scalability, the multicast tree simplification, and the protocol overhead reduction which arc obtained from the hierarchical multicast architecture, while it maintains the nat multicast architecture for the data transmission. It also prevents the concentration of the energy consumption dispersing data forwarding load into the several ingress/egress nodes. Results obtained through simulations show that logical cooperative entity based multicast protocol with multiple interfaces offers the protocol scalability and the efficient data transmission.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.513-522
• /
• 2008

Efficient data dissemination is one of the important subjects for sensor networks. High accessibility of the sensed data can be kept by deploying the data centric storage approach in which data is stored over the nodes in the sensor network itself rather than external storages or systems. The advantage of this approach is its direct accessibility in a real-time without the severe burden on delay and power dissipation on the data path to the external storages or systems. However, if the queries from many users are concentrated to the few nodes with data, then the response time could be increased and it could lead to the reduction of network life time by rapid energy dissipation caused by concentrated network load. In this paper, we propose a adaptive data centric storage scheme based on proxy trajectory (APT) mechanism. We highlight the data centric storage mechanism by taking account of supporting large number of users, and make it feasible to provide high-performance accessibility when a non-uniform traffic pattern is offered. Storing data around the localized users by considering spatial data-access locality, the proxy trajectory of APT provides fast response for the users. The trajectory, furthermore, may help the mobile users to roams freely within the area they dwell.

• The KIPS Transactions:PartC
• /
• v.15C no.3
• /
• pp.205-212
• /
• 2008

In the environment with multiple heterogeneous wireless sensor networks with a single point of sensed data collection or a gateway (GW), relay points (RPs) may be required for the energy efficient delivery of sensed data from static or mobile sinks to the GW. The optimal placement of RPs becomes an even more difficult problem if static sinks are dynamically added or the trajectory of mobile sinks can not be known in advance. In order to resolve this problem, we propose a mechanism to deploy RPs in a grid pattern and to use the tree-based relaying network for reducing the cost of the RP and for reducing the control overhead incurred by the route setup from sinks to the GW. For the performance evaluation of our proposed mechanism, we have carried out a numerical analysis on a single route setup from a sink to the GW and, for more general performance evaluations, ns-2 based simulations have been carried out. According to the performance evaluation results, our tree-based relaying network mechanism outperforms that based on AODV in terms of the data delivery time, the network service time and the control overhead.

• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.17-26
• /
• 2007

In this paper, we propose a basic virtual grid-based routing algorithm in order to devise an efficient routing method in ad hoc networks using the location information of nodes, energy level, etc. A packet is forwarded to the X-axis direction at first based on the location information of a destination node, and then it is forwarded to the Y-axis direction as its location becomes close to the destination from the viewpoint of the X-axis. Due to the selection of next hop nodes to deliver a packet from a certain node to a destination node, we can regard the whole network as a virtual grid network. The proposed routing algorithm determines routing paths using the local information such as the location information of a destination and its neighbor nodes. Thus, the routing path setup is achieved locally, by which we can expect reduction in network traffics and routing delays to a destination. To evaluate the performance of the proposed routing algorithm, we used the network simulator ns2 and compared its network throughput with that of an existing routing algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.1057-1069
• /
• 2017

The applications of Wireless Sensor Networks (WSN) are progressively adopting for various smart home services such as home automation, controlling smart home household appliances, constrained application services in a smart home, etc. However, enabling a seamless and ubiquitous WSN communication between the smart home appliances is still a challenging job. Therefore, in this paper, we propose a smart home control system using an Actuator based ZigBee networking (AZNET). The working of the proposed system is further divided into three phases, 1) an interference avoidance system is adopted to mitigate the effect of interference caused due to the co-existence of IEEE 802.11x based wireless local area networks (WLAN) and WSN, 2) a sensor-based smart light control system is used to fulfill the light requirement in the smart home using the sunlight with light source, and 3) an autonomous home management system is used to regulate the usage time of the electronic appliances in the smart home. The smart is tested in real time environment to use the sunlight with light sources in a various time of the day. Similarly, the performance of the proposed smart home is verified through simulation using C# programming language. The results and analysis revealed that the proposed smart home is less affected by the interference and efficient in reducing the energy consumption of the appliances available in the smart home scenario.

• Journal of Internet Computing and Services
• /
• v.12 no.2
• /
• pp.47-53
• /
• 2011

When some sensors under Wireless Sensor Networks fail or become energy-exhausted, redundant mobile sensors might be moved to recover the sensing holes. Within rugged terrain where wheeled sensors are unsuitable, other type of mobile sensors, such as hopping sensors, are needed. In this paper, we address the problem of relocating hopping sensors to the detected sensing holes. Recent study for this work considered the relocation using the shortest path between clusters; however, the shortest path might be used repeatedly and create other sensing holes. In order to overcome the mentioned problem, we propose relocation schemes using the most disjointed paths or multi-paths. Simulation results show that the proposed schemes guarantee more balanced migration distributions of efficient sensors and higher movement success ratios of required sensors than those of the shortest path-based scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.728-733
• /
• 2009

An ubiquitous environment has features like peer-to-peer and nomadic environments. Such features can be represented by peer-to-peer systems and mobile ad-hoc networks. P2P systems and MANETs share similar features, appealing for implementing P2P systems in MANET environment. However, if a P2P system designed for wired networks was applied to mobile ad-hoc environment, its performance was not good enough. Subsequently, this paper proposes a P2P system to improve performance using cross-layer design and the goodness of a node as a peer by using routing metric and P2P metric to choose favorable peers to connect. It also utilizes proactive approach for distributing peer information. The simulation results showed that the proposed system produced better performance in query success rate, query response time and energy consumption by reducing the routing path length.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.4
• /
• pp.40-46
• /
• 2011

Wireless Sensor Networks(WSNs) have shown a lot of good outcomes in providing a various functions depending on industrial expectations by deploying ad-hoc networking with helps of light loaded and battery powered sensor nodes. In particular, it is strongly requested to develop an algorithm of cross-layer control between 2-layer and 3-layer to deriver the sensing data from the end node to the sink node on time. In this paper, based on the above observation we have proposed an IEEE802.15.4 based self priority routing scheme under UC Berkely TinyOS platform. The proposed beacon based priority routing (BPR) algorithm scheme utilizes beacon periods in sending message with embedding the high priority data and thus provides high quality of service(QoS) in the given criteria. The performance measures are the packet Throughput, delivery, latency, total energy consumption. Simulation results under TinyOS Simulator(TOSSIM) have shown the proposed scheme outcome the conventional Ad hoc On-Demand Distance Vector(AODV) Routing.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.322-329
• /
• 2009

Many researches in wireless sensor networks have used a geographic routing to effectively disseminate data between sinks and sources. To know the location information, the geographic routing has proposed two manners. A sink-initiated and a source-initiated are flooding to disseminate its location information in WSN. However, these two manners have two problems. Firstly, whenever they move, they flood their location information. Secondly, their location information is disseminated unnecessary nodes besides nodes which send and receive data in actually. Therefore, this paper proposes a protocol that can solve the two problems and disseminate effectively data between few sinks and few sources. The proposed protocol exploits a location information manager that manages location information of the sinks and the sources. We also compare the performance of the proposed protocol with the existing protocols through a simulation.