• Title/Summary/Keyword: network node

Search Result 4,037, Processing Time 0.039 seconds

An efficient cluster header election scheme considering distancefrom upper node in zigbee environment (Zigbee 환경에서 Upper Node와의 거리를 고려한 효율적인클러스터 헤더 선출기법)

  • Park, Jong-Il;Lee, Kyoung-Hwa;Shin, Yong-Tae
    • Journal of Sensor Science and Technology
    • /
    • v.19 no.5
    • /
    • pp.369-374
    • /
    • 2010
  • It is important to efficiently elect the cluster header in Hierarchical Sensor Network, because it largely affects on the lifetime of the network. Therefore, recent research is focused on the lifetime extension of the whole network for efficient cluster header election. In this paper, we propose the new Cluster Header Election Scheme in which the cluster is divided into Group considering Distance from Upper Node, and a cluster header will be elected by node density of the Group. Also, we evaluate the performance of this scheme, and show that this proposed scheme improves network lifetime in Zigbee environment.

Implementation of LMPR on TinyOS for Wireless Sensor Network (전송 부하를 분산하는 무선 센서 네트워크 구축을 위한 TinyOS 기반 LMPR 구현)

  • Oh, Yong-Taek;Kim, Pung-Hyeok;Jeong, Kug-Sang;Choi, Deok-Jai
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.12
    • /
    • pp.136-146
    • /
    • 2006
  • In Wireless Sensor Network(WSN) a sensor node transfers sensing data to the base-node through multi-hop because of the limited transmission range. Also because of the limited energy of the sensor node, the sensor nodes are required to consume their energy evenly to prolong the lifetime of the network. LMPR is a routing protocol for WSN, LMPR configures the network autonomously based on level which is the depth from the base-node, and distributes the transmission and computation load of the network to each sensor node. This paper implements LMPR on TinyOS and experiments on the performance of LMPR in WSN. As the result, the average of the received rate of LMPR is 91.39% and LMPR distributes the load of the transmission and computation about 4.6 times compare to the shortest cost routing protocol. We expect LMPR evenly distributes the transmission and computation load of the network to each node, and the lifetime of the network will be longer than it used to be.

  • PDF

Handoff Improvement Method of an AP Choice for Guarantee of Mobile Node Network Performance according to Speed in Wireless LAN System (무선랜 시스템에서 속도에 따른 이동노드 네트워크 성능 보장을 위한 AP 선택 핸드오프 개선기법)

  • Kim, Dong-Geun;Park, Jae-Heung;Kim, Sang-Bok
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.6
    • /
    • pp.64-71
    • /
    • 2010
  • When Handoff occurs at wireless network, existing AP search chooses one of various APs according to signal strength information. However, IEEE 802.11 uses Medium Access method with CSMA/CA that competes to obtain a channel by sharing medium. Therefore, network performance is heavily affected by the number of nodes and network congestion aside from signal strength. This scheme presented an additional AP selection indicator and a new handoff algorithm to realize handoff guaranteeing the network performance of mobile node in a process selecting new AP. This indicator is includes a handoff cost function reflecting the network information of mobile node, and the mobile node made handoff guaranteeing the network performance using network information possible by using this. also we classified the nodes into high-speed node and low-speed node. Then, when Handoff occurs, high-speed node was made itself choose AP by signal strength information. We also made the low-speed node choose its AP by using AP network information which is applied area. Hence, we demonstrate through simulation that gets an improvement in performance, even in the wireless network which many users concurrently access to, and it has considerable effects on aspects of resources and network management by distribution of users.

A Node Deployment Strategy Considering Environmental Factors and the Number of Nodes in Surveillance and Reconnaissance Sensor Network (감시정찰 센서네트워크에서 환경요소와 노드수량을 고려한 노드 배치 전략)

  • Kim, Yong-Hyun;Chung, Kwang-Sue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.12B
    • /
    • pp.1670-1679
    • /
    • 2011
  • In the area of wireless sensor networks, sensor coverage and network connectivity problems are caused by a limited detection range and the communication distance of the nodes. To solve the coverage and connectivity problems, many studies are suggested, but most research is restricted to apply into the real environment because they didn't consider various environmental factors on wireless sensor network deployment. So in this paper, we propose a node deployment strategy considering environmental factors and the number of nodes in surveillance and reconnaissance sensor networks(SRSN). The proposed node deployment method divides the installation of the surveillance and reconnaissance sensor networks system into four steps such as identification of influences factors for node placement through IPB process, sensor node deployment based on sensing range, selection of monitoring site, and relay node deployment based on RF communication range. And it deploys the sensor nodes and relay nodes considered the features of the surveillance and reconnaissance sensor network system and environmental factors. The result of simulation indicates that the proposed node deployment method improves sensor coverage and network connectivity.

An Efficient Node Life-Time Management of Adaptive Time Interval Clustering Control in Ad-hoc Networks (애드혹 네트워크에서 적응적 시간관리 기법을 이용한 클러스터링 노드 에너지 수명의 효율적인 관리 방법)

  • Oh, Young-Jun;Lee, Knag-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.495-502
    • /
    • 2013
  • In the mobile Ad hoc Network(MANET), improving technique for management and control of topology is recognized as an important part of the next generation network. In this paper, we proposed an efficient node life time management of ATICC(Adaptive Time Interval Clustering Control) in Ad-hoc Networks. Ad-hoc Network is a self-configuration network or wireless multi-hop network based on inference topology. This is a method of path routing management node for increasing the network life time through the periodical route alternation. The proposed ATICC algorithm is time interval control technique depended on the use of the battery energy while node management considering the attribute of node and network routing. This can reduce the network traffic of nodes consume energy cost effectively. As a result, it could be improving the network life time by using timing control method in ad-hoc networks.

