• Title/Summary/Keyword: Beijing Protocol

Search Result 38, Processing Time 0.021 seconds

Stability-based On-demand Multi-path Distance Vector Protocol for Edge Internet of Things

  • Dongzhi Cao;Peng Liang;Tongjuan Wu;Shiqiang Zhang;Zhenhu Ning
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.10
    • /
    • pp.2658-2681
    • /
    • 2023
  • In edge computing scenarios, IoT end devices play a crucial role in relaying and forwarding data to significantly improve IoT network performance. However, traditional routing mechanisms are not applicable to this scenario due to differences in network size and environment. Therefore, it becomes crucial to establish an effective and reliable data transmission path to ensure secure communication between devices. In this paper, we propose a trusted path selection strategy that comprehensively considers multiple attributes, such as link stability and edge cooperation, and selects a stable and secure data transmission path based on the link life cycle, energy level, trust level, and authentication status. In addition, we propose the Stability-based On-demand Multipath Distance Vector (STAOMDV) protocol based on the Ad hoc AOMDV protocol. The STAOMDV protocol implements the collection and updating of link stability attributes during the route discovery and maintenance process. By integrating the STAOMDV protocol with the proposed path selection strategy, a dependable and efficient routing mechanism is established for IoT networks in edge computing scenarios. Simulation results validate that the proposed STAOMDV model achieves a balance in network energy consumption and extends the overall network lifespan.

A MAC Protocol for Link Maintenance in Multichannel Cognitive Radio Ad Hoc Networks

  • Li, Jingye;Luo, Tao;Gao, Jing;Yue, Guangxin
    • Journal of Communications and Networks
    • /
    • v.17 no.2
    • /
    • pp.172-183
    • /
    • 2015
  • To provide an efficient link maintenance approach, we propose a cross layer medium access control (LM-MAC) protocol for multichannel cognitive radio ad hoc networks. Link establishment and reliable transmission are two key problems for a perfect link maintenance mechanism. Since the cognitive user (CU) pairs have to reestablish their links each frame, in the proposed MAC protocol, three different access modes are designed to guarantee transmission efficiency in continuous frames. To enhance the transmission reliability, each CU will create a father spectrum list (FSL) after joining in the network. FSL is divided into three groups of sub-channels with different functions to compensate the packet loss caused by the primary users' appearance and the deep fading. Meanwhile, since the transmitter and the receiver will share the same FSL, periodical cooperative sensing is adopted to further optimize the former problem. Finally, compared with the existing opportunistic multichannel (OMC)-MAC protocol, the proposed LM-MAC protocol achieves better system performance in terms of saturation throughput, continuity and access delay.

Flexible Protocol Reconfiguration for Emergency Communication Systems

  • Zhang, Ji;Li, Hai;Hou, Shujuan
    • ETRI Journal
    • /
    • v.33 no.1
    • /
    • pp.18-26
    • /
    • 2011
  • The necessity for services of emergency communication systems to be uninterrupted and reliable has brought forward strict requirements for express software upgrades of base stations. Based on reconfigurability technology, this paper presents a protocol reconfiguration scheme for emergency communication base stations. By introducing the concept of 'local safe state,' the proposed scheme could make the updating and replacement of the protocol software flexible and maintain interactions during the updating procedure to achieve seamless system upgrades. Further, taking TETRA protocol stack and VxWorks operating system as an example, specific processes and realization methods of reconfiguration are proposed in this paper, along with the measurements of the factors impacting on the system performance. Simulation results show that, compared with traditional technology, the method proposed significantly improves the system efficiency and does not interrupt system services.

Optimal Energy-Efficient Power Allocation and Outage Performance Analysis for Cognitive Multi-Antenna Relay Network Using Physical-Layer Network Coding

  • Liu, Jia;Zhu, Ying;Kang, GuiXia;Zhang, YiFan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.3018-3036
    • /
    • 2013
  • In this paper, we investigate power allocation scheme and outage performance for a physical-layer network coding (PNC) relay based secondary user (SU) communication in cognitive multi-antenna relay networks (CMRNs), in which two secondary transceivers exchange their information via a multi-antenna relay using PNC protocol. We propose an optimal energy-efficient power allocation (OE-PA) scheme to minimize total energy consumption per bit under the sum rate constraint and interference power threshold (IPT) constraints. A closed-form solution for optimal allocation of transmit power among the SU nodes, as well as the outage probability of the cognitive relay system, are then derived analytically and confirmed by numerical results. Numerical simulations demonstrate the PNC protocol has superiority in energy efficiency performance over conventional direct transmission protocol and Four-Time-Slot (4TS) Decode-and-Forward (DF) relay protocol, and the proposed system has the optimal outage performance when the relay is located at the center of two secondary transceivers.

A Novel Improved Energy-Efficient Cluster Based Routing Protocol (IECRP) for Wireless Sensor Networks

  • Inam, Muhammad;Li, Zhuo;Zardari, Zulfiqar Ali
    • Journal of information and communication convergence engineering
    • /
    • v.19 no.2
    • /
    • pp.67-72
    • /
    • 2021
  • Wireless sensor networks (WSNs) require an enormous number of sensor nodes (SNs) to maintain processing, sensing, and communication capabilities for monitoring targeted sensing regions. SNs are generally operated by batteries and have a significantly restricted energy consumption; therefore, it is necessary to discover optimization techniques to enhance network lifetime by saving energy. The principal focus is on reducing the energy consumption of packet sharing (transmission and receiving) and improving the network lifespan. To achieve this objective, this paper presents a novel improved energy-efficient cluster-based routing protocol (IECRP) that aims to accomplish this by decreasing the energy consumption in data forwarding and receiving using a clustering technique. Doing so, we successfully increase node energy and network lifetime. In order to confirm the improvement of our algorithm, a simulation is done using matlab, in which analysis and simulation results show that the performance of the proposed algorithm is better than that of two well-known recent benchmarks.

Cooperative spectrum leasing using parallel communication of secondary users

  • Xie, Ping;Li, Lihua;Zhu, Junlong;Jin, Jin;Liu, Yijing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.8
    • /
    • pp.1770-1785
    • /
    • 2013
  • In this paper, a multi-hop transmission protocol based on parallel communication of secondary users (SUs) is proposed. The primary multi-hop network coexists with a set of SUs by cooperative spectrum sharing. The main optimization target of our protocol is the overall performance of the secondary system with the guarantee of the primary outage performance. The energy consumption of the primary system is reduced by the cooperation of SUs. The aim of the primary source is to communicate with the primary destination via a number of primary relays. SUs may serve as extra decode-and-forward relays for the primary network. When an SU acts as a relay for a primary user (PU), some other SUs that satisfy the condition for parallel communication are selected to simultaneously access the primary spectrum for secondary transmissions. For the proposed protocol, two opportunistic routing strategies are proposed, and a search algorithm to select the SUs for parallel communication is described. The throughput of the SUs and the PU is illustrated. Numerical results demonstrate that the average throughput of the SUs is greatly improved, and the end-to-end throughput of the PU is slightly increased in the proposed protocol when there are more than seven SUs.

An Improved Lightweight Two-Factor Authentication and Key Agreement Protocol with Dynamic Identity Based on Elliptic Curve Cryptography

  • Qiu, Shuming;Xu, Guosheng;Ahmad, Haseeb;Xu, Guoai;Qiu, Xinping;Xu, Hong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.978-1002
    • /
    • 2019
  • With the rapid development of the Internet of Things, the problem of privacy protection has been paid great attention. Recently, Nikooghadam et al. pointed out that Kumari et al.'s protocol can neither resist off-line guessing attack nor preserve user anonymity. Moreover, the authors also proposed an authentication supportive session initial protocol, claiming to resist various vulnerability attacks. Unfortunately, this paper proves that the authentication protocols of Kumari et al. and Nikooghadam et al. have neither the ability to preserve perfect forward secrecy nor the ability to resist key-compromise impersonation attack. In order to remedy such flaws in their protocols, we design a lightweight authentication protocol using elliptic curve cryptography. By way of informal security analysis, it is shown that the proposed protocol can both resist a variety of attacks and provide more security. Afterward, it is also proved that the protocol is resistant against active and passive attacks under Dolev-Yao model by means of Burrows-Abadi-Needham logic (BAN-Logic), and fulfills mutual authentication using Automated Validation of Internet Security Protocols and Applications (AVISPA) software. Subsequently, we compare the protocol with the related scheme in terms of computational complexity and security. The comparative analytics witness that the proposed protocol is more suitable for practical application scenarios.

