• Title/Summary/Keyword: Computer Networks

Search Result 5,189, Processing Time 0.035 seconds

Power of a Defer Timer for the design of broadcasting protocol in Wireless Sensor Networks

  • Kim, Bo-Nam;Lee, In-Sung;Yang, Jun-Mo;Lee, Jin-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.470-473
    • /
    • 2007
  • Wireless Sensor Networks (WSNs) have merged to become one of the most promising applications of wireless ad hoc networks. A defer timer has been used in some of existing network protocols to solve a set of problems in WSNs. We first investigate the use of a defer timer to fully take the advantage of it in WSNs. We demonstrate that by properly setting up the defer timers, many difficult issues in sensor networks, such as power limitation, the broadcast storm problem, and the construction of the virtual backbone, can be easily tackled with only the help of simple localized information at each node. In this paper, we present the power of a defer timer in the design of dominating set construction protocol for broadcasting. The ns 2 computer simulations are carried out for performance study.

  • PDF

Multiple token-based neighbor discovery for directional sensor networks

  • Nagaraju, Shamanth;Gudino, Lucy J.;Sood, Nipun;Chandran, Jasmine G.;Sreejith, V.
    • ETRI Journal
    • /
    • v.42 no.3
    • /
    • pp.351-365
    • /
    • 2020
  • Directional sensor networks (DSNs) can significantly improve the performance of a network by employing energy efficient communication protocols. Neighbor discovery is a vital part of medium access control (MAC) and routing protocol, which influences the establishment of communication between neighboring nodes. Neighbor discovery is a challenging task in DSNs due to the limited coverage provided by directional antennas. Furthermore, in these networks, communication can only take place when the beams of the directional antennas are pointed toward each other. In this article, we propose a novel multiple token-based neighbor discovery (MuND) protocol, in which multiple tokens are transmitted based on an area exploration algorithm. The performance of the protocol is evaluated using the Cooja simulator. The simulation results reveal that the proposed MuND protocol achieves lower neighbor discovery latency, with a 100% neighbor discovery ratio, and has a relatively low communication overhead and low energy consumption.

Accurate Range-free Localization Based on Quantum Particle Swarm Optimization in Heterogeneous Wireless Sensor Networks

  • Wu, Wenlan;Wen, Xianbin;Xu, Haixia;Yuan, Liming;Meng, Qingxia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1083-1097
    • /
    • 2018
  • This paper presents a novel range-free localization algorithm based on quantum particle swarm optimization. The proposed algorithm is capable of estimating the distance between two non-neighboring sensors for multi-hop heterogeneous wireless sensor networks where all nodes' communication ranges are different. Firstly, we construct a new cumulative distribution function of expected hop progress for sensor nodes with different transmission capability. Then, the distance between any two nodes can be computed accurately and effectively by deriving the mathematical expectation of cumulative distribution function. Finally, quantum particle swarm optimization algorithm is used to improve the positioning accuracy. Simulation results show that the proposed algorithm is superior in the localization accuracy and efficiency when used in random and uniform placement of nodes for heterogeneous wireless sensor networks.

Enhanced TDMA based MAC Protocol for Adaptive Data Control in Wireless Sensor Networks

  • Alvi, Ahmad Naseem;Bouk, Safdar Hussain;Ahmed, Syed Hassan;Yaqub, Muhammad Azfar;Javaid, Nadeem;Kim, Dongkyun
    • Journal of Communications and Networks
    • /
    • v.17 no.3
    • /
    • pp.247-255
    • /
    • 2015
  • In this paper, we propose an adaptive time division multiple access based medium access control (MAC) protocol, called bitmap-assisted shortest job first based MAC (BS-MAC), for hierarchical wireless sensor networks (WSNs). The main contribution of BS-MAC is that: (a) It uses small size time slots. (b) The number of those time slots is more than the number of member nodes. (c) Shortest job first (SJF) algorithm to schedule time slots. (d) Short node address (1 byte) to identify members nodes. First two contributions of BS-MAC handle adaptive traffic loads of all members in an efficient manner. The SJF algorithm reduces node's job completion time and to minimize the average packet delay of nodes. The short node address reduces the control overhead and makes the proposed scheme an energy efficient. The simulation results verify that the proposed BS-MAC transmits more data with less delay and energy consumption compared to the existing MAC protocols.

Resource Allocation based on Quantized Feedback for TDMA Wireless Mesh Networks

  • Xu, Lei;Tang, Zhen-Min;Li, Ya-Ping;Yang, Yu-Wang;Lan, Shao-Hua;Lv, Tong-Ming
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.3
    • /
    • pp.160-167
    • /
    • 2013
  • Resource allocation based on quantized feedback plays a critical role in wireless mesh networks with a time division multiple access (TDMA) physical layer. In this study, a resource allocation problem was formulated based on quantized feedback for TDMA wireless mesh networks that minimize the total transmission power. Three steps were taken to solve the optimization problem. In the first step, the codebook of the power, rate and equivalent channel quantization threshold was designed. In the second step, the timeslot allocation criterion was deduced using the primal-dual method. In the third step, a resource allocation scheme was developed based on quantized feedback using the stochastic optimization tool. The simulation results show that the proposed scheme not only reduces the total transmission power, but also has the advantage of quantized feedback.

  • PDF

