AT164481T

Method and apparatus for connecting a wireless lan to a wired lan

Abstract

Network communication procedure, through which wireless nodes (A, B, C, D, E) distribute intermediate data through wireless communication; - a node (A, B, C, D, E) sent a node (A, B, C, D, E) with each data message; As well as a request for assignment to a network intersection (AP1, AP2); - monitoring data received by wireless communication and identifying identification information determining the network node (A, B, C, D, E) transmitting data output data and identifying the identifying information determining the other network node interconnection nodes (AP1, AP2) sending the data; - store the other node identifying information identifying the interconnected node (AP1, AP2); - every time a node (A, B, C, D, E) the other node (A, B, C, D, E) assigned to the assigned network node (AP1, AP2) is sent, the stored identifier retrieves information; - and if the stored identifier information lacks a second identifier (A, B, C, D, E), the data to be sent is renamed and transferred to the assigned network node (AP1, AP2). Node for network communications, wirelessly communicating with a wireless network adapter transmitting and receiving data to other nodes of the network (A, B, C, D, E) and interconnection nodes (AP1, AP2); which node transmits information identifying a node coincident with each data message; and sending a request for assignment to a network intercept point (AP1, AP2), and receiving the received data; as well as identifying information identifying the network node (A, B, C, D, E) transmitting the data from the observed data and identifying information identifying the other network node interworking node (AP1, AP2) sending the data; the other node storing information identifying an intersecting node (AP1, AP2); the stored identifying information is forwarded to another node (A, B, C, D, E) other than the assigned interconnected node (AP1, AP2); and identifying a second node (A, B, C, D, E) in the missing information stored in the stored identity information is transmitted as a node that transmits the data to the remanufacturer and to the assigned inter-node node (AP1, AP2). ŕ and identifying information identifying the second network node interworking node (AP1, AP2) sending the data; the other node storing information identifying an intersecting node (AP1, AP2); the stored identifying information is forwarded to another node (A, B, C, D, E) other than the assigned interconnected node (AP1, AP2); and identifying a second node (A, B, C, D, E) in the missing information stored in the stored identity information is transmitted as a node that transmits the data to the remanufacturer and to the assigned inter-node node (AP1, AP2). ŕ and identifying information identifying the second network node interworking node (AP1, AP2) sending the data; the other node storing information identifying an intersecting node (AP1, AP2); the stored identifying information is forwarded to another node (A, B, C, D, E) other than the assigned interconnected node (AP1, AP2); and identifying a second node (A, B, C, D, E) in the missing information stored in the stored identity information is transmitted as a node that transmits the data to the remanufacturer and to the assigned inter-node node (AP1, AP2). ŕ the stored identifying information is forwarded to another node (A, B, C, D, E) other than the assigned interconnected node (AP1, AP2); and identifying a second node (A, B, C, D, E) in the missing information stored in the stored identity information is transmitted as a node that transmits the data to the remanufacturer and to the assigned inter-node node (AP1, AP2). ŕ the stored identifying information is forwarded to another node (A, B, C, D, E) other than the assigned interconnected node (AP1, AP2); and identifying a second node (A, B, C, D, E) in the missing information stored in the stored identity information is transmitted as a node that transmits the data to the remanufacturer and to the assigned inter-node node (AP1, AP2). ŕ

Term

No projected expiry on record.

  1. Priority
  2. Filed
  3. Granted
  4. Today

23 members in 13 offices

This recordMember, by publication datePriority claim3 more offices are in the list below

Priority claims1

Priority claims
DocumentOfficeKindDate
2129197CanadaA

Members23

Family members, oldest first
DocumentOfficeKind
CA2129197A1CanadaA1
WO9604734A1World Intellectual Property Organization (WIPO)A1
KR960006394ARepublic of KoreaA
JPH0865303AJapanA
HU9603625D0HungaryD0
CZ374996A3CzechiaA3
EP0772931A1European Patent Office (EPO)A1
PL318320A1PolandA1
HUT76242AHungaryA
EP0772931B1European Patent Office (EPO)B1
AT164481TThis recordAustriaT
DE69501896D1GermanyD1
ES2114326T3SpainT3
DE69501896T2GermanyT2
RU2121762C1Russian FederationC1
US5901362AUnited States of AmericaA
KR100192729B1Republic of KoreaB1
CA2129197CCanadaC
PL178035B1PolandB1
HU220518B1HungaryB1
US2002141368A1United States of AmericaA1
US6549786B2United States of AmericaB2
JP3429107B2JapanB2