• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.63-71
• /
• 2014

This paper proposes an algorithm that forms the clusters on the basis of hop distance in order to improve the actor coverage and connectivity in the sink-based wireless sensor and actor networks. The proposed algorithm forms the clusters that are distributed evenly in the target area by electing the CHs(Cluster Heads) at regular hop intervals from a sink. The CHs are elected sequentially from the sink in order to ensure the connectivity between the sink and the actors that are located on the CHs. Additionally, the electing are achieved from the area of the higher rate of the sensors density in order to improve the actor coverage. The number of clusters that are created in the target area and the number of the actors that are placed on the positions of the CHs are reduced by forming the clusters with regular distribution and minimizing the overlap of them through the proposed algorithm. Simulations are performed to verify that the proposed algorithm constructs the actor network that is connected to the sink. Moreover, we shows that the proposed algorithm improves the actor coverage and, therefore, reduces the amount of the actors that will be deployed in the region by 9~20% compared to the IDSC algorithm.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.113-122
• /
• 2008

Emerging of wireless sensor networks results in several modeling and design issues on the network simulations. In previous works, most researchers have used three evaluation approaches such as analysis method, computer simulation and real test-bed measurement in order to verify the performance of wireless sensor networks. Among these approaches, analysis method is widely used since the other approaches have significant drawbacks such as limitation of network power, computational problem of distribute processing and complication of debugging process. However, the analysis method also shows poor performance when it deals with complex operations in huge wireless sensor networks. Thus, in this paper, we design and develop SMAC and AODV protocols by using Ptolemy tool in order to improve the simulation performance. The developed Ptolemy actor can be easily adapted to compare and evaluate the various protocols for wireless sensor networks.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.330-340
• /
• 2012

In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.7
• /
• pp.540-544
• /
• 2007

Researches on Sensor Network has become much more active and is currently being applied to many different fields. However since sensor network is limited to only collecting and reporting information regarding a certain event, and requires human intervention with that given information, it is often difficult to react to an event or situation immediately and proactively. To overcome this kind of limitation, Wireless Sensor and Actor Networks (WSANs) with immediate-response Actor Nodes has been proposed which adds greater mobility and activity to exisiting sensor networks. Although WSANs shares many common grounds with sensor networks, it is difficult to apply exisiting security technologies due to the fact that WSAN contains Actor Nodes that are resource-independent and mobile. This research therefore seeks to demonstrate ways to provide security, integrity and authentication services for WSAN's secure operation, by separating networks into hierarchcial structure by each node's abilities and providing different encryption key-based secure protocols for each level of hierarchy: Pair-wise Key, Node Key, and Region Key for sensor levels, and Public Key for actor levels.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.291-296
• /
• 2008

Wireless network technologies are becoming more widely used in industrial environment. The industrial communication system requires a real-time delivery of messages. The sensors periodically senses the physical environment and wants to deliver the data in real-time to the sink. This paper proposes a real-time protocol for periodic messages on wireless sensor and actor networks to be used in industrial communications. The proposed protocol delivers the data message using the shortest path from the source and the nearest actor. The protocol considers the energy consumption by reducing the number of broadcast messages during flooding. We have evaluated the performance of the proposed protocol using QualNet simulator. The simulation results show that the data messages have been delivered in real-time and the number of broadcast messages is reduced from 90% to 35% compared the existing protocols.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1229-1242
• /
• 2017

In this paper, an interference aware distributed multi-channel MAC (IDMMAC) protocol is proposed for wireless sensor and actor networks (WSANs). The WSAN consists of a huge number of sensors and ample amount of actors. Hence, in the IDMMAC protocol a lightweight channel selection mechanism is proposed to enhance the sensor's lifetime. The IDMMAC protocol divides the beacon interval into two phases (i.e., the ad-hoc traffic indication message (ATIM) window phase and data transmission phase). When a sensor wants to transmit event information to the actor, it negotiates the maximum packet reception ratio (PRR) and the capacity channel in the ATIM window with its 1-hop sensors. The channel negotiation takes place via a control channel. To improve the packet delivery ratio of the IDMMAC protocol, each actor selects a backup cluster head (BCH) from its cluster members. The BCH is elected based on its residual energy and node degree. The BCH selection phase takes place whenever an actor wants to perform actions in the event area or it leaves the cluster to help a neighbor actor. Furthermore, an interference and throughput aware multi-channel MAC protocol is also proposed for actor-actor coordination. An actor selects a minimum interference and maximum throughput channel among the available channels to communicate with the destination actor. The performance of the proposed IDMMAC protocol is analyzed using standard network parameters, such as packet delivery ratio, end-to-end delay, and energy dissipation, in the network. The obtained simulation results indicate that the IDMMAC protocol performs well compared to the existing MAC protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.833-839
• /
• 2010

Mobility of sensor node is one of the rising issues in Wireless Sensor Networks (WSN). However, current security researches on WSN only consider static environments. Thus they are not sufficient to be deployed in the dynamic environment where the resource is limited. In this paper, we propose the efficient node authentication and key exchange protocol that reduces the overhead in node re-authentication.

• The Journal of Korea Robotics Society
• /
• v.4 no.3
• /
• pp.177-184
• /
• 2009

This paper presents an active assisted-living system in wireless sensor and actor network (WSAN) in which the mobile robot roles an actor. In order to provide assisted-living service to the elderly people, position recognition of the sensor node attached on the user and localization of the mobile robot should be performed at the same time. For the purpose, we use received signal strength indication (RSSI) to find the position of the person and ubiquitous sensor nodes including ultrasonic sensor which performs both transmission of sensor information and localization like global positioning system. Active services are moving to the elderly people by detecting activity sensor and visual tracking and voice chatting with remote monitoring system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.346-353
• /
• 2011

Routing schemes that service applications with various delay times, maintaining the long network life time are required in wireless sensor & actor networks. However, it is known that network lifetime and hop count of trees used in routing methods have the tradeoff between them. In this paper, we propose a Pareto Ant Colony Optimization algorithm to find the Pareto tree set such that it optimizes these both tradeoff objectives. As it enables applications which have different delay times to select appropriate routing trees, not only satisfies the requirements of various multiple applications but also guarantees long network lifetime. We show that the Pareto tree set found by proposed algorithm consists of trees that are closer to the Pareto optimal points in terms of hop count and network lifetime than minimum spanning tree which is a representative routing tree.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.414-426
• /
• 2021

In the task of data routing in Internet of Things enabled volatile underwater environments, providing better transmission and maximizing network communication performance are always challenging. Many network issues such as void holes and network isolation occur because of long routing distances between nodes. Void holes usually occur around the sink because nodes die early due to the high energy consumed to forward packets sent and received from other nodes. These void holes are a major challenge for I-UWSANs and cause high end-to-end delay, data packet loss, and energy consumption. They also affect the data delivery ratio. Hence, this paper presents an energy efficient watchman based flooding algorithm to address void holes. First, the proposed technique is formally verified by the Z-Eves toolbox to ensure its validity and correctness. Second, simulation is used to evaluate the energy consumption, packet loss, packet delivery ratio, and throughput of the network. The results are compared with well-known algorithms like energy-aware scalable reliable and void-hole mitigation routing and angle based flooding. The extensive results show that the proposed algorithm performs better than the benchmark techniques.