• Title/Summary/Keyword: multi-hop wireless network

Search Result 384, Processing Time 0.03 seconds

Performance Analysis in Wireless Home Network using Bluetooth with SAW-ARQ (SAW-ARQ를 활용하여 블루투스 하에서의 무선 홈 네트워크의 성능 분석)

  • Hong, Sung-Hwa;Kang, Bong-Jik
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.5
    • /
    • pp.1608-1615
    • /
    • 2010
  • In this paper, we proposed the method called "DoublePico"(Double Piconet) forovercoming low data transmission rate in a scatternet. This needs a new Ad-hoc network topology to transmit with high rate. Every node performs the function of the relay station. DoublePico has two bluetooth devices that should form two different poconets; every node can make a link between two different piconets. Two different piconets are linked in one node by the link with two bluetooth divices thereby forming the Ad-Hoc network. In this paper, we shows the method of DoublePico which supports about 457kbps of the maximum data transmission rate. This method supports a higher data transmission rate than the traditional bluetooth's Ad-Hoc topology by using analysis and comparison of existing algorithm of bluetooth specification and simulation results. Specifically, this paper focuses on the impact of intererence on the PER (Packet Error Rate), throughput performance, and the throughput improvement with SAW(Stop and Wait)-ARQ scheme in DoublePico.

Performance analysis of ZRP supporting QoS for Mobile Ad hoc networks (MANET에 대해 QoS를 지원하는 ZRP의 성능연구)

  • Kwon, Oh-Seong;Jeong, Eui-Hyun;Kim, Jun-Nyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3B
    • /
    • pp.224-236
    • /
    • 2003
  • MANET(Mobile Ad hoc networks) is a mobile, multi-hop, and wireless network which is bandwidth constrained, energy constrained, resource constrained, autonomous, and self operating systems with dynamic topology. These constraints make the routing between communicating nodes in ad hoc networks difficult. In this paper we survey several routing protocol for mobile ad hoc networks. Especially, we focus on Zone Routing Protocol, hybrid routing framework suitable for a wide of mobile ad hoc networks and analyze performance of ZRP. In the case of ZRP protocol, it is essential that the use of optimal zone radius for efficient use. Otherwise it was proved through an simulation that performance of whole network is rapidly decrease with greatly increasing overhead of ZRP traffic that need for transmission of packet by IARP or IERP traffic. Also we suggest the process of finding QoS path that use in-band signal for QoS routing in ad hoc network. This method guarantees route that make real time multimedia service for QoS enabled path.

Coalition Formation Game Based Relay Selection and Frequency Sharing for Cooperative Relay Assisted Wireless D2D Networks with QoS Constraints

  • Niu, Jinxin;Tang, Wei;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5253-5270
    • /
    • 2016
  • With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.

A Multistage Authentication Strategy for Reliable N-to-N Communication in CGSR based Mobile Ad Hoc Networks (CGSR 기반의 이동 애드 흑 네트워크에서 신뢰성 있는 통신을 위한 노드간 인증 기법)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.6
    • /
    • pp.659-667
    • /
    • 2005
  • A Mobile Ad Hoc Network(MANET) is a multi hop wireless network with no prepared base stations or centralized administrations, where flocks of peer systems gather and compose a network. Each node operates as a normal end system in public networks. In addition to it, a MANET node is required to work as a router to forward traffic from a source or intermediate node to others. Each node operates as a normal end system in public networks, and further a MANET node work as a router to forward traffic from a source or intermediate node to the next node via routing path. Applications of MANET are extensively wide, such as battle field or any unwired place; however, these are exposed to critical problems related to network management, node's capability, and security because of frequent and dynamic changes in network topology, absence of centralized controls, restricted usage on network resources, and vulnerability oi mobile nodes which results from the special MANET's character, shared wireless media. These problems induce MANET to be weak from security attacks from eavesdropping to DoS. To guarantee secure authentication is the main part of security service In MANET because networks without secure authentication are exposed to exterior attacks. In this paper, a multistage authentication strategy based on CGSR is proposed to guarantee that only genuine and veritable nodes participate in communications. The proposed authentication model is composed of key manager, cluster head and common nodes. The cluster head is elected from secure nodes, and key manager is elected from cluster heads. The cluster head will verify other common nodes within its cluster range in MANET. Especially, ID of each node is used on communication, which allows digital signature and blocks non repudiation. For performance evaluation, attacks against node authentication are analyzed. Based on security parameters, strategies to resolve these attacks are drawn up.

