• Title/Summary/Keyword: Multihop wireless networks

Search Result 50, Processing Time 0.028 seconds

Multihop Transmission Protocol Using Cooperative Diversity over Rayleigh Fading Channel

  • Duy, Tran Trung;Kim, Jong-Soo
    • Journal of electromagnetic engineering and science
    • /
    • v.12 no.2
    • /
    • pp.135-141
    • /
    • 2012
  • In this paper, we propose a novel cooperative routing protocol (NCRP) for wireless networks. The proposed protocol uses cooperative transmission to improve end-to-end outage probability. The broadcast nature ensures that the destination can receive a packet from the source or from the relays and if it cannot correctly decode the packet, the successful relays will start a retransmission. The NCRP protocol can skip some transmissions from the intermediate relays, thereby reducing the total power consumption. Theoretical results are derived and verified by simulation results.

Contribution-Level-Based Opportunistic Flooding for Wireless Multihop Networks (무선 다중 홉 환경을 위한 기여도 기반의 기회적 플러딩 기법)

  • Byeon, Seung-gyu;Seo, Hyeong-yun;Kim, Jong-deok
    • Journal of KIISE
    • /
    • v.42 no.6
    • /
    • pp.791-800
    • /
    • 2015
  • In this paper, we propose the contribution-level-based opportunistic flooding in a wireless multihop network which achieves outstanding transmission efficiency and reliability. While the potential of the the predetermined relay node to fail in its receipt of broadcast packets is due to the inherent instability in wireless networks, our proposed flooding actually increases network reliability by applying the concept of opportunistic routing, whereby relay-node selection is dependent on the transmission result. Additionally, depending on the contribution level for the entire network, the proposed technique enhances transmission efficiency through priority adjustment and the removal of needless relay nodes. We use the NS-3 simulator to compare the proposed scheme with dominant pruning. The analysis results show the improved performance in both cases: by 35% compared with blind flooding from the perspective of the transmission efficiency, and by 20~70% compared to dominant pruning from the perspective of the reliability.

Energy and Delay Efficient Slot Reservation Mechanism for Multihop Wireless Sensor Networks (멀티 홉 무선 센서 네트워크에서 에너지 소모와 전송 지연에 효율적인 슬롯 예약 메커니즘)

  • Park, Hyun Joo;Kim, Seong Cheol;Jeon, Jun Heon;Kim, Hye-Yun;Kim, Joong Jae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.102-105
    • /
    • 2014
  • 일반적으로 무선 센서네트워크에서 각 센서 노드들에서 생성된 데이터는 목적지 노드 즉, 싱크(sink) 노드로 전송되어진다. 본 논문에서는 이처럼 데이터 전송이 몰리게 되는 sink 노드 근처에서 노드들 사이에 전송된 데이터 패킷의 충돌을 줄임으로 에너지 효율과 지연의 성능을 향상시킬 수 있는 TDMA 기반의 MAC 프로토콜을 제안한다. 전송할 데이터를 가지는 노드들은 먼저 싱크 노드에게 자신이 전송할 데이터의 양을 포함하는 RTS 패킷을 전송한다. 이 RTS 패킷을 받은 싱크 노드는 각 노드들에게 전송할 수 있는 전송 스케줄을 노드들에게 보내고, 이 스케줄을 받은 각 노드들은 전송 스케줄에 맞추어 자신들에게 할당된 슬롯에 데이터 패킷을 전송함으로 충돌 없이 bursty데이터를 전송한다. 이 방법을 통하여 각 노드들은 동시에 멀티 슬롯을 할당 받아 여러 패킷을 전송할 수 있다. 따라서 버스티한 트래픽 전송에서 지연(Delay)을 줄이는 동시에 충돌을 없애 데이터 전송 효율을 높일 수 있다.

  • PDF

