• Title/Summary/Keyword: Power-Efficient Routing Protocol

Search Result 94, Processing Time 0.019 seconds

An Efficient Routing Scheme based on Link Quality and Load Balancing for Wireless Sensor Networks (무선 센서 네트워크에서 링크 상태 및 트래픽 분산 정보를 이용한 효과적인 라우팅 방법)

  • Kim, Sun-Myeng;Yang, Yeon-Mo
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.11-19
    • /
    • 2010
  • ZigBee is a standard for wireless personal area networks(WPANs) based on the IEEE 802.15.4 standard. It has been developed for low cost and low power consumption. There are two alternative routing schemes that have been proposed for the ZigBee standard: Ad-hoc On-Demand Distance Vector(AODV) and tree routing. The tree routing forwards packets from sensors to a sink node based on the parent-child relationships established by the IEEE 802.15.4 MAC topology formation procedure. In order to join the network, a sensor node chooses an existing node with the strongest RSSI(Received signal strength indicator) signal as a parent node. Therefore, some nodes carry a large amount of traffic load and exhaust their energy rapidly. To overcome this problem, we introduce a new metric based on link quality and traffic load for load balancing. Instead of the strength of RSSI, the proposed scheme uses the new metric to choose a parent node during the topology formation procedure. Extensive simulation results using TOSSIM(TinyOS mote SIMulator) show that the CFR scheme outperforms well in comparison to the conventional tree routing scheme.

A Simple Cooperative Transmission Protocol for Energy-Efficient Broadcasting Over Multi-Hop Wireless Networks

  • Kailas, Aravind;Thanayankizil, Lakshmi;Ingram, Mary Ann
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.213-220
    • /
    • 2008
  • This paper analyzes a broadcasting technique for wireless multi-hop sensor networks that uses a form of cooperative diversity called opportunistic large arrays (OLAs). We propose a method for autonomous scheduling of the nodes, which limits the nodes that relay and saves as much as 32% of the transmit energy compared to other broadcast approaches, without requiring global positioning system (GPS), individual node addressing, or inter-node interaction. This energy-saving is a result of cross-layer interaction, in the sense that the medium access control (MAC) and routing functions are partially executed in the physical (PHY) layer. Our proposed method is called OLA with a transmission threshold (OLA-T), where a node compares its received power to a threshold to decide if it should forward. We also investigate OLA with variable threshold (OLA-VT), which optimizes the thresholds as a function of level. OLA-T and OLA-VT are compared with OLA broadcasting without a transmission threshold, each in their minimum energy configuration, using an analytical method under the orthogonal and continuum assumptions. The trade-off between the number of OLA levels (or hops) required to achieve successful network broadcast and transmission energy saved is investigated. The results based on the analytical assumptions are confirmed with Monte Carlo simulations.

Cluster Topology Algorithm for Efficient Data Transmission in Wireless Body Area Network based on Mobile Sink (WBAN 환경에서 효율적인 데이터 전송을 위한 모바일 싱크기반의 클러스터 토폴로지 알고리즘)

  • Lee, Jun-Hyuk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.56-63
    • /
    • 2012
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. Mobile sink node distribute energy consumption therefore network life time was increased than fixed sink node. The energy efficient is important matter in wireless body area network because energy resource was limited on sensor node. In this paper we proposed cluster topology algorithm for efficient data transmission in wireless body area network based mobile sink. The proposed algorithm show good performance under the advantage of grid routing protocol and TDMA scheduling that minimized overlap area on cluster and reduced amount of data on cluster header in error prone wireless sensor network based on mobile sink.

Distribution of Inter-Contact Time: An Analysis-Based on Social Relationships

  • Wei, Kaimin;Duan, Renyong;Shi, Guangzhou;Xu, Ke
    • Journal of Communications and Networks
    • /
    • v.15 no.5
    • /
    • pp.504-513
    • /
    • 2013
  • Communication in delay tolerant networks (DTNs) relies on message transport by mobile nodes, and a correct understanding of the node mobility characteristics is therefore crucial to the design of an efficient DTN routing protocol. However, previous work has mainly focused on uncovering all behaviors of node movement, which is not conducive to accurately detecting the specific movement characteristics of a different node. In this paper, we seek to address this problem based on a consideration of social relationships. We first consider social ties from both static and dynamic perspectives. For a static perspective, in addition to certain accidental events, social relations are considered for a long time granularity and tend to be stable over time. For a dynamic perspective, social relations are analyzed in a relatively short time granularity and are likely to change over time. Based on these perspectives, we adopted different efficient approaches to dividing node pairs into two classes, i.e., familiar and unfamiliar pairs. A threshold approach is used for static social ties whereas a density-based aggregation method is used for dynamic social relationships. Extensive experimental results show that both familiar and unfamiliar node pairs have the same inter-contact time distribution, which closely follows a power-law decay up to a certain point, beyond which it begins to exponentially decay. The results also demonstrate that the inter-contact time distribution of familiar pairs decays faster than that of unfamiliar pairs, whether from a static or dynamic perspective. In addition, we also analyze the reason for the difference between the inter-contact time distributions of both unfamiliar and familiar pairs.