A Study on Efficient Network Topology Visualization using Node Centrality (노드 중심성을 이용한 효율적 네트워크 토폴로지 시각화 연구)

  • Chang, Beom-Hwan;Ryu, Jemin;Kwon, Koohyung
    • Convergence Security Journal
    • /
    • v.21 no.2
    • /
    • pp.47-56
    • /
    • 2021
  • Network topology visualization has been studied a lot since the past and developed with many tools. The network topology has strength in understanding the overall structure of a network physically and is useful for understanding data flow between nodes logically. Although there are existing tools, not many can be utilized efficiently while using the general network node data structure and express the topology similar to the actual network structure. In this paper, we propose an efficient method to visualize topology using only connection information of network nodes. The method finds the central node by using the centrality, the influence of nodes in the network, and visualizes the topology by dynamically segmenting all nodes and placing network nodes in 3D space using the weight of the child node. It is a straightforward method, yet it effectively visualizes in the form of an actual network structure.

A Stable Clustering Scheme Based on Node Mobility for Mobile Ad Hoc Networks (모바일 애드 혹 네트워크에서 이동성을 고려한 안정적인 클러스터링 기법)

  • Kim, Hyek-Su;Hwang, Jun-Ho;Yoo, Myung-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5B
    • /
    • pp.480-488
    • /
    • 2009
  • A mobile ad-hoc network is an autonomous collection of wireless mobile nodes that organizes a temporary network without any network infrastructure. Due to node mobility, it is a challenging task to maintain the network topology. In this paper, we propose a stable clustering algorithm that uses node mobility for cluster formation. In the proposed algorithm, the node mobility is measured by counting the number of nodes entering into/leaving from its transmission range. The node having the lowest mobility is selected as a cluster head. For topology maintenance with reduced control overhead, the cluster head adaptively controls the broadcasting period of hello message to the measured node mobility. Through computer simulations, it is verified that the proposed algorithm outperforms previous clustering algorithms in terms of control overhead, the rate of node mobility changes and the number of cluster head changes.

NUND: Non-Uniform Node Distribution in Cluster-based Wireless Sensor Networks

  • Ren, Ju;Zhang, Yaoxue;Lin, Xiaodong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.7
    • /
    • pp.2302-2324
    • /
    • 2014
  • Cluster-based wireless sensor network (WSN) can significantly reduce the energy consumption by data aggregation and has been widely used in WSN applications. However, due to the intrinsic many-to-one traffic pattern in WSN, the network lifetime is generally deteriorated by the unbalanced energy consumption in a cluster-based WSN. Therefore, energy efficiency and network lifetime improvement are two crucial and challenging issues in cluster-based WSNs. In this paper, we propose a Non-Uniform Node Distribution (NUND) scheme to improve the energy efficiency and network lifetime in cluster-based WSNs. Specifically, we first propose an analytic model to analyze the energy consumption and the network lifetime of the cluster-based WSNs. Based on the analysis results, we propose a node distribution algorithm to maximize the network lifetime with a fixed number of sensor nodes in cluster-based WSNs. Extensive simulations demonstrate that the theoretical analysis results determined by the proposed analytic model are consistent with the simulation results, and the NUND can significantly improve the energy efficiency and network lifetime.

Blockchain Technology and Utilization Schemes in Tactical Communication Network

  • Yoo, In-Deok;Lee, Woo-Sin;Kim, Hack-Joon;Jin, So-Yeon;Jo, Se-Hyeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.12
    • /
    • pp.49-55
    • /
    • 2018
  • In this paper, we propose schemes of blockchain utilization in tactical communication environment. The military tactical communication environment has similar characteristics with blockchain network such as distributed architecture, decentralization, and the need for data integrity. A communication node constituting a tactical communication network is constituted by a system capable of configuring and connecting a network for each node. When a communication node, having such capabilities, is configured as a node of blockchain network, various functions could be performed. In this paper, we propose utilization schemes of authentication, integrity, record management, and privilege control based blockchain technology. Functions for authentication, integrity verification, and record management need to ensure the stored data and could track history. The requirement of function's characteristics are matched to blockchain which is storing data sequentially and difficult to hack data, so that it could perform functionally and sufficiently well. Functions for authority control should be able to assign different privileges according to the state of the requestor. Smart contract will function when certain conditions are satisfied and it will be able to perform its functions by using it. In this paper, we will look over functions and utilization schemes of blockchain technology which could reliably share and synchronize data in a tactical communication environment composed of distributed network environment.

A Method to Find the Core Node Engaged in Malware Propagation in the Malware Distribution Network Hidden in the Web (웹에 숨겨진 악성코드 배포 네트워크에서 악성코드 전파 핵심노드를 찾는 방안)

  • Kim Sung Jin
    • Convergence Security Journal
    • /
    • v.23 no.2
    • /
    • pp.3-10
    • /
    • 2023
  • In the malware distribution network existing on the web, there is a central node that plays a key role in distributing malware. If you find and block this node, you can effectively block the propagation of malware. In this study, a centrality search method applied with risk analysis in a complex network is proposed, and a method for finding a core node in a malware distribution network is introduced through this approach. In addition, there is a big difference between a benign network and a malicious network in terms of in-degree and out-degree, and also in terms of network layout. Through these characteristics, we can discriminate between malicious and benign networks.