CN112261665A - Networking method of self-organizing network - Google Patents
Networking method of self-organizing network Download PDFInfo
- Publication number
- CN112261665A CN112261665A CN202011103029.4A CN202011103029A CN112261665A CN 112261665 A CN112261665 A CN 112261665A CN 202011103029 A CN202011103029 A CN 202011103029A CN 112261665 A CN112261665 A CN 112261665A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- cluster
- weight value
- connectivity
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a networking method of a self-organizing network, which comprises the following steps: the method comprises the following steps: sending a detection message; step two: calculating and broadcasting the weight value; step three: selecting a cluster head; step four: and the cluster member node is added. In the invention, firstly, in an initial state, nodes in a network send detection messages, each node calculates a weight value, the weight values mainly comprise the relative connectivity of the nodes, relative distance measurement values with other nodes and link channel utilization rate, the weight values are broadcasted, cluster heads of all sub-networks are selected within allowed networking time, other non-cluster-head nodes are added into all sub-networks, finally, networking is finished, and the method is rapid and accurate.
Description
Technical Field
The invention belongs to the technical field of self-organizing networks, and relates to a networking method of a self-organizing network.
Background
The multi-node unmanned platform should have the capabilities of fast automatic networking, dynamic random access, network destroy resistance, self-healing and the like. The unmanned platform needs information exchange and cooperative work of large-scale mobile nodes. Each node is a wireless node moving at a high speed, and all the nodes form a large-scale mobile ad hoc network. The network establishment and maintenance technology is one of the key technologies for such applications.
The basic idea of self-organizing network establishment is to divide large-scale network nodes into a plurality of small-scale sub-networks, and the sub-networks are interconnected through a backbone network. Because the scale of the sub-network is small, the rapid networking and reconstruction are easy to realize, and the fusion of the information in the sub-network at the backbone network node and the sharing of the information in the whole network are convenient to realize. The networking process is a distributed computing process, the situation of the whole network does not need to be known, only cluster heads need to be selected out locally through means of weight value comparison and the like, an interconnection subnet is formed locally, and the network establishment time is shortened.
Disclosure of Invention
Objects of the invention
The purpose of the invention is: aiming at the requirement of rapid networking communication of a multi-node unmanned platform, a large-scale network node is decomposed into a plurality of small-scale sub-networks, and rapid self-organizing networking is realized by using a distributed computing method.
(II) technical scheme
In order to solve the above technical problem, the present invention provides a networking method for an ad hoc network, which includes the following steps:
the method comprises the following steps: sending a detection message;
step two: calculating and broadcasting the weight value;
step three: selecting a cluster head;
step four: and the cluster member node is added.
In the first step, in an initial state, any node member in the network does not belong to any subnet, and is in an unclustered state, at this time, the node sends a probe message to the outside according to a fixed period, and the content of the probe message includes the ID of the node, all other node IDs that can be received in the period, and the weight value of the node at this time.
In the second step, a weight value Q (i) is calculated, and a proper cluster head is selected to achieve local optimization, so that global optimization is achieved; the calculation factors of the weight value are divided into 3 items:
(1) relative connectivity of the node;
(2) relative distance measurement values of the node and other nodes;
(3) the channel bandwidth utilization rate of the node;
Q(i)＝α*P(i)+β*1/D(i)+γ*1/Msg(i) (1)
the specific values of alpha, beta and gamma are selected according to the requirements of network application, the average connectivity P (i) of the nodes, the distance D (i) between two node terminals and the channel bandwidth utilization ratio msg (i) of the node i.
The more the number of the communication between each node and other nodes is, the more the nodes can be used as relay nodes of more nodes, the interconnection in the sub-networks is realized, and the information forwarding of cluster heads among the sub-networks is realized; defining the node connectivity degree C (i): the number of neighbor nodes; in a certain number N of wireless networks, the connectivity of node i is represented as:
wherein, tijShowing the communication between the ith node and the jth node,
if one hop between the i and j nodes is reachable, tij＝1；
If one hop between the i and j nodes is not reachable, tij＝0；
Defining the average connectivity p (i) of the nodes: the node i calculates its average connectivity through the connectivity of the peripheral nodes, which is expressed as:
where n (i) refers to a set of neighbor nodes of node i, and Cj refers to a connectivity of neighbor node j of node i.
Any terminal A in the network firstly sends a ranging request before ranging, the ranging request information comprises time mark information of the node, a node B receiving the ranging request writes a time mark difference between the time mark of the terminal A and the time mark of the node B into ranging response information, the terminal A obtains a time difference TOA between the ranging request and the ranging response after receiving the ranging response of the node B, and then measures the distance D (i) between the two nodes, and the calculation formula is as follows:
D(i)＝C×(TOA)； (4)
wherein C is the speed of light.
Defining the information rate M (i, j) of a communication link between a node i and a node j, wherein the information rate M (i, j) represents the proportion of the total number of time slots of a link e in an active state on a channel in a link scheduling period T to the whole link scheduling period, defining the maximum throughput rate of information of the node i as Mmax, and msg (i) is the accumulation of all data streams passing through the node, so that the channel bandwidth utilization rate of the node i is as follows:
in the third step, when broadcasting the detection message with the self weight value, the node also receives the detection message with the weight value of the neighbor node, compares the received weight value with the self weight value, and determines whether the node can become a subnet cluster head according to the comparison result;
if the node in the comparison state receives the node detection message with the weight value smaller than that of the node, the comparison state is maintained, when the node detection message with the weight value larger than that of the node is received, the node can determine that the node cannot become a cluster head node, the state is converted into a quasi-cluster member state, and the joining process of the cluster members is started; when the weighted values of all the neighbor nodes are smaller than the weighted values of the neighbor nodes within the preset networking time, the node becomes a cluster head node;
in the process of selecting the cluster head, the situation that a plurality of nodes with equal weight values are all nodes with the maximum weight values in the same range may occur, and when the situation occurs, the nodes all become the cluster head nodes; if the weighted values of all the nodes are equal, the nodes can become cluster head nodes, isolated clusters are merged, and the clustering algorithm is degenerated into randomly selected cluster heads.
In the fourth step, the nodes with the weight not being the maximum in the one-hop range enter the quasi-cluster member state, and the nodes monitor the detection message of the cluster head node and distribute the cluster member ID, so as to join the cluster; in order to ensure that non-clustered nodes are only added to cluster head nodes with the cluster member number smaller than Nmax, the cluster member number information is carried in the detection message of the cluster head nodes; the non-clustered node determines whether to join or not through the number of cluster members in the detection message; the joining process of the cluster members is divided into: monitoring cluster heads, establishing the relationship between cluster members and the cluster heads, and managing the cluster members.
(III) advantageous effects
In the networking method of the ad hoc network provided by the technical scheme, firstly, in an initial state, nodes in the network send detection messages, each node calculates a weight value, the weight values mainly comprise the relative connectivity of the nodes, relative distance measurement values of other nodes and the utilization rate of a link channel, the weight values are broadcasted, cluster heads of all sub-networks are selected within allowed networking time, other non-cluster-head nodes are added into all sub-networks, and finally, the networking is finished, so that the method is rapid and accurate.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
Detailed Description
In order to make the objects, contents, and advantages of the present invention clearer, the following detailed description of the embodiments of the present invention will be made in conjunction with the accompanying drawings and examples.
In this embodiment, the wireless sensor network is defined and represented by a directed graph G (V, E), where V represents a set of network nodes and E represents a set of communication links between each pair of adjacent nodes. The links in the set of links have directionality, and for link e in the set (u, v),
representing that node u can send data to node v without considering external interference. And E (u) represents the set of all links occurring on the node, then
Referring to fig. 1, the networking method of the ad hoc network of the present invention includes the following steps:
sending of probe message
In the initial state, any node member in the network does not belong to any subnet and is in an unclustered state. And the node sends a detection message to the outside according to a fixed period, wherein the content of the detection message comprises the ID of the node, all other node IDs which can be received in the period and the weight value of the node at the moment.
Second, calculation and broadcast of weighted value
The weight value q (i) is calculated to select a suitable cluster head to achieve local optimum and further achieve global optimum.
The calculation factors of the weight values are divided into 3 items:
(1) relative connectivity of the node;
(2) relative distance measurement values of the node and other nodes;
(3) the channel bandwidth utilization rate of the node;
Q(i)＝α*P(i)+β*1/D(i)+γ*1/Msg(i) (1)
wherein the specific values of alpha, beta and gamma are weighted according to the requirements of network application.
Description of the drawings:
(1) the more the number of the communication between each node and other nodes is, the more the nodes can be used as relay nodes of more nodes, thereby realizing interconnection in the sub-networks and information forwarding of cluster heads between the sub-networks.
Defining the node connectivity degree C (i): the number of neighbor nodes. In a certain number N of wireless networks, the connectivity of node i is represented as:
wherein, tijShowing the communication between the ith node and the jth node,
if one hop between the i and j nodes is reachable, tij＝1；
If one hop between the i and j nodes is not reachable, tij＝0。
Defining the average degree of connectivity Pi of the nodes: the node i calculates its average connectivity (the average of the connectivity of all neighboring nodes of the node i) from the connectivity of the neighboring nodes, and is represented as:
where n (i) refers to a set of neighbor nodes of node i, and Cj refers to a connectivity of neighbor node j of node i.
The average connectivity of the nodes is used for representing the average number of neighbor nodes of the nodes in the one-hop range of the nodes.
(2) The detection message sent by the node also comprises a ranging request, other nodes return the ranging information of the node after receiving the ranging request, and the relative distance between the two nodes can be obtained through a round-trip timing mechanism. All other nodes' relative distances that can be received during this period.
Any terminal A in the network firstly sends a ranging request before ranging, the ranging request information comprises time mark information of the node, a node B receiving the ranging request writes the time mark of the node A and the time mark difference of the node B into ranging response information, after the terminal A receives the ranging response of the node B, the time difference TOA between the ranging request and the ranging response can be obtained, and then the distance D (i) between the two terminals is measured, and the calculation formula is as follows:
D(i)＝C×(TOA)； (4)
wherein C is the speed of light.
(3) Link channel utilization. The communication link information rate M (i, j) between node i and node j represents the proportion of the total number of time slots of link e in an active state on a channel in a link scheduling period T to the whole link scheduling period, and defines the maximum throughput rate of node i information as Mmax, msg (i) is the accumulation of all data streams passing through the node, and the link channel utilization rate of node i is:
selection of cluster head
When broadcasting the detection message with the weight value of the node, the node also receives the detection message with the weight value of the neighbor node, compares the received weight value with the weight value of the node, and determines whether the node can become a subnet cluster head according to the comparison result.
If the node in the comparison state receives the node detection message with the weight value smaller than that of the node, the comparison state is maintained, when the node detection message with the weight value larger than that of the node is received, the node can determine that the node cannot become a cluster head node, the state is converted into a quasi-cluster member state, and the joining process of the cluster members is started; when the weight values of all the neighbor nodes are smaller than the self weight values within the preset networking time, the node becomes a cluster head node.
In the process of selecting the cluster head, a situation that a plurality of nodes with equal weight values are all nodes with the maximum weight value in the same range may occur. When this occurs, these nodes will all become cluster head nodes. If the weighted values of all the nodes are equal, the nodes can become cluster head nodes, isolated clusters are merged, and the clustering algorithm is degenerated into randomly selected cluster heads.
Four, cluster member node joining
And the nodes with the weight not the maximum in the one-hop range enter the quasi-cluster member state, monitor the detection message of the cluster head node and distribute the cluster member ID, thereby joining the cluster. In order to ensure that non-clustered nodes only join cluster head nodes with the cluster member number smaller than Nmax (Nmax is the maximum member number allowed in a subnet), the cluster member number information is carried in the detection message of the cluster head nodes. And the non-clustered node determines whether to join or not through the number of cluster members in the detection message. The joining process of the cluster members is divided into: monitoring cluster heads, establishing the relationship between cluster members and the cluster heads, and managing the cluster members.
The above description is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, several modifications and variations can be made without departing from the technical principle of the present invention, and these modifications and variations should also be regarded as the protection scope of the present invention.
Claims (8)
1. A networking method of an ad hoc network is characterized by comprising the following steps:
the method comprises the following steps: sending a detection message;
step two: calculating and broadcasting the weight value;
step three: selecting a cluster head;
step four: and the cluster member node is added.
2. The networking method of an ad hoc network according to claim 1, wherein in the first step, in an initial state, any node member inside the network does not belong to any subnet, and is in an unclustered state, at this time, the node sends out a probe message according to a fixed period, and the content of the probe message includes the ID of the node, all other node IDs that can be received in the period, and the weight value of the node at this time.
3. The networking method of an ad hoc network according to claim 2, wherein in the second step, a weight value q (i) is calculated, and a suitable cluster head is elected to achieve local optimization, and further achieve global optimization; the calculation factors of the weight value are divided into 3 items:
(1) relative connectivity of the node;
(2) relative distance measurement values of the node and other nodes;
(3) the channel bandwidth utilization rate of the node;
Q(i)＝α*P(i)+β*1/D(i)+γ*1/Msg(i) (1)
the specific values of alpha, beta and gamma are selected according to the requirements of network application, the average connectivity P (i) of the nodes, the distance D (i) between two node terminals and the channel bandwidth utilization ratio msg (i) of the node i.
4. The networking method of the ad hoc network according to claim 3, wherein the larger the number of each node communicating with other nodes is, the more nodes the node can serve as a relay node for the nodes, thereby realizing interconnection inside the sub-networks and forwarding of information of cluster heads between the sub-networks; defining the node connectivity degree C (i): the number of neighbor nodes; in a certain number N of wireless networks, the connectivity of node i is represented as:
wherein, tijShowing the communication between the ith node and the jth node,
if one hop between the i and j nodes is reachable, tij＝1；
If one hop between the i and j nodes is not reachable, tij＝0；
Defining the average connectivity p (i) of the nodes: the node i calculates its average connectivity through the connectivity of the peripheral nodes, which is expressed as:
where n (i) refers to a set of neighbor nodes of node i, and Cj refers to a connectivity of neighbor node j of node i.
5. The networking method of ad hoc network as claimed in claim 4, wherein any terminal a in the network firstly sends a ranging request before ranging, the ranging request includes time scale information of the node, the node B receiving the ranging request writes the time scale of the terminal a and the time scale difference of the node B into the ranging response information, after the terminal a receives the ranging response of the node B, the time difference TOA between the ranging request and the response is obtained, and then the distance d (i) between the two nodes is measured, the calculation formula is:
D(i)＝C×(TOA)； (4)
wherein C is the speed of light.
6. The networking method of an ad-hoc network according to claim 5, wherein a communication link information rate M (i, j) between node i and node j is defined, which represents a ratio of a total number of time slots of link e in an active state on a channel to the whole link scheduling period in a link scheduling period T, wherein the maximum throughput rate of node i information is defined as Mmax, msg (i) is an accumulation of all data streams passing through the node, and then the channel bandwidth utilization rate of node i is:
7. the networking method of an ad hoc network according to claim 6, wherein in the third step, when broadcasting the probe message with its own weight value, the node also receives the probe message with its own weight value from the neighboring node, compares the received weight value with its own weight value, and determines whether it can become a subnet cluster head according to the comparison result;
if the node in the comparison state receives the node detection message with the weight value smaller than that of the node, the comparison state is maintained, when the node detection message with the weight value larger than that of the node is received, the node can determine that the node cannot become a cluster head node, the state is converted into a quasi-cluster member state, and the joining process of the cluster members is started; when the weighted values of all the neighbor nodes are smaller than the weighted values of the neighbor nodes within the preset networking time, the node becomes a cluster head node;
in the process of selecting the cluster head, the situation that a plurality of nodes with equal weight values are all nodes with the maximum weight values in the same range may occur, and when the situation occurs, the nodes all become the cluster head nodes; if the weighted values of all the nodes are equal, the nodes can become cluster head nodes, isolated clusters are merged, and the clustering algorithm is degenerated into randomly selected cluster heads.
8. The networking method of an ad hoc network according to claim 7, wherein in the fourth step, the nodes whose weights are not the maximum in a hop range enter a quasi-cluster member state, and these nodes monitor a probe message of a cluster head node, and perform distribution of cluster member IDs, thereby joining a cluster; in order to ensure that non-clustered nodes are only added to cluster head nodes with the cluster member number smaller than Nmax, the cluster member number information is carried in the detection message of the cluster head nodes; the non-clustered node determines whether to join or not through the number of cluster members in the detection message; the joining process of the cluster members is divided into: monitoring cluster heads, establishing the relationship between cluster members and the cluster heads, and managing the cluster members.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011103029.4A CN112261665B (en) | 2020-10-15 | 2020-10-15 | Networking method of self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011103029.4A CN112261665B (en) | 2020-10-15 | 2020-10-15 | Networking method of self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112261665A true CN112261665A (en) | 2021-01-22 |
| CN112261665B CN112261665B (en) | 2022-10-14 |
Family
ID=74243311
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011103029.4A Active CN112261665B (en) | 2020-10-15 | 2020-10-15 | Networking method of self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112261665B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115226139A (en) * | 2022-09-19 | 2022-10-21 | 北京天辰合创科技有限公司 | Method and system for pushing and maintaining dual-redundancy high-reliability cluster head of wireless self-organizing network |
| WO2023219473A1 (en) * | 2022-05-12 | 2023-11-16 | 삼성전자 주식회사 | Method and device for cluster configuration and round allocation for uwb communication |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009104171A2 (en) * | 2008-02-22 | 2009-08-27 | France Telecom | Dynamic clustering management |
| CN102685808A (en) * | 2012-05-18 | 2012-09-19 | 电子科技大学 | Distribution type clustering method based on power control |
| CN103945487A (en) * | 2014-05-08 | 2014-07-23 | 国家电网公司 | Reliability node clustering method in power communication network |
| CN105744566A (en) * | 2016-01-28 | 2016-07-06 | 北京邮电大学 | Self-adaptive on-demand weighted clustering method based on perceptron |
| CN107071843A (en) * | 2016-12-28 | 2017-08-18 | 上海海事大学 | Mobile self-organizing network cluster dividing method |
| WO2018098753A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Management method for distributed network, node and system |
| CN110943920A (en) * | 2019-12-12 | 2020-03-31 | 电子科技大学 | Distributed cluster head election method based on wireless self-organizing network |
-
2020
- 2020-10-15 CN CN202011103029.4A patent/CN112261665B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009104171A2 (en) * | 2008-02-22 | 2009-08-27 | France Telecom | Dynamic clustering management |
| CN102685808A (en) * | 2012-05-18 | 2012-09-19 | 电子科技大学 | Distribution type clustering method based on power control |
| CN103945487A (en) * | 2014-05-08 | 2014-07-23 | 国家电网公司 | Reliability node clustering method in power communication network |
| CN105744566A (en) * | 2016-01-28 | 2016-07-06 | 北京邮电大学 | Self-adaptive on-demand weighted clustering method based on perceptron |
| WO2018098753A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Management method for distributed network, node and system |
| CN107071843A (en) * | 2016-12-28 | 2017-08-18 | 上海海事大学 | Mobile self-organizing network cluster dividing method |
| CN110943920A (en) * | 2019-12-12 | 2020-03-31 | 电子科技大学 | Distributed cluster head election method based on wireless self-organizing network |
Non-Patent Citations (1)
| Title |
|---|
| MANU SOOD: "Clustering In MANET and VANET: a Survey", 《2014 INTERNATIONAL CONFERENCE ON CIRCUITS, SYSTEMS, COMMUNICATION AND INFORMATION TECHNOLOGY APPLICATIONS》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023219473A1 (en) * | 2022-05-12 | 2023-11-16 | 삼성전자 주식회사 | Method and device for cluster configuration and round allocation for uwb communication |
| CN115226139A (en) * | 2022-09-19 | 2022-10-21 | 北京天辰合创科技有限公司 | Method and system for pushing and maintaining dual-redundancy high-reliability cluster head of wireless self-organizing network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112261665B (en) | 2022-10-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Youssef et al. | Overlapping multihop clustering for wireless sensor networks | |
| CN110943920B (en) | Distributed cluster head election method based on wireless self-organizing network | |
| Shaikh et al. | New metrics for dominating set based energy efficient activity scheduling in ad hoc networks | |
| Mishra et al. | Study of cluster based routing protocols in wireless sensor networks | |
| CN112261665B (en) | Networking method of self-organizing network | |
| Iwendi et al. | An ACO-KMT energy efficient routing scheme for sensed-IoT network | |
| CN103037436B (en) | Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP) | |
| Casari et al. | ALBA: An adaptive load-balanced algorithm for geographic forwarding in wireless sensor networks | |
| Barkunan et al. | An Efficient Deployment of Sensor Nodes in Wireless Sensor Networks for Agricultural Field. | |
| Sakhaee et al. | A new stable clustering scheme for pseudo-linear highly mobile ad hoc networks | |
| Francis et al. | Performance analysis of clustering protocols in Mobile Ad Hoc Networks | |
| Foroozan et al. | A high performance cluster-based broadcasting algorithm for wireless ad hoc networks based on a novel gateway selection approach | |
| Bachir et al. | Localized max-min remaining energy routing for wsn using delay control | |
| Sampaio et al. | DCRP: a scalable path selection and forwarding scheme for IEEE 802.11 s wireless mesh networks | |
| Chang et al. | A location-aware multicasting protocol for Bluetooth Location Networks | |
| Sonekar et al. | A loom for revealing selfish and malicious node in cluster based Adhoc wireless networks | |
| Adekiigbe et al. | Using fuzzy logic to improve cluster based routing protocol in mesh client networks | |
| Nath et al. | WACA: a new weighted adaptive clustering algorithm for MANET | |
| Vhatkar et al. | Performance evaluation and QoS analysis of PDCH and MBC routing protocols in wireless sensor networks | |
| Tuan et al. | Coverage and connectivity-aware clustering within k hops in wireless sensor and actuator networks | |
| Patil et al. | Cross layer AODV with position based forwarding routing for mobile adhoc network | |
| Purtoosi et al. | Improving broadcast performance by traffic isolation in wireless ad hoc networks | |
| Yao et al. | A cross-Layer synchronous dynamic token protocol for ad hoc networks | |
| Liu et al. | Scalable and robust data dissemination in wireless sensor networks | |
| Nikose et al. | CPAODV. A Cross Layer Path Metric Algorithm for TCP improvement in Wireless Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |