• Journal of KIISE:Information Networking
• /
• v.35 no.2
• /
• pp.120-129
• /
• 2008

The purpose of sensor network is gathering the information from sensor nodes. If there are selfish node that deliberately avoid packet forwarding to save their own energy, the sensor network has trouble to collect information smoothly. To solve this problem we suggest a mechanism which uses credit payment schema according to the amount of forwarding packets. Sensor nodes use credits to send their own message and they forward packets of other sensor nodes to get credits. To offer authenticity we combined the roles of sink node and server, also we used piggybacking not to send additional report message. The packet trace route is almost fixed because sensor node doesn't have mobility. In this case, it happens that some sensor nodes which don't receive forwarding packets therefore they can't get credit. So, we suggested the way to give more credits to these sensor nodes. Finally, we simulated the suggested mechanism to evaluate performance with ns2(network simulator). As a result, packet transmission rate was kept on a high rate and the number of arrival packets to sink node was increased. Also, we could verify that more sensor nodes live longer due to deceasing the energy consumption of sensor nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2111-2131
• /
• 2015

Tiered wireless sensor network is a network model of flexibility and robustness, which consists of the traditional resource-limited sensor nodes and the resource-abundant storage nodes. In such architecture, collected data from the sensor nodes are periodically submitted to the nearby storage nodes for archive purpose. When a query is requested, storage nodes also process the query and return qualified data as the result to the base station. The role of the storage nodes leads to an attack prone situation and leaves them more vulnerable in a hostile environment. If any of them is compromised, fake data may be injected into and/or qualified data may be discarded. And the base station would receive incorrect answers incurring malfunction to applications. In this paper, an efficient verifiable top-k query processing scheme called EVTQ is proposed, which is capable of verifying the authentication and completeness of the results. Collected data items with the embedded information of ordering and adjacent relationship through a hashed message authentication coding function, which serves as a validation code, are submitted from the sensor nodes to the storage nodes. Any injected or incomplete data in the returned result from a corresponded storage node is detected by the validation code at the base station. For saving communication cost, two optimized solutions that fuse and compress validation codes are presented. Experiments on communication cost show the proposed method is more efficiency than previous works.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.5
• /
• pp.929-935
• /
• 2017

All sensor nodes generally determine their positions using anchor nodes that are located in underwater sensor networks. This paper proposes a Tabu search algorithm to determine the minimum number of anchor nodes for the location of all sensor nodes in underwater sensor networks. As the number of the sensor nodes increases in the network, the amount of calculation that determines the number of anchor nodes would be too much increased. In this paper, we propose a Tabu search algorithm that determines the minimum number of anchor nodes within a reasonable computation time in a high dense network, and propose an efficient neighborhood generating operation of the Tabu search algorithm for efficient search. The proposed algorithm evaluates those performances through some experiments in terms of the minimum number of anchor nodes and execution time. The proposed algorithm shows 5-10% better performance than the conventional algorithm.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.266-276
• /
• 2011

In wireless networks, it is well-known that intermediate nodes can be used as cooperative relays to reduce the transmission energy required to reliably deliver a message to an intended destination. When the network is under a central authority, energy allocations and cooperative pairings can be assigned to optimize the overall energy efficiency of the network. In networks with autonomous selfish nodes, however, nodes may not be willing to expend energy to relay messages for others. This problem has been previously addressed through the development of extrinsic incentive mechanisms, e.g., virtual currency, or the insertion of altruistic nodes in the network to enforce cooperative behavior. This paper considers the problem of how selfish nodes can decide on an efficient energy allocation and endogenously form cooperative partnerships in wireless networks without extrinsic incentive mechanisms or altruistic nodes. Using tools from both cooperative and non-cooperative game theory, the three main contributions of this paper are (i) the development of Pareto-efficient cooperative energy allocations that can be agreed upon by selfish nodes, based on axiomatic bargaining techniques, (ii) the development of necessary and sufficient conditions under which "natural" cooperation is possible in systems with fading and non-fading channels without extrinsic incentive mechanisms or altruistic nodes, and (iii) the development of techniques to endogenously form cooperative partnerships without central control. Numerical results with orthogonal amplify-and-forward cooperation are also provided to quantify the energy efficiency of a wireless network with sources selfishly allocating transmission/relaying energy and endogenously forming cooperative partnerships with respect to a network with centrally optimized energy allocations and pairing assignments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.777-785
• /
• 2009

In recent wireless sensor networks, stationary nodes and mobile nodes co-exist to provide a diverse service. However, because there are multiple mobile nodes located in the wireless sensor network, there is a potential for the instability due to the frequent network reconfiguration and the traffic caused by densely concentration of mobile nodes while mobile nodes are switching locations. In order to solve this problem, we propose the pumping node architecture to solve this traffic congestion problem due to the crowds of mobile nodes. The pumping node can be reduced heavy traffic by pumping through the backbone network caused by the densely concentration of the mobile nodes. As a result, the architecture reduces the traffic in the sensor network with high reliability.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.133-142
• /
• 2009

