• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.244-250
• /
• 2011

Gossip is a well-known protocol which was proposed to implement broadcast service with a high reliability in an arbitrarily connected network of sensor nodes. The probabilistic techniques employed in gossip have been used to address many challenges which are caused by flooding in wireless sensor networks (WSNs). However, very little work has yet been done on real-time wireless sensor networks which require not only highly reliable packets reception but also strict time constraint of each packet. Moreover, the unique energy constraining feature of sensor makes existing solutions unsuitable. Combined with unreliable links, redundant messages overhead in real-time wireless sensor networks is a new challenging issue. In this paper, we introduce a Reliable Gossip Zone, a novel fine-tailored mechanism for real-time wireless sensor networks with unreliable wireless links and low packet redundancy. The key idea is the proposed forwarding probability algorithm, which makes forwarding decisions after the realtime flooding zone is set. Evaluation shows that as an oracle broadcast service design, our mechanism achieves significantly less message overhead than traditional flooding and gossip protocols.

• Journal of Internet Computing and Services
• /
• v.18 no.6
• /
• pp.65-73
• /
• 2017

Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

• Convergence Security Journal
• /
• v.16 no.5
• /
• pp.65-71
• /
• 2016

The use of Wireless Sensor Networks in many applications require not only efficient network design but also broad aspects of security, military and health care for hospital. Among many applications of WSNs, target tracking is an essential research area in WSNs. We need to track a target quickly as well as find the lost target in WSNs. In this paper, we propose an efficient target tracking method. We also propose an efficient clustering method and algorithm for target tracking.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.3
• /
• pp.75-88
• /
• 2011

Messages need to transmit to the neighbors securely in wireless sensor network, because a sensor node is deployed in hostile area. Thus it is necessary to support secure communication. One of the most important communication part is secure multicast. Especially, group rekeying is a big problem for multicast key management. So, group rekeying must be proceed securely when secrete information is exposed by attacker. Many group rekeying schemes have been studied for ad hoc networks. However, these schemes are Ill1desirable in WSNs. In this paper, we proposed a novel group rekeying scheme in WSNs that it has very powerful security.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3809-3822
• /
• 2017

Wireless Sensor Networks hold the limelight because of significant potential for distributed sensing of large geographical areas. The radio duty cycling mechanism that turns off the radio periodically is necessary for the energy conservation, but it deteriorates the network congestion when the traffic load is high, which increases the packet loss and the delay too. Although many papers for WSNs have tried to mitigate network congestion, none of them has mentioned the congestion problem caused by the radio duty cycling of MAC protocols. In this paper, we present a simple and efficient congestion control technique that operates on the radio duty cycling MAC protocol. It detects the congestion by checking the current queue size. If it detects the congestion, it extends the network capacity by adding supplementary wakeup times. Simulation results show that our proposed scheme highly reduces the packet loss and the delay.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.41-47
• /
• 2009

Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless sensor networks. However, the backbone nodes will need extra functionality and therefore consume more energy compared to the other nodes. The power consumption imbalance among sensor nodes may cause a network partition and failures where the transmission from some sensors to the sink node could be blocked. Hence optimal construction of the backbone is one of the pivotal problems in sensor network applications and can drastically affect the network's communication energy dissipation. In this paper a distributed algorithm is proposed to generate backbone trees through robust multi-hop clusters in wireless sensor networks. The main objective is to form a properly designed backbone through multi-hop clusters by considering energy level and degree of each node. Our improved cluster head selection method ensures that energy is consumed evenly among the nodes in the network, thereby increasing the network lifetime. Comprehensive computer simulations have indicated that the newly proposed scheme gives approximately 10.36% and 24.05% improvements in the performances related to the residual energy level and the degree of the cluster heads respectively and also prolongs the network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6B
• /
• pp.342-349
• /
• 2007

Clustering protocol of Wireless sensor networks(WSNs) not only reducing the volume of inter-node communication by the nodes's data aggreation but also extending the nodes's sleep times by cluster head's TDMA-schedule coordination. In order to extend network lifetime of WSNs, we propose ECS algorithm to select cluster-head using three variables. It consists of initial and current energy of nodes, round information and total numbers which have been selected as cluster head until current round.

• 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.

• International journal of advanced smart convergence
• /
• v.3 no.2
• /
• pp.14-17
• /
• 2014

Precision agriculture relies on information technology, whose precondition is providing real-time and accurate information. It depends on various kinds of advanced sensors, such as environmental temperature and humidity, wind speed, light intensity, and other types of sensors. Currently, it is a hot topic how to collect accurate information, the main raw data for agricultural experts, monitored by these sensors timely. Most existing work in WSNs addresses their fundamental challenges, including power supply, limited memory, processing power and communication bandwidth and focuses entirely on their operating system and networking protocol design and implementation. However, it is not easy to find the self-localization capability of wireless sensor networks. Because of constraints on the cost and size of sensors, energy consumption, implementation environment and the deployment of sensors, most sensors do not know their locations. This paper provides maximum likelihood estimators for sensor location estimation when observations are time-of arrival (TOA) range measurement.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.254-260
• /
• 2017

Data packets from sensor nodes scattered over measuring fields are generally forwarding to the sink node, which may be connected to the wired networks, in a wireless sensor network. So many data packets are gathered near the sink node, resulting in significant data packet collisions and severe transmission latency. In an event detection application such as object tracking and military, bursty data is generated when an event occurs. So many data packet should be transmitted in a limited time to the sink node. In this paper, we present a delay efficient and bursty traffic friendly MAC protocol called DEBF-MAC protocol for wireless sensor networks. The DEBF-MAC uses a slot-reserved mechanism and sleep period control method to send multiple data packets efficiently in an operational cycle time. Our simulation results show that DEBF-MAC outperforms DW-MAC and SR-MAC in terms of energy consumption and transmission delay.