DOCSLIB.ORG

Medium Access Control Protocols and Routing Algorithms for Wireless Sensor Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Medium Access Control Protocols and Routing Algorithms for Wireless Sensor Networks University of Central Florida STARS Electronic Theses and Dissertations, 2004-2019 2007 Medium Access Control Protocols And Routing Algorithms For Wireless Sensor Networks Anirban Bag University of Central Florida Part of the Computer Sciences Commons, and the Engineering Commons Find similar works at: https://stars.library.ucf.edu/etd University of Central Florida Libraries http://library.ucf.edu This Doctoral Dissertation (Open Access) is brought to you for free and open access by STARS. It has been accepted for inclusion in Electronic Theses and Dissertations, 2004-2019 by an authorized administrator of STARS. For more information, please contact [email protected]. STARS Citation Bag, Anirban, "Medium Access Control Protocols And Routing Algorithms For Wireless Sensor Networks" (2007). Electronic Theses and Dissertations, 2004-2019. 3069. https://stars.library.ucf.edu/etd/3069 MEDIUM ACCESS CONTROL PROTOCOLS AND ROUTING ALGORITHMS FOR WIRELESS SENSOR NETWORKS by ANIRBAN BAG M.S. University of Central Florida, 2007 A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the School of Electrical Engineering and Computer Science in the College of Engineering and Computer Science at the University of Central Florida Orlando, Florida Fall Term 2007 Major Professor: Mostafa A. Bassiouni © 2007 Anirban Bag ii ABSTRACT In recent years, the development of a large variety of mobile computing devices has led to wide scale deployment and use of wireless ad hoc and sensor networks. Wireless Sensor Networks consist of battery powered, tiny and cheap “motes”, having sensing and wireless communication capabilities. Although wireless motes have limited battery power, communication and computation capabilities, the range of their application is vast. In the first part of the dissertation, we have addressed the specific application of Biomedical Sensor Networks. To solve the problem of data routing in these networks, we have proposed the Adaptive Least Temperature Routing (ALTR) algorithm that reduces the average temperature rise of the nodes in the in-vivo network while routing data efficiently. For delay sensitive biomedical applications, we proposed the Hotspot Preventing Routing (HPR) algorithm which avoids the formation of hotspots (regions having very high temperature) in the network. HPR forwards the packets using the shortest path, bypassing the regions of high temperature and thus significantly reduces the average packet delivery delay, making it suitable for real-time applications of in-vivo networks. We also proposed another routing algorithm suitable for being used in a network of id-less biomedical sensor nodes, namely Routing Algorithm for networks of homogeneous and Id-less biomedical sensor Nodes (RAIN). Finally we developed Biocomm, a cross-layer MAC and Routing protocol co-design for Biomedical Sensor Networks, which optimizes the overall performance of an in-vivo network through cross- layer interactions. We performed extensive simulations to show that the proposed Biocomm protocol performs much better than the other existing MAC and Routing iii protocols in terms of preventing the formation of hotspots, reducing energy consumption of nodes and preventing network congestion when used in an in-vivo network. In the second part of the dissertation, we have addressed the problems of habitat- monitoring sensor networks, broadcast algorithms for sensor networks and the congestion problem in sensor networks as well as one non-sensor network application, namely, on- chip communication networks. Specifically, we have proposed a variation of HPR algorithm, called Hotspot Preventing Adaptive Routing (HPAR) algorithm, for efficient data routing in Networks On-Chip catering to their specific hotspot prevention issues. A protocol similar to ALTR has been shown to perform well in a sensor network deployed for habitat monitoring. We developed a reliable, low overhead broadcast algorithm for sensor networks namely Topology Adaptive Gossip (TAG) algorithm. To reduce the congestion problem in Wireless Sensor Networks, we proposed a tunable cross-layer Congestion Reducing Medium Access Control (CRMAC) protocol that utilizes buffer status information from the Network layer to give prioritized medium access to congested nodes in the MAC layer and thus preventing congestion and packet drops. CRMAC can also be easily tuned to satisfy different application-specific performance requirements. With the help of extensive simulation results we have shown how CRMAC can be adapted to perform well in different applications of Sensor Network like Emergency Situation that requires a high network throughput and low packet delivery latency or Long-term Monitoring application requiring energy conservation. iv To my parents, Asok Kumar Bag and Debasree Bag v TABLE OF CONTENTS LIST OF FIGURES ........................................................................................................... V CHAPTER 1 INTRODUCTION ........................................................................................ 1 1.1. Wireless Ad-hoc Networks...................................................................................... 1 1.2. Wireless Sensor Networks....................................................................................... 2 1.2.1. Constraints of Wireless Sensor Networks......................................................... 3 1.2.2. Biomedical Sensor Networks............................................................................ 4 1.2.3. Habitat-monitoring Sensor Networks ............................................................... 6 1.2.4. Networks On-Chip ............................................................................................ 7 1.3. Routing Algorithms ................................................................................................. 8 1.4. Medium Access Control Protocols ........................................................................ 11 1.5. Cross-Layer Protocol Design................................................................................. 12 CHAPTER 2 ENERGY EFFICIENT THERMAL AWARE ROUTING ALGORITHMS FOR EMBEDDED BIOMEDICAL SENSOR NETWORKS.......................................... 14 2.1. Introduction............................................................................................................ 14 2.2. Proposed Algorithms ............................................................................................. 16 2.2.1. Least Temperature Routing Protocol .............................................................. 16 2.2.2. Adaptive Least Temperature Routing protocol............................................... 17 2.3. Simulation.............................................................................................................. 18 2.3.1. Network of 12 randomly connected nodes ..................................................... 19 2.3.2. 4x4 Mesh topology ......................................................................................... 23 2.3.3. 4x4 Mesh Torus network ................................................................................ 26 2.3.4. 8-node Ring topology ..................................................................................... 30 2.3.5. Dense network of 50 randomly connected nodes ........................................... 33 2.3.6. Lifetime of Network ....................................................................................... 36 2.4. Conclusion ............................................................................................................. 38 CHAPTER 3 HOTSPOT PREVENTING ROUTING ALGORITHM FOR DELAY- SENSITIVE APPLICATIONS OF IN-VIVO BIOMEDICAL SENSOR NETWORKS. 39 3.1. Introduction............................................................................................................ 39 3.2. Proposed Algorithm............................................................................................... 40 3.3. Pseudo Code .......................................................................................................... 43 3.4. Simulation.............................................................................................................. 44 3.4.1. 4x8 Mesh-torus topology ................................................................................ 46 3.4.2. Topology consisting of a 3D layout of 27 nodes ............................................ 52 3.4.3. Topology consisting of 100 densely connected nodes.................................... 55 3.4.4. Lifetime of a network...................................................................................... 58 3.5. Conclusion ............................................................................................................. 61 CHAPTER 4 ROUTING ALGORITHM FOR NETWORK OF HOMOGENEOUS AND ID-LESS BIOMEDICAL SENSOR NODES (RAIN) ..................................................... 63 4.1. Introduction............................................................................................................ 63 4.2. Proposed Algorithm............................................................................................... 65 ii 4.3. Simulation Results ................................................................................................. 70 4.3.1. 11x11 regular mesh topology.......................................................................... 72 4.3.2. Topology consisting of 100 randomly connected nodes................................
Load more