Maximizing Information Transmission for Energy Harvesting Sensor Networks by an Uneven Clustering Protocol and Energy Management

  • Ge, Yujia;Nan, Yurong;Chen, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1419-1436
    • /
    • 2020
  • For an energy harvesting sensor network, when the network lifetime is not the only primary goal, maximizing the network performance under environmental energy harvesting becomes a more critical issue. However, clustering protocols that aim at providing maximum information throughput have not been thoroughly explored in Energy Harvesting Wireless Sensor Networks (EH-WSNs). In this paper, clustering protocols are studied for maximizing the data transmission in the whole network. Based on a long short-term memory (LSTM) energy predictor and node energy consumption and supplement models, an uneven clustering protocol is proposed where the cluster head selection and cluster size control are thoroughly designed for this purpose. Simulations and results verify that the proposed scheme can outperform some classic schemes by having more data packets received by the cluster heads (CHs) and the base station (BS) under these energy constraints. The outcomes of this paper also provide some insights for choosing clustering routing protocols in EH-WSNs, by exploiting the factors such as uneven clustering size, number of clusters, multiple CHs, multihop routing strategy, and energy supplementing period.

Cross-layer Optimization for Multichannel Multiradio Multisession Wireless Networks with Network Coding (멀티채널 멀티라디오 멀티세션 무선 네트워크를 위한 네트워크 코딩 기반 계층간 최적화 기법)

  • Park, Museong;Yoon, Wonsik
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.5
    • /
    • pp.18-24
    • /
    • 2013
  • Network coding has been extensively studied to increase the network throughput by exploiting the broadcast and overhearing capabilities. In this paper, we formulate a network utility maximization problem to improve the network utility in multichannel, multiradio and multisession wireless multihop network with intrasession network coding. To find the solution of this problem, we propose a congestion control, distributed rate control, and heuristic resource allocation algorithm. We find the network utility and evaluate the performance in multichannel, multiradio and multisession environment by using MATLAB. Finally, the results show that the proposed schemes can achieve throughput improvement by performing the network utility optimization in wireless multihop network.

Improved Throughput Scaling of Large Ultra-Wide Band Ad Hoc Networks (거대 초 광 대역 애드 혹 네트워크에서의 개선된 용량 스케일링)

  • Shin, Won-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.2
    • /
    • pp.303-310
    • /
    • 2014
  • We show improved throughput scaling laws for an ultra-wide band (UWB) ad hoc network, in which n wireless nodes are randomly located. First, we consider the case where a modified hierarchical cooperation (HC) strategy is used. Then, in a dense network of unit area, our result indicates that the derived throughput scaling depends on the path-loss exponent ${\alpha}$ for certain operating regimes due to the power-limited characteristics. It also turns out that the HC protocol is dominant for 2 < ${\alpha}$ < 3 while using the nearest multihop (MH) routing leads to a higher throughput for ${\alpha}{\geq}3$. Second, the impact and benefits of infrastructure support are analyzed, where m base stations (BSs) are regularly placed in UWB networks. In this case, the derived throughput scaling depends on ${\alpha}$ due to the power-limited characteristics for all operating regimes. Furthermore, it is shown that the total throughput scales linearly with parameter m as m is larger than a certain level. Hence, the use of either HC or infrastructure is helpful in improving the throughput of UWB networks in some conditions.

Improving IPTV Forwarding Masechanism in IEEE 802.16j MMR Networks Based on Aggregation

  • Brahmia, Mohamed-El-Amine;Abouaissa, Abdelhafid;Lorenz, Pascal
    • ETRI Journal
    • /
    • v.35 no.2
    • /
    • pp.234-244
    • /
    • 2013
  • Internet protocol television (IPTV) service depends on the network quality of service (QoS) and bandwidth of the broadband service provider. IEEE 802.16j mobile multihop relay Worldwide Interoperability for Microwave Access networks have the opportunity to offer high bandwidth capacity by introducing relay stations. However, to actually satisfy QoS requirements for offering IPTV services (HDTV, SDTV, Web TV, and mobile TV) for heterogeneous users' requests, providers must use a video server for each IPTV service type, which increases the network load, especially bandwidth consumption and forwarding time. In this paper, we present a solution for forwarding IPTV video streaming to diverse subscribers via an 802.16j broadband wireless access network. In particular, we propose a new multicast tree construction and aggregation mechanism based on the unique property of prime numbers. Performance evaluation results show that the proposed scheme reduces both bandwidth consumption and forwarding time.