Designing of Network based Tiny Ubiquitous Networked Systems (네트워크 기반의 소형 유비쿼터스 시스템의 개발)

  • Hwang, Kwang-Il;Eom, Doo-Seop
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.3
    • /
    • pp.141-152
    • /
    • 2007
  • In this paper, we present a network-oriented lightweight real-time system, which is composed of an event-driven operating system called the Embedded Lightweight Operating System (ELOS) and a generic multi hop ad hoc routing protocol suite. In the ELOS, a conditional preemptive FCFS scheduling method with a guaranteed time slot is designed for efficient real-time processing. For more elaborate configurations, we reinforce fault tolerance by supplementing semi-auto configuration using wireless agent nodes. The developed hardware platform is also introduced, which is a scalable prototype constructed using off-the-shelf components. In addition, in order to evaluate the performance of the proposed system, we developed a ubiquitous network test-bed on which several experiments with respect to various environments are conducted. The results show that the ELOS is considerably favorable for tiny ubiquitous networked systems with real-time constraints.

A Same-Priority Collision-Avoidance Algorithm Using RTS/CTS Frame in IEEE 802.11e EDCA under Network Congested Condition (IEEE 802.11e EDCA 네트워크 혼잡 환경에서 RTS/CTS 프레임을 이용한 동일 우선순위 충돌 회피 알고리즘)

  • Kwon, YongHo;Rhee, Byung Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.5
    • /
    • pp.425-432
    • /
    • 2014
  • The Enhanced Distributed Channel Access (EDCA) function of IEEE 802.11e standard defines contention window (CW) for different Access Category (AC) limits to support Quality-of-Service (QoS). However, it have been remained the problem that the collision probability of transmission is increasing in congested network. Several different solutions have been proposed but the collision occurs among same priority queue within the same station to compete the channel access. This paper presents an APCA (Advanced Priority Collision Avoidance) algorithm for EDCA that increases the throughput in saturated situation. The proposed algorithm use reserved field's bits of FC(Frame Control) using IEEE 802.11e standard's RTS/CTS (Request to Send / Clear to Send) mechanism to avoid data collision. The simulation results show that the proposed algorithm improves the performance of EDCA in packet loss. Using Jain's fairness index formula, we also prove that the proposed APCA algorithm achieves the better fairness than EDCA method under network congested condition.

TTCG : Three-Tier Context Gathering Technique for Mobile Devices (이동 단말기를 위한 Three-Tier 상황정보 수집 기법)

  • Sho, Su-Hwan;Kim, Seung-Hoon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.14 no.1
    • /
    • pp.64-72
    • /
    • 2009
  • Previous research on sensor networks mainly focused on efficient transmission of data from sensors to fixed sink nodes. Recently there has been active research on mobile sink nodes, but the re-search of an environment where both fixed sink nodes and mobile sinks are present at the same time is rather scarce. This paper proposes a technique for context gathering by mobile devices with the sink functionality added through fixed sinks under a previously built, cluster based multi hop sensor network environment. To this end, clustering of mobile devices were done based on the fixed sinks of a previously built sensor network, and by using appropriate fixed sinks, context gathering was made possible. By mathematical comparison with TTDD routing protocol, which was proposed for mobile sinks, it was conformed that performance increases in energy with the number of mobile sinks, and with the number of movements by mobile devices.