A rerouting-controlled ISL handover protocol for LEO satellite networks

  • Dong, Wei;Wang, Junfeng;Huang, Minhuan;Tang, Jian;Zhou, Hongxia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.10
    • /
    • pp.2620-2631
    • /
    • 2012
  • In this paper, a rerouting-controlled ISL (Inter-Satellite link) handover protocol for LEO satellite networks (RCIHP) is proposed. Through topological dynamics and periodic characterization of LEO satellite constellation, the protocol firstly derives the ISL related information such as the moments of ISL handovers and the intervals during which ISLs are closed and cannot be used to forward packet. The information, combined with satellite link load status, is then been utilized during packet forwarding process. The protocol makes a forwarding decision on a per packet basis and only routes packets to living and non-congested satellite links. Thus RCIHP avoids periodic rerouting that occurs in traditional routing protocols and makes it totally unnecessary. Simulation studies show that RCIHP has a good performance in terms of packet dropped possibility and end-to-end delay.

Stochastic Optimization of Multipath TCP for Energy Minimization and Network Stability over Heterogeneous Wireless Network

  • Arain, Zulfiqar Arain;Qiu, Xuesong;Zhong, Lujie;Wang, Mu;Chen, Xingyan;Xiong, Yongping;Nahida, Kiran;Xu, Changqiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.195-215
    • /
    • 2021
  • Multipath Transport Control Protocol (MPTCP) is a transport layer protocol that enables multiple TCP connections across various paths. Due to path heterogeneity, it incurs more energy in a multipath wireless network. Recent work presents a set of approaches described in the literature to support systems for energy consumption in terms of their performance, objectives and address issues based on their design goals. The existing solutions mainly focused on the primary system model but did not discourse the overall system performance. Therefore, this paper capitalized a novel stochastically multipath scheduling scheme for data and path capacity variations. The scheduling problem formulated over MPTCP as a stochastic optimization, whose objective is to maximize the average throughput, avoid network congestion, and makes the system more stable with greater energy efficiency. To design an online algorithm that solves the formulated problem over the time slots by considering its mindrift-plus penalty form. The proposed solution was examined under extensive simulations to evaluate the anticipated stochastic optimized MPTCP (so-MPTCP) outcome and compared it with the base MPTCP and the energy-efficient MPTCP (eMPTCP) protocols. Simulation results justify the proposed algorithm's credibility by achieving remarkable improvements, higher throughput, reduced energy costs, and lower-end to end delay.

A Novel Bio-inspired Trusted Routing Protocol for Mobile Wireless Sensor Networks

  • Zhang, Mingchuan;Xu, Changqiao;Guan, Jianfeng;Zheng, Ruijuan;Wu, Qingtao;Zhang, Hongke
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.1
    • /
    • pp.74-90
    • /
    • 2014
  • Routing in mobile wireless sensor networks (MWSNs) is an extremely challenging issue due to the features of MWSNs. In this paper, we present a novel bio-inspired trusted routing protocol (B-iTRP) based on artificial immune system (AIS), ant colony optimization (ACO) and Physarum optimization (PO). For trust mechanism, B-iTRP monitors neighbors' behavior in real time and then assesses neighbors' trusts based on AIS. For routing strategy, each node proactively finds routes to the Sink based on ACO. When a backward ant is on the way to return source, it senses the energy residual and trust value of each node on the discovered route, and calculates the link trust and link energy of the route. Moreover, B-iTRP also assesses the availability of route based on PO to maintain the route table. Simulation results show how B-iTRP can achieve the effective performance compared to existing state-of-the-art algorithms.