Abstract: Various examples are provided that are related to fractal-based reactive impedance surfaces. These surfaces allow for miniaturization of antennas. In one example, a fractal rectangular reactive impedance surface (FR-RIS) includes a plurality of fractal rectangular (FR) patches having an outer edge defined by a fractal rectangular pattern that is repeated along each side of inner FR patches of the plurality of FR patches. The fractal rectangular pattern of a FR patch matches with the fractal rectangular pattern of an adjacent FR patch. An antenna can include a planar antenna disposed over the FR-RIS.

Abstract: Various examples are provided for point symmetric complementary meander line (PSC-ML) slots, which can be used for mutual coupling reduction. In one example, an antenna array includes first and second patch antenna elements disposed on a first side of a substrate, the first and second patch antenna elements separated by a gap. The antenna array can include point symmetric complementary meander line (PSC-ML) slots formed in a ground plane disposed on a second side of the substrate. The PSC-ML slots can include a pair of ML slots aligned with the gap between the first and second patch antenna elements. In another example, a method includes forming first and second antenna elements on a first side of a substrate and forming PSC-ML slots in a ground plane disposed on a second side of the substrate that are aligned with a gap between the first and second antenna elements.

Abstract: Exemplary embodiments include a computer-implemented method for configuring at least one antenna array comprising receiving a plurality of sets of samples corresponding to signals incident on a plurality of antennas; computing a mean of the envelopes of the sums of the respective sets; estimating a direction of arrival of the signals incident on the antennas based on the computed means; and configuring the antenna array based on the estimated direction of arrival. The computing and estimating procedures can be performed for each of a plurality of direction-of-arrival candidates. The estimating procedure can comprise determining a maximum value of the mean and a direction of arrival corresponding to the maximum value. The spatial selectivity of the antenna array can be configured based on the estimated direction of arrival. Other exemplary embodiments can include communication apparatus and computer-readable media embodying one or more of the exemplary computer-implemented methods and/or procedures.

Abstract: Various examples are provided that are related to fractal-based reactive impedance surfaces. These surfaces allow for miniaturization of antennas. In one example, a fractal rectangular reactive impedance surface (FR-RIS) includes a plurality of fractal rectangular (FR) patches having an outer edge defined by a fractal rectangular pattern that is repeated along each side of inner FR patches of the plurality of FR patches. The fractal rectangular pattern of a FR patch matches with the fractal rectangular pattern of an adjacent FR patch. An antenna can include a planar antenna disposed over the FR-RIS.

Abstract: Provided is a failure recovery method in a non-revertive mode of an Ethernet ring network. In an Ethernet ring network, link priorities between nodes or node priorities are determined based on media access control (MAC) addresses and the nodes having blocked ports are determined after failures are recovered from based on the priorities so that the blocked ports can be distributed.

Abstract: A method and apparatus for provisioning a node with executable code is provided herein. Prior to sending out a code request, a node (101) determines a set of nodes that may potentially host the requested code and sends the request to these nodes instead of a blind broadcast. The determination of what nodes have access to the required code is based on a history information of code request of the node, the overhead traffic, and/or application dependencies that are available to the node. The code request is unicast-based and may involve a multi-hop path for both code requests and responses. If this step fails, a broadcast-based approach can be again employed to request the code.

Abstract: A method and apparatus for address assignment and node scheduling within an ad-hoc communication system is provided herein. During operation a personal area network coordinator (PANC) (40) will divide a superframe (301) into a plurality of slots, assigning each sub-tree under the PANC's direct child node to each slot for communication with the PANC. Each sub-tree coordinator will be assigned a same logical address by the PANC. As a result, a sub-tree coordinator synchronizes to the PANC node in only one subsuperframe slot assigned by the PANC with different sub-tree coordinators synchronizing to the PANC in different slots.