Abstract
The algorithm proposed in this patent enables any node in a Wireless Mesh Network (WMN) to have knowledge of all intermediate nodes, in all the possible-routes towards the destination node. The algorithm uses a novel recursive algorithm to accumulate knowledge beyond the neighbouring nodes, as well as the sequence of all the intermediate nodes used to form these routes. Prime numbers are used in the address of the host portion of the WMN node IP address to identify the optimum route.
| Original language | English |
|---|---|
| Patent number | GB2479136 |
| Filing date | 30/03/10 |
| Publication status | Published - 27 Aug 2014 |
Bibliographical note
Page bookmark GB2479136 (A) - Routing and node addressing in wireless mesh networksInventor(s): AL-SHERBAZ ALI HABIB AL-JASMIN [GB]; JASIM SABAH [GB]; LAMI IHSAN ALSHAHIB [GB]; ADAMS CHRIS [GB] +
Applicant(s): AL-SHERBAZ ALI HABIB AL-JASMIN [GB]; JASIM SABAH [GB]; LAMI IHSAN ALSHAHIB [GB]; ADAMS CHRIS [GB]; UNIV BUCKINGHAM [GB] +
Classification:
- international: H04L12/56; H04L29/12; H04W40/24; H04W8/26
- cooperative:
H04L12/56; H04L29/12; H04L29/12009; H04L29/12216; H04L29/12801; H04L45/02; H04L61/2007; H04L61/6004; H04W40/24; H04W40/246; H04W8/26; H04W8/26 more
Application number: GB20100005254 20100330
Priority number(s): GB20100005254 20100330
Also published as:
GB2479136 (B)
Fingerprint
Dive into the research topics of 'Method and process for routing and node addressing in wireless mesh networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver