US20090122753A1 - Dynamic data link segmentation and reassembly - Google Patents
Dynamic data link segmentation and reassembly Download PDFInfo
- Publication number
- US20090122753A1 US20090122753A1 US12/242,597 US24259708A US2009122753A1 US 20090122753 A1 US20090122753 A1 US 20090122753A1 US 24259708 A US24259708 A US 24259708A US 2009122753 A1 US2009122753 A1 US 2009122753A1
- Authority
- US
- United States
- Prior art keywords
- node
- data
- link
- packets
- data link
- 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.)
- Abandoned
Links
Images
Classifications
-
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/16—Multipoint routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/20—Hop count for routing purposes, e.g. TTL
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/302—Route determination based on requested QoS
-
- 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/16—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on interference
-
- 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/30—Connectivity information management, e.g. connectivity discovery or connectivity update for proactive routing
Definitions
- This invention relates to physical layer communications in a Mobile Ad Hoc Network (MANET), and more particularly to dynamic segmentation and reassembly of data packets in a data link of a MANET.
- MANET Mobile Ad Hoc Network
- Dynamic Data Link Segmentation and Reassembly (SAR) functions perform a large packet to small packet transformation and reassembles packets at a receiving node.
- the packet size is determined dynamically in response to link quality data for each individual data link. By periodically sharing link quality information with neighbors, the segmentation size and corresponding reassembly can be performed using readily available neighborhood and waveform information.
- a method that is disclosed herein includes providing a data item for transmission from a first node to a second node over a data link in an ad hoc wireless network, the data item having a length; determining a link quality of the data link; selecting a transmit mode for the data link according to the link quality, the transmit mode including a data rate; determining a payload length for the data link according to the data rate; segmenting the data item into one or more segments according to the payload length; and transmitting the one or more segments as one or more packets over the data link.
- a device that is disclosed herein includes a data source that provides data; a data link that packetizes data from the data source into a packet; a radio that provides an air interface to a mobile ad hoc network including a link to a neighboring node; and a signal processor that prepares the packet for transmission over the air interface, the signal processor adapted to dynamically segment the packet into one or more segments according to a data rate for the link.
- a computer program product that is disclosed herein performs the steps of providing a data item for transmission from a first node to a second node over a data link in an ad hoc wireless network; determining a link quality of the data link; selecting a transmit mode for the data link according to the link quality, the transmit mode including a data rate; determining a payload length for the data link according to the data rate; segmenting the data item into one or more segments according to the payload length; and transmitting the one or more segments as one or more packets over the data link.
- FIG. 1 is a block diagram of a Mobile Ad Hoc Network (MANET).
- MANET Mobile Ad Hoc Network
- FIG. 2 is a block diagram of a MANET having multiple backhaul access points.
- FIG. 3 is a block diagram of a node in a MANET.
- FIG. 4 is a flow chart of a process for measuring link quality.
- FIG. 5 is a flow chart of a process for dynamic segmentation and reassembly of data.
- So-called “infrastructure” networks employ base stations at fixed locations to form a substantially fixed network infrastructure.
- the base stations may enable communication among the wireless devices of the network, between a wireless device and another device on another network, and so on.
- This general approach is employed, for example, in 802.11 or WiFi networks, as well as in cellular telephony networks.
- ad hoc wireless communications networks are formed in an ad hoc manner among any number of participating nodes that may periodically join, leave, or move within the ad hoc network.
- Such networks do not belong to any fixed network infrastructure, they may support conventional network communications such as point-to-point or broadcast communications, and may be adapted for use with any of the Internet Protocols (e.g. IPv4, IPv6) or similar, well-established networking protocols.
- a Mobile Ad Hoc Network is an ad hoc wireless network in which some (or all) of the participating devices—also referred to herein as “nodes”—are mobile.
- the topography of a MANET may change not only as nodes enter and leave the network, but as nodes move relative to one another within the network.
- communications routes through the network may also vary in terms of availability and in terms of quality. While the invention(s) disclosed herein have broad applicability, they may be particularly useful in a MANET environment where the context of continuously changing node-to-node links poses challenges to, and opportunities for, maintaining traffic flow.
- FIG. 1 shows a Mobile Ad Hoc Network (MANET) that may be used with the systems and methods described herein.
- a MANET 100 may include subscriber devices 102 , access points 104 , and backhaul access points 108 (for coupling to a core network 110 such as the Internet), and subscriber devices 110 , all generally interconnected as shown in FIG. 1 .
- a core network 110 such as the Internet
- subscriber devices 110 all generally interconnected as shown in FIG. 1 .
- one or more of the subscriber devices 102 may be a stationary device 112 that does not move within the MANET 100 . It will be understood that the device-to-device links illustrated in FIG.
- the links among devices within the MANET 100 are wireless links, although wired links may optionally be employed in various locations such as between the backhaul access point 108 and the core networks 110 .
- typically one or more protocols are shared among the participating devices to control creation, removal, and modification of individual data links between devices, and to route traffic and control information among the devices.
- protocol as used herein generally refers to any and all such rules, procedures, and/or algorithms used in maintaining the MANET 100 , unless a specific protocol is explicitly stated or otherwise clear from the context.
- Subscriber devices 102 may include any general purpose nodes participating in the MANET 100 according to suitable protocols. It will be understood that while subscriber devices 102 may include terminal nodes that send or receive data, in a MANET 100 as described herein subscriber devices 102 may also suitably be employed as intermediate nodes to route traffic to and from other subscriber devices 102 . Thus an ad hoc network as described herein is generally extensible, and as new subscriber devices 102 appear within the MANET 100 , they may form a part of the MANET 100 fabric that routes traffic among other nodes. In general, subscriber devices 102 may include any network or computing devices that include a wireless interface, network protocol stack(s), and the like adapted to participate in the MANET 100 .
- the Internet Protocol may usefully be employed in subscriber devices 102 within the MANET 100 in order to use well-established addressing schemes and the like.
- a subscriber device 102 may include without limitation a cellular phone, personal digital assistant, wireless electronic mail client, laptop computer, palmtop computer, desktop computer, video device, digital camera, electrical instrument, sensor, detector, display, media player, navigation device, smart phone, a wireless networking card, or any other device that might usefully participate in a network.
- subscriber devices may include a GPS receiver providing a position and timing reference.
- each subscriber device 102 may be authenticated and/or authorized before being granted access to the MANET 100 .
- Access points 104 may be provided to establish a permanent or otherwise generally stable infrastructure to the MANET 100 .
- the access points 104 may employ identical network functionality and protocol stacks as subscriber devices 102 .
- an access point 104 may have a number of differences related to their dedicated function within the MANET 100 .
- the access points 104 may have no associated computing device that originates or consumes network traffic. That is, the access points 104 may simply form a fixed mesh of participants in the MANET 100 and relay traffic among other network participants.
- An access point 104 may also include a physical connection to a power infrastructure so that it may be physically installed at a location and operate autonomously without requiring regular maintenance for battery changes and the like.
- access points 104 may include some minimal supplemental circuitry related to, e.g., status and diagnostics, or for receiving software updates and the like. This may improve continuity of coverage across a physical region where subscriber devices 102 may or may not be present with any regularity, and may ensure that wireless network resources are available in a desired area.
- the access point 104 may be of a size and weight making it suitable for mounting and/or concealment in a variety of locations including indoor and outdoor locations, and including mounting on walls, floors, ground, ceilings, roofs, utility poles, and so forth.
- Each access point 104 may include or utilize a timing reference such as any of the Network Timing Protocols described in RFC 778, RFC 891, RFC 956, RFC 958, RFC 1305, RFC 1361, RFC 1769, RFC 2030, and RFC 4330, all published by The Internet Engineering Task Force.
- Each access point may also, or instead, include a GPS receiver providing a position and timing reference.
- the wireless access points 104 may have a greater transmit power and/or a greater antenna gain than mobile subscriber devices 102 , thus providing greater physical coverage than some other devices within the MANET 100 .
- the MANET 100 may include one or more backhaul access points 108 that generally operate to connect nodes within the MANET 100 to a core network 110 such as the Internet.
- a backhaul access point 108 may have a wireless radio interface, protocol stack(s) and other components of other nodes within the MANET 100 .
- the backhaul access point 108 may provide any suitable interface to the core network 110 .
- the backhaul access point 108 may, for example, be deployed at a fiber access point or the like that provides high-speed data capacity Internet traffic.
- the fiber access point may include a Gig-E router site or an OC-3/12 add-drop multiplexer site.
- the backhaul access point 108 may include two Gig-E interfaces for backhaul connections. It will be understood that any number of a variety of suitable interfaces for backhaul connections may be usefully employed with a backhaul access point 108 as described herein.
- a backhaul access point 108 may serve multiple access points 104 within the MANET 100 , and may distribute network load across those access points 104 .
- a single backhaul access point 108 may serve a single access point 104 .
- the number of access points 104 served by a backhaul access point 108 may relate to the amount of intra-MANET traffic and extra-MANET traffic, the nature and direction of multicast versus unicast data, and so forth. This association between backhaul access points 108 and access points 104 may change from time to time depending on the presence of other subscriber devices 102 within the area, network conditions, and so forth. In some cases an access point 104 may for a time be associated with more than one backhaul access point.
- the core networks 110 may provide access to network resources outside the MANET 100 .
- the core networks 114 may connect disparate, geographically remote and/or local instances of the MANET 100 to form a single network.
- the core networks 110 may include any and all forms of IP networks, including LANs, MANs, WANs, and so on.
- the core networks 110 may also or instead include the public Internet.
- the core networks 110 may consist exclusively of a single zone of administrative control, or a number of zones of administrative control, or some combination of an administrative zone and any of the foregoing.
- the stationary device 112 may include any subscriber device 102 that, for whatever reason, does not physically move within the MANET 100 .
- such fixed physical points within the MANET 100 may provide useful routing alternatives for traffic that can be exploited for load balancing, redundancy, and so forth. This may include, for example, a fixed desktop computer within the MANET 100 .
- any of the nodes above that participate in the MANET 100 according to the MWP may include a hardware platform enabling radio software and firmware upgrades, which may include for example a dedicated or general purpose computing device, memory, digital signal processors, radio-frequency components, an antenna, and any other suitable hardware and/or software suitable for implementing the MWP in participating nodes.
- any of the foregoing devices may also include an adapter for other networks such as an Ethernet network adapter or equivalent IP network adapter, router, and the like, so that non-MANET 100 equipment can participate in the MANET 100 through the device. It will also be appreciated that, while a connection to other core networks 110 is shown, this connection is optional.
- a MANET 100 (with or without fixed access points 104 ) may be maintained independently without connections to any other networks, and may be usefully employed for the sole purpose of trafficking data among subscriber devices 102 .
- FIG. 2 is a block diagram of a MANET having multiple backhaul access points.
- the MANET 100 may include subscriber devices 102 (not shown), access points 104 , and backhaul access points 108 for connecting to core networks 110 , and an edge router 202 that facilitates routing between the MANET 100 and the core networks 110 .
- the edge router 202 may include any devices or systems for maintaining connectivity between the MANET 100 and the core networks 110 , and may further support or enhance network activity within the MANET 100 .
- the edge router 202 may include an industry standard and/or proprietary Address Resolution Protocol server, an application server, a Virtual Private Network server, a Network Address Translation server, a firewall, a Domain Name System server, a Dynamic Host Configuration Protocol server, and/or an Operations, Administration, Maintenance and Provisioning server, as well as any combination of the foregoing.
- These various components may be integrated into the edge router 202 , or may be provided as separate (physical and/or logical) systems that support operation of the edge router 202 .
- These supporting systems may in general support operations such as broadband Internet connectivity within the MANET 100 and the like, broadcast communications crossing between the MANET 100 and the core networks 110 , and so forth, as well as the use of multiple backhaul access points 108 to efficiently route inter-MANET traffic among subscriber devices 102 .
- FIG. 3 is a block diagram of a node in a MANET.
- the node may be any of the devices described above, such as a subscriber device 102 , access point 104 , or backhaul access point.
- the node 300 may include data sources 302 , a data link 304 , a signal processor 306 , a radio 308 , data queues 310 , routing information 312 , and neighborhood information 314 .
- the following description is general in nature, and that numerous arrangements of processing, storage, and radio frequency hardware may be suitably employed to similar affect. This description is intended to outline certain operations of a MANET node relevant to the systems and methods described herein, and in no way limits the invention to the specific architecture shown in FIG. 3 .
- the data sources 302 may include any applications or other hardware and/or software associated with the node 300 . This may include, for example, programs running on a laptop or other portable computing device, a web server or client, a multimedia input and/or output sources such as a digital camera or video, and so forth. More generally any device, sensor, detector, or the like that might send or receive data may operate as a data source 302 in the node 300 . It will be further understood that some nodes such as access points 104 may not have independent data sources 302 , and may function exclusively as MANET 100 network elements that relay data among other nodes and/or provide network stability as generally described above.
- the data link 304 may include hardware and/or software implementing data link layer functionality such as neighbor management, segmentation and reassembly of data packets, Quality of Service (QoS) management, data queue servicing, channel access, adaptive data rates, and any other suitable data link functions.
- data link 304 controls participation of the data sources 302 , and more generally the node 300 , in a MANET. It will be understood that the data link 304 in FIG.
- routing protocols may be implemented within hardware/software of the data link 304 in order to ensure that nodes in the MANET 100 share appropriate routing functions.
- the systems and methods of this disclosure might also or instead be implemented with variations to a conventional protocol stack, or without any formal protocol stack whatsoever.
- the data link 304 may include a link manager that collects neighbor information from the data link layer, and may form and maintains the neighborhood information 314 for the node 300 .
- This table may be used to establish routes to neighbors, and may be updated periodically with information from one and two hop neighbors as described further below.
- the link manager may monitor statistics on all active links for a node on a link-by-link basis in order to support link quality calculations and other functions described herein.
- the signal processor 306 may include waveform processing and timing functions associated with transceiving data at the node 300 . This may include, for example, network timing, time-slot and/or frame-based waveform configuration, maintenance of one or more families of Orthogonal Frequency Division Multiplexing waveform modes (or other transmit mode waveforms), receiver detection of waveform modes, error correction coding, and so forth.
- the signal processor 306 may be implemented in any suitable combination of digital signal processors, field programmable gate arrays, application-specific integrated circuits, microprocessors, or other general or special-purpose computing devices.
- a family of Orthogonal Frequency Division Multiplexing (OFDM) waveforms may be employed for adaptive data rate communications.
- the modes of the OFDM waveforms may, for example, include 7.2 MHz Quadrature Phase-Shift Keying (QPSK), 4.8 MHz QPSK, 2.4 MHz QPSK, 1.2 MHz QPSK, 1.2 MHz Binary Phase-Shift Keying (BPSK), or the like.
- the effective data rate for transmit waveforms may be affected by other parameters such as error correction.
- the transmit modes may be organized into an ordered list of monotonically increasing data rates matched to correspondingly decreasing signal robustness, thus permitting unique mapping of link quality to transmit mode.
- the actual waveform mode selected to transmit data on a link may be adaptively selected according to any suitable evaluation of link quality for links to neighboring nodes.
- the radio 308 in general operates to transmit data from the data queue(s) 310 , as organized and encoded by the data link 304 and the signal processor 306 (along with any control information, packet header information, and so forth), over a wireless air interface to other nodes in a MANET, and to perform complementary data reception.
- the radio 308 may include any radio frequency analog circuitry and the like, and may be coupled to the signal processor 306 which converts data and control information between a digital representation used within the node 300 , and an analog representation used in radio frequency communications with other nodes.
- a low power radio 308 may be employed, such as where the node 300 is a battery-powered mobile device.
- a high-power radio 308 may be employed, such as where the node 300 is an access point or backhaul access point connected to a fixed power infrastructure.
- the radio 308 and signal processor 306 provide adaptive data rate coding capable of changing transmit modes, error correction, and the like according to measured link quality.
- the data queue(s) 310 may include any data for transmission from the node 300 . This may include, for example, data from the data sources 302 , data that is relayed by the node 300 from other nodes in the MANET, and/or control information scheduled for transmission within data packets from the node 300 .
- the data queue(s) 310 may be organized in any suitable fashion, and may include a single first-in-first-out queue, multiple queues, prioritized queues, and the like.
- the node 300 may include multiple prioritized queues to assist in providing various service levels, such as for QoS traffic.
- data in the data queue(s) 310 is delivered according to any suitable queuing mechanism to the data link 304 , signal processor 306 , and radio 308 for transmission within the MANET.
- Routing information 312 such as a routing or forwarding table may be provided to support routing functions by the node 300 .
- this may include, for example, a destination address or identifier, a cost of a path to the destination (using any suitably cost calculation), and a next hop on that path.
- Other information such as quality of service and other metrics for various routes and links may also be provided for more refined routing decisions.
- Neighborhood information 314 may be maintained in a database, flat file, routing table, or other suitably organized volatile or non-volatile storage within the node 300 .
- the neighborhood information 314 generally supports the creation and maintenance of the MANET as well as routing functions of each MANET node. Within the MANET, each node may interact with other nodes to autonomously identify and maintain local network connections, shift capacity, dynamically form routes throughout the network, and so on.
- the routing functions of the node (as supported by the neighbourhood information 314 ) may accommodate delay-sensitive (e.g. voice) traffic, delay-tolerant traffic with quality of service (QoS) prioritization, and so on.
- delay-sensitive e.g. voice
- QoS quality of service
- the neighborhood information 314 may include an identification of neighboring nodes along with information relating to those nodes. This may include one-hop neighbors (i.e., neighboring nodes in direct wireless communication with the node 300 ), two-hop neighbors (i.e., neighboring nodes that communicate with the node 300 through only one other node), or any other nodes or participants within the MANET.
- neighborhood information 314 includes link quality information for the radio 308 , which may be obtained from any combination of physical layer and data link data, and may be employed to adapt the data rate of communications according to currently present channel conditions.
- the neighborhood information may also include QoS data used to select next hops for QoS data. Other useful information may include bandwidth utilization, node weights, node position (either logical or physical), and queue latency for each QoS type and/or other priority type.
- the neighborhood information 314 may be gathered during periodic exchanges (such as during control transmissions) with neighboring nodes, which may occur under control of the link manager of the data link 304 .
- the node 300 may determine output bandwidth (i.e., data transmit requirements) for each link that the node 300 has with a neighbor, and may transmit this to one-hop neighbors.
- the node 300 may receive output bandwidth from each one-hop neighbor.
- each node 300 may further calculate its own input bandwidth (i.e., data receive requirements) from each link to a neighboring node, and this information may in turn be exchanged with one-hop neighbors.
- the node 300 (and every other node in the MANET) may calculate a node weight that represents relative output requirements for the node 300 .
- the node weight, W may be calculated as:
- the node 300 may transmit the node weight to each neighboring node, and may in turn receive a node weight from each neighboring node.
- the node weight, W may be further processed for use with other neighborhood information 314 , such as by limiting the value according to the number of bits used for control information, or by providing a supplemental adjustment to the node weight to further refine control of routing or other MANET functions. Sharing of information for maintenance of the neighborhood information 314 may be controlled, for example, by the data link 304 , which may apply any suitable technique to determine when to share information with one hop neighbors.
- the data link 304 may transmit data whenever a change is detected in the MANET such as an addition or deletion of a node.
- the neighborhood information 314 may include position data in order to support location-based routing and the like.
- GPS Global Positioning System
- FIG. 4 is a flow chart of a process for measuring link quality.
- the process 400 may start 402 with a node counting packets received on a link over some predetermined time period such as one second as shown in step 404 . Over a corresponding time period, the node may also count packets sent on the link as shown in step 406 .
- packet counts may include a count of the number of slots received in a TDMA frame.
- Each node may then exchange packet count information for each link with neighboring nodes as shown in step 408 .
- This may include, for example, transmitting a count of packets received for each link to each neighboring node, and receiving from each neighboring node the number of packets that they received over each link.
- This data may be used, for example, to evaluate missed, dropped, or otherwise lost packets for each data link as described below.
- Each node may obtain a obtaining a Receive Strength Signal Indicator (RSSI) from a channel, as shown in step 410 .
- RSSI Receive Strength Signal Indicator
- This data may be obtained, for example, directly from the radio hardware for the node. It will be understood that while an RSSI is a common metric available from radio hardware, any suitable signal strength indicator may also, or instead, be employed.
- the node may then calculate a link quality for each link, and the process 400 may return to step 404 where new packet counts may be obtained.
- Any suitable calculation may be used to calculate link quality. For example a ratio of sent-to-received packets may be obtained and weighted according to the RSSI. These values provide a useful metric that combines the actual, physical signal strength and the actual, observed packet integrity for a link. Other metrics may also, or instead, be employed, such as a signal-to-noise ratio, an average signal-to-noise ratio over a predetermined time interval, a bit-error rate (prior to any forward error correction), or a simple dropped packet count.
- the resulting link quality metric(s) may be usefully employed in a number of manners.
- the link quality metric(s) may be employed to select a transmit mode (and corresponding data rate) for each link, thus supporting an adaptive data rate communication channel.
- link quality information may be stored in the neighborhood information for the node, and may be employed in cost-based route calculations and other routing or network functions. More specifically as it relates to this disclosure, the link quality metric(s) may be employed to support dynamic segmentation and reassembly of packets as described in greater detail below.
- FIG. 5 is a flow chart of a process for dynamic segmentation and reassembly of data.
- the process 500 includes a transmit node process 502 and a receive node process 504 executed on a node that transmits the data and a node that receives the data respectively.
- the process 500 may begin 506 with receiving a packet of data as shown in step 508 .
- the packet may be received from any source within a node, including without limitation one of the data sources of the node as described above, or from one of the data queues of the node used for relaying unicast or multicast data.
- the packet may be a layer three packet including header information such as a source identifier (e.g., a layer 2 address of the node that transmitted the packet), a destination identifier (e.g., a layer 2 address of a final destination for the packet), a type of the packet (e.g., control, application data, invalid), and a type of service for the packet (e.g., a QoS level or the like for the packet).
- a source identifier e.g., a layer 2 address of the node that transmitted the packet
- a destination identifier e.g., a layer 2 address of a final destination for the packet
- a type of the packet e.g., control, application data, invalid
- a type of service for the packet e.g., a QoS level or the like for the packet.
- a data link refers to an aspect of the air interface for a node, as distinguished from the data link 304 described above, which is hardware and/or software implementing layer three and other functionality of a network protocol stack.
- a data link for the packet may be evaluated.
- this evaluation may be made with direct reference to information in the neighborhood information maintained by the data link, and may simply require retrieving relevant information for the link.
- link quality, a transmit mode, and the corresponding payload length may be predetermined for the link according to any adaptive data rate protocol employed within the node and/or MANET, and accessed as needed by the segmentation and reassembly process to facilitate efficient segmentation and reassembly of data.
- the payload length may be stored with other information for the link, or may be calculated based on other parameters for the corresponding waveform mode. Relevant information may also, or instead, be obtained by direct measurement of physical layer characteristics, or by some combination of these.
- evaluation of the data link may draw on information collected and maintained by the node during ordinary operation, or may occur concurrently with receipt of the packet using any available data, or some combination of these.
- the evaluation of the data link may result in a determination or selection of a payload length for physical layer packets transmitted by the radio.
- the packet received in step 508 may be segmented.
- this step involves a comparison of the packet length to the available payload length for the transmit mode of the data link. If the packet length is smaller than the payload length, the data in the packet may be transmitted without segmentation. If the packet length is greater than the payload length, any type of segmentation may be suitably employed.
- a network packet may be divided into one, two, four, or eight segments.
- additional capacity in a transmit mode payload may be filled with other data, including other segments of other network packets intended for the same data link or node.
- each segment may be encapsulated for communication to another node in the MANET.
- This may include the addition of a header containing any of the header information from the original packet, as well as supplemental information to support reassembly.
- the segment header may include a transmit mode of the segment, a payload length for the segment that specifies a length of a data portion of the packet (e.g., in bytes), a fragment identifier that specifies a position of the segment in the original packet, and a last fragment indicator.
- a stream identifier may be provided that identifies a number of related segments such as segments that share a destination and/or source address, type of service, and transmit mode.
- This may be used, for example, to identify a number of segments belonging to a common stream, but spanning two or more of the network packets received in step 508 .
- a non-segmented packet may be identified using this header information, such as by setting both the fragment identifier and the last fragment indicator to a value of one. It will be understood that the segmentation header information described above is optional. Information such as service types and transmit modes may also or instead be obtained or inferred from neighborhood information maintained by the receiving node as generally described above.
- a segment may be transmitted to a receiving node. This may include analyzing header information and queuing the segment for transmission using any suitable techniques. The segment may then be transmitted over a link of the air interface using a corresponding link and transmit mode.
- the segment may be received by a receiving node over the corresponding link of the air interface.
- the segment may then be reassembled with other segments into a network packet using complementary operations to those described above.
- this reassembly may include using data in the segment header and/or information maintained at the receiving node concerning the neighboring nodes.
- the reassembled network packet may be queued for transmission to another node in the MANET according to any destination information appended to the data. It will be understood that this step is optional, and where the data is intended for use at the receiving node, the network packet may instead be further decoded for use in applications or the like executing on the receiving node according to any protocol stack(s) on the node. Where the packet is queued for forwarding to another node, the network packet may again be segmented as generally described above.
- the process may end. It will be appreciated that the process 500 may be repeated at each hop of a path through a network.
- a segmentation and reassembly process that dynamically segments and reassembles data on a link-by-link basis across a multi-hop network route.
- steps that evaluate link quality and assign waveform transmit modes to individual links may execute independently from the segmentation and reassembly process, and may provide a programming interface, function call, object, service, or the like that provides relevant neighborhood data on an as-needed basis.
- a node may support multiple data queues, each of which may execute segmentation and reassembly processes in parallel or serially. It will be further understood that the methods and systems described above may be suitably adapted to other hardware and or software, such as by using directional antennas to maintain individual data links or by using neighborhood information instead of segment header information to control segmentation and reassembly. All such variations that would be apparent to one of ordinary skill in the art are intended to fall within the scope of this disclosure.
- the system components may be realized in hardware, software, or some combination of these.
- the components may be realized in one or more microprocessors, microcontrollers, embedded microcontrollers, programmable digital signal processors or other programmable devices, along with internal and/or external memory such as read-only memory, programmable read-only memory, electronically erasable programmable read-only memory, random access memory, dynamic random access memory, double data rate random access memory, Rambus direct random access memory, flash memory, or any other volatile or non-volatile memory for storing program instructions, program data, and program output or other intermediate or final results.
- the components may also, or instead, include one or more application specific integrated circuits (ASICs), dedicated semiconductor devices, programmable gate arrays, programmable array logic devices, or any other device that may be configured to process electronic signals.
- ASICs application specific integrated circuits
- any combination of the above circuits and components may be suitably adapted to use with the systems described herein.
- the above components may be realized as computer executable code created using a structured programming language such as C, an object oriented programming language such as C++, or any other high-level or low-level programming language that may be compiled or interpreted to run on one of the above devices, as well as heterogeneous combinations of processors, processor architectures, or combinations of different hardware and software. Any such combination of hardware and software suitable for use in an ad hoc network as described herein may be employed without departing from the scope of this disclosure.
Abstract
In a Mobile Ad Hoc Network (MANET), Dynamic Data Link Segmentation and Reassembly (SAR) functions perform a large packet to small packet transformation and reassembles packets at a receiving node. The packet size is determined dynamically in response to link quality data for each individual data link. By periodically sharing link quality information with neighbors, the segmentation size and corresponding reassembly can be performed using readily available neighborhood and waveform information.
Description
- This application claims the benefit of the following U.S. Provisional Patent Applications, each of which is incorporated by reference herein in its entirety:
- U.S. App. No. 60/976,730 filed on Oct. 1, 2007;
- U.S. App. No. 60/976,735 filed on Oct. 1, 2007;
- U.S. App. No. 60/976,740 filed on Oct. 1, 2007;
- U.S. App. No. 60/976,744 filed on Oct. 1, 2007;
- U.S. App. No. 60/976,747 filed on Oct. 1, 2007; and
- U.S. App. No. 60/976,748 filed on Oct. 1, 2007.
- This invention was made with support of the United States Government under Contract MDA972-01-9-0022. The United States Government may have certain rights in the invention.
- This invention relates to physical layer communications in a Mobile Ad Hoc Network (MANET), and more particularly to dynamic segmentation and reassembly of data packets in a data link of a MANET. There remains a need for improved physical layer handling of data in wireless ad hoc networks, particularly where traffic of varying types and priorities are exchanged over dynamically changing data links.
- In a Mobile Ad Hoc Network (MANET), Dynamic Data Link Segmentation and Reassembly (SAR) functions perform a large packet to small packet transformation and reassembles packets at a receiving node. The packet size is determined dynamically in response to link quality data for each individual data link. By periodically sharing link quality information with neighbors, the segmentation size and corresponding reassembly can be performed using readily available neighborhood and waveform information.
- In one aspect, a method that is disclosed herein includes providing a data item for transmission from a first node to a second node over a data link in an ad hoc wireless network, the data item having a length; determining a link quality of the data link; selecting a transmit mode for the data link according to the link quality, the transmit mode including a data rate; determining a payload length for the data link according to the data rate; segmenting the data item into one or more segments according to the payload length; and transmitting the one or more segments as one or more packets over the data link.
- In one aspect, a device that is disclosed herein includes a data source that provides data; a data link that packetizes data from the data source into a packet; a radio that provides an air interface to a mobile ad hoc network including a link to a neighboring node; and a signal processor that prepares the packet for transmission over the air interface, the signal processor adapted to dynamically segment the packet into one or more segments according to a data rate for the link.
- In one aspect, a computer program product that is disclosed herein performs the steps of providing a data item for transmission from a first node to a second node over a data link in an ad hoc wireless network; determining a link quality of the data link; selecting a transmit mode for the data link according to the link quality, the transmit mode including a data rate; determining a payload length for the data link according to the data rate; segmenting the data item into one or more segments according to the payload length; and transmitting the one or more segments as one or more packets over the data link.
- The invention and the following detailed description of certain embodiments thereof may be understood by reference to the following figures wherein:
-
FIG. 1 is a block diagram of a Mobile Ad Hoc Network (MANET). -
FIG. 2 is a block diagram of a MANET having multiple backhaul access points. -
FIG. 3 is a block diagram of a node in a MANET. -
FIG. 4 is a flow chart of a process for measuring link quality. -
FIG. 5 is a flow chart of a process for dynamic segmentation and reassembly of data. - The following description details certain embodiments of a dynamic segmentation and reassembly technique for use in packetizing data for transmission over wireless communication links. By tracking link quality based on local metrics and/or information shared among nodes in the network, data can be segmented and reassembled dynamically to provide more efficient use of communication links without requiring more overhead in individual packet headers. While the invention is described below in relation to Mobile Ad Hoc Networks, it will be understood that the principles of the invention may be suitably applied in any environment where link quality and/or transmission modes vary dynamically, and information relating to link quality is available to nodes participating in a network.
- So-called “infrastructure” networks employ base stations at fixed locations to form a substantially fixed network infrastructure. The base stations may enable communication among the wireless devices of the network, between a wireless device and another device on another network, and so on. This general approach is employed, for example, in 802.11 or WiFi networks, as well as in cellular telephony networks. By contrast, ad hoc wireless communications networks are formed in an ad hoc manner among any number of participating nodes that may periodically join, leave, or move within the ad hoc network. Although such networks do not belong to any fixed network infrastructure, they may support conventional network communications such as point-to-point or broadcast communications, and may be adapted for use with any of the Internet Protocols (e.g. IPv4, IPv6) or similar, well-established networking protocols.
- In general, a Mobile Ad Hoc Network (MANET) is an ad hoc wireless network in which some (or all) of the participating devices—also referred to herein as “nodes”—are mobile. Thus the topography of a MANET may change not only as nodes enter and leave the network, but as nodes move relative to one another within the network. As the network topology changes, communications routes through the network may also vary in terms of availability and in terms of quality. While the invention(s) disclosed herein have broad applicability, they may be particularly useful in a MANET environment where the context of continuously changing node-to-node links poses challenges to, and opportunities for, maintaining traffic flow.
-
FIG. 1 shows a Mobile Ad Hoc Network (MANET) that may be used with the systems and methods described herein. In general, a MANET 100 may includesubscriber devices 102,access points 104, and backhaul access points 108 (for coupling to acore network 110 such as the Internet), andsubscriber devices 110, all generally interconnected as shown inFIG. 1 . Without limiting the generality of the foregoing, one or more of thesubscriber devices 102 may be astationary device 112 that does not move within theMANET 100. It will be understood that the device-to-device links illustrated inFIG. 1 are for purposes of illustration only, and in no way are intended to limit the nature or number of links between devices in theMANET 100, which may be created, removed, and/or modified over time according to any corresponding protocols followed by the devices within theMANET 100. In general, the links among devices within the MANET 100 are wireless links, although wired links may optionally be employed in various locations such as between thebackhaul access point 108 and thecore networks 110. In order to maintain the MANET 100, typically one or more protocols are shared among the participating devices to control creation, removal, and modification of individual data links between devices, and to route traffic and control information among the devices. The term protocol as used herein generally refers to any and all such rules, procedures, and/or algorithms used in maintaining theMANET 100, unless a specific protocol is explicitly stated or otherwise clear from the context. -
Subscriber devices 102 may include any general purpose nodes participating in the MANET 100 according to suitable protocols. It will be understood that whilesubscriber devices 102 may include terminal nodes that send or receive data, in aMANET 100 as described hereinsubscriber devices 102 may also suitably be employed as intermediate nodes to route traffic to and fromother subscriber devices 102. Thus an ad hoc network as described herein is generally extensible, and asnew subscriber devices 102 appear within theMANET 100, they may form a part of theMANET 100 fabric that routes traffic among other nodes. In general,subscriber devices 102 may include any network or computing devices that include a wireless interface, network protocol stack(s), and the like adapted to participate in the MANET 100. The Internet Protocol may usefully be employed insubscriber devices 102 within the MANET 100 in order to use well-established addressing schemes and the like. Asubscriber device 102 may include without limitation a cellular phone, personal digital assistant, wireless electronic mail client, laptop computer, palmtop computer, desktop computer, video device, digital camera, electrical instrument, sensor, detector, display, media player, navigation device, smart phone, a wireless networking card, or any other device that might usefully participate in a network. In some embodiments subscriber devices may include a GPS receiver providing a position and timing reference. In embodiments, eachsubscriber device 102 may be authenticated and/or authorized before being granted access to theMANET 100. -
Access points 104 may be provided to establish a permanent or otherwise generally stable infrastructure to the MANET 100. In one embodiment, theaccess points 104 may employ identical network functionality and protocol stacks assubscriber devices 102. However, anaccess point 104 may have a number of differences related to their dedicated function within theMANET 100. In one aspect, theaccess points 104 may have no associated computing device that originates or consumes network traffic. That is, theaccess points 104 may simply form a fixed mesh of participants in theMANET 100 and relay traffic among other network participants. Anaccess point 104 may also include a physical connection to a power infrastructure so that it may be physically installed at a location and operate autonomously without requiring regular maintenance for battery changes and the like. In another aspect,access points 104 may include some minimal supplemental circuitry related to, e.g., status and diagnostics, or for receiving software updates and the like. This may improve continuity of coverage across a physical region wheresubscriber devices 102 may or may not be present with any regularity, and may ensure that wireless network resources are available in a desired area. In embodiments theaccess point 104 may be of a size and weight making it suitable for mounting and/or concealment in a variety of locations including indoor and outdoor locations, and including mounting on walls, floors, ground, ceilings, roofs, utility poles, and so forth. - Each
access point 104 may include or utilize a timing reference such as any of the Network Timing Protocols described in RFC 778, RFC 891, RFC 956, RFC 958, RFC 1305, RFC 1361, RFC 1769, RFC 2030, and RFC 4330, all published by The Internet Engineering Task Force. Each access point may also, or instead, include a GPS receiver providing a position and timing reference. In embodiments thewireless access points 104 may have a greater transmit power and/or a greater antenna gain thanmobile subscriber devices 102, thus providing greater physical coverage than some other devices within theMANET 100. - The
MANET 100 may include one or morebackhaul access points 108 that generally operate to connect nodes within theMANET 100 to acore network 110 such as the Internet. On one interface, abackhaul access point 108 may have a wireless radio interface, protocol stack(s) and other components of other nodes within theMANET 100. On another interface, thebackhaul access point 108 may provide any suitable interface to thecore network 110. Thebackhaul access point 108 may, for example, be deployed at a fiber access point or the like that provides high-speed data capacity Internet traffic. For example and without limitation, the fiber access point may include a Gig-E router site or an OC-3/12 add-drop multiplexer site. In an embodiment thebackhaul access point 108 may include two Gig-E interfaces for backhaul connections. It will be understood that any number of a variety of suitable interfaces for backhaul connections may be usefully employed with abackhaul access point 108 as described herein. - A
backhaul access point 108 may servemultiple access points 104 within theMANET 100, and may distribute network load across those access points 104. Alternatively, a singlebackhaul access point 108 may serve asingle access point 104. In some embodiments, the number ofaccess points 104 served by abackhaul access point 108 may relate to the amount of intra-MANET traffic and extra-MANET traffic, the nature and direction of multicast versus unicast data, and so forth. This association betweenbackhaul access points 108 andaccess points 104 may change from time to time depending on the presence ofother subscriber devices 102 within the area, network conditions, and so forth. In some cases anaccess point 104 may for a time be associated with more than one backhaul access point. - The core networks 110 may provide access to network resources outside the
MANET 100. The core networks 114 may connect disparate, geographically remote and/or local instances of theMANET 100 to form a single network. The core networks 110 may include any and all forms of IP networks, including LANs, MANs, WANs, and so on. The core networks 110 may also or instead include the public Internet. In other embodiments thecore networks 110 may consist exclusively of a single zone of administrative control, or a number of zones of administrative control, or some combination of an administrative zone and any of the foregoing. - The
stationary device 112 may include anysubscriber device 102 that, for whatever reason, does not physically move within theMANET 100. In general, such fixed physical points within theMANET 100 may provide useful routing alternatives for traffic that can be exploited for load balancing, redundancy, and so forth. This may include, for example, a fixed desktop computer within theMANET 100. - Details of
various MANET 100 protocols—referred to collectively herein as the MANET Wireless Protocol (MWP)—are provided below. In general, any of the nodes above that participate in theMANET 100 according to the MWP may include a hardware platform enabling radio software and firmware upgrades, which may include for example a dedicated or general purpose computing device, memory, digital signal processors, radio-frequency components, an antenna, and any other suitable hardware and/or software suitable for implementing the MWP in participating nodes. - In embodiments, any of the foregoing devices, such as one of the
access points 104, may also include an adapter for other networks such as an Ethernet network adapter or equivalent IP network adapter, router, and the like, so thatnon-MANET 100 equipment can participate in theMANET 100 through the device. It will also be appreciated that, while a connection toother core networks 110 is shown, this connection is optional. A MANET 100 (with or without fixed access points 104) may be maintained independently without connections to any other networks, and may be usefully employed for the sole purpose of trafficking data amongsubscriber devices 102. -
FIG. 2 is a block diagram of a MANET having multiple backhaul access points. In general, theMANET 100 may include subscriber devices 102 (not shown),access points 104, andbackhaul access points 108 for connecting tocore networks 110, and anedge router 202 that facilitates routing between theMANET 100 and the core networks 110. - The
edge router 202 may include any devices or systems for maintaining connectivity between theMANET 100 and thecore networks 110, and may further support or enhance network activity within theMANET 100. For example, theedge router 202 may include an industry standard and/or proprietary Address Resolution Protocol server, an application server, a Virtual Private Network server, a Network Address Translation server, a firewall, a Domain Name System server, a Dynamic Host Configuration Protocol server, and/or an Operations, Administration, Maintenance and Provisioning server, as well as any combination of the foregoing. These various components may be integrated into theedge router 202, or may be provided as separate (physical and/or logical) systems that support operation of theedge router 202. These supporting systems may in general support operations such as broadband Internet connectivity within theMANET 100 and the like, broadcast communications crossing between theMANET 100 and thecore networks 110, and so forth, as well as the use of multiplebackhaul access points 108 to efficiently route inter-MANET traffic amongsubscriber devices 102. -
FIG. 3 is a block diagram of a node in a MANET. The node may be any of the devices described above, such as asubscriber device 102,access point 104, or backhaul access point. In general thenode 300 may includedata sources 302, adata link 304, asignal processor 306, aradio 308,data queues 310, routinginformation 312, andneighborhood information 314. It will be understood that the following description is general in nature, and that numerous arrangements of processing, storage, and radio frequency hardware may be suitably employed to similar affect. This description is intended to outline certain operations of a MANET node relevant to the systems and methods described herein, and in no way limits the invention to the specific architecture shown inFIG. 3 . - The
data sources 302 may include any applications or other hardware and/or software associated with thenode 300. This may include, for example, programs running on a laptop or other portable computing device, a web server or client, a multimedia input and/or output sources such as a digital camera or video, and so forth. More generally any device, sensor, detector, or the like that might send or receive data may operate as adata source 302 in thenode 300. It will be further understood that some nodes such asaccess points 104 may not haveindependent data sources 302, and may function exclusively asMANET 100 network elements that relay data among other nodes and/or provide network stability as generally described above. - The data link 304 may include hardware and/or software implementing data link layer functionality such as neighbor management, segmentation and reassembly of data packets, Quality of Service (QoS) management, data queue servicing, channel access, adaptive data rates, and any other suitable data link functions. In general, the data link 304 controls participation of the
data sources 302, and more generally thenode 300, in a MANET. It will be understood that the data link 304 inFIG. 3 may implement any number of lower layer (e.g., physical layer) or higher layer (e.g., routing, transport, session, presentation, application) protocols from a conventional Open Systems Interconnection (OSI) Model, or any such protocols and related functions may be implemented elsewhere within thenode 300, such as in an IP stack executing on thedata source 302, or in firmware within thesignal processor 306 orradio 308, or in additional functional blocks not depicted inFIG. 3 . For example, routing protocols may be implemented within hardware/software of the data link 304 in order to ensure that nodes in theMANET 100 share appropriate routing functions. Thus it will be appreciated that while the certain elements discussed herein might suitably be placed within the data link layer of a formal protocol stack, the systems and methods of this disclosure might also or instead be implemented with variations to a conventional protocol stack, or without any formal protocol stack whatsoever. - The data link 304 may include a link manager that collects neighbor information from the data link layer, and may form and maintains the
neighborhood information 314 for thenode 300. This table may be used to establish routes to neighbors, and may be updated periodically with information from one and two hop neighbors as described further below. The link manager may monitor statistics on all active links for a node on a link-by-link basis in order to support link quality calculations and other functions described herein. - The
signal processor 306 may include waveform processing and timing functions associated with transceiving data at thenode 300. This may include, for example, network timing, time-slot and/or frame-based waveform configuration, maintenance of one or more families of Orthogonal Frequency Division Multiplexing waveform modes (or other transmit mode waveforms), receiver detection of waveform modes, error correction coding, and so forth. In general, thesignal processor 306 may be implemented in any suitable combination of digital signal processors, field programmable gate arrays, application-specific integrated circuits, microprocessors, or other general or special-purpose computing devices. - In one embodiment, a family of Orthogonal Frequency Division Multiplexing (OFDM) waveforms may be employed for adaptive data rate communications. The modes of the OFDM waveforms may, for example, include 7.2 MHz Quadrature Phase-Shift Keying (QPSK), 4.8 MHz QPSK, 2.4 MHz QPSK, 1.2 MHz QPSK, 1.2 MHz Binary Phase-Shift Keying (BPSK), or the like. The effective data rate for transmit waveforms may be affected by other parameters such as error correction. In order to facilitate implementation of an adaptive rate system, the transmit modes may be organized into an ordered list of monotonically increasing data rates matched to correspondingly decreasing signal robustness, thus permitting unique mapping of link quality to transmit mode. In one aspect, the actual waveform mode selected to transmit data on a link may be adaptively selected according to any suitable evaluation of link quality for links to neighboring nodes.
- The
radio 308 in general operates to transmit data from the data queue(s) 310, as organized and encoded by thedata link 304 and the signal processor 306 (along with any control information, packet header information, and so forth), over a wireless air interface to other nodes in a MANET, and to perform complementary data reception. Theradio 308 may include any radio frequency analog circuitry and the like, and may be coupled to thesignal processor 306 which converts data and control information between a digital representation used within thenode 300, and an analog representation used in radio frequency communications with other nodes. In embodiments, alow power radio 308 may be employed, such as where thenode 300 is a battery-powered mobile device. In other embodiments, a high-power radio 308 may be employed, such as where thenode 300 is an access point or backhaul access point connected to a fixed power infrastructure. In an embodiment, theradio 308 andsignal processor 306 provide adaptive data rate coding capable of changing transmit modes, error correction, and the like according to measured link quality. - The data queue(s) 310 may include any data for transmission from the
node 300. This may include, for example, data from thedata sources 302, data that is relayed by thenode 300 from other nodes in the MANET, and/or control information scheduled for transmission within data packets from thenode 300. The data queue(s) 310 may be organized in any suitable fashion, and may include a single first-in-first-out queue, multiple queues, prioritized queues, and the like. In one embodiment, thenode 300 may include multiple prioritized queues to assist in providing various service levels, such as for QoS traffic. In general, data in the data queue(s) 310 is delivered according to any suitable queuing mechanism to thedata link 304,signal processor 306, andradio 308 for transmission within the MANET. - Routing
information 312 such as a routing or forwarding table may be provided to support routing functions by thenode 300. In general, this may include, for example, a destination address or identifier, a cost of a path to the destination (using any suitably cost calculation), and a next hop on that path. Other information such as quality of service and other metrics for various routes and links may also be provided for more refined routing decisions. -
Neighborhood information 314 may be maintained in a database, flat file, routing table, or other suitably organized volatile or non-volatile storage within thenode 300. Theneighborhood information 314 generally supports the creation and maintenance of the MANET as well as routing functions of each MANET node. Within the MANET, each node may interact with other nodes to autonomously identify and maintain local network connections, shift capacity, dynamically form routes throughout the network, and so on. The routing functions of the node (as supported by the neighbourhood information 314) may accommodate delay-sensitive (e.g. voice) traffic, delay-tolerant traffic with quality of service (QoS) prioritization, and so on. - The
neighborhood information 314 may include an identification of neighboring nodes along with information relating to those nodes. This may include one-hop neighbors (i.e., neighboring nodes in direct wireless communication with the node 300), two-hop neighbors (i.e., neighboring nodes that communicate with thenode 300 through only one other node), or any other nodes or participants within the MANET. In one aspect,neighborhood information 314 includes link quality information for theradio 308, which may be obtained from any combination of physical layer and data link data, and may be employed to adapt the data rate of communications according to currently present channel conditions. The neighborhood information may also include QoS data used to select next hops for QoS data. Other useful information may include bandwidth utilization, node weights, node position (either logical or physical), and queue latency for each QoS type and/or other priority type. - In one aspect, the
neighborhood information 314 may be gathered during periodic exchanges (such as during control transmissions) with neighboring nodes, which may occur under control of the link manager of thedata link 304. For example, thenode 300 may determine output bandwidth (i.e., data transmit requirements) for each link that thenode 300 has with a neighbor, and may transmit this to one-hop neighbors. Similarly, thenode 300 may receive output bandwidth from each one-hop neighbor. Using this data, eachnode 300 may further calculate its own input bandwidth (i.e., data receive requirements) from each link to a neighboring node, and this information may in turn be exchanged with one-hop neighbors. Following a system-wide exchange with one-hop neighbors, the node 300 (and every other node in the MANET) may calculate a node weight that represents relative output requirements for thenode 300. For example, the node weight, W, may be calculated as: -
- where BWout is the total output or transmit requirements for each link of the
node 300, and BWin is the total input or receive requirements for each link of thenode 300. Finally, thenode 300 may transmit the node weight to each neighboring node, and may in turn receive a node weight from each neighboring node. It will be appreciated that the node weight, W, may be further processed for use withother neighborhood information 314, such as by limiting the value according to the number of bits used for control information, or by providing a supplemental adjustment to the node weight to further refine control of routing or other MANET functions. Sharing of information for maintenance of theneighborhood information 314 may be controlled, for example, by thedata link 304, which may apply any suitable technique to determine when to share information with one hop neighbors. In one aspect, thedata link 304 may transmit data whenever a change is detected in the MANET such as an addition or deletion of a node. - In another aspect, for a MANET that has location-aware nodes 300 (e.g., using Global Positioning System (GPS) data, signal strength data, and so forth), the
neighborhood information 314 may include position data in order to support location-based routing and the like. - Having described in general terms a MANET that can implement the dynamic segmentation and reassembly disclosed herein, the description now turns to a more detailed treatment of an embodiment of systems and methods for dynamic segmentation and reassembly of data. First, an example embodiment of link quality measurement is provided, followed by an example embodiment of the use of this link quality data to segment and reassemble data packets in the physical layer of a MANET radio.
-
FIG. 4 is a flow chart of a process for measuring link quality. Theprocess 400 may start 402 with a node counting packets received on a link over some predetermined time period such as one second as shown instep 404. Over a corresponding time period, the node may also count packets sent on the link as shown instep 406. For a Time Division Multiple Access (TDMA) system, packet counts may include a count of the number of slots received in a TDMA frame. - Each node may then exchange packet count information for each link with neighboring nodes as shown in
step 408. This may include, for example, transmitting a count of packets received for each link to each neighboring node, and receiving from each neighboring node the number of packets that they received over each link. This data may be used, for example, to evaluate missed, dropped, or otherwise lost packets for each data link as described below. - Each node may obtain a obtaining a Receive Strength Signal Indicator (RSSI) from a channel, as shown in
step 410. This data may be obtained, for example, directly from the radio hardware for the node. It will be understood that while an RSSI is a common metric available from radio hardware, any suitable signal strength indicator may also, or instead, be employed. - As shown in
step 412, the node may then calculate a link quality for each link, and theprocess 400 may return to step 404 where new packet counts may be obtained. Any suitable calculation may be used to calculate link quality. For example a ratio of sent-to-received packets may be obtained and weighted according to the RSSI. These values provide a useful metric that combines the actual, physical signal strength and the actual, observed packet integrity for a link. Other metrics may also, or instead, be employed, such as a signal-to-noise ratio, an average signal-to-noise ratio over a predetermined time interval, a bit-error rate (prior to any forward error correction), or a simple dropped packet count. The resulting link quality metric(s) may be usefully employed in a number of manners. In one aspect, the link quality metric(s) may be employed to select a transmit mode (and corresponding data rate) for each link, thus supporting an adaptive data rate communication channel. In another aspect, link quality information may be stored in the neighborhood information for the node, and may be employed in cost-based route calculations and other routing or network functions. More specifically as it relates to this disclosure, the link quality metric(s) may be employed to support dynamic segmentation and reassembly of packets as described in greater detail below. - It will be understood that numerous variations to the
above process 400 are possible without departing from the scope of the invention. For example, the rate of change in link quality, distance between nodes, network topology, node movement, or any other metrics that can be captured by one or more nodes and usefully employed in a link quality calculation. Similarly, the order of steps in theprocess 400 above is not strictly required, and a step such as calculation of link quality may be performed at any regular interval relative to packet counts and channel measurements. Further, while illustrated as a single process, it will be understood that any number of link calculations may be performed, either in serial or in parallel, for some or all of the links of a node. All such variations that would be apparent to one of ordinary skill in that art and may be usefully employed in a MANET node are intended to fall within the scope of this disclosure. -
FIG. 5 is a flow chart of a process for dynamic segmentation and reassembly of data. In general, theprocess 500 includes a transmitnode process 502 and a receivenode process 504 executed on a node that transmits the data and a node that receives the data respectively. Theprocess 500 may begin 506 with receiving a packet of data as shown instep 508. The packet may be received from any source within a node, including without limitation one of the data sources of the node as described above, or from one of the data queues of the node used for relaying unicast or multicast data. The packet may be a layer three packet including header information such as a source identifier (e.g., a layer 2 address of the node that transmitted the packet), a destination identifier (e.g., a layer 2 address of a final destination for the packet), a type of the packet (e.g., control, application data, invalid), and a type of service for the packet (e.g., a QoS level or the like for the packet). It will be understood that while the following description relates to packets, which are typically used in an IP network, any data item may be usefully processed as described herein, whether it is received in packetized or other streamed, serial, or segmented form. For purposes of clarity, it is further noted that a data link, as used in the following description, refers to an aspect of the air interface for a node, as distinguished from the data link 304 described above, which is hardware and/or software implementing layer three and other functionality of a network protocol stack. - As shown in
step 510, a data link for the packet may be evaluated. In one embodiment, this evaluation may be made with direct reference to information in the neighborhood information maintained by the data link, and may simply require retrieving relevant information for the link. Thus, link quality, a transmit mode, and the corresponding payload length may be predetermined for the link according to any adaptive data rate protocol employed within the node and/or MANET, and accessed as needed by the segmentation and reassembly process to facilitate efficient segmentation and reassembly of data. The payload length may be stored with other information for the link, or may be calculated based on other parameters for the corresponding waveform mode. Relevant information may also, or instead, be obtained by direct measurement of physical layer characteristics, or by some combination of these. Thus, in general evaluation of the data link may draw on information collected and maintained by the node during ordinary operation, or may occur concurrently with receipt of the packet using any available data, or some combination of these. However performed, the evaluation of the data link may result in a determination or selection of a payload length for physical layer packets transmitted by the radio. - As shown in
step 512, after determining a payload length for data based upon an evaluation of a particular data link, the packet received instep 508 may be segmented. In general, this step involves a comparison of the packet length to the available payload length for the transmit mode of the data link. If the packet length is smaller than the payload length, the data in the packet may be transmitted without segmentation. If the packet length is greater than the payload length, any type of segmentation may be suitably employed. By way of example, for an adaptive data rate system using four transmit modes having payload lengths of 1× the network packet length, 0.5× the network packet length, 0.25× the network packet length, and 0.125× the network packet length, a network packet may be divided into one, two, four, or eight segments. In one aspect, additional capacity in a transmit mode payload may be filled with other data, including other segments of other network packets intended for the same data link or node. It will be appreciated that the above example is provided by way of illustration and not limitation, and that there are numerous types of segmentation that may be suitably and usefully implemented in a segmentation and reassembly process as described herein. The applicant has successfully deployed a dynamic segmentation and reassembly as described herein using as many as twelve different waveform modes. - As shown in
step 514, each segment may be encapsulated for communication to another node in the MANET. This may include the addition of a header containing any of the header information from the original packet, as well as supplemental information to support reassembly. For example, the segment header may include a transmit mode of the segment, a payload length for the segment that specifies a length of a data portion of the packet (e.g., in bytes), a fragment identifier that specifies a position of the segment in the original packet, and a last fragment indicator. A stream identifier may be provided that identifies a number of related segments such as segments that share a destination and/or source address, type of service, and transmit mode. This may be used, for example, to identify a number of segments belonging to a common stream, but spanning two or more of the network packets received instep 508. A non-segmented packet may be identified using this header information, such as by setting both the fragment identifier and the last fragment indicator to a value of one. It will be understood that the segmentation header information described above is optional. Information such as service types and transmit modes may also or instead be obtained or inferred from neighborhood information maintained by the receiving node as generally described above. - As shown in
step 516, a segment may be transmitted to a receiving node. This may include analyzing header information and queuing the segment for transmission using any suitable techniques. The segment may then be transmitted over a link of the air interface using a corresponding link and transmit mode. - As shown in
step 518, the segment may be received by a receiving node over the corresponding link of the air interface. The segment may then be reassembled with other segments into a network packet using complementary operations to those described above. In general, this reassembly may include using data in the segment header and/or information maintained at the receiving node concerning the neighboring nodes. - As shown in
step 520, the reassembled network packet may be queued for transmission to another node in the MANET according to any destination information appended to the data. It will be understood that this step is optional, and where the data is intended for use at the receiving node, the network packet may instead be further decoded for use in applications or the like executing on the receiving node according to any protocol stack(s) on the node. Where the packet is queued for forwarding to another node, the network packet may again be segmented as generally described above. - As shown in
step 522, the process may end. It will be appreciated that theprocess 500 may be repeated at each hop of a path through a network. Thus in one aspect there is disclosed herein a segmentation and reassembly process that dynamically segments and reassembles data on a link-by-link basis across a multi-hop network route. It will further be appreciated that the order of the steps above may be varied, and that steps may be added to, removed from, or modified in theabove process 500 without departing from the scope of this disclosure. For example, steps that evaluate link quality and assign waveform transmit modes to individual links may execute independently from the segmentation and reassembly process, and may provide a programming interface, function call, object, service, or the like that provides relevant neighborhood data on an as-needed basis. In addition, a node may support multiple data queues, each of which may execute segmentation and reassembly processes in parallel or serially. It will be further understood that the methods and systems described above may be suitably adapted to other hardware and or software, such as by using directional antennas to maintain individual data links or by using neighborhood information instead of segment header information to control segmentation and reassembly. All such variations that would be apparent to one of ordinary skill in the art are intended to fall within the scope of this disclosure. - A wide range of software and hardware platforms may be used to deploy the systems and methods described herein. Generally, the system components may be realized in hardware, software, or some combination of these. The components may be realized in one or more microprocessors, microcontrollers, embedded microcontrollers, programmable digital signal processors or other programmable devices, along with internal and/or external memory such as read-only memory, programmable read-only memory, electronically erasable programmable read-only memory, random access memory, dynamic random access memory, double data rate random access memory, Rambus direct random access memory, flash memory, or any other volatile or non-volatile memory for storing program instructions, program data, and program output or other intermediate or final results. The components may also, or instead, include one or more application specific integrated circuits (ASICs), dedicated semiconductor devices, programmable gate arrays, programmable array logic devices, or any other device that may be configured to process electronic signals.
- Any combination of the above circuits and components, whether packaged discretely, as a chip, as a chip set, or as a die, may be suitably adapted to use with the systems described herein. It will further be appreciated that the above components may be realized as computer executable code created using a structured programming language such as C, an object oriented programming language such as C++, or any other high-level or low-level programming language that may be compiled or interpreted to run on one of the above devices, as well as heterogeneous combinations of processors, processor architectures, or combinations of different hardware and software. Any such combination of hardware and software suitable for use in an ad hoc network as described herein may be employed without departing from the scope of this disclosure.
- Those skilled in the art will recognize, or will be able to ascertain using no more than routine experimentation, numerous equivalents to the systems and methods described herein. Such equivalents are considered to fall within the scope of the present invention. Moreover, the embodiments described herein are intended to exemplify the invention and not to limit it. While the invention is described above in connection with certain preferred embodiments, other embodiments may be understood by those of ordinary skill in the art. All such variations, modifications, extensions, additions, omissions, and the like as would be apparent to one of ordinary skill in the art are intended to fall within the scope of this disclosure, which is to be interpreted in the broadest sense allowable by law.
Claims (20)
1. A method comprising:
providing a data item for transmission from a first node to a second node over a data link in an ad hoc wireless network, the data item having a length;
determining a link quality of the data link;
selecting a transmit mode for the data link according to the link quality, the transmit mode including a data rate;
determining a payload length for the data link according to the data rate;
segmenting the data item into one or more segments according to the payload length; and
transmitting the one or more segments as one or more packets over the data link.
2. The method of claim 1 further comprising measuring a link quality of the data link, and selecting a data rate for the data link based upon the link quality.
3. The method of claim 2 wherein selecting a data rate further includes selecting one of a plurality of transmit modes for the data link.
4. The method of claim 2 wherein measuring a link quality includes obtaining a receive signal strength indicator for the data link.
5. The method of claim 4 further comprising communicating the receive signal strength indicator from the first node to the second node.
6. The method of claim 2 further comprising counting a number of packets sent from the second node to the first node and transmitting this number from the second node to the first node.
7. The method of claim 6 wherein measuring a link quality includes comparing the number of packets sent from the second node to a number of packets received from the second node.
8. The method of claim 1 further comprising selecting the data link from a plurality of available data links between the first node and the second node.
9. The method of claim 1 further comprising:
receiving the one or more packets at the second node;
receiving a receive signal strength indicator at the second node, the receive signal strength indicator indicative of a strength of a signal for the data link received at the first node from the second node;
receiving a first packet count from the first node, the first packet count indicative of a number of packets received at the first node from the second node over a time period;
maintaining a second packet count at the second node, the second packet count indicative of a number of packets transmitted from the second node to the first node over the time period;
inferring a segmentation for the one or more packets based upon the first packet count, the second packet count and the receive signal strength indicator; and
reassembling the data item based upon the segmentation of the one or more packets.
10. The method of claim 9 further comprising determining a second receive signal strength indicator according to a strength of a signal for the data link received at the second node from the first node and transmitting the second receive signal strength indicator from the second node to the first node.
11. The method of claim 1 further comprising, when the payload length is larger than a segment of the data item one of the packets, adding a second segment of a second data item to the payload of the one of the packets.
12. The method of claim 1 wherein segmenting includes selectively using one, two or four segments for each of the one or more packets according to a length of the data item.
13. A device comprising:
a data source that provides data;
a data link that packetizes data from the data source into a packet;
a radio that provides an air interface to a mobile ad hoc network including a link to a neighboring node; and
a signal processor that prepares the packet for transmission over the air interface, the signal processor adapted to dynamically segment the packet into one or more segments according to a data rate for the link.
14. The device of claim 13 wherein the air interface includes a plurality of links to a plurality of neighboring nodes.
15. The device of claim 13 wherein the signal processor modulates the one or more segments with one of a plurality of waveform modes, the one of the plurality of waveform modes selected according to a link quality metric for the link.
16. The device of claim 15 wherein the link quality metric is determined using a signal strength indicator for the link.
17. The device of claim 15 wherein the link quality metric is determined using a received packet count and a sent packet count for the link.
18. A computer program product comprising computer executable code that, when executing on one or more computing devices, performs the steps of:
providing a data item for transmission from a first node to a second node over a data link in an ad hoc wireless network;
determining a link quality of the data link;
selecting a transmit mode for the data link according to the link quality, the transmit mode including a data rate;
determining a payload length for the data link according to the data rate;
segmenting the data item into one or more segments according to the payload length; and
transmitting the one or more segments as one or more packets over the data link.
19. The computer program product of claim 18 further comprising computer executable code that performs the step of measuring a link quality of the data link, and selecting a data rate for the data link based upon the link quality.
20. The computer program product of claim 18 wherein selecting a data rate further includes selecting one of a plurality of transmit modes for the data link.
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/242,597 US20090122753A1 (en) | 2007-10-01 | 2008-09-30 | Dynamic data link segmentation and reassembly |
EP08835939A EP2201725B1 (en) | 2007-10-01 | 2008-10-01 | Mobile ad hoc networking systems and methods |
PCT/US2008/078501 WO2009046143A2 (en) | 2007-10-01 | 2008-10-01 | Mobile ad hoc networking systems and methods |
CA2739458A CA2739458A1 (en) | 2007-10-01 | 2008-10-01 | Mobile ad hoc networking systems and methods |
MX2010003539A MX2010003539A (en) | 2007-10-01 | 2008-10-01 | Mobile ad hoc networking systems and methods. |
Applications Claiming Priority (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US97674807P | 2007-10-01 | 2007-10-01 | |
US97674407P | 2007-10-01 | 2007-10-01 | |
US97673007P | 2007-10-01 | 2007-10-01 | |
US97674007P | 2007-10-01 | 2007-10-01 | |
US97673507P | 2007-10-01 | 2007-10-01 | |
US97674707P | 2007-10-01 | 2007-10-01 | |
US12/242,597 US20090122753A1 (en) | 2007-10-01 | 2008-09-30 | Dynamic data link segmentation and reassembly |
Publications (1)
Publication Number | Publication Date |
---|---|
US20090122753A1 true US20090122753A1 (en) | 2009-05-14 |
Family
ID=40587996
Family Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/242,747 Active US7948966B2 (en) | 2007-10-01 | 2008-09-30 | Multi-metric routing calculations |
US12/242,697 Abandoned US20090122766A1 (en) | 2007-10-01 | 2008-09-30 | Nested weighted round robin queuing |
US12/242,597 Abandoned US20090122753A1 (en) | 2007-10-01 | 2008-09-30 | Dynamic data link segmentation and reassembly |
US13/098,420 Abandoned US20130107726A1 (en) | 2007-10-01 | 2011-04-30 | Multi-metric routing calculations |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/242,747 Active US7948966B2 (en) | 2007-10-01 | 2008-09-30 | Multi-metric routing calculations |
US12/242,697 Abandoned US20090122766A1 (en) | 2007-10-01 | 2008-09-30 | Nested weighted round robin queuing |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/098,420 Abandoned US20130107726A1 (en) | 2007-10-01 | 2011-04-30 | Multi-metric routing calculations |
Country Status (1)
Country | Link |
---|---|
US (4) | US7948966B2 (en) |
Cited By (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110105151A1 (en) * | 2009-11-04 | 2011-05-05 | At&T Intellectual Property I, Lp | Geographic advertising using a scalable wireless geocast protocol |
US20140133489A1 (en) * | 2011-06-13 | 2014-05-15 | Electronic and Techcommunications Research Institute | Method for transmitting packet-based media data having header in which overhead is minimized |
US20140161006A1 (en) * | 2012-12-12 | 2014-06-12 | At&T Intellectual Property I, Lp | Geocast-Based File Transfer |
US9071451B2 (en) | 2012-07-31 | 2015-06-30 | At&T Intellectual Property I, L.P. | Geocast-based situation awareness |
US20150200846A1 (en) * | 2014-01-15 | 2015-07-16 | Cisco Technology, Inc. | Data rate selection with proactive routing in smart grid networks |
US9161158B2 (en) | 2011-06-27 | 2015-10-13 | At&T Intellectual Property I, L.P. | Information acquisition using a scalable wireless geocast protocol |
US9210589B2 (en) | 2012-10-09 | 2015-12-08 | At&T Intellectual Property I, L.P. | Geocast protocol for wireless sensor network |
US9264863B2 (en) | 2011-12-15 | 2016-02-16 | At&T Intellectual Property I, L.P. | Media distribution via a scalable ad hoc geographic protocol |
US20160073416A1 (en) * | 2014-09-09 | 2016-03-10 | Vivint, Inc. | Location-based access point module control |
US9319842B2 (en) | 2011-06-27 | 2016-04-19 | At&T Intellectual Property I, L.P. | Mobile device configured point and shoot type weapon |
US9495870B2 (en) | 2011-10-20 | 2016-11-15 | At&T Intellectual Property I, L.P. | Vehicular communications using a scalable ad hoc geographic routing protocol |
US9544922B2 (en) | 2008-09-16 | 2017-01-10 | At&T Intellectual Property I, L.P. | Quality of service scheme for collision-based wireless networks |
US9788329B2 (en) | 2005-11-01 | 2017-10-10 | At&T Intellectual Property Ii, L.P. | Non-interference technique for spatially aware mobile ad hoc networking |
US9895604B2 (en) | 2007-08-17 | 2018-02-20 | At&T Intellectual Property I, L.P. | Location-based mobile gaming application and method for implementing the same using a scalable tiered geocast protocol |
US10016684B2 (en) | 2010-10-28 | 2018-07-10 | At&T Intellectual Property I, L.P. | Secure geographic based gaming |
US10205979B2 (en) | 2011-10-13 | 2019-02-12 | Electronics And Telecommunications Research Institute | Method of configuring and transmitting an MMT transport packet |
US10742271B2 (en) | 2017-05-04 | 2020-08-11 | At&T Intellectual Property I, L.P. | Code block group configuration with code block segmentation for 5G systems |
US20230269410A1 (en) * | 2020-06-17 | 2023-08-24 | Boe Technology Group Co., Ltd. | Method, device and system for transmitting data stream and computer storage medium |
US11811642B2 (en) | 2018-07-27 | 2023-11-07 | GoTenna, Inc. | Vine™: zero-control routing using data packet inspection for wireless mesh networks |
EP3366055B1 (en) * | 2015-10-19 | 2024-04-03 | Qualcomm Incorporated | Direct or indirect d2d communication between a mtc ue and an enb |
Families Citing this family (146)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080240096A1 (en) | 2007-03-29 | 2008-10-02 | Twisted Pair Solutions, Inc. | Method, apparatus, system, and article of manufacture for providing distributed convergence nodes in a communication network environment |
CA2634344A1 (en) * | 2007-06-06 | 2008-12-06 | Black Coral Inc. | Broker mediated geospatial information service including relative ranking data |
US9137806B2 (en) | 2007-09-21 | 2015-09-15 | Qualcomm Incorporated | Interference management employing fractional time reuse |
US9374791B2 (en) | 2007-09-21 | 2016-06-21 | Qualcomm Incorporated | Interference management utilizing power and attenuation profiles |
US9078269B2 (en) | 2007-09-21 | 2015-07-07 | Qualcomm Incorporated | Interference management utilizing HARQ interlaces |
US9066306B2 (en) | 2007-09-21 | 2015-06-23 | Qualcomm Incorporated | Interference management utilizing power control |
US8948095B2 (en) * | 2007-11-27 | 2015-02-03 | Qualcomm Incorporated | Interference management in a wireless communication system using frequency selective transmission |
US8867456B2 (en) | 2007-11-27 | 2014-10-21 | Qualcomm Incorporated | Interface management in wireless communication system using hybrid time reuse |
US9456054B2 (en) | 2008-05-16 | 2016-09-27 | Palo Alto Research Center Incorporated | Controlling the spread of interests and content in a content centric network |
WO2010002844A2 (en) | 2008-07-01 | 2010-01-07 | Twisted Pair Solutions, Inc. | Method, apparatus, system, and article of manufacture for reliable low-bandwidth information delivery across mixed-mode unicast and multicast networks |
US20100091318A1 (en) * | 2008-10-09 | 2010-04-15 | Andrew Rodney Ferlitsch | Systems and methods for multiple queue options for a single logical printer |
JP5239783B2 (en) * | 2008-11-27 | 2013-07-17 | 富士通株式会社 | Route calculation method and node device |
US8682254B2 (en) * | 2009-06-19 | 2014-03-25 | Empire Technology Development Llc | Wireless communication system modeling |
CN101616439A (en) | 2009-07-28 | 2009-12-30 | 华为技术有限公司 | Wireless self-return method in the evolvement network, Apparatus and system |
EP2296324A1 (en) | 2009-09-14 | 2011-03-16 | Thomson Licensing, Inc. | Distributed flow mechanism for peer-to-peer streaming |
US8923293B2 (en) | 2009-10-21 | 2014-12-30 | Palo Alto Research Center Incorporated | Adaptive multi-interface use for content networking |
KR101644800B1 (en) * | 2010-01-07 | 2016-08-02 | 삼성전자주식회사 | Computing system and method |
US8923131B2 (en) * | 2010-02-16 | 2014-12-30 | Broadcom Corporation | Traffic management in a multi-channel system |
EP2541989B1 (en) * | 2010-02-23 | 2018-04-11 | Kyushu University, National University Corporation | Communications system, slave node, route building method, and program |
US8249101B2 (en) * | 2010-03-26 | 2012-08-21 | Raytheon Company | Mobile ad hoc network configured as a virtual internet protocol network |
CN103069863A (en) * | 2010-08-13 | 2013-04-24 | 日本电气株式会社 | Wireless communication network and method for selecting path |
US9065584B2 (en) | 2010-09-29 | 2015-06-23 | Qualcomm Incorporated | Method and apparatus for adjusting rise-over-thermal threshold |
US8526307B2 (en) * | 2011-03-04 | 2013-09-03 | Ntt Docomo, Inc. | Proportional-fair radio resource management |
US8699368B2 (en) * | 2011-07-26 | 2014-04-15 | Cisco Technology, Inc. | Link reliability metrics in communication networks |
WO2013100752A1 (en) | 2011-12-30 | 2013-07-04 | Mimos Berhad | A method for establishing an end-to-end route for traversing data |
EP2823606B1 (en) * | 2012-03-06 | 2021-08-18 | Koninklijke Philips N.V. | Wireless docking automatic configuration and optimization system |
US20130279409A1 (en) * | 2012-04-18 | 2013-10-24 | Draker, Inc. | Establishing a Mesh Network |
US8942120B2 (en) * | 2012-05-24 | 2015-01-27 | Mitsubishi Electric Research Laboratories, Inc. | Reputation-based routing and error-correction coding in ad hoc networks |
JP6031894B2 (en) * | 2012-08-24 | 2016-11-24 | 富士通株式会社 | Relay program, relay device, and relay method |
US9647930B2 (en) | 2012-11-26 | 2017-05-09 | Telefonaktiebolaget Lm Ericsson (Publ) | Route determination in a multi-hop network using multiple routing metrics |
US9072079B2 (en) * | 2012-11-29 | 2015-06-30 | China Mobile Communications Corporation | Method for controlling channel access, access point and user equipment |
US9338082B2 (en) * | 2012-12-27 | 2016-05-10 | T-Mobile Usa, Inc. | Resilient backhaul network |
US20140201458A1 (en) * | 2013-01-17 | 2014-07-17 | Spirent Communications, Inc. | Reducing cache memory requirements for recording statistics from testing with a multiplicity of flows |
US9402244B2 (en) * | 2013-01-17 | 2016-07-26 | Raytheon Bbn Technologies Corp. | Multiple simultaneous link transmissions for a multi-frequency multi-rate multi-transceiver communications device |
US9332399B2 (en) * | 2013-01-17 | 2016-05-03 | Raytheon Bbn Technologies Corp. | Just in time link transmission for a multi-frequency multi-rate multi-transceiver communication device |
US20140198703A1 (en) * | 2013-01-17 | 2014-07-17 | Raytheon Bbn Technologies Corp. | Interface and link selection for a multi-frequency multi-rate multi-transceiver communication device |
US20140233402A1 (en) * | 2013-02-15 | 2014-08-21 | United States Government, as represented by the Department of the Navy | Wireless Network Message Prioritization Technique |
EP3445133B1 (en) * | 2013-02-19 | 2020-04-01 | Kyocera Corporation | Mobile communication system, user terminal, and base station |
US9094417B2 (en) * | 2013-04-25 | 2015-07-28 | Netapp, Inc. | Status transfer within a group of computing entities |
WO2015011648A1 (en) * | 2013-07-24 | 2015-01-29 | Telefonaktiebolaget L M Ericsson (Publ) | Automated traffic engineering based upon the use of bandwidth and unequal cost path utilization |
US9304816B2 (en) | 2013-08-05 | 2016-04-05 | International Business Machines Corporation | Multiple stage workload management system |
US9544331B2 (en) * | 2013-10-31 | 2017-01-10 | Aruba Networks, Inc. | Method and system for controlling access to shared devices |
US9742681B2 (en) * | 2013-11-06 | 2017-08-22 | Sony Corporation | Session-based traffic routing policies |
CN106165492B (en) | 2013-11-26 | 2019-10-08 | 瑞典爱立信有限公司 | Distributed Route Selection in wireless network |
CN103685054B (en) * | 2013-12-18 | 2017-02-01 | 武汉烽火网络有限责任公司 | Multipath load balancing method based on service awareness |
US10098051B2 (en) * | 2014-01-22 | 2018-10-09 | Cisco Technology, Inc. | Gateways and routing in software-defined manets |
US9954678B2 (en) | 2014-02-06 | 2018-04-24 | Cisco Technology, Inc. | Content-based transport security |
US9836540B2 (en) | 2014-03-04 | 2017-12-05 | Cisco Technology, Inc. | System and method for direct storage access in a content-centric network |
US9626413B2 (en) | 2014-03-10 | 2017-04-18 | Cisco Systems, Inc. | System and method for ranking content popularity in a content-centric network |
US9716622B2 (en) | 2014-04-01 | 2017-07-25 | Cisco Technology, Inc. | System and method for dynamic name configuration in content-centric networks |
US9473576B2 (en) | 2014-04-07 | 2016-10-18 | Palo Alto Research Center Incorporated | Service discovery using collection synchronization with exact names |
US9992281B2 (en) | 2014-05-01 | 2018-06-05 | Cisco Technology, Inc. | Accountable content stores for information centric networks |
US9609014B2 (en) | 2014-05-22 | 2017-03-28 | Cisco Systems, Inc. | Method and apparatus for preventing insertion of malicious content at a named data network router |
US10778334B2 (en) * | 2014-06-06 | 2020-09-15 | Vivint, Inc. | Fiber/wireless hybrid solution |
US9699198B2 (en) | 2014-07-07 | 2017-07-04 | Cisco Technology, Inc. | System and method for parallel secure content bootstrapping in content-centric networks |
US9621354B2 (en) | 2014-07-17 | 2017-04-11 | Cisco Systems, Inc. | Reconstructable content objects |
US9729616B2 (en) | 2014-07-18 | 2017-08-08 | Cisco Technology, Inc. | Reputation-based strategy for forwarding and responding to interests over a content centric network |
US9590887B2 (en) | 2014-07-18 | 2017-03-07 | Cisco Systems, Inc. | Method and system for keeping interest alive in a content centric network |
US9882964B2 (en) | 2014-08-08 | 2018-01-30 | Cisco Technology, Inc. | Explicit strategy feedback in name-based forwarding |
US9729662B2 (en) | 2014-08-11 | 2017-08-08 | Cisco Technology, Inc. | Probabilistic lazy-forwarding technique without validation in a content centric network |
US9800637B2 (en) | 2014-08-19 | 2017-10-24 | Cisco Technology, Inc. | System and method for all-in-one content stream in content-centric networks |
US10069933B2 (en) | 2014-10-23 | 2018-09-04 | Cisco Technology, Inc. | System and method for creating virtual interfaces based on network characteristics |
KR101730991B1 (en) | 2014-10-28 | 2017-04-28 | 삼성전자주식회사 | Storage device and operating method of storage device |
US9590948B2 (en) | 2014-12-15 | 2017-03-07 | Cisco Systems, Inc. | CCN routing using hardware-assisted hash tables |
US10237189B2 (en) | 2014-12-16 | 2019-03-19 | Cisco Technology, Inc. | System and method for distance-based interest forwarding |
US10003520B2 (en) | 2014-12-22 | 2018-06-19 | Cisco Technology, Inc. | System and method for efficient name-based content routing using link-state information in information-centric networks |
US9660825B2 (en) | 2014-12-24 | 2017-05-23 | Cisco Technology, Inc. | System and method for multi-source multicasting in content-centric networks |
US9916457B2 (en) | 2015-01-12 | 2018-03-13 | Cisco Technology, Inc. | Decoupled name security binding for CCN objects |
US9832291B2 (en) | 2015-01-12 | 2017-11-28 | Cisco Technology, Inc. | Auto-configurable transport stack |
US9954795B2 (en) | 2015-01-12 | 2018-04-24 | Cisco Technology, Inc. | Resource allocation using CCN manifests |
US9946743B2 (en) | 2015-01-12 | 2018-04-17 | Cisco Technology, Inc. | Order encoded manifests in a content centric network |
US9385953B1 (en) * | 2015-02-03 | 2016-07-05 | Google Inc. | Mesh network addressing |
US10333840B2 (en) | 2015-02-06 | 2019-06-25 | Cisco Technology, Inc. | System and method for on-demand content exchange with adaptive naming in information-centric networks |
US10075401B2 (en) | 2015-03-18 | 2018-09-11 | Cisco Technology, Inc. | Pending interest table behavior |
US10075402B2 (en) | 2015-06-24 | 2018-09-11 | Cisco Technology, Inc. | Flexible command and control in content centric networks |
US10701038B2 (en) | 2015-07-27 | 2020-06-30 | Cisco Technology, Inc. | Content negotiation in a content centric network |
US10952123B1 (en) | 2015-07-28 | 2021-03-16 | National Technology & Engineering Solutions Of Sandia, Llc | Ultra-high reliability wireless communication systems and methods |
US9986034B2 (en) | 2015-08-03 | 2018-05-29 | Cisco Technology, Inc. | Transferring state in content centric network stacks |
US10581667B2 (en) * | 2015-09-03 | 2020-03-03 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and network node for localizing a fault causing performance degradation of a service |
US9832123B2 (en) | 2015-09-11 | 2017-11-28 | Cisco Technology, Inc. | Network named fragments in a content centric network |
US10355999B2 (en) | 2015-09-23 | 2019-07-16 | Cisco Technology, Inc. | Flow control with network named fragments |
US9977809B2 (en) | 2015-09-24 | 2018-05-22 | Cisco Technology, Inc. | Information and data framework in a content centric network |
US10313227B2 (en) | 2015-09-24 | 2019-06-04 | Cisco Technology, Inc. | System and method for eliminating undetected interest looping in information-centric networks |
US10454820B2 (en) | 2015-09-29 | 2019-10-22 | Cisco Technology, Inc. | System and method for stateless information-centric networking |
US10263965B2 (en) | 2015-10-16 | 2019-04-16 | Cisco Technology, Inc. | Encrypted CCNx |
US9794238B2 (en) | 2015-10-29 | 2017-10-17 | Cisco Technology, Inc. | System for key exchange in a content centric network |
US9807205B2 (en) | 2015-11-02 | 2017-10-31 | Cisco Technology, Inc. | Header compression for CCN messages using dictionary |
GB2544525B (en) * | 2015-11-20 | 2017-12-06 | Bluwireless Tech Ltd | Wired mesh communications networks |
GB2544524B (en) * | 2015-11-20 | 2017-12-06 | Bluwireless Tech Ltd | Wireless mesh communications networks |
US9912776B2 (en) | 2015-12-02 | 2018-03-06 | Cisco Technology, Inc. | Explicit content deletion commands in a content centric network |
US10097346B2 (en) | 2015-12-09 | 2018-10-09 | Cisco Technology, Inc. | Key catalogs in a content centric network |
US10078062B2 (en) | 2015-12-15 | 2018-09-18 | Palo Alto Research Center Incorporated | Device health estimation by combining contextual information with sensor data |
US10257271B2 (en) | 2016-01-11 | 2019-04-09 | Cisco Technology, Inc. | Chandra-Toueg consensus in a content centric network |
US9949301B2 (en) | 2016-01-20 | 2018-04-17 | Palo Alto Research Center Incorporated | Methods for fast, secure and privacy-friendly internet connection discovery in wireless networks |
US10305864B2 (en) | 2016-01-25 | 2019-05-28 | Cisco Technology, Inc. | Method and system for interest encryption in a content centric network |
US10043016B2 (en) | 2016-02-29 | 2018-08-07 | Cisco Technology, Inc. | Method and system for name encryption agreement in a content centric network |
US10038633B2 (en) | 2016-03-04 | 2018-07-31 | Cisco Technology, Inc. | Protocol to query for historical network information in a content centric network |
US10051071B2 (en) | 2016-03-04 | 2018-08-14 | Cisco Technology, Inc. | Method and system for collecting historical network information in a content centric network |
US10742596B2 (en) | 2016-03-04 | 2020-08-11 | Cisco Technology, Inc. | Method and system for reducing a collision probability of hash-based names using a publisher identifier |
US10003507B2 (en) | 2016-03-04 | 2018-06-19 | Cisco Technology, Inc. | Transport session state protocol |
US9832116B2 (en) | 2016-03-14 | 2017-11-28 | Cisco Technology, Inc. | Adjusting entries in a forwarding information base in a content centric network |
US10212196B2 (en) | 2016-03-16 | 2019-02-19 | Cisco Technology, Inc. | Interface discovery and authentication in a name-based network |
US11436656B2 (en) | 2016-03-18 | 2022-09-06 | Palo Alto Research Center Incorporated | System and method for a real-time egocentric collaborative filter on large datasets |
US10067948B2 (en) | 2016-03-18 | 2018-09-04 | Cisco Technology, Inc. | Data deduping in content centric networking manifests |
US10091330B2 (en) | 2016-03-23 | 2018-10-02 | Cisco Technology, Inc. | Interest scheduling by an information and data framework in a content centric network |
US10033639B2 (en) | 2016-03-25 | 2018-07-24 | Cisco Technology, Inc. | System and method for routing packets in a content centric network using anonymous datagrams |
US10320760B2 (en) | 2016-04-01 | 2019-06-11 | Cisco Technology, Inc. | Method and system for mutating and caching content in a content centric network |
US9930146B2 (en) | 2016-04-04 | 2018-03-27 | Cisco Technology, Inc. | System and method for compressing content centric networking messages |
US10425503B2 (en) | 2016-04-07 | 2019-09-24 | Cisco Technology, Inc. | Shared pending interest table in a content centric network |
US10027578B2 (en) | 2016-04-11 | 2018-07-17 | Cisco Technology, Inc. | Method and system for routable prefix queries in a content centric network |
US10404450B2 (en) | 2016-05-02 | 2019-09-03 | Cisco Technology, Inc. | Schematized access control in a content centric network |
US10320675B2 (en) | 2016-05-04 | 2019-06-11 | Cisco Technology, Inc. | System and method for routing packets in a stateless content centric network |
US10547589B2 (en) | 2016-05-09 | 2020-01-28 | Cisco Technology, Inc. | System for implementing a small computer systems interface protocol over a content centric network |
US10063414B2 (en) | 2016-05-13 | 2018-08-28 | Cisco Technology, Inc. | Updating a transport stack in a content centric network |
US10084764B2 (en) | 2016-05-13 | 2018-09-25 | Cisco Technology, Inc. | System for a secure encryption proxy in a content centric network |
US10103989B2 (en) | 2016-06-13 | 2018-10-16 | Cisco Technology, Inc. | Content object return messages in a content centric network |
US10305865B2 (en) | 2016-06-21 | 2019-05-28 | Cisco Technology, Inc. | Permutation-based content encryption with manifests in a content centric network |
US10148572B2 (en) | 2016-06-27 | 2018-12-04 | Cisco Technology, Inc. | Method and system for interest groups in a content centric network |
US10009266B2 (en) | 2016-07-05 | 2018-06-26 | Cisco Technology, Inc. | Method and system for reference counted pending interest tables in a content centric network |
US9992097B2 (en) | 2016-07-11 | 2018-06-05 | Cisco Technology, Inc. | System and method for piggybacking routing information in interests in a content centric network |
US10122624B2 (en) | 2016-07-25 | 2018-11-06 | Cisco Technology, Inc. | System and method for ephemeral entries in a forwarding information base in a content centric network |
US10069729B2 (en) | 2016-08-08 | 2018-09-04 | Cisco Technology, Inc. | System and method for throttling traffic based on a forwarding information base in a content centric network |
US10956412B2 (en) | 2016-08-09 | 2021-03-23 | Cisco Technology, Inc. | Method and system for conjunctive normal form attribute matching in a content centric network |
US10033642B2 (en) | 2016-09-19 | 2018-07-24 | Cisco Technology, Inc. | System and method for making optimal routing decisions based on device-specific parameters in a content centric network |
US10212248B2 (en) | 2016-10-03 | 2019-02-19 | Cisco Technology, Inc. | Cache management on high availability routers in a content centric network |
US10447805B2 (en) | 2016-10-10 | 2019-10-15 | Cisco Technology, Inc. | Distributed consensus in a content centric network |
US10405264B2 (en) * | 2016-10-17 | 2019-09-03 | WiSilica Inc. | Bulk pairing for mesh networks |
US10135948B2 (en) | 2016-10-31 | 2018-11-20 | Cisco Technology, Inc. | System and method for process migration in a content centric network |
US10243851B2 (en) | 2016-11-21 | 2019-03-26 | Cisco Technology, Inc. | System and method for forwarder connection information in a content centric network |
US20180270679A1 (en) * | 2017-03-20 | 2018-09-20 | Nokia Technologies Oy | Reliability-based multi-link communications |
JP6801619B2 (en) * | 2017-09-25 | 2020-12-16 | 株式会社デンソー | Data transfer route calculation device and data transfer terminal |
US10341190B2 (en) * | 2017-11-14 | 2019-07-02 | International Business Machines Corporation | Centrality measure ranking for a multiplex network |
US10656966B1 (en) * | 2018-01-02 | 2020-05-19 | Amazon Technologies, Inc. | Deep-inspection weighted round robin of multiple virtualized resources |
US10813169B2 (en) | 2018-03-22 | 2020-10-20 | GoTenna, Inc. | Mesh network deployment kit |
US10826831B2 (en) * | 2018-05-30 | 2020-11-03 | Cisco Technology, Inc. | Dynamic protocol independent multicast load balancing |
CN110167097B (en) * | 2019-04-22 | 2024-02-20 | 北京邮电大学 | Mobile robot relay routing method based on weighted metric forwarding and path planning |
US11317427B2 (en) | 2019-11-11 | 2022-04-26 | Trellisware Technologies, Inc. | Network-enabled connectivity for disadvantaged communication links |
US11349584B2 (en) * | 2019-11-21 | 2022-05-31 | Westwood One, Llc | System and method of providing content to a broadcast network |
US11329880B2 (en) * | 2020-01-09 | 2022-05-10 | Dell Products L.P. | Automatic route reflector configuration system |
CN113472671B (en) * | 2020-03-30 | 2023-05-02 | 中国电信股份有限公司 | Method, device and computer readable storage medium for determining multicast route |
CN112583715B (en) * | 2020-12-08 | 2022-05-27 | 广州技象科技有限公司 | Equipment node connection adjustment method and device |
US11758369B2 (en) * | 2020-12-23 | 2023-09-12 | Itron Global Sarl | Discovery of forwarders to mitigate asymmetric links in a multicast group |
CN113572692B (en) * | 2021-09-24 | 2021-12-28 | 天津市海承科技发展有限公司 | Multicast routing method of high-speed power line carrier communication network |
US11929907B2 (en) | 2022-03-08 | 2024-03-12 | T-Mobile Usa, Inc. | Endpoint assisted selection of routing paths over multiple networks |
US20240063909A1 (en) * | 2022-08-18 | 2024-02-22 | At&T Mobility Ii Llc | Mobile telecommunications network access point configuration and fiber routing configuration for customer premises equipment |
GB2622064A (en) * | 2022-09-01 | 2024-03-06 | Bae Systems Plc | Communication network |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7027409B2 (en) * | 2002-01-10 | 2006-04-11 | Harris Corporation | Method and device for establishing communication links and for estimating overall quality of a directional link and reporting to OLSR in a communication system |
US7062687B1 (en) * | 1999-07-12 | 2006-06-13 | International Business Machines Corporation | Apparatus and method for setting a data rate in a wireless communication system |
US20060268879A1 (en) * | 2005-05-11 | 2006-11-30 | Texas Instruments Incorporated | Quality of service aware robust link state routing for mesh networks |
US7616565B2 (en) * | 2007-02-26 | 2009-11-10 | Raytheon Company | Network communication scheduling |
US7894830B2 (en) * | 2007-04-28 | 2011-02-22 | Broadcom Corporation | Motion adaptive wireless local area network, wireless communications device and integrated circuits for use therewith |
US7949345B2 (en) * | 2007-09-18 | 2011-05-24 | Alfaplus Semiconductor Inc. | Cognitive radio system and method |
Family Cites Families (30)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6094435A (en) * | 1997-06-30 | 2000-07-25 | Sun Microsystems, Inc. | System and method for a quality of service in a multi-layer network element |
JP3075251B2 (en) * | 1998-03-05 | 2000-08-14 | 日本電気株式会社 | Virtual Path Bandwidth Distribution System in Asynchronous Transfer Mode Switching Network |
US6788702B1 (en) | 1999-10-15 | 2004-09-07 | Nokia Wireless Routers, Inc. | Protocol for neighborhood-established transmission scheduling |
US6438135B1 (en) * | 1999-10-21 | 2002-08-20 | Advanced Micro Devices, Inc. | Dynamic weighted round robin queuing |
US7277446B1 (en) * | 2000-11-02 | 2007-10-02 | Airvana, Inc. | Communication of digital data over a wireless transmission medium |
KR20020055285A (en) | 2000-12-28 | 2002-07-08 | 구자홍 | Slot Allocation Method in Wireless Section of WATM System |
US7110359B1 (en) * | 2001-03-05 | 2006-09-19 | Advanced Micro Devices, Inc. | System and method for dynamically updating weights of weighted round robin in output queues |
WO2002073865A2 (en) * | 2001-03-09 | 2002-09-19 | Vitesse Semiconductor Corporation | Time based packet scheduling and sorting system |
US20020150099A1 (en) * | 2001-04-13 | 2002-10-17 | Pung Hung Keng | Multicast routing method satisfying quality of service constraints, software and devices |
WO2003015352A1 (en) * | 2001-08-01 | 2003-02-20 | Nokia Corporation | Apparatus and method for flow scheduling based on priorities in a mobile network |
US7107498B1 (en) | 2002-04-16 | 2006-09-12 | Methnetworks, Inc. | System and method for identifying and maintaining reliable infrastructure links using bit error rate data in an ad-hoc communication network |
US7764617B2 (en) * | 2002-04-29 | 2010-07-27 | Harris Corporation | Mobile ad-hoc network and methods for performing functions therein based upon weighted quality of service metrics |
US7397805B2 (en) * | 2003-04-02 | 2008-07-08 | Ntt Docomo Inc. | Systems and methods for goodput guarantee through adaptive fair queuing |
US20050047353A1 (en) * | 2003-08-25 | 2005-03-03 | Susan Hares | Systems and methods for routing employing link state and path vector techniques |
US7580355B2 (en) * | 2003-08-25 | 2009-08-25 | Integrated Device Technology, Inc. | Method of performing weighted round-robin queue scheduling using a dynamic link list and structure for implementing same |
US7085290B2 (en) * | 2003-09-09 | 2006-08-01 | Harris Corporation | Mobile ad hoc network (MANET) providing connectivity enhancement features and related methods |
US7388841B2 (en) * | 2003-10-20 | 2008-06-17 | Mitsubishi Electric Research Laboratories, Inc. | Selecting multiple paths in overlay networks for streaming data |
US7593333B2 (en) * | 2004-07-07 | 2009-09-22 | Microsoft Corporation | Efficient one-to-many content distribution in a peer-to-peer computer network |
US7430207B2 (en) * | 2005-02-07 | 2008-09-30 | Reti Corporation | Preemptive weighted round robin scheduler |
JP4606249B2 (en) * | 2005-05-18 | 2011-01-05 | 富士通株式会社 | Information processing method and router |
US7729257B2 (en) * | 2006-03-30 | 2010-06-01 | Alcatel-Lucent Usa Inc. | Method and apparatus for link transmission scheduling for handling traffic variation in wireless mesh networks |
US8223642B2 (en) * | 2006-04-28 | 2012-07-17 | Tellabs San Jose, Inc. | Differentiated services using weighted quality of service (QoS) |
US7558209B2 (en) * | 2006-04-28 | 2009-07-07 | Alcatel-Lucent Usa Inc. | Maximum-throughput routing of traffic in the hose model |
IL176332A0 (en) * | 2006-06-15 | 2007-07-04 | Rafael Advanced Defense Sys | Method for scheduling of packets in tdma channels |
CN101543019B (en) * | 2006-11-29 | 2012-11-28 | 汤姆森特许公司 | Contribution aware peer-to-peer live streaming service |
US9049095B2 (en) * | 2006-12-29 | 2015-06-02 | Alcatel Lucent | Methods and devices for providing ingress routing in selective randomized load balancing |
US8379518B2 (en) * | 2007-01-23 | 2013-02-19 | Agere Systems Llc | Multi-stage scheduler with processor resource and bandwidth resource allocation |
US7965671B2 (en) | 2007-10-01 | 2011-06-21 | Powerwave Cognition, Inc. | Dynamic channel sharing using bandwidth metrics |
US20090089319A1 (en) | 2007-10-01 | 2009-04-02 | Tele Atlas North America, Inc. | System and Method for Differentiating Duplicate Addresses in a Locality |
US20100169937A1 (en) * | 2008-04-04 | 2010-07-01 | Peter Atwal | Wireless ad hoc networking for set top boxes |
-
2008
- 2008-09-30 US US12/242,747 patent/US7948966B2/en active Active
- 2008-09-30 US US12/242,697 patent/US20090122766A1/en not_active Abandoned
- 2008-09-30 US US12/242,597 patent/US20090122753A1/en not_active Abandoned
-
2011
- 2011-04-30 US US13/098,420 patent/US20130107726A1/en not_active Abandoned
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7062687B1 (en) * | 1999-07-12 | 2006-06-13 | International Business Machines Corporation | Apparatus and method for setting a data rate in a wireless communication system |
US7027409B2 (en) * | 2002-01-10 | 2006-04-11 | Harris Corporation | Method and device for establishing communication links and for estimating overall quality of a directional link and reporting to OLSR in a communication system |
US20060268879A1 (en) * | 2005-05-11 | 2006-11-30 | Texas Instruments Incorporated | Quality of service aware robust link state routing for mesh networks |
US7616565B2 (en) * | 2007-02-26 | 2009-11-10 | Raytheon Company | Network communication scheduling |
US7894830B2 (en) * | 2007-04-28 | 2011-02-22 | Broadcom Corporation | Motion adaptive wireless local area network, wireless communications device and integrated circuits for use therewith |
US7949345B2 (en) * | 2007-09-18 | 2011-05-24 | Alfaplus Semiconductor Inc. | Cognitive radio system and method |
Cited By (43)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9788329B2 (en) | 2005-11-01 | 2017-10-10 | At&T Intellectual Property Ii, L.P. | Non-interference technique for spatially aware mobile ad hoc networking |
US9895604B2 (en) | 2007-08-17 | 2018-02-20 | At&T Intellectual Property I, L.P. | Location-based mobile gaming application and method for implementing the same using a scalable tiered geocast protocol |
US9544922B2 (en) | 2008-09-16 | 2017-01-10 | At&T Intellectual Property I, L.P. | Quality of service scheme for collision-based wireless networks |
US9802120B2 (en) | 2009-11-04 | 2017-10-31 | At&T Intellectual Property I, L.P. | Geographic advertising using a scalable wireless geocast protocol |
US9675882B2 (en) | 2009-11-04 | 2017-06-13 | At&T Intellectual Property I, L.P. | Augmented reality gaming via geographic messaging |
US9118428B2 (en) | 2009-11-04 | 2015-08-25 | At&T Intellectual Property I, L.P. | Geographic advertising using a scalable wireless geocast protocol |
US9656165B2 (en) | 2009-11-04 | 2017-05-23 | At&T Intellectual Property I, L.P. | Campus alerting via wireless geocast |
US20110105151A1 (en) * | 2009-11-04 | 2011-05-05 | At&T Intellectual Property I, Lp | Geographic advertising using a scalable wireless geocast protocol |
US9266025B2 (en) | 2009-11-04 | 2016-02-23 | At&T Intellectual Property I, L.P. | Augmented reality gaming via geographic messaging |
US10016684B2 (en) | 2010-10-28 | 2018-07-10 | At&T Intellectual Property I, L.P. | Secure geographic based gaming |
US9386125B2 (en) * | 2011-06-13 | 2016-07-05 | Electronic And Telecommunications Research Institute | Method for transmitting packet-based media data having header in which overhead is minimized |
US9473378B1 (en) * | 2011-06-13 | 2016-10-18 | Electronics And Telecommunications Research Instit | Method for transmitting packet-based media data having header in which overhead is minimized |
US20140133489A1 (en) * | 2011-06-13 | 2014-05-15 | Electronic and Techcommunications Research Institute | Method for transmitting packet-based media data having header in which overhead is minimized |
US9319842B2 (en) | 2011-06-27 | 2016-04-19 | At&T Intellectual Property I, L.P. | Mobile device configured point and shoot type weapon |
US10279261B2 (en) | 2011-06-27 | 2019-05-07 | At&T Intellectual Property I, L.P. | Virtual reality gaming utilizing mobile gaming |
US9973881B2 (en) | 2011-06-27 | 2018-05-15 | At&T Intellectual Property I, L.P. | Information acquisition using a scalable wireless geocast protocol |
US11202961B2 (en) | 2011-06-27 | 2021-12-21 | At&T Intellectual Property I, L.P. | Virtual reality gaming utilizing mobile gaming |
US9698996B2 (en) | 2011-06-27 | 2017-07-04 | At&T Intellectual Property I, L.P. | Information acquisition using a scalable wireless geocast protocol |
US9161158B2 (en) | 2011-06-27 | 2015-10-13 | At&T Intellectual Property I, L.P. | Information acquisition using a scalable wireless geocast protocol |
US10205979B2 (en) | 2011-10-13 | 2019-02-12 | Electronics And Telecommunications Research Institute | Method of configuring and transmitting an MMT transport packet |
US10728591B2 (en) | 2011-10-13 | 2020-07-28 | Electronics And Telecommunications Research Institute | Method of configuring and transmitting an MMT transport packet |
US9495870B2 (en) | 2011-10-20 | 2016-11-15 | At&T Intellectual Property I, L.P. | Vehicular communications using a scalable ad hoc geographic routing protocol |
US9264863B2 (en) | 2011-12-15 | 2016-02-16 | At&T Intellectual Property I, L.P. | Media distribution via a scalable ad hoc geographic protocol |
US10462727B2 (en) | 2011-12-15 | 2019-10-29 | At&T Intellectual Property I, L.P. | Media distribution via a scalable ad hoc geographic protocol |
US10075893B2 (en) | 2011-12-15 | 2018-09-11 | At&T Intellectual Property I, L.P. | Media distribution via a scalable ad hoc geographic protocol |
US9369295B2 (en) | 2012-07-31 | 2016-06-14 | At&T Intellectual Property I, L.P. | Geocast-based situation awareness |
US9794860B2 (en) | 2012-07-31 | 2017-10-17 | At&T Intellectual Property I, L.P. | Geocast-based situation awareness |
US9071451B2 (en) | 2012-07-31 | 2015-06-30 | At&T Intellectual Property I, L.P. | Geocast-based situation awareness |
US9210589B2 (en) | 2012-10-09 | 2015-12-08 | At&T Intellectual Property I, L.P. | Geocast protocol for wireless sensor network |
US20140161006A1 (en) * | 2012-12-12 | 2014-06-12 | At&T Intellectual Property I, Lp | Geocast-Based File Transfer |
US9660745B2 (en) * | 2012-12-12 | 2017-05-23 | At&T Intellectual Property I, L.P. | Geocast-based file transfer |
US20170257178A1 (en) * | 2012-12-12 | 2017-09-07 | At&T Intellectual Property I, L.P. | Geocast-Based File Transfer |
US10511393B2 (en) * | 2012-12-12 | 2019-12-17 | At&T Intellectual Property I, L.P. | Geocast-based file transfer |
US20150200846A1 (en) * | 2014-01-15 | 2015-07-16 | Cisco Technology, Inc. | Data rate selection with proactive routing in smart grid networks |
US20160073416A1 (en) * | 2014-09-09 | 2016-03-10 | Vivint, Inc. | Location-based access point module control |
US10362554B1 (en) | 2014-09-09 | 2019-07-23 | Vivint, Inc. | Location-based access point module control |
US9717067B2 (en) * | 2014-09-09 | 2017-07-25 | Vivint, Inc. | Location-based access point module control |
EP3366055B1 (en) * | 2015-10-19 | 2024-04-03 | Qualcomm Incorporated | Direct or indirect d2d communication between a mtc ue and an enb |
US10742271B2 (en) | 2017-05-04 | 2020-08-11 | At&T Intellectual Property I, L.P. | Code block group configuration with code block segmentation for 5G systems |
US11563465B2 (en) | 2017-05-04 | 2023-01-24 | At&T Intellectual Property I, L.P. | Code block group configuration with code block segmentation for 5G systems |
US11196461B2 (en) | 2017-05-04 | 2021-12-07 | At&T Intellectual Property I, L.P. | Code block group configuration with code block segmentation for 5G systems |
US11811642B2 (en) | 2018-07-27 | 2023-11-07 | GoTenna, Inc. | Vine™: zero-control routing using data packet inspection for wireless mesh networks |
US20230269410A1 (en) * | 2020-06-17 | 2023-08-24 | Boe Technology Group Co., Ltd. | Method, device and system for transmitting data stream and computer storage medium |
Also Published As
Publication number | Publication date |
---|---|
US7948966B2 (en) | 2011-05-24 |
US20130107726A1 (en) | 2013-05-02 |
US20090116393A1 (en) | 2009-05-07 |
US20090122766A1 (en) | 2009-05-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20090122753A1 (en) | Dynamic data link segmentation and reassembly | |
US7965671B2 (en) | Dynamic channel sharing using bandwidth metrics | |
US10708787B2 (en) | Mesh islands | |
KR101150011B1 (en) | System and method for link quality routing using a weighted cumulative expected transmission time metric | |
KR100957920B1 (en) | System and method for utilizing multiple radios to increase the capacity of a wireless communication network | |
US7558818B2 (en) | System and method for characterizing the quality of a link in a wireless network | |
EP3209089B1 (en) | Hybrid mesh network | |
US20110164546A1 (en) | Vehicular mobility vector based routing | |
US20110164527A1 (en) | Enhanced wireless ad hoc communication techniques | |
US20100142446A1 (en) | Business management systems for a mobile, broadband, routable internet | |
US20100150027A1 (en) | Systems and methods of planning and deploying an ad hoc mobile wireless network | |
US20120106428A1 (en) | Methods and systems for a mobile, broadband, routable internet | |
US20100202397A1 (en) | Wireless Routing Based On Data Packet Classfication | |
EP2366261A1 (en) | Enhanced wireless ad hoc communication techniques | |
US20050169206A1 (en) | Relay apparatus, communication system and relay method | |
JP2009517987A (en) | Method and system for improving the quality of a wireless communication route | |
JP2006319676A (en) | Frame transmitting method, topology acquiring method and radio communication system | |
JP5252978B2 (en) | Route control method, communication system, and communication apparatus | |
ES2913209T3 (en) | Methods, devices and systems to implement centralized hybrid wireless self-organizing networks | |
Miao et al. | Study on research challenges and optimization for internetworking of hybrid MANET and satellite networks | |
Paul et al. | Adaptive path selection for high throughput Heterogeneous Wireless Mesh Networks | |
Brannstrom et al. | Port-based multihomed mobile ipv6: Load-balancing in mobile ad hoc networks | |
Kim et al. | Voice call capacity model for hybrid multi-channel protocol over multi-hop multi-channel multi-radio wireless mesh networks | |
Abdalla | Scalable Wireless Mesh Networks | |
Cao | Providing fairness and maximising throughput in 802.11 wireless mesh network. |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: POWERWAVE COGNITION, INC., NEW HAMPSHIRE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HUGHES, TIMOTHY J.;CORMIER, DANIEL R.;ULINSKAS, TYLER J.;REEL/FRAME:022604/0806;SIGNING DATES FROM 20090330 TO 20090422 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |