• Title/Summary/Keyword: node deployment

Search Result 147, Processing Time 0.033 seconds

Integrated USN Simulator for Efficient and Extensible Deployment (효율적이고 확장성 있는 배치를 위한 통합형 USN 시뮬레이터)

  • Kim, Hyun-Woo;Kim, Jun-Ho;Song, Eun-Ha;Jeong, Young-Sik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.698-701
    • /
    • 2012
  • IT기술의 급격한 발전을 토대로 유비쿼터스 사회로 변화함에 따라, USN(Ubiquitous Sensor Network) 기술이 매우 활성화되어있으며 연구 분야로 주목을 받고 있다. 그러나 USN 환경 구축시 효울적인지 실험을 하기위해서는 상당한 시간 및 비용이 따르게 된다. 본 논문에서는 USN 환경을 GML로 구성하고, 장애물에 대해 Map Object 여부 설정을 통해 타겟 지역 설정뿐만 아니라, MSN(Mobile Sensor Node)과 FSN(Fixed Sensor Node)에 대하여 동적 및 다양한 정적 배치가 가능한 멀티형 시뮬레이터인 IS_WSN을 제안한다.

On the Handling of Node Failures: Energy-Efficient Job Allocation Algorithm for Real-time Sensor Networks

  • Karimi, Hamid;Kargahi, Mehdi;Yazdani, Nasser
    • Journal of Information Processing Systems
    • /
    • v.6 no.3
    • /
    • pp.413-434
    • /
    • 2010
  • Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks (WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.

Secret Sharing based Node Authentication in FANET (FANET에서의 비밀분산 기반 노드 인증)

  • Yang Ji Hun;Lee Soo Jin
    • Convergence Security Journal
    • /
    • v.22 no.4
    • /
    • pp.25-34
    • /
    • 2022
  • This paper proposes a secret sharing based fast node authentication technique applicable to Flying Ad-Hoc Network (FANET) that can be used to construct self-organized communication network in multi drones and drone squadrons operations. Before deployment, each node stores an exponential share, exponential secret and a portion of PUF CRP table. After being deployed in the field, in the early-stage of network formation, each node broadcasts its ID, exponential share and a hash value of PUF Response and pseudo-random number. Then each node performs a reconstruction of the exponential secret using the exponential shares transmitted from neighboring nodes. When the exponential secret is reconstructed, simultaneous authentication is completed for all nodes that have transmitted the exponential share used in the reconstruction. A node that transmits an incorrect exponential share to disturb the reconstruction of the exponential secret during the authentication process can be detected before performing the reconstruction through the verification of the hash value, and will be excluded from the reconstruction.

A Secure Key Predistribution Scheme for WSN Using Elliptic Curve Cryptography

  • Rajendiran, Kishore;Sankararajan, Radha;Palaniappan, Ramasamy
    • ETRI Journal
    • /
    • v.33 no.5
    • /
    • pp.791-801
    • /
    • 2011
  • Security in wireless sensor networks (WSNs) is an upcoming research field which is quite different from traditional network security mechanisms. Many applications are dependent on the secure operation of a WSN, and have serious effects if the network is disrupted. Therefore, it is necessary to protect communication between sensor nodes. Key management plays an essential role in achieving security in WSNs. To achieve security, various key predistribution schemes have been proposed in the literature. A secure key management technique in WSN is a real challenging task. In this paper, a novel approach to the above problem by making use of elliptic curve cryptography (ECC) is presented. In the proposed scheme, a seed key, which is a distinct point in an elliptic curve, is assigned to each sensor node prior to its deployment. The private key ring for each sensor node is generated using the point doubling mathematical operation over the seed key. When two nodes share a common private key, then a link is established between these two nodes. By suitably choosing the value of the prime field and key ring size, the probability of two nodes sharing the same private key could be increased. The performance is evaluated in terms of connectivity and resilience against node capture. The results show that the performance is better for the proposed scheme with ECC compared to the other basic schemes.

Review on Energy Efficient Clustering based Routing Protocol

  • Kanu Patel;Hardik Modi
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.10
    • /
    • pp.169-178
    • /
    • 2023
  • Wireless sensor network is wieldy use for IoT application. The sensor node consider as physical device in IoT architecture. This all sensor node are operated with battery so the power consumption is very high during the data communication and low during the sensing the environment. Without proper planning of data communication the network might be dead very early so primary objective of the cluster based routing protocol is to enhance the battery life and run the application for longer time. In this paper we have comprehensive of twenty research paper related with clustering based routing protocol. We have taken basic information, network simulation parameters and performance parameters for the comparison. In particular, we have taken clustering manner, node deployment, scalability, data aggregation, power consumption and implementation cost many more points for the comparison of all 20 protocol. Along with basic information we also consider the network simulation parameters like number of nodes, simulation time, simulator name, initial energy and communication range as well energy consumption, throughput, network lifetime, packet delivery ration, jitter and fault tolerance parameters about the performance parameters. Finally we have summarize the technical aspect and few common parameter must be fulfill or consider for the design energy efficient cluster based routing protocol.

On the Security of Hierarchical Wireless Sensor Networks (계층적 무선 센서 네트워크에서의 키관리 메커니즘)

  • Hamid, Md. Abdul;Hong, Choong-Seon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.8
    • /
    • pp.23-32
    • /
    • 2007
  • We propose a group-based security scheme for hierarchical wireless sensor networks. We model the network for secure routing with 3-tier sensor network comprised of three types of nodes: Base Station, Group Dominator and ordinary Sensor Nodes. Group-based deployment is performed using Gaussian (normal) distribution and show that more than 85% network connectivity can be achieved with the proposed model. The small groups with pre-shared secrets form the secure groups where group dominators form the backbone of the entire network. The scheme is devised for dealing with sensory data aggregated by groups of collocated sensors; i.e., local sensed data are collected by the dominating nodes and sent an aggregated packet to the base station via other group dominators. The scheme is shown to be light-weight, and it offers a stronger defense against node capture attacks. Analysis and simulation results are presented to defend our proposal. Analysis shows that robustness can significantly be improved by increasing the deployment density using both the dominating and/or ordinary sensor nodes.

Impact of Power Control Optimization on the System Performance of Relay Based LTE-Advanced Heterogeneous Networks

  • Bulakci, Omer;Redana, Simone;Raaf, Bernhard;Hamalainen, Jyri
    • Journal of Communications and Networks
    • /
    • v.13 no.4
    • /
    • pp.345-359
    • /
    • 2011
  • Decode-and-forward relaying is a promising enhancement to existing radio access networks and is already standardized in 3rd generation partnership project (3GPP) as a part of long term evolution (LTE)-Advanced Release 10. Two inband operation modes of relay nodes are supported, namely type 1 and type lb. Relay nodes promise to offer considerable gain for system capacity or coverage, depending on the deployment prioritization, in a cost-efficient way. Yet, in order to fully exploit the benefits of relaying, the inter-cell interference which is increased due to the presence of relay nodes should be limited. Moreover, large differences in the received power levels from different users should be avoided. The goal is to keep the receiver dynamic range low in order to retain the orthogonality of the single carrier-frequency division multiple access system. In this paper, an evaluation of the relay based heterogeneous deployment within the LTE-Advanced uplink framework is carried out by applying the standardized LTE Release 8 power control scheme both at evolved node B and relay nodes. In order to enhance the overall system performance, different power control optimization strategies are proposed for 3GPP urban and suburban scenarios. A comparison between type 1 and type 1b relay nodes is as well presented to study the effect of the relaying overhead on the system performance in inband relay deployments. Comprehensive system level simulations show that the power control is a crucial means to increase the cell edge and system capacities, to mitigate inter-cell interference and to adjust the receiver dynamic range for both relay node types.

An Efficient Neighbor Discovery Method for Cooperative Video Surveillance Services in Internet of Vehicles (차량 인터넷에서 협업 비디오 감시 서비스를 위한 효율적인 이웃 발견 방법)

  • Park, Taekeun;Lee, Suk-Kyoon
    • Journal of Information Technology Services
    • /
    • v.15 no.4
    • /
    • pp.97-109
    • /
    • 2016
  • The rapid deployment of millions of mobile sensors and smart devices has resulted in high demand for opportunistic encounter-based networking. For the cooperative video surveillance of dashboard cameras in nearby vehicles, a fast and energy-efficient asynchronous neighbor discovery protocol is indispensable because a dashboard camera is an energy-hungry device after the vehicle's engine has turned off. In the existing asynchronous neighbor discovery protocols, all nodes always try to discover all neighbors. However, a dashboard camera needs to discover nearby dashboard cameras when an event is detected. In this paper, we propose a fast and energy-efficient asynchronous neighbor discovery protocol, which enables nodes : 1) to have different roles in neighbor discovery, 2) to discover neighbors within a search range, and 3) to report promptly the exact discovery result. The proposed protocol has two modes: periodic wake-up mode and active discovery mode. A node begins with the periodic wake-up mode to be discovered by other nodes, switches to the active discovery mode on receiving a neighbor discovery request, and returns to the periodic wake-up mode when the active discovery mode finishes. In the periodic wake-up mode, a node wakes up at multiples of number ${\alpha}$, where ${\alpha}$ is determined by the node's remaining battery power. In the active discovery mode, a node wakes up for consecutive ${\gamma}$ slots. Then, the node operating in the active discovery mode can discover all neighbors waking up at multiples of ${\beta}$ for ${\beta}{\leq}{\gamma}$ within ${\gamma}$ time slots. Since the proposed protocol assigns one half of the duty cycle to each mode, it consumes equal to or less energy than the existing protocols. A performance comparison shows that the proposed protocol outperforms the existing protocols in terms of discovery latency and energy consumption, where the frequency of neighbor discovery requests by car accidents is not constantly high.

A Study on Overlay based Mobile IPv6 Implementation and Performance Measuring in IEEE 802.16/WiBro Environment (WiBro 환경에서 Overlay 기반의 Mobile IPv6 이동성 구현 및 성능 시험에 관한 연구)

  • Lee, Jae-Ho;Ryu, Hyung-Keun;Lee, Jae-Jun;Kang, Sun-Moo;Lee, Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6B
    • /
    • pp.334-341
    • /
    • 2007
  • A Mobile IP is considered for the efficient mobility function in IEEE 802.16/WiBro environment. However, during the deployment of WiBro, only some of the ACRs(Access Control Router) can support the Mobile IP function. Therefore, a WiBro network can not support the mobility function for the mobile node. In this paper, we implement an overlay-based Mobile IP function and measure the performance through a field trial. Moreover, we evaluate the possibility of commercial deployment and suggest areas that need to be improved.

Policy for planned placement of sensor nodes in large scale wireless sensor network

  • Sharma, Vikrant;Patel, R.B;Bhadauria, HS;Prasad, D
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.3213-3230
    • /
    • 2016
  • Sensor node (SN) is a crucial part in any remote monitoring system. It is a device designed to monitor the particular changes taking place in its environs. Wireless sensor network (WSN) is a system formed by the set of wirelessly connected SNs placed at different geographical locations within a target region. Precise placement of SNs is appreciated, as it affects the efficiency and effectiveness of any WSN. The manual placement of SNs is only feasible for small scale regions. The task of SN placement becomes tedious, when the size of a target region is extremely large and manually unreachable. In this research article, an automated mechanism for fast and precise deployment of SNs in a large scale target region has been proposed. It uses an assembly of rotating cannons to launch the SNs from a moving carrier helicopter. The entire system is synchronized such that the launched SNs accurately land on the pre-computed desired locations (DLs). Simulation results show that the proposed model offers a simple, time efficient and effective technique to place SNs in a large scale target region.