Recommended publications
  • Solutions to Chapter 2
    CS413 Computer Networks ASN 4 Solutions Solutions to Assignment #4 3. What difference does it make to the network layer if the underlying data link layer provides a connection-oriented service versus a connectionless service? [4 marks] Solution: If the data link layer provides a connection-oriented service to the network layer, then the network layer must precede all transfer of information with a connection setup procedure (2). If the connection-oriented service includes assurances that frames of information are transferred correctly and in sequence by the data link layer, the network layer can then assume that the packets it sends to its neighbor traverse an error-free pipe. On the other hand, if the data link layer is connectionless, then each frame is sent independently through the data link, probably in unconfirmed manner (without acknowledgments or retransmissions). In this case the network layer cannot make assumptions about the sequencing or correctness of the packets it exchanges with its neighbors (2). The Ethernet local area network provides an example of connectionless transfer of data link frames. The transfer of frames using "Type 2" service in Logical Link Control (discussed in Chapter 6) provides a connection-oriented data link control example. 4. Suppose transmission channels become virtually error-free. Is the data link layer still needed? [2 marks – 1 for the answer and 1 for explanation] Solution: The data link layer is still needed(1) for framing the data and for flow control over the transmission channel. In a multiple access medium such as a LAN, the data link layer is required to coordinate access to the shared medium among the multiple users (1).
    [Show full text]
  • MAC Protocols for IEEE 802.11Ax: Avoiding Collisions on Dense Networks Rafael A
    MAC Protocols for IEEE 802.11ax: Avoiding Collisions on Dense Networks Rafael A. da Silva1 and Michele Nogueira1;2 1Department of Informatics, Federal University of Parana,´ Curitiba, PR, Brazil 2Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA E-mails: [email protected] and [email protected] Wireless networks have become the main form of Internet access. Statistics show that the global mobile Internet penetration should exceed 70% until 2019. Wi-Fi is an important player in this change. Founded on IEEE 802.11, this technology has a crucial impact in how we share broadband access both in domestic and corporate networks. However, recent works have indicated performance issues in Wi-Fi networks, mainly when they have been deployed without planning and under high user density. Hence, different collision avoidance techniques and Medium Access Control protocols have been designed in order to improve Wi-Fi performance. Analyzing the collision problem, this work strengthens the claims found in the literature about the low Wi-Fi performance under dense scenarios. Then, in particular, this article overviews the MAC protocols used in the IEEE 802.11 standard and discusses solutions to mitigate collisions. Finally, it contributes presenting future trends arXiv:1611.06609v1 [cs.NI] 20 Nov 2016 in MAC protocols. This assists in foreseeing expected improvements for the next generation of Wi-Fi devices. I. INTRODUCTION Statistics show that wireless networks have become the main form of Internet access with an expected global mobile Internet penetration exceeding 70% until 2019 [1]. Wi-Fi Notice: This work has been submitted to the IEEE for possible publication.
    [Show full text]
  • OSI Model and Network Protocols
    CHAPTER4 FOUR OSI Model and Network Protocols Objectives 1.1 Explain the function of common networking protocols . TCP . FTP . UDP . TCP/IP suite . DHCP . TFTP . DNS . HTTP(S) . ARP . SIP (VoIP) . RTP (VoIP) . SSH . POP3 . NTP . IMAP4 . Telnet . SMTP . SNMP2/3 . ICMP . IGMP . TLS 134 Chapter 4: OSI Model and Network Protocols 4.1 Explain the function of each layer of the OSI model . Layer 1 – physical . Layer 2 – data link . Layer 3 – network . Layer 4 – transport . Layer 5 – session . Layer 6 – presentation . Layer 7 – application What You Need To Know . Identify the seven layers of the OSI model. Identify the function of each layer of the OSI model. Identify the layer at which networking devices function. Identify the function of various networking protocols. Introduction One of the most important networking concepts to understand is the Open Systems Interconnect (OSI) reference model. This conceptual model, created by the International Organization for Standardization (ISO) in 1978 and revised in 1984, describes a network architecture that allows data to be passed between computer systems. This chapter looks at the OSI model and describes how it relates to real-world networking. It also examines how common network devices relate to the OSI model. Even though the OSI model is conceptual, an appreciation of its purpose and function can help you better understand how protocol suites and network architectures work in practical applications. The OSI Seven-Layer Model As shown in Figure 4.1, the OSI reference model is built, bottom to top, in the following order: physical, data link, network, transport, session, presentation, and application.
    [Show full text]
  • Medium Access Control Layer
    Telematics Chapter 5: Medium Access Control Sublayer User Server watching with video Beispielbildvideo clip clips Application Layer Application Layer Presentation Layer Presentation Layer Session Layer Session Layer Transport Layer Transport Layer Network Layer Network Layer Network Layer Univ.-Prof. Dr.-Ing. Jochen H. Schiller Data Link Layer Data Link Layer Data Link Layer Computer Systems and Telematics (CST) Physical Layer Physical Layer Physical Layer Institute of Computer Science Freie Universität Berlin http://cst.mi.fu-berlin.de Contents ● Design Issues ● Metropolitan Area Networks ● Network Topologies (MAN) ● The Channel Allocation Problem ● Wide Area Networks (WAN) ● Multiple Access Protocols ● Frame Relay (historical) ● Ethernet ● ATM ● IEEE 802.2 – Logical Link Control ● SDH ● Token Bus (historical) ● Network Infrastructure ● Token Ring (historical) ● Virtual LANs ● Fiber Distributed Data Interface ● Structured Cabling Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 5: Medium Access Control Sublayer 5.2 Design Issues Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 5: Medium Access Control Sublayer 5.3 Design Issues ● Two kinds of connections in networks ● Point-to-point connections OSI Reference Model ● Broadcast (Multi-access channel, Application Layer Random access channel) Presentation Layer ● In a network with broadcast Session Layer connections ● Who gets the channel? Transport Layer Network Layer ● Protocols used to determine who gets next access to the channel Data Link Layer ● Medium Access Control (MAC) sublayer Physical Layer Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 5: Medium Access Control Sublayer 5.4 Network Types for the Local Range ● LLC layer: uniform interface and same frame format to upper layers ● MAC layer: defines medium access ..
    [Show full text]
  • Migrating Backoff to the Frequency Domain
    No Time to Countdown: Migrating Backoff to the Frequency Domain Souvik Sen Romit Roy Choudhury Srihari Nelakuditi Duke University Duke University University of South Carolina Durham, NC, USA Durham, NC, USA Columbia, SC, USA [email protected] [email protected] [email protected] ABSTRACT 1. INTRODUCTION Conventional WiFi networks perform channel contention in Access control strategies are designed to arbitrate how mul- time domain. This is known to be wasteful because the chan- tiple entities access a shared resource. Several distributed nel is forced to remain idle while all contending nodes are protocols embrace randomization to achieve arbitration. In backing off for multiple time slots. This paper proposes to WiFi networks, for example, each participating node picks a break away from convention and recreate the backing off op- random number from a specified range and begins counting eration in the frequency domain. Our basic idea leverages the down. The node that finishes first, say N1, wins channel con- observation that OFDM subcarriers can be treated as integer tention and begins transmission. The other nodes freeze their numbers. Thus, instead of picking a random backoff duration countdown temporarily, and revive it only after N1’s trans- in time, a contending node can signal on a randomly cho- mission is complete. Since every node counts down at the sen subcarrier. By employing a second antenna to listen to same pace, this scheme produces an implicit ordering among all the subcarriers, each node can determine whether its cho- nodes. Put differently, the node that picks the smallest ran- sen integer (or subcarrier) is the smallest among all others.
    [Show full text]
  • Collision Detection
    Computer Networking Michaelmas/Lent Term M/W/F 11:00-12:00 LT1 in Gates Building Slide Set 3 Evangelia Kalyvianaki [email protected] 2017-2018 1 Topic 3: The Data Link Layer Our goals: • understand principles behind data link layer services: (these are methods & mechanisms in your networking toolbox) – error detection, correction – sharing a broadcast channel: multiple access – link layer addressing – reliable data transfer, flow control • instantiation and implementation of various link layer technologies – Wired Ethernet (aka 802.3) – Wireless Ethernet (aka 802.11 WiFi) • Algorithms – Binary Exponential Backoff – Spanning Tree 2 Link Layer: Introduction Some terminology: • hosts and routers are nodes • communication channels that connect adjacent nodes along communication path are links – wired links – wireless links – LANs • layer-2 packet is a frame, encapsulates datagram data-link layer has responsibility of transferring datagram from one node to adjacent node over a link 3 Link Layer (Channel) Services • framing, physical addressing: – encapsulate datagram into frame, adding header, trailer – channel access if shared medium – “MAC” addresses used in frame headers to identify source, dest • different from IP address! • reliable delivery between adjacent nodes – we see some of this again in the Transport Topic – seldom used on low bit-error link (fiber, some twisted pair) – wireless links: high error rates 4 Link Layer (Channel) Services - 2 • flow control: – pacing between adjacent sending and receiving nodes • error control: – error
    [Show full text]
  • On-Demand Routing in Multi-Hop Wireless Mobile Ad Hoc Networks
    Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IJCSMC, Vol. 2, Issue. 7, July 2013, pg.317 – 321 RESEARCH ARTICLE ON-DEMAND ROUTING IN MULTI-HOP WIRELESS MOBILE AD HOC NETWORKS P. Umamaheswari 1, K. Ranjith singh 2 1Periyar University, TamilNadu, India 2Professor of PGP College, TamilNadu, India 1 [email protected]; 2 [email protected] Abstract— An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any preexisting network infrastructure or centralized administration. Routing protocols used in ad hoc networks must automatically adjust to environments that can vary between the extremes of high mobility with low bandwidth, and low mobility with high bandwidth. This thesis argues that such protocols must operate in an on-demand fashion and that they must carefully limit the number of nodes required to react to a given topology change in the network. I have embodied these two principles in a routing protocol called Dynamic Source Routing (DSR). As a result of its unique design, the protocol adapts quickly to routing changes when node movement is frequent, yet requires little or no overhead during periods in which nodes move less frequently. By presenting a detailed analysis of DSR’s behavior in a variety of situations, this thesis generalizes the lessons learned from DSR so that they can be applied to the many other new routing protocols that have adopted the basic DSR framework. The thesis proves the practicality of the DSR protocol through performance results collected from a full-scale 8 node tested, and it demonstrates several methodologies for experimenting with protocols and applications in an ad hoc network environment, including the emulation of ad hoc networks.
    [Show full text]
  • The OSI Model: Understanding the Seven Layers of Computer Networks
    Expert Reference Series of White Papers The OSI Model: Understanding the Seven Layers of Computer Networks 1-800-COURSES www.globalknowledge.com The OSI Model: Understanding the Seven Layers of Computer Networks Paul Simoneau, Global Knowledge Course Director, Network+, CCNA, CTP Introduction The Open Systems Interconnection (OSI) model is a reference tool for understanding data communications between any two networked systems. It divides the communications processes into seven layers. Each layer both performs specific functions to support the layers above it and offers services to the layers below it. The three lowest layers focus on passing traffic through the network to an end system. The top four layers come into play in the end system to complete the process. This white paper will provide you with an understanding of each of the seven layers, including their functions and their relationships to each other. This will provide you with an overview of the network process, which can then act as a framework for understanding the details of computer networking. Since the discussion of networking often includes talk of “extra layers”, this paper will address these unofficial layers as well. Finally, this paper will draw comparisons between the theoretical OSI model and the functional TCP/IP model. Although TCP/IP has been used for network communications before the adoption of the OSI model, it supports the same functions and features in a differently layered arrangement. An Overview of the OSI Model Copyright ©2006 Global Knowledge Training LLC. All rights reserved. Page 2 A networking model offers a generic means to separate computer networking functions into multiple layers.
    [Show full text]
  • A Load Awareness Medium Access Control Protocol for Wireless Ad
    A Load Awareness Medium Access Control Protocol for Single-Hop Wireless Ad Hoc Networks Chih-Min Chao1, Jang-Ping Sheu2, and I-Cheng Chou2 1 Department of Computer Science and Engineering National Taiwan Ocean University, 20224, Taiwan Tel: +886-2-24622192 ext 6651, Fax: +886-2-24623249 Email: [email protected] 2 Department of Computer Science and Information Engineering National Central University, Taiwan Email: [email protected], [email protected] Abstract A contention-based wireless ad hoc medium access control (MAC) protocol, such as car- rier sense multiple access with collision avoidance (CSMA/CA), has excellent e±ciency when the system is light-loaded. The main drawback of such protocols is their ine±ciency and un- bounded delay when the system load is heavy. On the other hand, a contention-free MAC protocol, such as token passing, has a better and fair throughput when the system is heavy- loaded. The main drawback of such protocols is their ine±ciency when only a small amount of users want to transmit. In this paper, we propose a new load awareness single-hop wireless ad hoc MAC protocol (which is called the LA protocol) that exploits the bene¯ts of both contention-based and contention-free protocols. A contention-based MAC protocol is used when the system is light-loaded and a contention-free one is used otherwise. Our LA protocol, which operates in a distributed fashion and is fully compatible with the IEEE 802.11 wireless local area network (WLAN) standard, can switch smoothly between the contention-based pro- tocol and the contention-free one.
    [Show full text]
  • Wireless Networks Book
    Wireless Networks Local and Ad Hoc Networks Ivan Marsic Department of Electrical and Computer Engineering and the CAIP Center Rutgers University Contents CHAPTER 1................................................................................................... INTRODUCTION ..............................................................................................................................1 1.1 Summary and Bibliographical Notes................................................................................................... 6 CHAPTER 2 THE RADIO CHANNEL.......................................................................1 2.1 Introduction........................................................................................................................................ 1 2.1.1 Decibels and Signal Strength ............................................................................................................ 4 2.2 Channel Implementation..................................................................................................................... 5 2.2.1 Transmission Rate ........................................................................................................................... 5 2.2.2 Symbols To Signals.......................................................................................................................... 6 2.2.3 Modulation ...................................................................................................................................... 6 2.2.4 Noise and Error
    [Show full text]
  • How Computers Share Data
    06 6086 ch03 4/6/04 2:51 PM Page 41 HOUR 3 Getting Data from Here to There: How Computers Share Data In this hour, we will first discuss four common logi- cal topologies, starting with the most common and ending with the most esoteric: . Ethernet . Token Ring . FDDI . ATM In the preceding hour, you read a brief definition of packet-switching and an expla- nation of why packet switching is so important to data networking. In this hour, you learn more about how networks pass data between computers. This process will be discussed from two separate vantage points: logical topologies, such as ethernet, token ring, and ATM; and network protocols, which we have not yet discussed. Why is packet switching so important? Recall that it enables multiple computers to send multiple messages down a single piece of wire, a technical choice that is both efficient and an elegant solution. Packet switching is intrinsic to computer network- ing—without packet switching, no network. In the first hour, you learned about the physical layouts of networks, such as star, bus, and ring technologies, which create the highways over which data travels. In the next hour, you learn about these topologies in more depth. But before we get to them, you have to know the rules of the road that determine how data travels over a network. In this hour, then, we’ll review logical topologies. 06 6086 ch03 4/6/04 2:51 PM Page 42 42 Hour 3 Logical Topologies Before discussing topologies again, let’s revisit the definition of a topology.
    [Show full text]
  • Listen Before You Talk but on the Frequency Domain
    1 Listen Before You Talk But On The Frequency Domain Souvik Sen Romit Roy Choudhury Srihari Nelakuditi Duke University Duke University University of South Carolina Abstract Access control strategies are designed to arbitrate how multiple entities access a shared resource. Several dis- tributed protocols embrace randomization to achieve arbitration. In WiFi networks, for example, each participating node picks a random number from a specified range and begins counting down. The device that reaches zero first wins the contention and initiates transmission. This core idea – called backoff – is known to be inherently wasteful because the channel must remain idle while all contending nodes are simultaneously counting down. This wastage has almost been accepted as a price for decentralization. In this paper, we ask whether the entire backoff operation can be migrated to the frequency domain, thereby eliminating a long-standing source of channel inefficiency. Our core idea draws on OFDM subcarriers in modern WiFi radios, treating each subcarrier as an integer number. By transmitting a signal on a random subcarrier frequency, and using a second antenna to listen for all active frequencies, each node may be able to detect its rank among all contenders. Since signaling on subcarriers is almost instantaneous, the wastage from backoff can become negligible. We design such an unconventional backoff scheme called Back2F, implement it on a software- radio testbed, and demonstrate its feasibility with real-world experiments. A natural next step would be to revisit today’s protocols, and ask what other operations may be similarly migrated to the frequency domain. I. PROBLEM &MOTIVATION Accessing a shared resource in a decentralized manner has been studied for several decades.
    [Show full text]