• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.144-153
• /
• 2010

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1363-1372
• /
• 2011

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.209-216
• /
• 2009

In the wireless sensor network, flooding is required for the dissemination of queries and event announcements. The simple flooding causes the implosion and the overlap problems, so the simple flooding may result in the reduced network lifetime. Therefore, in this paper, we propose the flooding overlay structure (FOS) so that the overhead caused by flooding can be reduced. We propose two variants of FOS mechanisms, the centralized FOS (CFOS) and the distributed FOS (DFOS). In CFOS, the sink collects the network topology information and selects forwarding nodes based on that information. On the other hand, DFOS allows each sensor node to decide whether to act as a forwarding node or not based on its local information. For the performance evaluation of our proposed mechanisms, we carry out NS-2 based simulations and compare ours with the simple flooding and the gossiping. The simulation results indicate that the proposed FOS mechanisms outperform the simple flooding in terms of the network lifetime and the gossiping in terms of the data delivery ratio.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.1
• /
• pp.50-54
• /
• 2016

A Wireless Sensor Network (WSN) is better than a conventional network for use in construction and Operations and Maintenance (O&M) because of its lower surveillance system cost. However, effective operation of a WSN is often difficult to obtain because the surveillance targets are usually fixed inside the building or underground. Therefore, this environmental constraint should be considered in the design of the WSN plant equipment surveillance system prior to installation. This study employs simulations of WSN-based fixed facility surveillance using the TinyOS TOSSIM simulator to investigate ideal types and setups of the WSN. Simulation target protocols included LEACH and flooding and gossiping protocols. The results show that the hierarchically-structured LEACH protocol demonstrated better load-balancing and efficiency than the flatly-structured flooding and gossiping protocol.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.872-874
• /
• 2003

가쉬평이란 그래프에서 각각의 점들이 각각 다튼 메시지들을 다른 모든 점들에게 전달하는 것이다. 이 논문에서는 그리드 구조에서 각각의 점들이 매번 인접한 하나의 점과 하나의 메시지를 서로 주고받을 수 있는 조건 하에서 가쉬핑을 빠르게 하는 알고리즘을 제시한다. m $\times$ n 그리드에서 가쉬핑을 하는 기존의 알고리즘은 (mn＋$\frac{1}{4}$mn＋2) 라운드가 걸렸는데 이는 이 문제의 알려진 하한인 (mn ＋ 1)과는 거리가 있었다. 우리는 mn이 홀수인 그리드 구조에서 가쉬핑을 (mn ＋ 9) 라운드 만에 ？낼 수 있는 알고리즘을 제시한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.685-689
• /
• 2007

Recently, wireless communication technology and state of art miniaturization has enabled the wireless sensor network with Smart Environmental sensors. The sensor network is a new field which has been researched vigorously in the ubiquitous computing and Ad-hoc network. How to efficiently use the limited energy in this USN(Ubiquitous sensor Networks) has been debated recently. We utilized the Directed Diffusion and Gossiping concept which is based on the Large scale Glass greenhouse and present a method to prolong the lifespan of the sensor network by operating variable time based this routing information on the average energy leftover. In this paper, we present a method to minimize the energy consumption of sensor node within Glass greenhouses and ensure a stable network operation at the same time through energy efficient routing among sensor nodes.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.485-486
• /
• 2007

Wireless Sensor Networking is state of the art technology that has a wide range of potential applications. Sensor network generally consists of a large number of distributed nodes that organize themselves into a multi-hop wireless network. Each node has one or more sensors, embedded processors and low-power radios, and is normally battery operated because of small size. In this paper wireless sensor networking technology applies to the environment monitoring system in the underground. This system can monitor a pollution level of the underground in realtime for keeping up a comfortable environment.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1722-1729
• /
• 2008

This paper describes the contents about the efficient routing technique for improvement of transmission in Wireless Sensor Networks. Existing flat-based routing protocols have several problems like data overlap and implosion. Gossiping Algorithm in WSN is able to reduce the overhead and transmit packets through already set up the path but it takes place the data delivery and problem of worst-case. In this paper, we try to solve two problems that are data delivery and worst-case by selecting neighbor nodes using RSSI and number of linkage. The proposed model is available to real-mote and we confirmed the improvement of the performance against existing models.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.17-23
• /
• 2016

In the future network such as Internet of Things (IoT), the number of computing devices are expected to grow exponentially, and each of the things communicates with the others and acquires information by itself. Due to the growing interest in IoT applications, the broadcasting in Opportunistic ad-hoc networks such as Machine-to-Machine (M2M) is very important transmission strategy which allows fast data dissemination. In distributed networks for IoT, the energy efficiency of the nodes is a key factor in the network performance. In this paper, we propose a fuzzy logic based probabilistic multi-hop broadcast (FPMCAST) algorithm which statistically disseminates data accordingly to the remaining energy rate, the replication density rate of sending node, and the distance rate between sending and receiving nodes. In proposed FPMCAST, the inference engine is based the fuzzy rule base which is consists of 27 if-then rules. It maps input and output parameters to membership functions of input and output. The output of fuzzy system defines the fuzzy sets for rebroadcasting probability, and defuzzification is used to extract a numeric result from the fuzzy set. Here Center of Gravity (COG) method is used to defuzzify the fuzzy set. Then, the performance of FPMCAST is evaluated through a simulation study. From the simulation, we demonstrate that the proposed FPMCAST algorithm significantly outperforms flooding and gossiping algorithms. Specially, the FPMCAST algorithm has longer network lifetime because the residual energy of each node consumes evenly.

• Journal of Computing Science and Engineering
• /
• v.2 no.3
• /
• pp.249-273
• /
• 2008

Epidemic protocols have two fundamental assumptions. One is the availability of a mechanism that provides each node with a set of log(N) (fanout) nodes to gossip with at each cycle. The other is that the network size N is known to all member nodes. While it may be trivial to support these assumptions in small systems, it is a challenge to realize them in large open dynamic systems, such as peer-to-peer (P2P) systems. Technically, since the most fundamental parameter of epidemic protocols is log(N), without knowing the system size, the protocols will be limited. Further, since the network churn, frequently observed in P2P systems, causes rapid membership changes, providing a different set of log(N) at each cycle is a difficult problem. In order to support the assumptions, the fanout nodes should be selected randomly and uniformly from the entire membership. This paper investigates one possible solution which addresses both problems; providing at each cycle a different set of log(N) nodes selected randomly and uniformly from the entire network under churn, and estimating the dynamic network size in the number of nodes. This solution improves the previously developed distributed algorithm called Shuffle to deal with churn, and utilizes the Shuffle infrastructure to estimate the dynamic network size. The effectiveness of the proposed solution is evaluated by simulation. According to the simulation results, the proposed algorithms successfully handle network churn in providing random log(N0 fanout nodes, and practically and accurately estimate the network size. Overall, this work provides insights in designing epidemic protocols for large scale open dynamic systems, where the protocols behave autonomically.