• Title/Summary/Keyword: single-hop network

Search Result 107, Processing Time 0.026 seconds

Energy-efficient Relay MAC with Dynamic Power Control in Wireless Body Area Networks

  • Cai, Xuelian;Yuan, Jingjing;Yuan, Xiaoming;Zhu, Wu;Li, Jiandong;Li, Changle;Ullah, Sana
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.7
    • /
    • pp.1547-1568
    • /
    • 2013
  • Wireless body area network (WBAN) is an emerging short-range wireless communication network with sensor nodes located on, in or around the human body for healthcare, entertainment and ubiquitous computing. In WBANs, energy is severely constrained which is the prime consideration in the medium access control (MAC) protocol design. In this paper, we propose a novel MAC protocol named Energy-efficient Relay MAC with dynamic Power Control (ERPC-MAC) to save energy consumption. Without relying on the additional devices, ERPC-MAC employs relaying nodes to provide relay service for nodes which consume energy fast. Accordingly the superframe adjustment is performed and then the network topology can be smoothly switched from single-hop to multi-hop. Moreover, for further energy saving and reliability improvement, the dynamic power control is introduced to adjust the power level whenever a node transmits its packets to the coordinator or the relaying node. To the best of the authors' knowledge, this is the first effort to integrate relay, topology adjustment and power control to improve the network performance in a WBAN. Comprehensive simulations are conducted to evaluate the performance. The results show that the ERPC-MAC is more superior to the existing standard and significantly prolongs the network lifetime.

Dynamic Class Mapping Mechanism for Guaranteed Service with Minimum Cost over Differentiated Services Networks (다중 DiffServ 도메인 상에서 QoS 보장을 위한 동적 클래스 재협상 알고리즘)

  • 이대붕;송황준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.697-710
    • /
    • 2004
  • Differentiated services (DiffServ) model has been prevailed as a scalable approach to provide quality of service in the Internet. However, there are difficulties in providing the guaranteed service in terms of end-to-end systems since differentiated services network considers quality of service of aggregated traffic due to the scalability and many researches have been mainly focused on per hop behavior or a single domain behavior. Furthermore quality of service may be time varying according to the network conditions. In this paper, we study dynamic class mapping mechanism to guarantee the end-to-end quality of service for multimedia traffics with the minimum network cost over differentiated services network. The proposed algorithm consists of an effective implementation of relative differentiated service model, quality of service advertising mechanism and dynamic class mapping mechanism. Finally, the experimental results are provided to show the performance of the proposed algorithm.

Pre-cluster HEAD Selection Scheme based on Node Distance in Chain-Based Protocol (체인기반 프로토콜에서 노드의 거리에 따른 예비 헤드노드 선출 방법)

  • Kim, Hyun-Duk;Choi, Won-Ik
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1273-1287
    • /
    • 2009
  • PEGASIS, a chain-based protocol, forms chains from sensor nodes so that each node transmits and receives from a neighbor. In this way, only one node (known as a HEAD) is selected from that chain to transmit to the sink. Although PEGASIS is able to balance the workload among all of the nodes by selecting the HEAD node in turn, a considerable amount of energy may be wasted when nodes which are far away from sink node act as the HEAD. In this study, DERP (Distance-based Energy-efficient Routing Protocol) is proposed to address this problem. DERP is a chain-based protocol that improves the greedy-algorithm in PEGASIS by taking into account the distance from the HEAD to the sink node. The main idea of DERP is to adopt a pre-HEAD (P-HD) to distribute the energy load evenly among sensor nodes. In addition, to scale DERP to a large network, it can be extended to a multi-hop clustering protocol by selecting a "relay node" according to the distance between the P-HD and SINK. Analysis and simulation studies of DERP show that it consumes up to 80% less energy, and has less of a transmission delay compared to PEGASIS.

  • PDF

A Novel Algebraic Framework for Analyzing Finite Population DS/SS Slotted ALOHA Wireless Network Systems with Delay Capture

  • Kyeong, Mun-Geon
    • ETRI Journal
    • /
    • v.18 no.3
    • /
    • pp.127-145
    • /
    • 1996
  • A new analytic framework based on a linear algebra approach is proposed for examining the performance of a direct sequence spread spectrum (DS/SS) slotted ALOHA wireless communication network systems with delay capture. The discrete-time Markov chain model has been introduced to account for the effect of randomized time of arrival (TOA) at the central receiver and determine the evolution of the finite population network performance in a single-hop environment. The proposed linear algebra approach applied to the given Markov problem requires only computing the eigenvector ${\prod}$ of the state transition matrix and then normalizing it to have the sum of its entries equal to 1. MATLAB computation results show that systems employing discrete TOA randomization and delay capture significantly improves throughput-delay performance and the employed analysis approach is quite easily and staightforwardly applicable to the current analysis problem.

  • PDF

Efficient Message Scheduling for WDM Optical Networks with Minimizing Flow Time

  • Huang, Xiaohong;Ma, Maode
    • Journal of Communications and Networks
    • /
    • v.6 no.2
    • /
    • pp.147-155
    • /
    • 2004
  • In this paper, we propose an efficient sequencing technique, namely minimum Row time scheduling (MFTS), to manage variable-Iength message transmissions for single-hop passive starcoupled WDM optical networks. By considering not only the message length but also the state of the receivers and the tuning latency, the proposed protocol can reduce the average delay of the network greatly. This paper also introduces a new channel assignment technique latency minimizing scheduling (LMS), which aims to reduce the scheduling latency. We evaluate the proposed algorithm, using extensive discrete-event simulations, by comparing its performance with shortest job first (SJF) algorithm. We find that significant improvement in average delay could be achieved by MFTS algorithm. By combining the proposed message sequencing technique with the channel selection technique, the performance of the optical network could be further improved.

A Model-based Rate Separation Algorithm Using Multiple Channels in Multi-Radio Ad Hoc Networks (멀티 라디오 애드혹 네트워크에서의 멀티 채널을 이용한 모델 기반 레이트 분할 알고리즘)

  • Kim, Sok-Hyong;Kim, Dong-Wook;Suh, Young-Joo;Kwon, Dong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1A
    • /
    • pp.73-81
    • /
    • 2011
  • IEEE 802.11 PHY and MAC layer provide multiple channels and data rates. To improve the performance of IEEE 802.11 multi-radio ad hoc networks, it is required to utilize available channels and data rates efficiently. However, in IEEE 802.11 multi-rate networks, the rate anomaly (RA) problem occurs that the network performance is severely degraded as low-rate links affect high-rate links. Hence, in this paper, we propose a model-based rate separation (MRS) algorithm that uses multiple channels to separate different data rate links so that the RA problem is mitigated. MRS algorithm utilizes an existing throughput model that estimates the throughput of IEEE 802.11 single-hop networks to separate low-rate links and high-rate links. Through simulations, we demonstrate that the MRS algorithm shows improved network performance compared with existing algorithms in multi-radio ad hoc networks.

A study on improvement of ISO/IEC 29157 MAC protocol (ISO/IEC 29157 표준 MAC 프로토콜 개선 연구)

  • Cha, Bong-Sang;Jeong, Eui-Hoon;Jeon, Gwangil;Seo, Dae-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.5
    • /
    • pp.17-26
    • /
    • 2013
  • ISO/IEC 29157 originally developed in the Republic of Korea and is based on commercially available PicoCast v1.0. ISO/IEC JTC1 SC6 was registered by the international standard on May 2010. A single platform for a variety of applications and media formats to support development objectives were. ISO/IEC 29157 based wireless networks, ie, Pico-net to master node periodically transmit sync signal is synchronized to the number of slave nodes have the communications structure. Pico-net also supports a variety of network topologies and direct communication between nodes(single-hop communication) and QoS is guaranteed. But Pico-net network structure has the following problems. Loss of communication problems due to mobile nodes, resulting in limitations of node mobility and wireless network operation range of conventional wireless networks operating range less than 1/4 was reduced to the problem. In this paper, a possible solution to the problems mentioned is proposed, using multi-hop communication technology and sync signal transmission technology between nodes.

Lifetime Maximizing Routing Algorithm for Multi-hop Wireless Networks (다중-홉 무선 네트워크 환경에서 수명 최대화를 위한 라우팅 알고리즘)

  • Lee, Keon-Taek;Han, Seung-Jae;Park, Sun-Ju
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.292-300
    • /
    • 2008
  • In multi-hop wireless networks like Wireless Mesh Networks (WMN) and Wireless Sensor Networks (WSN), nodes often rely on batteries as their power source. In such cases, energy efficient routing is critical. Many schemes have been proposed to find the most energy efficient path, but most of them do not achieve optimality on network lifetime. Once found, the energy efficient path is constantly used such that the energy of the nodes on the path is depleted quickly. As an alternative, the approaches that dynamically change the path at run time have also been proposed. These approaches, however, involve high overhead of establishing multiple paths. In this paper, we first find an optimal multi-path routing using LP. Then we apply an approximation algorithm to derive a near-optimal solution for single-path routing. We compare the performance of the proposed scheme with several other existing algorithms through simulation.

Weight Adjustment Scheme Based on Hop Count in Q-routing for Software Defined Networks-enabled Wireless Sensor Networks

  • Godfrey, Daniel;Jang, Jinsoo;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.1
    • /
    • pp.22-30
    • /
    • 2022
  • The reinforcement learning algorithm has proven its potential in solving sequential decision-making problems under uncertainties, such as finding paths to route data packets in wireless sensor networks. With reinforcement learning, the computation of the optimum path requires careful definition of the so-called reward function, which is defined as a linear function that aggregates multiple objective functions into a single objective to compute a numerical value (reward) to be maximized. In a typical defined linear reward function, the multiple objectives to be optimized are integrated in the form of a weighted sum with fixed weighting factors for all learning agents. This study proposes a reinforcement learning -based routing protocol for wireless sensor network, where different learning agents prioritize different objective goals by assigning weighting factors to the aggregated objectives of the reward function. We assign appropriate weighting factors to the objectives in the reward function of a sensor node according to its hop-count distance to the sink node. We expect this approach to enhance the effectiveness of multi-objective reinforcement learning for wireless sensor networks with a balanced trade-off among competing parameters. Furthermore, we propose SDN (Software Defined Networks) architecture with multiple controllers for constant network monitoring to allow learning agents to adapt according to the dynamics of the network conditions. Simulation results show that our proposed scheme enhances the performance of wireless sensor network under varied conditions, such as the node density and traffic intensity, with a good trade-off among competing performance metrics.

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.