• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.499-504
• /
• 2010

The flooding is the simplest and effective way to disseminate a packet to all nodes in a wireless sensor network (WSN). However, basic flooding makes all nodes transmit the packet at least once, resulting in the broadcast storm problem in a serious case, in turn network resources become severely wasted. Particularly, power is one of the most valuable resources of WSNs as nodes are powered by battery, then the waste of energy by the basic flooding lessens the lifetime of WSNs. In order to solve the broadcast storm problem, this paper proposes a dynamic probabilistic flooding that utilizes the neighbor information like the number of child and sibling nodes. Simulation results show that the proposed method achieves a higher packet delivery ratio with the similar number of duplicate packets as compared to existing schemes.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.209-216
• /
• 2005

In wireless sensor networks, an estimation method is proposed for distances between nodes within two hops. The method uses only proximity information of nodes without physiccal distance measurements. It drastically improves the performance of localization algorithms based on Proximity information. In addition, it is the first method that estimates distances between nodes exactly in two hops. The distances are estimated from the number of common neighbors under an assumption that the number of common neighbors is proportional to the intersection of two unit disks centered at the two nodes. Simulation analysis shows that the estimation error is roughly from 10 to 20 percent of real distances. Meanwhile, the number of messages required by a distributed algorithm realizing this method is only two times the number of nodes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.112-114
• /
• 2002

본 논문에서는 방향성 안테나를 사용하는 이동 노드들로 구성된 애드 혹 네트워크에서의 새로운 매체 접근 제어 프로토콜을 제안한다. 고려된 네트워크에서는 단일 채널이 사용되며, 각각의 노드는 하나의 트랜시버와 m개의 방향성 안테나를 사용하며 특정 안테나를 필요시 on/off할 수 있다고 가정한다. 제안된 프로토콜은 은닉 단말기 문제를 해결하여 서로 다른 노드로부터 동일 노드로 전송되는 사용자 데이터 프레임의 충돌을 방지하는 한편, 노출 단말기 문제를 해결하여 이웃한 노드들이 서로 다른 노드들로 사용자 데이터 프레임을 동시에 전송 또는 수신할 수 있다. 네트워크 이용도에 있어서도 단일 채널 애드 혹 네트워크의 매체 접근 제어 프로토골 중 가장 우수한 것으로 알려진 DBTMA보다도 최대 25%정도 향상되었다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1679-1686
• /
• 2019

The main purpose of this research is to propose an approach for solving the packet loss problem by quickly adapting to topology change when nodes move in RPL-based IoT environment. In order to enhance mobility, every node is aware of the mobility of its neighbor nodes and quantifies the mobility level based on the number of control messages and all received packets. According to the mobility level, the DIO timer is changed. The proposed approach allows nodes to change their DIO timers according to their mobility levels to adapt topology changes and update paths to the sink. The performance of the proposed approach is evaluated using a Contiki-based Cooja simulator in various moving speeds. The simulation results show that the proposed approach copes with mobility scenarios better than the standard RPL by ascertaining that the packet delivery ratio is improved by 31.03%.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.583-588
• /
• 2007

It is easy to implement a temporary network with a mobile ad-hoc network in which mobile nodes have without using a infrastructure network. They depend on their limited power. Recently, it is a hot issue to save the energy in a mobile ad-hoc network because a mobile nodes have a limited energy. Research of IEEE 802.11 PSM was proposed in a single hop ad-hoc assumption. If IEEE 802.11 PSM is applied to multi hop ad-hoc network, non-optimal paths will be generated by the mobile nodes which didn't receive a message of routing request. Non-optimal paths increase not only a network latency but also energy consumption of mobile nodes. Reconfiguring algorithm of non-optimal paths caused by the mobile nodes which didn't receive a message of routing request is proposed in this paper. A mobile node can overhear the data in his range. A wireless medium is shared by all mobile nodes using the same bandwidth. All mobile nodes lookout the non-optimal paths with these properties of a medium, if non-optimal path is generated, optimal reconfiguring will be accomplished by modifying routing table of itself or sending a request message of routing update to nearby nodes. By reconfiguring the non-optimal paths to optimized ones, network latency and energy consumption was decreased. It is confirmed to ignore the overhead caused by a algorithm presented in this paper through the result of the simulation.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.274-280
• /
• 2011

Due to their rapid growth and new paradigm applications, wireless sensor networks(WSNs) are morphing into low power personal area networks(LoWPANs), which are envisioned to grow radically. The fragmentation and reassembly of IP data packet is one of the most important function in the 6LoWPAN based communication between Internet and wireless sensor network. However, since the 6LoWPAN data unit size is 102 byte for IPv6 MTU size is 1200 byte, it increases the number of fragmentation and reassembly. In order to reduce the number of fragmentation and reassembly, this paper presents a new scheme that can be applicable to 6LoWPAN. When a fragmented packet header is constructed, we can have more space for data. This is because we use 8-bits routing table ill instead of 16-bits or 54-bits MAC address to decide the destination node. Analysis shows that our design has roughly 7% or 22% less transmission number of fragmented packets, depending on MAC address size(16-bits or 54-bits), compared with the previously proposed scheme in RFC4944. The reduced fragmented packet transmission means a low power consumption since the packet transmission is the very high power function in wireless sensor networks. Therefore the presented fragmented transmission scheme is well suited for low-power wireless sensor networks.