Energy-efficient intrusion detection system for secure acoustic communication in under water sensor networks

  • N. Nithiyanandam;C. Mahesh;S.P. Raja;S. Jeyapriyanga;T. Selva Banu Priya
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.6
    • /
    • pp.1706-1727
    • /
    • 2023
  • Under Water Sensor Networks (UWSN) has gained attraction among various communities for its potential applications like acoustic monitoring, 3D mapping, tsunami detection, oil spill monitoring, and target tracking. Unlike terrestrial sensor networks, it performs an acoustic mode of communication to carry out collaborative tasks. Typically, surface sink nodes are deployed for aggregating acoustic phenomena collected from the underwater sensors through the multi-hop path. In this context, UWSN is constrained by factors such as lower bandwidth, high propagation delay, and limited battery power. Also, the vulnerabilities to compromise the aquatic environment are in growing numbers. The paper proposes an Energy-Efficient standalone Intrusion Detection System (EEIDS) to entail the acoustic environment against malicious attacks and improve the network lifetime. In EEIDS, attributes such as node ID, residual energy, and depth value are verified for forwarding the data packets in a secured path and stabilizing the nodes' energy levels. Initially, for each node, three agents are modeled to perform the assigned responsibilities. For instance, ID agent verifies the node's authentication of the node, EN agent checks for the residual energy of the node, and D agent substantiates the depth value of each node. Next, the classification of normal and malevolent nodes is performed by determining the score for each node. Furthermore, the proposed system utilizes the sheep-flock heredity algorithm to validate the input attributes using the optimized probability values stored in the training dataset. This assists in finding out the best-fit motes in the UWSN. Significantly, the proposed system detects and isolates the malicious nodes with tampered credentials and nodes with lower residual energy in minimal time. The parameters such as the time taken for malicious node detection, network lifetime, energy consumption, and delivery ratio are investigated using simulation tools. Comparison results show that the proposed EEIDS outperforms the existing acoustic security systems.

An Energy-Balancing Technique using Spatial Autocorrelation for Wireless Sensor Networks (공간적 자기상관성을 이용한 무선 센서 네트워크 에너지 균등화 기법)

  • Jeong, Hyo-nam;Hwang, Jun
    • Journal of Internet Computing and Services
    • /
    • v.17 no.6
    • /
    • pp.33-39
    • /
    • 2016
  • With recent advances in sensor technology, CMOS-based semiconductor devices and networking protocol, the areas for application of wireless sensor networks greatly expanded and diversified. Such diversification of uses for wireless sensor networks creates a multitude of beneficial possibilities for several industries. In the application of wireless sensor networks for monitoring systems' data transmission process from the sensor node to the sink node, transmission through multi-hop paths have been used. Also mobile sink techniques have been applied. However, high energy costs, unbalanced energy consumption of nodes and time gaps between the measured data values and the actual value have created a need for advancement. Therefore, this thesis proposes a new model which alleviates these problems. To reduce the communication costs due to frequent data exchange, a State Prediction Model has been developed to predict the situation of the peripheral node using a geographic autocorrelation of sensor nodes constituting the wireless sensor networks. Also, a Risk Analysis Model has developed to quickly alert the monitoring system of any fatal abnormalities when they occur. Simulation results have shown, in the case of applying the State Prediction Model, errors were smaller than otherwise. When the Risk Analysis Model is applied, the data transfer latency was reduced. The results of this study are expected to be utilized in any efficient communication method for wireless sensor network monitoring systems where all nodes are able to identify their geographic location.

Operating μTESLA based on Variable Key-Slot in Multi-Hop Unattended WSN (멀티 홉 Unattended WSN에서 가변 키 슬롯 기반 μTESLA의 운영)

  • Choi, JinChun;Kang, Jeonil;Nyang, DaeHun;Lee, KyungHee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.3
    • /
    • pp.223-233
    • /
    • 2014
  • As a broadcast message authentication method in wireless sensor networks, ${\mu}$TESLA enables sensor nodes efficiently authenticate message from base station (BS). However, if we use ${\mu}$TESLA that has very short length of key slot in unattended wireless sensor network (UWSN), sensors may calculate a huge amount of hashs at once in order to verify the revealed secret key. In contrast, if we set the length of ${\mu}$TESLA's key slot too long in order to reduce the amount of hashs to calculate, BS should wait out the long slot time to release key. In this paper, we suggest variable key slot ${\mu}$TESLA in order to mitigate the problem. As showing experiment results, we prove that our suggestion improve sensor node's response time and decrease of number of hash function calculation.