A Cache Hit Ratio based Power Consumption Model for Wireless Mesh Networks (무선 메쉬 네트워크를 위한 캐시 적중률 기반 파워 소모 모델)

  • Jeon, Seung Hyun;Seo, Yong-jun
    • Journal of Industrial Convergence
    • /
    • v.18 no.2
    • /
    • pp.69-75
    • /
    • 2020
  • Industrial IoT has much interested in wireless mesh networks (WMNs) due to cost effectiveness and coverage. According to the advance in caching technology, WMNs have been researched to overcome the throughput degradation of multihop environment. However, there is few researches of cache power consumption models for WMNs. In particular, a wired line based cache power consumption model in content-centric networks is not still proper to WMNs. In this paper, we split the amount of cache power from the idle power consumption of CPU, and then the cache hit ratio proportional power consumption model (CHR-model) is proposed. The proposed CHR-model provides more accurate power consumption in WMNs, compared with the conventional cache power efficiency based consumption model (CPE-model). The proposed CHR-model can provide a reference model to improve energy-efficient cache operation for Industrial IoT.

A Novel Multihop Range-Free Localization Algorithm Based on Reliable Anchor Selection in Wireless Sensor Networks

  • Woo, Hyunjae;Lee, Chaewoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.574-592
    • /
    • 2016
  • Range-free localization algorithm computes a normal node's position by estimating the distance to anchors which know their actual position. In recent years, reliable anchor selection research has been gained a lot of attention because this approach improves localization accuracy by selecting the only subset of anchors called reliable anchor. The distance estimation accuracy and the geometric shape formed by anchors are the two important factors which need to be considered when selecting the reliable anchors. In this paper, we study the relationship between a relative position of three anchors and localization error. From this study, under ideal condition, which is with zero localization error, we find two conditions for anchor selection, thereby proposing a novel anchor selection algorithm that selects three anchors matched most closely to the two conditions, and the validities of the conditions are proved using two theorems. By further employing the conditions, we finally propose a novel range-free localization algorithm. Simulation results show that the proposed algorithm shows considerably improved performance as compared to other existing works.

Routing in Vehicular Ad Hoc Networks: Issues and Protocols

  • Shrestha, Raj K.;Moh, Sang-Man;Chung, Il-Yong
    • Korea Multimedia Society
    • /
    • v.12 no.4
    • /
    • pp.28-40
    • /
    • 2008
  • Vehicular ad hoc networks (VANETs) are a practical application class of wireless ad hoc networks, which consist of moving vehicles equipped with radio communication capabilities that collaborate to form a temporary network. This paper addresses issues and protocols of multihop routing in such emerging networks in the context of safety and infotainment applications. Due to the highly dynamic mobility of vehicles, frequent link breakage and short connection time are inevitable and, thus, the routing is a challenging task and interest for many researchers and industrial community. The frequent and dynamic change of topology makes the topology-based routing unreliable but the position-based routing more effective. The position-based routing consists of the location service which maps a node id to a geo-graphical position and the forwarding scheme which selects the next hop based on geo-graphical information of the node, its neighbors and the destination. The routing techniques are further categorized into geographical forwarding, trajectory forwarding and opportunistic forwarding based on the forwarding scheme. In this paper, we first present the distinguished properties of VANETs and the challenges and intractable issues posed in designing the routing protocols, followed by the comprehensive survey of existing routing protocols. Then, the different routing protocols designed for VANETs are compared in terms of characteristics, performance and application domains.

  • PDF