Efficient Peer-to-Peer File Sharing Using Network Coding in MANET

  • Lee, Uichin;Park, Joon-Sang;Lee, Seung-Hoon;Ro, Won-W.;Pau, Giovanni;Gerla, Mario
    • Journal of Communications and Networks
    • /
    • v.10 no.4
    • /
    • pp.422-429
    • /
    • 2008
  • Mobile peer-to-peer (P2P) systems have recently got in the limelight of the research community that is striving to build efficient and effective mobile content addressable networks. Along this line of research, we propose a new peer-to-peer file sharing protocol suited to mobile ad hoc networks (MANET). The main ingredients of our protocol are network coding and mobility assisted data propagation, i.e., single-hop communication. We argue that network coding in combination with single-hop communication allows P2P file sharing systems in MANET to operate in a more efficient manner and helps the systems to deal with typical MANET issues such as dynamic topology and intermittent connectivity as well as various other issues that have been disregarded in previous MANET P2P researches such as addressing, node/user density, non-cooperativeness, and unreliable channel. Via simulation, we show that our P2P protocol based on network coding and single-hop communication allows shorter file downloading delays compared to an existing MANET P2P protocol.

Transient Multipath routing protocol for low power and lossy networks

  • Lodhi, Muhammad Ali;Rehman, Abdul;Khan, Meer Muhammad;Asfand-e-yar, Muhammad;Hussain, Faisal Bashir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.2002-2019
    • /
    • 2017
  • RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

Performance Analysis of Co- and Cross-tier Device-to-Device Communication Underlaying Macro-small Cell Wireless Networks

  • Li, Tong;Xiao, Zhu;Georges, Hassana Maigary;Luo, Zhinian;Wang, Dong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1481-1500
    • /
    • 2016
  • Device-to-Device (D2D) communication underlaying macro-small cell networks, as one of the promising technologies in the era of 5G, is able to improve spectral efficiency and increase system capacity. In this paper, we model the cross- and co-tier D2D communications in two-tier macro-small cell networks. To avoid the complicated interference for cross-tier D2D, we propose a mode selection scheme with a dedicated resource sharing strategy. For co-tier D2D, we formulate a joint optimization problem of power control and resource reuse with the aim of maximizing the overall outage capacity. To solve this non-convex optimization problem, we devise a heuristic algorithm to obtain a suboptimal solution and reduce the computational complexity. System-level simulations demonstrate the effectiveness of the proposed method, which can provide enhanced system performance and guarantee the quality-of-service (QoS) of all devices in two-tier macro-small cell networks. In addition, our study reveals the high potential of introducing cross- and co-tier D2D in small cell networks: i) cross-tier D2D obtains better performance at low and medium small cell densities than co-tier D2D, and ii) co-tier D2D achieves a steady performance improvement with the increase of small cell density.

THE EFFICIENCY ROUTING ALGORITHM FOR MULTIMEDIA TRANSMISSION IN DIGITAL HOME NETWORK SCENARIOS

  • Nguyen Thanh Tung;Ahn Sea-Young;An Sun-Shin
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06d
    • /
    • pp.136-138
    • /
    • 2006
  • The high-rate Wireless Personal Area Networks (WPANs) which IEEE 802.15.3 standard support, foster the Digital Home Network (DHN) scenarios with high rate multimedia data transmission. Actually, there are a few routing protocols for ad-hoc networks which considered the terminal location information and routing metric to reduce the energy consumption and optimize the routing path in mobile system. Based on other routing protocols, this paper presents the reliable location-based routing algorithm which is an adaptation to these networks.

  • PDF

Anomaly Detection in Smart Homes Using Bayesian Networks

  • Saqaeeyan, Sasan;javadi, Hamid Haj Seyyed;Amirkhani, Hossein
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1796-1816
    • /
    • 2020
  • The health and safety of elderly and disabled patients who cannot live alone is an important issue. Timely detection of sudden events is necessary to protect these people, and anomaly detection in smart homes is an efficient approach to extracting such information. In the real world, there is a causal relationship between an occupant's behaviour and the order in which appliances are used in the home. Bayesian networks are appropriate tools for assessing the probability of an effect due to the occurrence of its causes, and vice versa. This paper defines different subsets of random variables on the basis of sensory data from a smart home, and it presents an anomaly detection system based on various models of Bayesian networks and drawing upon these variables. We examine different models to obtain the best network, one that has higher assessment scores and a smaller size. Experimental evaluations of real datasets show the effectiveness of the proposed method.