This paper proposes an analytical performance model of IEEE 802.15.4 in the presence of hidden nodes. Conventional 802.15.4 mathematical models assume ideal situations where every node can detect the transmission signal of every other nodes different from the realistic environments. Since nodes can be randomly located in real environments so that some nodes' presence is hidden from other ones, this assumption leads to wrong performance evaluation of 802.15.4. For solving this problem, we develop an extended performance model which combines the traditional 802.15.4 performance model with one for accounting the presence of hidden nodes. The extended model predicts the rapid performance degradation of 802.15.4 due to the small number of hidden nodes. The performance, for example, degrades by 62% at maximum when 5% of the total nodes are hidden. These predictions are confirmed to be equal to those of ns-2 simulations by less than 6% difference.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.114-121
• /
• 2015

Large-scale wireless sensor networks are constructed by using a large number of sensor nodes that are non-uniformly deployed over a wide area. As a result, the data collected by the sensor nodes are similar to that from one another since a high density of the sensor nodes may cause an overlap. As a result of the characteristics of the traffic, data is collected from a plurality of sensor nodes by a sink node, and when the sensor nodes transmit their collected data to the sink node, the sensor nodes around the sink node have a higher amount of traffic than the sensor nodes far away from the sink node. Thus, the former sensor encounter bottlenecks due to traffic congestion and have an energy hole problem more often than the latter ones, increasing energy consumption. This paper proposes a congestion control scheme that considers traffic flows in order to control traffic congestion of the sensor nodes that are non-uniformly deployed over a large-scale wireless sensor network.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.222-230
• /
• 2009

A sensor network is an important element of the ubiquitous and it consists of sensor fields that contain sensor nodes and sink nodes that collect data from sensor nodes. Since each sensor node has limited resources, one of the important issues covered in the past sensor network studies has been maximizing the usage of limited energy to extend network lifetime. However, most studies have only considered fixed sink nodes, which created various problems for cases with multiple mobile sink nodes. Accordingly, while maintaining routes to mobile sink nodes, this study aims to deploy the hybrid communication mode that combines single and multi-hop modes for intra-cluster and inter-cluster transmission to resolve the problem of failed data transmission to mobile sink nodes caused by disconnected routes. Furthermore, a 2-level hierarchical routing protocol was used to reduce the number of sensor nodes participating in data transmission, and cross-shape trajectory forwarding was employed in packet transmission to provide an efficient data dissemination method.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.9-18
• /
• 2008

Prevention of attacks being made through program modification in sensor nodes is one of the important security issues. The software-based attestation technology that verifies the running code by checking whether it is modified or not in sensor nodes is being used to solve the attack problem. However, the current software-based attestation techniques are not appropriate in sensor networks because not only they are targeting static networks that member nodes does not move, but also they lacks consideration on the environment that the trusted verifier may not exist. This paper proposes a mutual attestation protocol that is suitable for sensor networks by using SWATT(Software-based ATTestation) technique. In the proposed protocol, sensor nodes periodically notify its membership to neighbor nodes and carry out mutual attestation procedure with neighbor nodes by using SWATT technique. With the proposed protocol, verification device detects the sensor nodes compromised by malicious attacks in the sensor network environments without trusted verifier and the sensor networks can be composed of only the verified nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1224-1248
• /
• 2022

In various sensor network applications, such as climate observation organizations, sensor nodes need to collect information from time to time and pass it on to the recipient of information through multiple bounces. According to field tests, this information corresponds to most of the energy use of the sensor hub. Decreasing the measurement of information transmission in sensor networks becomes an important issue.Compression sensing (CS) can reduce the amount of information delivered to the network and reduce traffic load. However, the total number of classification of information delivered using pure CS is still enormous. The hybrid technique for utilizing CS was proposed to diminish the quantity of transmissions in sensor networks.Further the energy productivity is a test task for the sensor nodes. However, in previous studies, a clustering approach using hybrid CS for a sensor network and an explanatory model was used to investigate the relationship between beam size and number of transmissions of hybrid CS technology. It uses efficient data integration techniques for large networks, but leads to clone attacks or attacks. Here, a new algorithm called SBEA (Snowball Endurance Algorithm) was proposed and tested with a bow. Thus, you can extend the battery life of your WSN by running effective copy detection. Often, multiple nodes, called observers, are selected to verify the reliability of the nodes within the network. Personal data from the source centre (e.g. personality and geographical data) is provided to the observer at the optional witness stage. The trust and reputation system is used to find the reliability of data aggregation across the cluster head and cluster nodes. It is also possible to obtain a mechanism to perform sleep and standby procedures to improve the life of the sensor node. The sniffers have been implemented to monitor the energy of the sensor nodes periodically in the sink. The proposed algorithm SBEA (Snowball Endurance Algorithm) is a combination of ERCD protocol and a combined mobility and routing algorithm that can identify the cluster head and adjacent cluster head nodes.This algorithm is used to yield the network life time and the performance of the sensor nodes can be increased.