Sensor nodes have restricted storage, computational and energy resources, these restrictions place a limit on the types of deployable routing mechanisms. Routing protocol disseminates information that enables the sensor nodes to select routes to communicate with other nodes on the network and the choice of the route is determined by the routing algorithms. Thus the routing protocol helps the nodes to gain knowledge about the topology of the network to which it is attached directly.
There are mainly two types of routing processes: one is static routing and the other is dynamic routing. In a static routing, the routing tables are set up in a static manner in the nodes. The network routes for the packet are initially set between the nodes. However, if any node on the specified route fails, the data may not reach the destination. In a dynamic routing, routing tables in the routers often change whenever the possible routes change. Dynamic routing is more suitable as the nodes in WSNs may frequently change their position and die at any moment.
The routing protocols are classified into single hop and multi hop routing. In a single hop routing, sensor node directly communicates with the sink to share the gathered information. Energy consumption is high in the network using single hop protocol. In multi hop routing, data is routed through the intermediate nodes to the base station. Each node transfers sensed data to the immediate node which in turn transfers the data to the next immediate node and finally the data reaches the base station. Energy consumption in this kind of routing protocol is less and thus the lifetime of the nodes is high.
The major challenge to the efficient operation of wireless sensor network lies in its ability to deliver the sensed information from the nodes to the sink within the specific time duration without the loss of data packets with high security. The sensor nodes depend on the battery source for their operation which has limited capacity. Thus the energy resource of the sensor nodes has to be used efficiently in order to increase the operational lifetime of the network.
Table of Contents
1. INTRODUCTION
1.1 OVERVIEW
1.2 WIRELESS SENSOR NETWORKS
1.3 ROUTING PROTOCOLS IN WSN
2. BACKGROUND ON WIRELESS SENSOR NETWORKS (WSN)
2.1 INTRODUCTION
2.2 ARCHITECTURE OF WIRELESS SENSOR NODES
2.2.1 Sensing Unit
2.2.2 Processing Unit
2.2.3 Communication Unit
2.2.4 Power Unit
2.3 DATA GATHERING IN WIRELESS SENSOR NETWORKS
2.3.1 Challenges and issues
2.3.2 Network Topology
2.3.2.1 Flat topology
2.3.2.2 Cluster-based topology
2.3.2.3 Chain-based topology
2.3.2.4 Tree-based topology
2.3.3 Stages in Data Gathering in WSN
2.3.3.1 Deployment stage
2.3.3.2 Control message dissemination
2.3.3.3 Data delivery stage
2.3.4 Data Collection Approaches
2.3.4.1 Static nodes based data collection
2.3.4.2 Mobile elements based data collection techniques
2.3.4.3 Mobile sink based WSN
2.3.4.4 Mobile relay based wireless sensor network
2.4 APPLICATIONS OF WSN
2.5 PERFORMANCE METRICS
2.6 CONCLUSION
3. Routing Protocols in Wireless Sensor Networks
3.1 INTRODUCTION
3.2 DATA COLLECTION TECHNIQUES IN WIRELESS SENSOR NETWORKS
3.3 MOBILE SINK BASED DATA COLLECTION SCHEMES
3.4 ENERGY AWARENESS IN DATA COLLECTION IN WIRELESS SENSOR NETWORK
3.5 ROUTING PROTOCOLS FOR WSN
3.6 ROUTING PROTOCOLS FOR MOBILE SINK IN WIRELESS SENSOR NETWORK
3.7 RELIABILE DATA COLLECTION PROTOCOLS IN WSNs
3.8 CONCLUSION
4. RELIABLE AND ENERGY EFFICIENT DATA COLLECTION USING MOBILE SINK IN WSN
4.1 INTRODUCTION
4.1.1 Energy Model
4.2 RENDEZVOUS POINT (RP) BASED DATA COLLECTION SCHEME
4.3 ESTIMATION OF IN-NETWORK COMMUNICATION COST
4.4 RENDEZVOUS POINT (RP) ESTIMATION
4.4.1 Rendezvous Point (RP) based Data Collection using Mobile Relay (MR)
4.4.2 RP-Mobile Sink based Optimal Solution for Trajectory Path
4.5 BIASED RANDOM WALK MODEL FOR SINK MOBILITY
4.5.1 Challenges in Mobile Sink based Data Collection Paradigm
4.5.2 Network Traversal using Deterministic Walk
4.5.3 Network Traversal using Biased Random Walk
4.5.3.1 Network initialization
4.6 DATA TRANSMISSION TECHNIQUE
4.7 DATA GATHERING LINKED WITH PAUSE TIME
4.8 PERFORMANCE METRICS
5. EFFICIENT ROUTING PROTOCOL FOR MOBILE SINK BASED DATA GATHERING (ERMMSDG)
5.1 INTRODUCTION
5.2 DATA GATHERING TECHNIQUE USING ERMMSDG PROTOCOL
5.4 INTELLIGENT AGENT-BASED ROUTING PROTOCOL (IAR)
5.4 Performance Metrics
6. RSRPMS PROTOCOL FOR MULTIPLE MOBILE SINK
6.1 INTRODUCTION
6.2 RSRPMS PROTOCOL FOR MULTIPLE MOBILE SINK
6.2.1 The Process at the Sink Node
6.2.2 The Process at Source Node
6.3 RELAY NODE SELECTION
6.3 OVERALL ALGORITHM
Objectives & Core Themes
This work aims to address the critical challenges in Wireless Sensor Networks (WSNs) regarding energy efficiency, network lifetime, and reliable data delivery. It investigates the integration of mobile sinks and relay nodes to optimize data gathering, specifically focusing on energy-constrained sensor environments where static node exhaustion leads to network failure. The research proposes and evaluates advanced routing protocols to improve connectivity and transmission reliability.
- Energy-efficient routing and data aggregation strategies for WSNs.
- Performance impact of sink mobility, including deterministic and biased random walk models.
- Development of reliable data delivery mechanisms, incorporating Reed-Solomon coding and session-based cryptography.
- Optimization of rendezvous point planning and relay node selection for multiple mobile sinks.
Excerpt from the Book
1.1 OVERVIEW
The explosive growth of information and communication technologies in the last decade has opened new possibilities in networking of ubiquitous devices. The significant developments made in communication were the advent of wireless based networks. Wireless networks belong to an important class of networks that transmit data between devices using radio waves instead of wires. Most of the wireless networks utilize either the microwave frequencies around the 2.4 GHz ISM (Industrial, Scientific and Medical) band for a bandwidth of about 83 MHz, or around the 5 GHz U-NII (Unlicensed-National Information Infrastructure) band for a bandwidth of about 300 MHz divided into two parts. These are simple, fast, easy to establish and cheap even though the initial cost of installation is high. The main advantage of wireless networks is enhancement of the mobility of devices.
The convergence of the communication, networking and wireless technologies coupled with advances in engineering, is paving the way for a new breed of sensor networks capable of achieving higher resolution and accuracy. The special networks called as wireless sensor network is formed by the wirelessly interconnected systems of sensor nodes. Generally the sensor nodes self-organize an appropriate network infrastructure and use the multi hopping technique to establish connections among the nodes (Yu et al 2006). The sensor nodes are often programmed to work either on a continuous basis or event driven working modes. Depending on the applications the data samples should be delivered either as soon as it is detected, or within a predefined latency bound.
Summary of Chapters
1. INTRODUCTION: Provides an overview of wireless sensor networks, their advantages over wired networks, and the fundamental challenges posed by limited energy resources in sensor nodes.
2. BACKGROUND ON WIRELESS SENSOR NETWORKS (WSN): Discusses the architecture of sensor nodes, various network topologies, and standard data gathering strategies including mobile elements.
3. Routing Protocols in Wireless Sensor Networks: Reviews existing literature on data collection and routing protocols, with a specific focus on mobile sink strategies and energy-aware mechanisms.
4. RELIABLE AND ENERGY EFFICIENT DATA COLLECTION USING MOBILE SINK IN WSN: Introduces the MSREEDG protocol, detailing an energy model and a rendezvous point-based approach for efficient data gathering.
5. EFFICIENT ROUTING PROTOCOL FOR MOBILE SINK BASED DATA GATHERING (ERMMSDG): Presents the ERMMSDG protocol, which extends previous techniques to support multiple mobile sinks and improve routing efficiency.
6. RSRPMS PROTOCOL FOR MULTIPLE MOBILE SINK: Proposes the RSRPMS algorithm, which incorporates symmetric key cryptography to enhance security while maintaining energy-efficient relay node selection.
Keywords
Wireless Sensor Networks, WSN, Data Gathering, Mobile Sink, Routing Protocols, Energy Efficiency, Network Lifetime, Rendezvous Point, Reliability, Reed-Solomon Coding, Data Aggregation, Multi-hop Routing, Relay Nodes, Network Topology, Security
Frequently Asked Questions
What is the core focus of this research?
The research primarily focuses on improving data collection efficiency and extending the operational lifetime of wireless sensor networks (WSNs) through the use of mobile sinks and advanced routing protocols.
What are the primary challenges in WSNs addressed here?
The work addresses critical limitations such as finite battery life of sensor nodes, limited communication range, data loss, and energy imbalance caused by static sink proximity.
What is the main research objective?
The main objective is to design and evaluate energy-efficient, reliable routing and data gathering protocols that minimize energy consumption and transmission delays in large-scale sensor environments.
What scientific methodology is utilized?
The research employs a combination of theoretical energy modeling and simulation-based performance evaluation using tools like NS2 and J-Sim to validate the efficiency of the proposed protocols.
What does the main body of the work cover?
The main body details the evolution of routing protocols from basic static models to advanced mobility-based and secure protocols, including specific mechanisms for sink mobility, trajectory planning, and data encryption.
Which keywords best characterize this work?
Key terms include Wireless Sensor Networks, Mobile Sink, Energy Efficiency, Data Gathering, Network Lifetime, and Routing Protocols.
How does the proposed MSREEDG protocol improve energy usage?
The MSREEDG protocol introduces an energy-aware model and uses rendezvous points to reduce the energy expenditure traditionally associated with multi-hop communication to static base stations.
Why is Reed-Solomon coding implemented in the RSRPMS protocol?
Reed-Solomon coding is implemented to provide redundant bits, which help compensate for data loss in noisy wireless channels, thereby improving overall transmission reliability without requiring frequent energy-intensive retransmissions.
- Citar trabajo
- Madhumathy Perumal (Autor), R. Umamaheswari (Autor), 2020, Wireless Sensor Networks. Routing Protocol Overview, Múnich, GRIN Verlag, https://www.grin.com/document/963306
