• Journal of Information Processing Systems
• /
• v.6 no.2
• /
• pp.147-162
• /
• 2010

In this paper, we present a fine-grained localization algorithm for wireless sensor networks using a mobile beacon node. The algorithm is based on distance measurement using RSSI. The beacon node is equipped with a GPS sender and RF (radio frequency) transmitter. Each stationary sensor node is equipped with a RF. The beacon node periodically broadcasts its location information, and stationary sensor nodes perceive their positions as beacon points. A sensor node's location is computed by measuring the distance to the beacon point using RSSI. Our proposed localization scheme is evaluated using OPNET 8.1 and compared with Ssu's and Yu's localization schemes. The results show that our localization scheme outperforms the other two schemes in terms of energy efficiency (overhead) and accuracy.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.9
• /
• pp.43-50
• /
• 2018

In this paper, we propose a hexagon model-based efficient beacon frame scheduling approach for wireless sensor networks. The existing beacon frame scheduling approaches use a lot of slots and subslots for the beacon frame scheduling. Thus, the data from source nodes are not efficiently delivered to a sink node. Also in case a sink node needs to broadcast a beacon frame to the nodes in the network, delivering the beacon frame to the network nodes is not efficient as well. Thus, to solve the problem, we use a hexagon model to find the number of slots and subslots for the beacon frame scheduling. By using them for the beacon frame scheduling, the proposed approach performs better than other approaches in terms of the data transmission delay, the number of received data, the beacon transmission delay and the number of relaying the beacon frames.

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

The three-dimensional triangulation algorithm that the beacon nodes can be allocated to dynamically in not the experimental region but the practical region is suggested, and the performance of the localization system adapting the suggested algorithm is analyzed. The suggested algorithm adapts the computation method of the three dimensional point that the surfaces of three spheres overlapped, while the traditional triangulation algorithm adapts the computation method of the two dimensional point that three circles are overlapped in order to compute the distance between beacon nodes and mobile node that means a radius. In addition to this, to analyze the performance of the localization system adapting the suggested algorithm, first of all, the allocation layout of beacon nodes is made, and the allocation layout is modeled by selection of ten random distance values between mobile node and beacon nodes for computer simulation of the practical model. Next, the two dimensional coordinator of mobile node that is calculated by the suggested algorithm and the traditional triangulation algorithm is compared with each other. The localization measuring performance about three dimensional coordinator(z axis) of the suggested algorithm is also obtained by comparing with that of the practical model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2223-2242
• /
• 2019

Distance Vector-Hop (DV-Hop) algorithm is widely used in node localization. It often suffers the wormhole attack. The current researches focus on Double-Wormhole-Node-Link (DWNL) and have limited attention to Multi-Wormhole-Node-Link (MWNL). In this paper, we propose a security DV-Hop algorithm (AMLDV-Hop) to resist MWNL. Firstly, the algorithm establishes the Neighbor List (NL) in initialization phase. It uses the NL to find the suspect beacon nodes and then find the actually attacked beacon nodes by calculating the distances to other beacon nodes. The attacked beacon nodes generate and broadcast the conflict sets to distinguish the different wormhole areas. The unknown nodes take the marked beacon nodes as references and mark themselves with different numbers in the first-round marking. If the unknown nodes fail to mark themselves, they will take the marked unknown nodes as references to mark themselves in the second-round marking. The unknown nodes that still fail to be marked are semi-isolated. The results indicate that the localization error of proposed AMLDV-Hop algorithm has 112.3%, 10.2%, 41.7%, 6.9% reduction compared to the attacked DV-Hop algorithm, the Label-based DV-Hop (LBDV-Hop), the Secure Neighbor Discovery Based DV-Hop (NDDV-Hop), and the Against Wormhole DV-Hop (AWDV-Hop) algorithm.

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

Zigbee is communication technology most ideal because Zigbee support low power communication and wide expansion in wireless home network. However, Zigbee is not popular, because of Zigbee always has Hidden Node Problem and Transit Delay Problem. We propose new Beacon Frame structure to solve the two problem in Zigbee. New Beacon Frame structure reduces a Super Frame Duration and add a same space of a Control Frame Duration. We expect to solved method of Hidden Node Problem that exchange terminal information to using RTS/CTS. Also, We expect to solved method of Transit Delay Problem that put Beacon between Control Frame Duration and Super Frame Duration for synchronization. We confirm new Beacon Frame to solved two problem in OPNET simulation at Zigbee QoS Parameters. We measure Delay(sec) for solution degree of Transit Delay Problem, and measure Throughput(bits/sec) and Load (bits/sec) for solution degree of Hidden Node Problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1423-1430
• /
• 2016

The MAC protocols, which are classified into synchronous and asynchronous MAC protocol in the wireless sensor network, have actively studied. Especially, the asynchronous MAC protocol needs to research on the algorithm synchronizing between nodes, since each node independently operates in its own duty cycle. Typically, Receiver-Initiated MAC protocol is the algorithm synchronizing particular nodes by using beacon immediately transmitted by each node when it wakes up. However, the sender consumes unnecessary energy because it blankly waits until receiving the receiver's beacon, even if it does not know when the receiver's beacon is transmitted. In this paper, we propose the MAC protocol which can improve the performance by selecting an optimal node between a sender and a receiver to overcome the disadvantages. The simulation results show that the proposed algorithm improves energy efficiency and decreases average delay time than the conventional algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1178-1181
• /
• 2009

Geographic forwarding algorithms을 사용하는 Georouting protocol에서는 route maintenance을 위해서 고정된 주기마다 beacon message을 이웃노드에 전송하는 fixed periodical beacon based route algorithm을 사용하여 mobile node 정보를 습득한다. Fixed periodical beacon scheme에서의 기존 연구 이슈는 이웃노드 정보의 신뢰성을 유지하기 위해서 다양한 mobility environment 환경에 맞도록 beacon 전송주기를 적절히 결정하는 연구가 진행되어 왔다. 이와 같은 연구에서는 long periodical interval 사용 시 이웃노드의 위치정보 error을 발생시킬 확률이 높으며 또한 short periodical interval 의 경우 네트워크 내에 high route overhead 을 유발시키는 단점을 가지고 있다. 따라서 고정된 주기 방법은 다양한 mobility environment에 잘 적용되지 못하며 또한 mobility environment 에서 발생하는 route maintenance 내에 이웃노드 정보에 대한 불확실성 문제가 빈번이 발생하여 경로 설정에 잘못된 정보를 제공하여 경로 신뢰성(path reliability)과 낮은 전송률 (transmission rate)을 야기한다. 본 논문에서는 이런 이웃노드 정보의 불확실성 문제를 극복하기 위해서 mobile node가 스스로 자신의 위치를 체크하여 routing table을 능동적으로 갱신하는 방법을 이용하여 이 문제를 극복할 수 있도록 하였다. 모의 실험은 ns2를 이용하여 실시하였으며 결과는 low/high mobility scenario에서는 기존 방법 보다 routing overhead 을 줄이면서 높은 전송률 (transmission rate)을 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.101-108
• /
• 2007

There nay be collisions among beacons from several full function devices in IEEE 802.15.4 sensor networks. These collision of beacons may cause devices to lose time synchronization, and thus be unable to association. To solve this problem, the IEEE 802.15.4b defines a new Post Beacon Period(PBP), but it does not still alleviate the beacon collision problem. In this paper, we propose two automatic beacon alignment schemes that a node itself can decide its beacon start time using its short address that has been assigned during association. We also simulate and investigate our proposed automatic beacon collision avoidance schemes using NS-2 simulator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4971-4987
• /
• 2019

Node localization is the basic task of underwater wireless sensor networks (UWSNs). Most of the existing underwater localization methods rely on ranging accuracy. Due to the special environment conditions in the ocean, beacon nodes are difficult to deploy accurately. The narrow bandwidth and high delay of the underwater acoustic communication channel lead to large errors. In order to reduce the ranging error and improve the positioning accuracy, we propose a localization algorithm based on ranging correction and inertial coordination. The algorithm can be divided into two parts, Range Correction based Localization algorithm (RCL) and Inertial Coordination based Localization algorithm (ICL). RCL uses the geometric relationship between the node positions to correct the ranging error and obtain the exact node position. However, when the unknown node deviates from the deployment area with the movement of the water flow, it cannot communicate with enough beacon nodes in a certain period of time. In this case, the node uses ICL algorithm to combine position data with motion information of neighbor nodes to update its position. The simulation results show that the proposed algorithm greatly improves the positioning accuracy of unknown nodes compared with the existing localization methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1873-1882
• /
• 2009

In the ad-hoc mode of IEEE 802.11 standard, beacon is used for power control and network alarming between each node, and also it is for the synchronization in controlling network as PCF. However beacon is also used to inform the neighbor nodes of itself except for original purpose in the environment of IEEE 802.11s. For this, the existing beacon's transmission mechanism can't perform a function in full. In this paper, we suggest much faster neighbor discovery reducing network congestion caused by beacon through modification of beacon transmission mechanism. And we will show that suggesting algorithm more faster full neighbor discovery than traditional neighbor discovery using for IEEE 802.11 through simulation and test in real ad-hoc network.