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

Search Result 333, Processing Time 0.022 seconds

An Efficient Code Assignment Algorithm in Wireless Mesh Networks (무선 메쉬 네트워크에서의 효율적인 코드할당 알고리즘에 대한 연구)

  • Yeo, Jae-Hyun
    • Journal of Information Technology Applications and Management
    • /
    • v.15 no.1
    • /
    • pp.261-270
    • /
    • 2008
  • Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.

  • PDF

Dimensioning of linear and hierarchical wireless sensor networks for infrastructure monitoring with enhanced reliability

  • Ali, Salman;Qaisar, Saad Bin;Felemban, Emad A.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3034-3055
    • /
    • 2014
  • Wireless Sensor Networks have extensively been utilized for ambient data collection from simple linear structures to dense tiered deployments. Issues related to optimal resource allocation still persist for simplistic deployments including linear and hierarchical networks. In this work, we investigate the case of dimensioning parameters for linear and tiered wireless sensor network deployments with notion of providing extended lifetime and reliable data delivery over extensive infrastructures. We provide a single consolidated reference for selection of intrinsic sensor network parameters like number of required nodes for deployment over specified area, network operational lifetime, data aggregation requirements, energy dissipation concerns and communication channel related signal reliability. The dimensioning parameters have been analyzed in a pipeline monitoring scenario using ZigBee communication platform and subsequently referred with analytical models to ensure the dimensioning process is reflected in real world deployment with minimum resource consumption and best network connectivity. Concerns over data aggregation and routing delay minimization have been discussed with possible solutions. Finally, we propose a node placement strategy based on a dynamic programming model for achieving reliable received signals and consistent application in structural health monitoring with multi hop and long distance connectivity.

Reliable Transmission of Bio-Data for IEEE 11073 PHD Standards at 6LoWPAN Multi-Hop Wireless Sensor Networks (6LoWPAN 멀티-홉 무선 센서 네트워크에서의 IEEE 11073 PHD 표준을 위한 신뢰성 있는 생체 정보 전송)

  • Woo, Yeon Kyung;Park, Jong Tae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.10
    • /
    • pp.116-123
    • /
    • 2013
  • In mobile healthcare applications, the reliable transmission of the bio-data is very important. In this article, we present a reliable bio-data transmission technique for mobile healthcare monitoring service at 6LoWPAN multi-hop wireless networks. In particular, we expand IEEE 11073-20601 protocol, and propose the reliable path construction for 6LoWPAN aimed to reliably provide mobile healthcare service over wireless sensor network, using IPv6 network. 6LoWPAN is recognized possibility because it is agree with sensor network by raising Adaptation layer on the MAC layer to transmit IPv6 packets. In this article proposed minimize the algorithm complexity and reliability routing protocol because the 6LoWPAN devices are suitable for low cost, small size and battery that can be used to health care system environment. And detailed procedures and algorithms are presented. We the proposed method to prove the superiority of using NS-3 for compareing with AODV protocol.

A Rendezvous Node Selection and Routing Algorithm for Mobile Wireless Sensor Network

  • Hu, Yifan;Zheng, Yi;Wu, Xiaoming;Liu, Hailin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4738-4753
    • /
    • 2018
  • Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

A Study on WSN based Low Power Fire Prevention System (무선 센서 네트워크 기반 저전력 화재방재 시스템을 위한 전송 프로토콜 연구)

  • Kim, Young-Hyuk;Lim, Il-Kwon;Li, Qi Gui;Kim, Myung-Jin;Lee, Jae-Kwang
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.535-538
    • /
    • 2010
  • In this paper, this study goal is development for WSN-based fire prevention systems of using temperature/humidity Sensor. So, distributed sensor nodes structural and packet transfer characteristics study for fire monitoring. Battery-operated wireless sensor networks is data transfer manner of multi-hop. WSN fire prevention system need to sensor nodes management and energy consumption of efficient adjust for sustained action. Thus, study with efficient energy consumption the normal WSN environment is not, characteristics for WSN fire prevention environment.

  • PDF

The Throughput Order of Multicast Traffics with Physical-Layer Network Coding in Random Wireless Ad Hoc Networks

  • Chen, Chen;Bai, Lin;He, Jianhua;Xiang, Haige;Choi, Jin-Ho
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.214-220
    • /
    • 2011
  • This paper attempts to address the effectiveness of physical-layer network coding (PNC) on the throughput improvement for multi-hop multicast in random wireless ad hoc networks (WAHNs). We prove that the per session throughput order with PNC is tightly bounded as ${\Theta}((n\sqrt{m}R(n))^{-1})$ if $m=(R^{-2}(n))$, where n is the total number of nodes, R(n) is the communication range, and m is the number of destinations for each multicast session. We also show that per-session throughput order with PNC is tight bounded as ${\Theta}(n^{-1})$, when $m={\Omega}(R^{-2}(n))$. The results of this paper imply that PNC cannot improve the throughput order of multicast in random WAHNs, which is different from the intuition that PNC may improve the throughput order as it allows simultaneous signal access and combination.

Packet-Level Scheduling for Implant Communications Using Forward Error Correction in an Erasure Correction Mode for Reliable U-Healthcare Service

  • Lee, Ki-Dong;Kim, Sang-G.;Yi, Byung-K.
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.160-166
    • /
    • 2011
  • In u-healthcare services based on wireless body sensor networks, reliable connection is very important as many types of information, including vital signals, are transmitted through the networks. The transmit power requirements are very stringent in the case of in-body networks for implant communication. Furthermore, the wireless link in an in-body environment has a high degree of path loss (e.g., the path loss exponent is around 6.2 for deep tissue). Because of such inherently bad settings of the communication nodes, a multi-hop network topology is preferred in order to meet the transmit power requirements and to increase the battery lifetime of sensor nodes. This will ensure that the live body of a patient receiving the healthcare service has a reduced level of specific absorption ratio (SAR) when exposed to long-lasting radiation. We propose an efficientmethod for delivering delay-intolerant data packets over multiple hops. We consider forward error correction (FEC) in an erasure correction mode and develop a mathematical formulation for packet-level scheduling of delay-intolerant FEC packets over multiple hops. The proposed method can be used as a simple guideline for applications to setting up a topology for a medical body sensor network of each individual patient, which is connected to a remote server for u-healthcare service applications.

A study on the Robust and Systolic Topology for the Resilient Dynamic Multicasting Routing Protocol

  • Lee, Kang-Whan;Kim, Sung-Uk
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.3
    • /
    • pp.255-260
    • /
    • 2008
  • In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

Improved Routing Algorithm for Enhancing Survivability in Wireless Sensor Networks (무선 센서 네트워크의 생존성 강화를 위한 개선된 라우팅 알고리즘)

  • Choi, Seung-Kwon;Lee, Byong-Rok;Jang, Yoon-Sik;Kim, Tae-Hoon;Ji, Hong-Il
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.9
    • /
    • pp.100-107
    • /
    • 2007
  • This paper proposes and efficient routing scheme named MP-DD(MultiPath-Direct Diffusion) which are simple enough to be applicable to the wireless sensor networks. Conventional DD(Direct Diffusion) uses only one optimal path, therefore it consumes more energy of specific nodes. MP-DD uses multiple path and has a information of hop upstream node in the direction of the base-station. Simulation results show that the proposed scheme can increase network survivability compared to conventional DD and EAR(Energy Aware Routing) schemes.

Multi-hop Transmission Scheme for Delay-Sensitive Information in Wireless Sensor Networks (무선 센서 네트워크에서 지연에 민감한 정보의 다중 홉 전송 기법)

  • Cha, Jae-Ryong;Kim, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.10
    • /
    • pp.876-884
    • /
    • 2012
  • This paper introduces two multi-hop delay factors which can be caused by conventional TDMA scheduling; queueing delay and delay by random link scheduling, and proposes a new sequential scheduling scheme to resolve these two factors. We also simulate the TDMA network with the proposed link scheduling scheme and compare it with conventional(random) link scheduling scheme in terms of end-to-end packet transmission delay. From the simulation results, the more the average hop distance increases, the more the difference of the delay performance of both scheduling schemes increases. When the average number of hops is 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 22%, 36%, 48%, and 55% respectively when compared to the random scheduling scheme.