Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for discovering neighbors based on asynchronous time slice in single-hop network

A neighbor discovery, time-slicing technique, used in network topology, network data management, error prevention/detection using return channels, etc.

Inactive Publication Date: 2015-01-28
ENG DESIGN & RES INST OF GENERAL ARMAMENTS DEPT
View PDF7 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This method solves the above-mentioned problems faced by neighbor discovery under the standard conflicting channel model

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
  • Method for discovering neighbors based on asynchronous time slice in single-hop network
  • Method for discovering neighbors based on asynchronous time slice in single-hop network
  • Method for discovering neighbors based on asynchronous time slice in single-hop network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] The technical solution of the present invention will be specifically described below in conjunction with the embodiments.

[0034] The neighbor discovery method is a solution for the deployment and implementation of all nodes in the entire network, that is, all nodes run the same program, including synchronous neighbor discovery methods and asynchronous neighbor discovery methods. For synchronous neighbor discovery methods, the total number of network nodes is divided into known and unknown. In the two cases, the following will mainly describe the method for discovering network neighbors based on asynchronous time slices in a network where the total number of network nodes is known.

[0035] Asynchronous neighbor discovery method with known total number of network nodes n

[0036] The asynchronous neighbor method (n known) performed by each node in the network is as follows figure 2 As shown, it mainly includes the following steps:

[0037] Step 301: Initialize the n...

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

The present invention provides a method for discovering neighbors based on asynchronous time slices in a single-hop network with a known node number. Each node in the network comprises a message sending module, a message receiving module and a main neighbor discovering module, wherein the message sending module is used for combination of different messages; the messages are classified into DISCOVERY messages and SUCCESS messages; the message receiving module is used for receiving messages; the main neighbor discovering module is divided into a time slice management module, a neighbor information module and a node information module. When inter-network time slices are asynchronous, in case of knowing a network node n, a sending probability lambda in the message sending module of the current node is configured to be 1 / (2kappa(n-b)), wherein kappa is configured to be the sum of a fixed time period tau and a feedback time period sigma, while the time slice management module configures an interception time period to be Exp(1 / lambda). After processing according to the solution in the present invention, the operation complexity of the aforementioned method for discovering neighbors is Theta(n).

Description

technical field [0001] The invention relates to the technical field of wireless communication, in particular to a neighbor discovery method based on an asynchronous time slice in a single-hop network with a known number of nodes. Background technique [0002] Wireless ad hoc networks (Wireless ad hoc networks) are wireless networks composed of a large number of stationary or mobile nodes in a self-organizing single-hop or multi-hop manner. It does not require the support of fixed communication equipment, and each node forms a network by itself. For example, when deploying immediately, the node does not know which nodes are within its communication range, and needs to discover neighbor nodes before communicating with the discovered nodes. Neighbor discovery is an indispensable first step in the initialization of wireless ad hoc networks. MAC (media access control), routing protocols, and topology control algorithms all need to know neighbor information in order to work effect...

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): H04W36/00H04L1/16
CPCH04W8/005H04W40/246H04W84/18
Inventor 朱沿旭左超尚国强王坚李超王黎明曹廷友贾佳
Owner ENG DESIGN & RES INST OF GENERAL ARMAMENTS DEPT
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com