Energy priority routing method based on extended transmission distance and retransmission

A technology of transmission distance and energy, applied in the field of wireless networks, can solve the problem of inability to accurately simulate the working conditions of the physical layer, and achieve the effect of increasing paths, dense topology structures, and increasing transmission distances.

Inactive Publication Date: 2018-04-17
TIANJIN UNIV
View PDF3 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] However, this simplified model cannot accurately simulate the p

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Energy priority routing method based on extended transmission distance and retransmission
  • Energy priority routing method based on extended transmission distance and retransmission
  • Energy priority routing method based on extended transmission distance and retransmission

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0046] The embodiment of the present invention proposes a set of low-complexity design schemes, the MREPE algorithm does not increase the complexity of the MREP algorithm, and the AMREP algorithm hardly increases. It is generally considered that a wireless sensor network includes a series of static nodes randomly distributed in a square. Assume that each node knows the distance from itself to other nodes, and in the sensor network, there is a source node and a sink node, except these two nodes are supported by sufficient energy, other nodes are supported by a limited energy Batteries provide energy.

[0047] Each node participating in message forwarding will consume a certain amount of energy. The energy consumption value depends on the number of transmitted packets and the distance transmitted. Before sending a packet, based on the modified MERP algorithm, the source node chooses a reasonable path that can maximize the lifetime of the system. This method converts the maxim...

Embodiment 2

[0065] Combined with the specific calculation formula, Figure 2-Figure 5 1. Examples further introduce the scheme in Example 1, see the following description for details:

[0066] 201: node definition;

[0067] see figure 2 , the routing problem can be regarded as a directed graph G(N, A) model, N is all the vertices (sensor nodes) in the graph, A is the directed edge (sensor path) between the vertices in the graph, such as (p,q) means from vertex p to vertex q. Two special vertices s and t represent the source node and the destination node, respectively. Each vertex p has an initial energy E(p) ≥ 0, where E(p) is the energy available to the current node p before sending a packet.

[0068] Each edge, such as e=(p,q) and transmission cost S e (S p,q ) contact, S e Indicates the energy consumed by transmitting a packet from vertex p to vertex q along edge e. Thus transmitting a packet along edge e, the node energy E(p) of vertex p will be reduced by S e . Let d repre...

Embodiment 3

[0115] The embodiment of the present invention takes wireless network-based data packet transmission as an example to give a specific implementation mode. Figure 3 to Figure 5 The functions and effects in the embodiments of the present invention are demonstrated, and the specific steps are as follows:

[0116] (1) Maximum transmission distance d max and the determination of the number of retransmissions n;

[0117] Assume that each node knows the distance from itself to other nodes. And in the sensor network, there is a source node and a sink node, except that these two nodes are supported by sufficient energy, and the other nodes are powered by a battery with limited energy. custom p 0 and n max The value of d can be obtained respectively according to the above formula max and n. In subsequent steps, the number of transmission times and the transmission distance of the same data packet on a pair of nodes shall not be greater than n max and d max .

[0118] (2) Combi...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

An energy priority routing method based on extended transmission distance and retransmission comprises the following steps that a digraph composed of vertexes, directed sides, a source node and a termination node is obtained, sensor nodes serve as the vertexes, and sensor paths serve as the directed sides among the vertexes; each vertex includes initial energy, each side is associated with the transmission cost, and an energy consumption model is used to represent a value of energy consumed by a distance between two nodes; maximal transmission distance and maximal retransmission frequency of adata packet are defined; and a bandwidth value when the distance (between adjacent nodes) d<=R and R<d<=dmax is obtained by combining MREPE and ARMEP algorithms, and a maximal residual energy path issearched via an improved Dijkstra's algorithm. The method of the invention aims at solving the problem that the system lifetime is short on the premise that the wireless network environment is severeand node energy is finite, the robustness is high, and energy utilization is optimized.

Description

technical field [0001] The invention relates to the field of wireless networks, in particular to an energy priority routing method based on increasing transmission distance and retransmission. Background technique [0002] In recent years, the development of wireless technology has made it feasible to construct ad-hoc (non-central self-organizing network) networks, which can be used in sensor networks to detect and monitor surrounding environmental conditions. In wireless sensor networks, since the energy supply of each node is limited, how to make nodes send messages along a certain path and maximize the system lifetime is an important issue. There are two ways to solve this problem. One is to minimize the absolute energy consumption in each routing task; the other is to distribute the traffic as evenly as possible in each node to balance the energy consumption when selecting the routing path. In most cases, the second method is preferable due to higher energy utilization...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04W40/10H04W40/12H04W40/24
CPCH04W40/10H04W40/125H04W40/246
Inventor 张蕾王志锐
Owner TIANJIN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap