EP1845584A1 - Appareil de sélection de la direction du faisceau - Google Patents

Appareil de sélection de la direction du faisceau Download PDF

Info

Publication number
EP1845584A1
EP1845584A1 EP06112581A EP06112581A EP1845584A1 EP 1845584 A1 EP1845584 A1 EP 1845584A1 EP 06112581 A EP06112581 A EP 06112581A EP 06112581 A EP06112581 A EP 06112581A EP 1845584 A1 EP1845584 A1 EP 1845584A1
Authority
EP
European Patent Office
Prior art keywords
angle
neighborhood
parameters
beamforming
network
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.)
Granted
Application number
EP06112581A
Other languages
German (de)
English (en)
Other versions
EP1845584B1 (fr
Inventor
Joerg Widmer
Imad Aad
Robert Vilzmann
Christian Hartmann
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NTT Docomo Inc
Original Assignee
NTT Docomo Inc
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by NTT Docomo Inc filed Critical NTT Docomo Inc
Priority to EP20060112581 priority Critical patent/EP1845584B1/fr
Priority to DE200660004175 priority patent/DE602006004175D1/de
Priority to JP2007104702A priority patent/JP4629065B2/ja
Publication of EP1845584A1 publication Critical patent/EP1845584A1/fr
Application granted granted Critical
Publication of EP1845584B1 publication Critical patent/EP1845584B1/fr
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H01—ELECTRIC ELEMENTS
    • H01Q—ANTENNAS, i.e. RADIO AERIALS
    • H01Q1/00—Details of, or arrangements associated with, antennas
    • H01Q1/12—Supports; Mounting means
    • H01Q1/125—Means for positioning
    • H01Q1/1257—Means for positioning using the received signal strength
    • H—ELECTRICITY
    • H01—ELECTRIC ELEMENTS
    • H01Q—ANTENNAS, i.e. RADIO AERIALS
    • H01Q3/00—Arrangements for changing or varying the orientation or the shape of the directional pattern of the waves radiated from an antenna or antenna system
    • H01Q3/02—Arrangements for changing or varying the orientation or the shape of the directional pattern of the waves radiated from an antenna or antenna system using mechanical movement of antenna or antenna system as a whole
    • H01Q3/08—Arrangements for changing or varying the orientation or the shape of the directional pattern of the waves radiated from an antenna or antenna system using mechanical movement of antenna or antenna system as a whole for varying two co-ordinates of the orientation
    • H—ELECTRICITY
    • H01—ELECTRIC ELEMENTS
    • H01Q—ANTENNAS, i.e. RADIO AERIALS
    • H01Q3/00—Arrangements for changing or varying the orientation or the shape of the directional pattern of the waves radiated from an antenna or antenna system
    • H01Q3/26—Arrangements for changing or varying the orientation or the shape of the directional pattern of the waves radiated from an antenna or antenna system varying the relative phase or relative amplitude of energisation between two or more active radiating elements; varying the distribution of energy across a radiating aperture

Definitions

  • the present invention relates to the beamforming of antenna arrays.
  • a mobile device with a beam antenna may select the direction of its beam-pattern in a wireless network and may thereby positively affect connectivity and stability of the network.
  • beam direction we refer to the orientation of the antenna pattern, where the pattern can have arbitrary shape as determined by the antenna array.
  • Beamforming may be applied, among others, for wireless access networks, mesh networks, vehicular networks and sensor networks.
  • Random direction beamforming (which is e.g. described in C. Bettstetter, C. Hartmann and C. Moser, "How does randomized beamforming improve the connectivity of ad hoc networks?", In Proc. IEEE Intern. Conf. on Communications (ICC), Seoul, Korea, May 16-20, 2005 ) is a simple method that consists of pointing (and fixing) the beam of a directional-antenna in a random direction. RDB showed considerable improvement compared to using omni-directional antennas.
  • Fig. 1 illustrates the case where nodes x and y point their beams in a direction where no neighbors are located. Such nodes are isolated from the rest of the network.
  • This approach is e.g. described in R. Roy Choudhury, X. Yang, R. Ramanathan and N. H. Vaidya, "Using directional antennas for medium access control in ad hoc networks", in ACM MobiCom 2002 . It involves choosing the direction of the beam based on routing information.
  • Communication-based beamforming forces nodes to continuously search for and adapt to the position of their communication partner, which requires tight coordination between nodes, resulting in high complexity and overhead. This means that the beamforming mechanism and the routing mechanism interact and are not independent of each other.
  • the beamforming mechanism must be aware of routing information such as the identity of the communication partner (or at least the next hop) of the node and its location, which increases the complexity of the overall system.
  • the individual nodes must be aware of the angle at which they can reach their communication partner, which can be obtained through angle-of-arrival estimation or using information about their position and the position of their immediate communication partners (next hop).
  • the (OSI) layer which is responsible for the routing and the layer which is responsible for the beamforming e.g. the MAC layer
  • This situation is unfavorable in terms of complexity of the overall beamforming mechanism; moreover, its implementation in existing network infrastructures becomes difficult because it requires modifications at two different layers of the ISO-OSlmodel.
  • an apparatus for selecting the beamforming direction of a node in an ad-hoc network comprising:
  • a beamforming antenna in wireless networks in order to enhance connectivity and robustness of routing and to decrease mutual interference.
  • said neighborhood parameters are transmitted by other nodes without specific request from said node which is to select its beamforming angle, and wherein the weights with which said neighborhood parameters obtained from multiple nodes at different angles are considered for the calculation of the decision parameter are independent of the present or intended communication partner of the node which is to select its beamforming direction.
  • the selection mechanism can be based on a "passive" overhearing of ongoing communications rather than on active requests which would involve additional communication.
  • the selection is based on the overall neighborhood as reflected by the parameters derived from the overheard transmissions, thereby avoiding a frequent change of the angle and furthermore cascading effects which may arise from such a change in case of communication based beamforming which would take into account any change in communication partners.
  • said neighborhood parameters are included in data transmissions or dedicated beacon messages at a layer different from or below the layers at which the routing protocol operates.
  • the beamforming selection becomes independent of the routing protocol and thereby avoids the complications which are caused by the interdependence between beamforming and routing in case of the communication based beamforming approach.
  • the approach according to this embodiment is much less complex than "communication-based beamforming" since it requires no coordination among nodes, while significantly outperforming random beamforming direction at a comparable complexity.
  • the method provides better network connectivity, shorter paths (therefore shorter end-to-end delays), lower interference, lower battery consumption of mobile devices and increased network capacity.
  • said neighborhood parameters are transmitted by said nodes at regular intervals, and wherein said neighborhood parameters comprise one or more of the following:
  • the node may compute the optimal beam direction using information about its neighborhood obtained from said parameters such as number of neighbors, their energy level, channel quality, congestion level, position, etc.
  • a beamforming selection algorithm may be implemented.
  • the regular repetition ensures that the algorithm adapts to changes of the network conditions.
  • control module is adapted to adapt the incrementing step size of the angle and/or the step duration at a certain angle during the sweeping to obtain a statistically significant sample of the status updates in the corresponding direction.
  • said neighborhood information is transmitted by said nodes piggy-packed on the normal traffic or by using a dedicated beacon message for transmitting said neighborhood information.
  • said apparatus comprises a module for changing a threshold parameter which is applied to determine whether a change in the decision parameter is sufficient to change the beamforming direction, whereas said module is adapted to increase said threshold in case it detects that the network is too unstable, and/or said module is adapted to decrease said threshold in case it detects that the network is too stable. This enables said apparatus to adapt to the overall stability condition of the network.
  • a network comprising a plurality of nodes, each node comprising an apparatus according to one of the preceding claims, whereas said network is one of the following:
  • said apparatus comprises a module for randomly choosing the timing of the first beamforming selection carried out by this node, and for choosing the timing of subsequent beamforming selection operations at regular intervals.
  • said regular intervals vary in accordance with some random parameter chosen by said timing selection module.
  • the selection operations are carried out on an ordered sequence. This ensures that two nodes do not simultaneously choose their beamforming direction. However, this requires node coordination to some extent.
  • a beamforming method and apparatus that improves performance compared to RDB, while avoiding the complexity of communication-based beamforming.
  • the selection of the beamforming direction is based on aggregate information collected from neighboring nodes.
  • some information can be gathered at each node without requiring any cooperation from other nodes (e.g. by overhearing ongoing transmissions and estimating the number of neighbors in each beam direction).
  • the information about the number of neighbors may be derived from the overheard transmissions by identifying the number of different MAC (Media Access Control) addresses found in the overheard transmissions.
  • This information (the MAC address which is a unique identifier attached to most forms of networking equipment) typically is contained in the data stream originating from a certain node, and therefore by identifying the number of different MAC addresses one can identify the number of different nodes.
  • a control mechanism may cause the beam of the antenna to carry out a sweep in incrementing angles, and at each angle the number of different nodes is determined. The angle where the maximum number of nodes has been found may then be chosen as the direction of the beam for the antenna.
  • a receiving module 210 which is connected to antenna 200 and which overhears the data transmitted from other nodes in incrementing angles, furthermore a control module 220 which is capable of controlling the beam direction of the antenna through control signal 230 and sweeps through the different angles (in incrementing steps) and extracts at each angle neighborhood parameters (according to one embodiment MAC addresses) from the overheard data stream, and which then based on the neighborhood parameters calculates a decision parameter for each angle. Based on a comparison of the decision parameters for the different angles the control module selects the angle to be chosen as the beamforming direction for the antenna. According to one embodiment this is the angle in which the highest number of nodes are located, in other words the angle at which the most distinct MAC addresses could be found.
  • the receiving module and the control module may be implemented by a digital signal processor which is suitably programmed to operate as described before.
  • Fig. 3 illustrates a block diagram of a node according to a further embodiment of the invention and its operation.
  • the transceiver gathers the overheard data and the (periodically transmitted) neighborhood parameters p_k. Those parameters (p_k) are used by the "computation of beam direction" module that controls the antenna beam direction. They are gathered using the current beam pattern without estimating their angle of arrival.
  • each node periodically transmits its own status parameters p_i, either in beacon messages or piggy-backed onto data packets.
  • the node illustrated in Fig. 3 also transmits its own internal parameters p_i which are then received by other nodes as "neighborhood parameters" p_k and which thereby influence the selection of the beamforming direction at the other nodes.
  • the neighborhood parameters are transmitted in the data link layer, or in one specific embodiment in the MAC layer which is a sub-layer of the data link layer. This is indicated in Fig.3 by the element labeled MAC. From the MAC layer the data is passed on to higher layers as indicated in Fig.3. However, the neighborhood parameters p_k are not passed on to higher layers because they are transmitted at the MAC layer and therefore extracted from the data stream already at this level. Similarly, the internal parameters p_i are fed into the outgoing data stream at the MAC layer level.
  • Transmitting the neighborhood parameters at the MAC layer has the advantage that the whole beamforming selection operation is carried out at a layer which lies below the layers which are e.g. concerned with the routing algorithm. This means that the beamforming angle selection can be performed independently of the routing algorithm and thereby avoids the complications which are introduced by the interdependence between routing and beamforming in case of communication-based beamforming.
  • the beamforming direction selection mechanism operates independent of any information about the communication partner of the node which has to select its beamform. This means that the node does not take into account its present communication partner, its present next hop in an ongoing communication session, and so on. Rather it only performs a "passive" monitoring of its neighborhood by overhearing ongoing transmissions at different angles. This is independent of its own communication intentions or conditions in the sense that the routing information such as its next hop and the location or direction of the next hop is not influencing the decision of the beamforming selection. Instead, rather than considering its own communication conditions and requirements a node scans its neighborhood with respect to the ongoing traffic to determine therefrom parameters indicative of the neighborhood as a whole (i.e.
  • any information from the present or intended communication partner of the node is considered at all, they are only considered equally with information from other nodes at the same angle step, i.e. there is no preference regarding any node the communication of which is overheard.
  • the node does not need the extensive communication with other nodes to obtain relevant parameters for its own situation concerning its own communication requirements (such as determining "where is my next hop, at which angle in forward and in backward direction of the present or intended communication path") because instead the node rather than being concerned with its own communication partners is concerned about the overall situation of its neighborhood.
  • the node obtains this information without actively “requesting" it but rather by "passively” overhearing it.
  • the neighborhood parameters are transmitted by the nodes of the neighborhood without specific request, e.g. in regular intervals using a piggy-back mechanism or a beacon signal.
  • nodes can also include status parameters, e.g. their own energy level, the number of neighbors they have, etc., in their beacons or piggy-back it onto data packets.
  • This information is then received by other nodes as "neighborhood parameters", and in one embodiment it may be used for determining or calculating the decision parameter.
  • neighboredness parameters e.g. their own energy level, the number of neighbors they have, etc., in their beacons or piggy-back it onto data packets.
  • neighborehood parameters e.g. their own energy level, the number of neighbors they have, etc., in their beacons or piggy-back it onto data packets.
  • status parameters p_i may contain one or more of the following:
  • this information is sent at regular intervals, e.g. periodically, with period T_b, without affecting the beam direction of the node transmitting them (i.e., beacons are transmitted using the current beam configuration).
  • the number of neighbors may be considered as already described before by selecting the angle where the maximum number of neighbors are located.
  • the battery level may be considered by choosing an angle where there is a high battery lifetime for the nodes, in other words, an angle having the maximum cumulative energy level. This has the effect that it increases the network stability because an angle where due to the low energy one node after another will fail would have the effect that many communication paths cease to exist and new routing paths would have to be chosen.
  • the nodes may be weighted based on their congestion level and based thereupon a cumulative congestion parameter may be determined for the different angles. Then an angle having a low congestion level may be selected.
  • Considering the position may be done such that it is tried to cover an area as completely as possible to leave no "white spots" where it would be difficult for a newly entering node to find a connecting node.
  • the nodes it would be necessary for the nodes to determine and transmit their absolute or relative positions so that this information may be extracted from the overheard traffic by a node which is to determine its beamforming angle.
  • more than one neighborhood parameter may be taken into account when determining the decision parameters for the different angles. This may e.g. be done by determining an individual decision parameter based on each of the neighborhood parameters to be considered and to then calculate cumulated decision parameter based on the individual decision parameters. In such a case different weights may be applied to the different individual decision parameters, e.g. if energy is of particular concern the individual decision parameter based on the battery level may be assigned higher weight than e.g. the number of neighboring nodes.
  • the multiple different neighbourhod parameters are not used to determine individually different decision parameters which are then combined, but rather a final decision parameter is directly obtained from different neighborhood parameters.
  • the algorithm is performed by each node of the network.
  • Each node runs an algorithm to (re-)compute the beam direction (Algorithm 1) independently from the other nodes.
  • the sweeping loop searches for the beam direction that maximizes a decision parameter F(P), where F() combines all the relevant parameters p_k (battery level, SNR, number of neighbors, etc.). If the new beam direction results in a considerable increase (larger than threshold) of F() over the previous one, the new beam direction is kept. This search algorithm is repeated every search_period_duration.
  • the average number of status updates (be they piggybacked or through dedicated beacons) over time determines the speed with which the sweeping for the computation of the beam direction can occur. In case data packets are sent very frequently, it may be sufficient to piggyback status information only onto some of them. In contrast, if very little or no traffic occurs, inferring an accurate image might take too much time without using dedicated beacon messages.
  • the beacon frequency can be adapted such that the total number of updates a node can overhear per time step remains relatively constant.
  • a threshold parameter to decide whether a change in the decision parameter or optimization value opt_value is considered significant enough to actually change the beam direction.
  • the lower the threshold the closer the beam direction tracks the optimum direction.
  • frequent changes in beam direction have an impact on the stability of the network. Changing the beam direction results in changes to the parameter values of the neighbors and this can cause them to also change their beam direction in turn.
  • a wireless routing algorithm that is running on top of the proposed beam forming protocol would have to frequently adjust to the changes in the neighborhood, computing new routes and tearing down invalid old ones. Therefore, it is preferable to adapt the threshold parameter to the responsiveness of the routing protocol, as well as the network requirements concerning energy consumption, availability of alternate paths, etc.
  • This intelligent adjustment can be done through additional signaling between the beam direction protocol and higher layers such as the routing or even application layer.
  • a higher layer may change the threshold (as well as the other parameters of the algorithm) in case it detects that the network is too unstable. This may be detected by measuring e.g. the average duration of a connection, and if it is considered too short the network may be considered too unstable. Another possibility would be to measure the number of broken connections within a certain time period, if it is too high the network may be regarded as unstable.
  • the mobile terminals initially beamform in a random direction. Then each node sweeps the main lobe by incrementing its beamforming angle by a predefined amount. Upon completing the sweep, the node beamforms in the direction where the node degree was maximum (i.e. where it found the highest number of neighbors). If this maximum node degree occurred in more than one direction, one of these directions is picked at random. This process is repeated periodically to account for possible changes in the network topology.
  • F(P) corresponds to the number of distinct MAC source addresses overheard during each step of the sweeping phase.
  • MNDB maximum node degree beamforming
  • MNDB can result in sub-optimal connectivity, where nodes point their beams such that they form clusters with strong connectivity within each of them, but few connections between different clusters. This is because a node tends to direct its beam into an angle where it can "directly” reach a maximum number of neighbors, "directly” here means without intermediate hops. However this is not in all cases the best solution, as can be seen from Fig. 5A which depicts a situation where node X can reach the maximum number of hops directly by directing its beam towards cluster A. However, in terms of overall connectivity it would be advantageous if node X would direct its beam towards cluster B because thereby a connection between these two clusters could be established, thereby increasing overall connectivity.
  • nodes may use the Two-hop Node Degree Beamforming algorithm (TNDB) to maximize the number of distinct 1- and 2-hop neighbors, as will become apparent from the following.
  • TNDB Two-hop Node Degree Beamforming algorithm
  • a node not only transmits its own MAC address as status information or neighborhood information, but additionally also the MAC addresses of its next hop neighbors. It will be understood that this may require some amendment of the protocol at the MAC layer because while the own MAC address usually is transmitted together with any communication data, the MAC address of the next hop is normally not included. However, this may be achieved by keeping the MAC addresses received with incoming data and then feeding them again into an outgoing data stream as neighborhood parameter. Any node receiving these neighborhood parameters may then use all of those MAC addresses, the one of the originating node and the MAC addresses of that node's neighbors, as input parameters for calculating the decision parameter F(P).
  • the individual status updates p_k contain the list of overheard MAC source addresses of node k, and F(P) calculates from this the number of distinct MAC addresses of the two-hop neighborhood, by summing up the p_k and removing duplicate MAC addresses.
  • node X is connected to its neighbors in cluster A through its side-lobes, and it uses its main-lobe to reach further neighbors in cluster B, thus improving connectivity between the two clusters.
  • both MNDB and TNDB provide better network connectivity, shorter paths (therefore reducing end-to-end delays), and lower interference.
  • These algorithms can be further improved by using additional information from neighbor nodes such as available energy, congestion level and channel quality. This reduces the cost of operating the networks while increasing user satisfaction (e.g. lower battery consumption of mobile devices, increased network capacity, etc.).
  • an even more distant neighborhood than the two-hop neighborhood may be considered.
  • the status information or neighborhood information are sent by each node periodically in a predetermined interval.
  • the moment of the initial transmission may be chosen randomly, e.g. within a certain timing window after switching on the node.
  • the subsequent transmissions (beacon or piggy backed) may be sent in a predetermined interval, according to one embodiment also this interval varies to some extent randomly.
  • Introducing the random character of the beamforming selection timing at the start and possibly also for subsequent selection operations reduces the possibility that beamforming selections are carried out simultaneously which might negatively affect network stability.
  • the provision of a regular interval (which may vary to some extent randomly) within which a beamforming selection is made ensures that the network continuously and regularly adapts to changing situations which may arise through the movement of the nodes.
  • the sequence within which the individual nodes transmit is predetermined or fixed, in other words the order in which the individual nodes select their beamforming direction does not change.
  • a fixed sequence requires at least some coordination between the individual nodes, at least to establish the order. It is therefore somewhat more complex than having each node choosing its timing for its selection operation on its own while introducing some random element to ensure a more or less distributed execution over time of the selection process.
  • beam-antennas help increasing the transmission rates and ranges, saving energy, extending the sensors' lifetimes and better connecting the network.
  • some sensors may be disconnected from the rest of the network due to the heterogeneity of the topology (topology borders, empty areas, etc.). Selecting the beamforming direction using embodiments of the invention helps all sensors to find the direction that better connects them to the (rest of the) network.
  • vehicular networks Another example where embodiments of the invention may be applied are vehicular networks.
  • an access point using a beam antennas increases its transmission range (and its receive gain) in a given direction(s).
  • Selecting the beamforming direction using embodiments of the invention helps further adapting the orientation of the antenna beam(s) to cover more users, adapt to the dynamics of the topology (e.g. which conference room in a hotel is used) and increase user satisfaction.
  • mesh network elements can use embodiments of the invention to improve network connectivity, reduce interference and adapt to occasional dynamics of the network.

Landscapes

  • Mobile Radio Communication Systems (AREA)
EP20060112581 2006-04-12 2006-04-12 Appareil de sélection de la direction du faisceau Expired - Fee Related EP1845584B1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP20060112581 EP1845584B1 (fr) 2006-04-12 2006-04-12 Appareil de sélection de la direction du faisceau
DE200660004175 DE602006004175D1 (de) 2006-04-12 2006-04-12 Gerät zur Bestimmung der Keulenrichtung
JP2007104702A JP4629065B2 (ja) 2006-04-12 2007-04-12 ビームフォーム方向を選択する装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP20060112581 EP1845584B1 (fr) 2006-04-12 2006-04-12 Appareil de sélection de la direction du faisceau

Publications (2)

Publication Number Publication Date
EP1845584A1 true EP1845584A1 (fr) 2007-10-17
EP1845584B1 EP1845584B1 (fr) 2008-12-10

Family

ID=36691381

Family Applications (1)

Application Number Title Priority Date Filing Date
EP20060112581 Expired - Fee Related EP1845584B1 (fr) 2006-04-12 2006-04-12 Appareil de sélection de la direction du faisceau

Country Status (3)

Country Link
EP (1) EP1845584B1 (fr)
JP (1) JP4629065B2 (fr)
DE (1) DE602006004175D1 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2071662A1 (fr) * 2007-11-30 2009-06-17 Canon Kabushiki Kaisha Procédé, appareil et programme informatique de mise à jour des angles de faisceau d'antenne d'une antenne directionnelle d'un dispositif sans fil
WO2009114621A2 (fr) * 2008-03-11 2009-09-17 Intel Corporation Agencements pour l’association et la réassociation dans un réseau sans fil
FR2939267A1 (fr) * 2008-11-28 2010-06-04 Canon Kk Procede de gestion de routage de communications dans un reseau de communication sans-fil, produit programme d'ordinateur, moyen de stockage et dispositif de gestion correspondant
EP2197238A1 (fr) * 2008-12-11 2010-06-16 Canon Kabushiki Kaisha Procédé de sélection d'un angle de réception effectif d'une antenne directionnelle d'un noeud récepteur, produit programe d'ordinateur, moyen de stockage et noeud récepteur
GB2479197A (en) * 2010-04-01 2011-10-05 Canon Kk Configuring a receiving antenna array for transmissions of a first type on the basis of transmissions of another type
CN115002002A (zh) * 2022-04-02 2022-09-02 中国兵器科学研究院 一种装备体系信息通联能力评估方法、装置、设备及介质

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8335170B2 (en) * 2008-11-25 2012-12-18 Intel Corporation Directional transmission techniques
JP5682487B2 (ja) * 2011-07-08 2015-03-11 富士通株式会社 無線通信装置及び通信ルート選定方法
JP6278382B2 (ja) * 2013-09-24 2018-02-14 公立大学法人首都大学東京 情報端末および情報端末用のプログラム

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050047322A1 (en) * 2003-09-03 2005-03-03 Intel Corporation Communication system and method for channel estimation and beamforming using a multi-element array antenna
US6970722B1 (en) * 2002-08-22 2005-11-29 Cisco Technology, Inc. Array beamforming with wide nulls
US20060040706A1 (en) * 2002-11-19 2006-02-23 Shiquan Wu And John Litva Hybrid space-time diversity beam forming system

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3445549B2 (ja) * 2000-03-01 2003-09-08 株式会社国際電気通信基礎技術研究所 無線ネットワークのためのルーチング方法及びルータ装置
JP2003115851A (ja) * 2001-10-03 2003-04-18 Advanced Telecommunication Research Institute International 無線ネットワークの制御方法及び制御装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6970722B1 (en) * 2002-08-22 2005-11-29 Cisco Technology, Inc. Array beamforming with wide nulls
US20060040706A1 (en) * 2002-11-19 2006-02-23 Shiquan Wu And John Litva Hybrid space-time diversity beam forming system
US20050047322A1 (en) * 2003-09-03 2005-03-03 Intel Corporation Communication system and method for channel estimation and beamforming using a multi-element array antenna

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8169368B2 (en) 2007-11-30 2012-05-01 Canon Kabushiki Kaisha Method, apparatus and computer program for updating antenna beam angles of a directional antenna of wireless device
EP2071662A1 (fr) * 2007-11-30 2009-06-17 Canon Kabushiki Kaisha Procédé, appareil et programme informatique de mise à jour des angles de faisceau d'antenne d'une antenne directionnelle d'un dispositif sans fil
US8902822B2 (en) 2008-03-11 2014-12-02 Intel Corporation Arrangements for association and re-association in a wireless network
WO2009114621A2 (fr) * 2008-03-11 2009-09-17 Intel Corporation Agencements pour l’association et la réassociation dans un réseau sans fil
CN107070523A (zh) * 2008-03-11 2017-08-18 英特尔公司 用于无线网络中的关联和重新关联的布置
KR101227305B1 (ko) * 2008-03-11 2013-01-28 인텔 코오퍼레이션 무선 네트워크에서의 연관 및 재연관을 위한 방법, 장치 및 저장 매체
KR101226367B1 (ko) * 2008-03-11 2013-01-24 인텔 코오퍼레이션 무선 네트워크에서의 연관 및 재연관을 위한 방법, 장치 및 저장 매체
WO2009114621A3 (fr) * 2008-03-11 2009-12-17 Intel Corporation Agencements pour l’association et la réassociation dans un réseau sans fil
FR2939267A1 (fr) * 2008-11-28 2010-06-04 Canon Kk Procede de gestion de routage de communications dans un reseau de communication sans-fil, produit programme d'ordinateur, moyen de stockage et dispositif de gestion correspondant
FR2939991A1 (fr) * 2008-12-11 2010-06-18 Canon Kk Procede de selection d'un angle de reception effectif d'une antenne directionnelle d'un noeud recepteur, produit programme d'ordinateur, moyen de stockage et noeud recepteur
US8494567B2 (en) 2008-12-11 2013-07-23 Canon Kabushiki Kaisha Method for selecting an effective angle of reception of a directional antenna of a receiver node, corresponding storage means and receiver node
EP2197238A1 (fr) * 2008-12-11 2010-06-16 Canon Kabushiki Kaisha Procédé de sélection d'un angle de réception effectif d'une antenne directionnelle d'un noeud récepteur, produit programe d'ordinateur, moyen de stockage et noeud récepteur
GB2479197A (en) * 2010-04-01 2011-10-05 Canon Kk Configuring a receiving antenna array for transmissions of a first type on the basis of transmissions of another type
GB2479197B (en) * 2010-04-01 2013-05-15 Canon Kk Configuring a receiving antenna of a receiving device
CN115002002A (zh) * 2022-04-02 2022-09-02 中国兵器科学研究院 一种装备体系信息通联能力评估方法、装置、设备及介质
CN115002002B (zh) * 2022-04-02 2024-02-13 中国兵器科学研究院 一种装备体系信息通联能力评估方法、装置、设备及介质

Also Published As

Publication number Publication date
EP1845584B1 (fr) 2008-12-10
DE602006004175D1 (de) 2009-01-22
JP2007288786A (ja) 2007-11-01
JP4629065B2 (ja) 2011-02-09

Similar Documents

Publication Publication Date Title
EP1845584B1 (fr) Appareil de sélection de la direction du faisceau
Bandyopadhyay et al. An adaptive MAC and idrectional routing protocol for ad hoc wireless network using ESPAR antenna
JP7289436B2 (ja) 小波長無線ネットワークにおけるビーコニング（ｂｅａｃｏｎｉｎｇ）
Choudhury et al. Using directional antennas for medium access control in ad hoc networks
Roy et al. A network-aware MAC and routing protocol for effective load balancing in ad hoc wireless networks with directional antenna
Hu et al. On mitigating the broadcast storm problem with directional antennas
US7453832B2 (en) Transit link coordination systems and methods for a distributed wireless communication network
CN113261344B (zh) 多跳路由中的快速阻塞发现和恢复
US20070133483A1 (en) Transmission power control over a wireless ad-hoc network
WO2019002991A1 (fr) Découverte de nœuds voisins dans des réseaux maillés sans fil avec transmissions directionnelles
WO2006014512A2 (fr) Systeme et procede de selection d'itineraires stables dans des reseaux sans fil
Takata et al. A dual access mode MAC protocol for ad hoc networks using smart antennas
CN113273101B (zh) 在多跳系统中集成扇区化通信和路由发现
JP7345735B2 (ja) Ｗｌａｎネットワークにおけるバックアップルートを伴うマルチホップルーティングプロトコル
JP2003332971A (ja) 無線ネットワークのための通信方法及び無線ネットワークシステム
GB2455794A (en) Establishing a multi-hop route in wireless network
Mir et al. Continuous neighbor discovery protocol in wireless ad hoc networks with sectored-antennas
Choudhury et al. Mac-layer capture: A problem in wireless mesh networks using beamforming antennas
Gossain et al. Minimizing the effect of deafness and hidden terminal problem in wireless ad hoc networks using directional antennas
Cordeiro et al. A directional antenna medium access control protocol for wireless ad hoc networks
Vilzmann et al. Low-complexity beamforming techniques for wireless multihop networks
JP3920814B2 (ja) 無線ネットワークのための制御方法及び無線通信システム
JP3936328B2 (ja) 無線ネットワークのルーティング方法及び無線通信システム
Kwon et al. DC-MAC: Directional cooperative MAC for ad-hoc networks
Chatterjee et al. Hop-efficient and power-optimized routing strategy in a decentralized mesh network using directional antenna

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20060824

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK YU

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

AKX Designation fees paid

Designated state(s): DE GB

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE GB

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 602006004175

Country of ref document: DE

Date of ref document: 20090122

Kind code of ref document: P

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20090911

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20120425

Year of fee payment: 7

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20120411

Year of fee payment: 7

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20130412

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20130412

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131101

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602006004175

Country of ref document: DE

Effective date: 20131101