Source: http://www.google.com/patents/US8009562?ie=ISO-8859-1&dq=6,183,366
Timestamp: 2015-03-02 21:40:10
Document Index: 697979422

Matched Legal Cases: ['Application No. 03', 'Application No. 03', 'Application No. 03', 'Application No. 03', 'Application No. 03', 'Application No. 2', 'Application No. 2']

Patent US8009562 - Integrated wireless distribution and mesh backhaul networks - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsNetworks, devices and methods related to wireless networking. A wireless network using nodes that perform both distribution and backhaul functions is provided. These nodes constitute the key elements of a wireless network that would be deployed and controlled by a wireless network operator. Each node...http://www.google.com/patents/US8009562?utm_source=gb-gplus-sharePatent US8009562 - Integrated wireless distribution and mesh backhaul networksAdvanced Patent SearchPublication numberUS8009562 B2Publication typeGrantApplication numberUS 12/708,768Publication dateAug 30, 2011Filing dateFeb 19, 2010Priority dateJun 28, 2002Also published asCA2490075A1, CA2490075C, CA2718599A1, CA2718599C, CA2718627A1, DE60325728D1, EP1518372A2, EP1518372B1, US7164667, US7693105, US8483066, US8520578, US20040001442, US20070047514, US20100208683, US20110075627, US20120063396, WO2004004219A2, WO2004004219A3Publication number12708768, 708768, US 8009562 B2, US 8009562B2, US-B2-8009562, US8009562 B2, US8009562B2InventorsStephen G. Rayment, Bernard HerscovichOriginal AssigneeBelair Networks Inc.Export CitationBiBTeX, EndNote, RefManPatent Citations (22), Non-Patent Citations (18), Referenced by (4), Classifications (24), Legal Events (2) External Links: USPTO, USPTO Assignment, EspacenetIntegrated wireless distribution and mesh backhaul networks
One major problem facing wireless networks is backhaul data transmission. As cellular and PCS voice utilization inside buildings increases and as the data transfer rate provided to the end user increases, the backhaul network feeding the localized wireless nodes gets heavily burdened. Each local wireless node servicing local wireless end users must be fed traffic from public and/or private, voice and/or data networks. As each end user demands coverage in more areas and higher data throughput, the backhaul network, the network that feeds the localized wireless nodes that actually distribute data traffic to individual end users, has to provide more and more data capacity. Further, as wireless data speed requirements increase, cell sizes�the area serviced by the localized wireless nodes�must shrink. As cell density increases, then, so does the number of backhaul nodes and links that are needed to feed the cells. In fact, the number of backhaul links increases inversely with the square of the wireless nodes' cell radius.
SkyPilot Networks, Inc. (www.skypilot.com) proposes a similar multipoint to multipoint wireless network with every subscriber node being coupled to every other node surrounding it. Data can then travel across any one of the links to arrive at the destination. Unfortunately, the performance of this type of network is highly dependent on the presence and location of the subscriber's equipment. It suffers from limits to scalability�since each subscriber node is potentially a connecting link for all traffic, each subscriber node can potentially become clogged with data traffic. In addition, there are problems in seeding initial network coverage. Furthermore, there is a greater potential lack of privacy between subscribers since each node can become an intercept point for network wide data leaks.
From the above, the main functions of a routing node are a superset of the functions of an end node. A routing node serves to route traffic from a source, such as an end user device in the same wireless network or a node in the larger network, to a destination, again such as an end user device in the wireless network or in another network. The traffic is sent encoded in at least one wireless signal that is transmitted from one routing node to another in the wireless network until it reaches its destination�either an end user device or the network aggregation node. If the destination is the network aggregation node, the traffic can be further routed via the core network to its ultimate destination. If the destination is an end user, the traffic is distributed to the end user device serviced by an appropriate routing or end node. It should therefore be clear that both routing and end nodes communicate with the end user devices and distributes the traffic which has been routed via other routing nodes. Both end and routing nodes receive traffic from the end user devices that they service and transmit this traffic to the appropriate routing or aggregation node for routing to their destination.
a) The daemon greets and establishes contact with neighboring nodes by sending identifying packets to the neighboring nodes. b) The daemon constructs and sends to each neighboring node a link state packet. Each link state packet contains the address/name/identifying indication of the originating node, the originating node's neighboring nodes, and, for each neighboring node, a cost associated with a dedicated link between the neighboring node and the originating node. c) Each link state packet is transmitted to all the other nodes and is provided with either time stamps or sequence numbers. The time stamps and/or sequence numbers are used to ensure that the latest data is being used for any particular routing node. The daemon keeps track of these link state packets and ensures that the latest data is being used for all nodes in the network. d) Each routing daemon in each node then continuously computes routes to each destination within the wireless network using its own home node as the starting point. This calculation can be done using, among others, the well-known Dijkstra Shortest Routing Path algorithm. This and other algorithms for calculating routing paths based on costs associated with each link may be found in texts such as �Introduction to Algorithms�, McGraw-Hill, 1990. For optimum results, the data traffic should be routed to a route in which the combined cost is minimal. As noted above, a cost is associated with each link between two nodes in the wireless network. For each link, the cost can be derived from:
Since the backhaul links are independent point to point connections, the allocation of transmission capacity between the two ends of a given backhaul link can be determined between the two ends independently of any other link. The allocation of capacity in the two directions may be predetermined�fixed or under operator control. Alternatively a protocol can negotiate between the two ends to decide on the flow of traffic on the basis of packets queued at each end of the link. The number or size of the packets can be used to determine which end is to transmit. This and other parameters of the link can be negotiated between the two ends of the link. Additionally for multimedia traffic, priority tags may be used with the packets as they are queued and Quality of Service (QoS) management may be used to alter the transmission order of the packets.
It should be clear that for the distribution function, each routing or end node has a limited geographic coverage in that only wireless end users within that geographic coverage can receive services from a particular node. Thus, wireless end user device being serviced by node 90C cannot be serviced by node 90M. Each node therefore covers a �cell�, a geographic area in which users can be serviced by a particular node. While cells may overlap, each node can service end user devices which are in its cell. To extend the coverage of the wireless network to multiple isolated islands, between which no coverage is required, dedicated routing nodes which only perform the backhaul function and not the distribution function may be used.
Referring to FIG. 4, a block diagram of a routing node device 170 is illustrated. This routing node device 170 performs both distribution and backhaul functions. As can be seen, the routing node device 170 is equipped with three backhaul wireless modules 110A, 110B, 110C with their corresponding directional antennae 120A, 120B, 120C. A multipoint distribution wireless module 130 and its antennae 140A, 140B, are present along with a management and control module 150 and power supply/battery backup module 160. Similar to the device 100 in FIG. 3, the multipoint distribution wireless module 130 communicates with end user devices 175A, 175B, 175C. A switch/router module 180 is coupled to all the wireless modules�backhaul wireless modules 110A, 110B, 110C and multipoint distribution wireless module 130. The switch/router module 180 routes traffic within the routing node device 170 to their proper wireless module interim destinations. As an example, information in traffic received from another routing node by way of one of the backhaul wireless modules may be destined for another routing node or it may be destined, via the distribution module, for an end user device currently being serviced by this routing node. If the information within that traffic is destined for another routing node, then the information is sent to one of the other backhaul wireless modules for transmission to a neighboring routing node. If the traffic is destined for an end user device currently being serviced by this particular routing node 170, then the traffic is routed by the switch/router 180 to the multipoint distribution wireless module 130. Otherwise, the traffic is routed to one of the other backhaul wireless modules 110B, 110C. This switch/router module 180, in conjunction with the management and control module 150, would implement whichever routing scheme is chosen.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4939726Jul 18, 1989Jul 3, 1990Metricom, Inc.Method for routing packets in a packet communication networkUS5115433Apr 20, 1990May 19, 1992Metricom, Inc.Method and system for routing packets in a packet communication networkUS5479400Jun 6, 1994Dec 26, 1995Metricom, Inc.Transceiver sharing between access and backhaul in a wireless digital communication systemUS5488608Apr 14, 1994Jan 30, 1996Metricom, Inc.Method and system for routing packets in a packet communication network using locally constructed routing tablesUS6219346Dec 2, 1997Apr 17, 2001At&T Corp.Packet switching architecture in cellular radioUS6298053Jan 14, 2000Oct 2, 2001Metricom, Inc.Method and apparatus for connection handoff between connected radiosUS6366584Feb 6, 1999Apr 2, 2002Triton Network Systems, Inc.Commercial network based on point to point radiosUS6370185Aug 10, 2000Apr 9, 2002Airnet Communications CorporationTranslating repeater system with improved backhaul efficiencyUS6618355May 7, 1999Sep 9, 2003Carriercomm, Inc.Service tariffing based on usage indicators in a radio based networkUS7283494 *Apr 15, 2002Oct 16, 2007Skypilot Networks, Inc.Network channel access protocol-interference and load adaptiveUS20020012336Aug 10, 2001Jan 31, 2002Radiant Networks PlcCommunications system and methodUS20020015397Aug 10, 2001Feb 7, 2002Radiant Networks PlcCommunications system and methodUS20020015402Aug 10, 2001Feb 7, 2002Radiant Networks PlcCommunications system and methodUS20020027896Aug 10, 2001Mar 7, 2002Radiant Networks PlcCommunications system and methodUS20020042274Oct 9, 2001Apr 11, 2002Radiant Networks PlcCommunications meshesUS20020044537Oct 9, 2001Apr 18, 2002Radiant Networks PlcCommunications meshesUS20020159409 *Apr 26, 2001Oct 31, 2002Charles WolfeRadio access network with meshed radio base stationsUS20040171400Feb 23, 2004Sep 2, 2004Eric RosenController for reducing latency in a group dormancy-wakeup process in a group communication networkUS20050153725Feb 3, 2005Jul 14, 2005Nokia CorporationMobile mesh Ad-Hoc networkingWO2000046958A2Feb 4, 2000Aug 10, 2000Triton Network Systems IncCommercial network based on point to point radiosWO2001024600A2Oct 6, 2000Apr 12, 2001Fiberless Soc Sverige AbNetwork arrangement, station for wireless switching, and port unit thereforWO2002051018A2Dec 17, 2001Jun 27, 2002Donald ChaffeeA polymorphic cellular network comprising nano cellular base stations with transceivers providing mobile and base station functions* Cited by examinerNon-Patent CitationsReference1"Nokia RoofTop Wireless Routing" White Paper; http://www.wbs.nokia.com/docs/White-Paper-Ver2.pdf.2"Wireless Broadband for Residential Markets" White Paper; http://www.wbs.nokia.com/docs/ResidentialWhitePaper.pdf.3"Nokia RoofTop Wireless Routing" White Paper; http://www.wbs.nokia.com/docs/White�Paper�Ver2.pdf.4Annex of European Patent Office Communication relating to EP Patent Application No. 03 735 229.1 dated Mar. 29, 2005.5European Patent Office Communication relating to EP Patent Application No. 03 735 229.1 dated Jan. 3, 2007.6European Patent Office Communication relating to EP Patent Application No. 03 735 229.1 dated May 29, 2006.7European Patent Office Communication relating to EP Patent Application No. 03 735 229.1 dated Oct. 5, 2005.8European Patent Office Communication relating to EP Patent Application No. 03 735 229.1 dated Sep. 7, 2007.9Examiner's Report relating to Canadian Patent Application No. 2,490,075 dated Apr. 20, 2010.10Examiner's Report relating to Canadian Patent Application No. 2,718,627 dated Jan. 31, 2011.11Information Disclosure Statement relating to U.S. Appl. No. 10/183,730 dated Aug. 3, 2004.12Information Disclosure Statement relating to U.S. Appl. No. 10/183,730 dated May 20, 2003.13Information Disclosure Statement relating to U.S. Appl. No. 10/183,730 dated Nov. 27, 2002.14Information Disclosure Statement relating to U.S. Appl. No. 11/592,994 dated Feb. 21, 2007.15International Search Report relating to PCT International Patent Application No. PCT/CA2003/000917 (WO 2004/004219) dated Jun. 27, 2003.16Notice of Allowance relating to U.S. Appl. No. 10/183,730 dated Sep. 28, 2006.17Notice of Allowance relating to U.S. Appl. No. 11/592,994 dated Nov. 19, 2009.18Office Action relating to U.S. Appl. No. 11/592,994 dated May 14, 2009.Referenced byCiting PatentFiling datePublication dateApplicantTitleUS8504091 *Jan 26, 2009Aug 6, 2013Qualcomm IncorporatedInterference mitigation for control channels in a wireless communication networkUS8599705Jan 26, 2009Dec 3, 2013Qualcomm IncorporatedInterference management based on enhanced pilot measurement reportsUS20090197631 *Jan 26, 2009Aug 6, 2009Qualcomm IncorporatedInterference mitigation for control channels in a wireless communication networkWO2014041414A1Sep 11, 2013Mar 20, 2014Telefonaktiebolaget L M Ericsson (Publ)Vault antenna for wlan or cellular application* Cited by examinerClassifications U.S. Classification370/230, 370/329, 370/400, 370/419International ClassificationH04W84/00, H04W40/02, H04W40/06, H04L12/56, H04W28/08, H04L12/28, H04J1/16, H04W40/24, H04W40/00Cooperative ClassificationH04W28/08, H04W84/00, H04L45/124, H04W40/246, H04W40/02, H04W40/06, H04W40/00, H04L45/02European ClassificationH04W84/00, H04L45/124, H04L45/02Legal EventsDateCodeEventDescriptionMay 16, 2011ASAssignmentFree format text: SECURITY AGREEMENT;ASSIGNOR:BELAIR NETWORKS INC., A CORPORATION EXISTING UNDER THE LAWS OF THE PROVINCE OF ONTARIO;REEL/FRAME:026282/0232Owner name: COMERICA BANK, A TEXAS BANKING ASSOCIATION AND AUTEffective date: 20110505Jan 25, 2011ASAssignmentFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:RAYMENT, STEPHEN G;HERSCOVICH, BERNARD;REEL/FRAME:025688/0324Owner name: BELAIR NETWORKS INC., CANADAEffective date: 20020625RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services