EP1499982A1 - Systeme et procede de creation d'une representation graphique d'un reseau sur la base de la perspective d'un noeud - Google Patents

Systeme et procede de creation d'une representation graphique d'un reseau sur la base de la perspective d'un noeud

Info

Publication number
EP1499982A1
EP1499982A1 EP03724269A EP03724269A EP1499982A1 EP 1499982 A1 EP1499982 A1 EP 1499982A1 EP 03724269 A EP03724269 A EP 03724269A EP 03724269 A EP03724269 A EP 03724269A EP 1499982 A1 EP1499982 A1 EP 1499982A1
Authority
EP
European Patent Office
Prior art keywords
node
display
nodes
network
links
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.)
Ceased
Application number
EP03724269A
Other languages
German (de)
English (en)
Other versions
EP1499982A4 (fr
Inventor
Keith Goldberg
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.)
Arris Enterprises LLC
Original Assignee
MeshNetworks 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 MeshNetworks Inc filed Critical MeshNetworks Inc
Publication of EP1499982A1 publication Critical patent/EP1499982A1/fr
Publication of EP1499982A4 publication Critical patent/EP1499982A4/fr
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/22—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks comprising specially adapted graphical user interfaces [GUI]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • 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/248—Connectivity information update
    • 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/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/34—Modification of an existing route
    • H04W40/36—Modification of an existing route due to handover

Definitions

  • the present invention relates to a system and method for providing a graphical illustration of nodes and node links as perceived by a selectable root node within a network. More particularly, the present invention relates to a system and method for creating an illustrative graph of connected nodes and node links to display network topology, from a root node's perspective, on a computerized display device.
  • the display is user configurable and is automatically updated as network topology changes.
  • a system may consist of a fixed network, including a core local access network (LAN), and a plurality of servers and gateway routers, to provide subscriber devices access to other networks.
  • LAN local access network
  • Each element may be linked in some fashion to other elements in the network, and each may be in various states of operation.
  • Information of importance may include which links are active or what operation each element is currently executing.
  • each node and link will have a significant amount of information regarding the type, use and current operation associated with it. Much of this information may be of importance to a network administrator, and may be presented in a number of ways, for instance, individual node data may be presented in table form accessed through a video display. For a complex network, this may include a large number of individual tables and accessing network information through such tables, may require the network administrator to page through numerous table displays to gather sufficient information about the network. As networks have grown, this method has become too slow and impractical.
  • Another solution to the difficulties of network data presentation has included the graphical display of information previously available in table form, wherein the network may be displayed as a collection of linked nodes on a computerized display device.
  • Hewlett Packard provides several versions of a network management software package entitled 'Network Node Manager', which provides views of the network in a graphical format.
  • the Network Node Manager discovers transmission control protocol/internet protocol (TCP/IP), internetwork packet exchange (IPX) and Level 2 devices on a network and creates a graphical display of linked devices.
  • TCP/IP transmission control protocol/internet protocol
  • IPX internetwork packet exchange
  • Level 2 devices level 2 devices on a network and creates a graphical display of linked devices.
  • the display is configured to present a map illustrating what the network actually looks like.
  • Attempts to expand data content in graphic displays may include adding additional features, such as graphic enhancements, to the illustrated nodes or links to indicate an operational state. For instance, as discussed in the Brandau Patent, bullets representing the connection status of nodes and links may be color coded within the display. [0006]
  • previous graphic display applications such as those described in the Brandau and Richardson Patents, have displayed network topology solely from the network administrator's perspective. That is, the view given each node and each node link is based upon network information perceived by the network administrator.
  • the Hewlett Packard Network Node Manager software illustrates what the network ' tfually looks like", rather than how the network appears to a selected node. Each node in the network may actually perceive network topology differently, and respond accordingly.
  • the view of the network, or some portion of the network, will vary from node to node. Therefore, if a node's perspective of the network is used to create a network display, the display will also vary. In past solutions, even though each node in the network may perceive the topology differently, the displayed information has not been tailored to the node's unique perspective of the network. The display has always represented what the network actually looks like.
  • a network display from a node's perspective may be used to show the presence and location of other nodes within a particular area.
  • An object of the present invention is to provide a system and method for determining network information as seen by a selectable root node in a network.
  • Another object of the present invention is to provide an illustrative display of network nodes and node links as determined by network information seen by a selected root node in a network.
  • Figure 1 is a block diagram of an example of an ad-hoc wireless communications network including a plurality of nodes employing an embodiment of the present invention
  • Figure 2 is a block diagram of an example of a wireless node as shown in Figure 1 ;
  • Figure 3 is an example of a windowing graphic system illustrating a display of nodes and node links from a selected root node's perspective in accordance with an embodiment of the present invention.
  • Figure 4 is an example of a dialog box providing additional node information for use with the display shown in Figure 3 in accordance with an embodiment of the present invention.
  • FIG. 1 is a block diagram illustrating an example of an ad-hoc packet- switched wireless communications network 100 employing an embodiment of the present invention.
  • the network 100 includes a plurality of mobile wireless user terminals 102-1 through 102-n (referred to generally as nodes 102 or mobile nodes 102), and can, but is not required to, include a fixed network 104 having a plurality of access points 106-1, 106-2,..106-n (referred to generally as nodes 106 or access points 106), for providing nodes 102 with access to the fixed network 104.
  • the fixed network 104 can include, for example, a core local access network (LAN), and a plurality of servers and gateway routers, to provide network nodes with access to other networks, such as other ad-hoc networks, the public switched telephone network (PSTN) and the Internet.
  • the network 100 further can include a plurality of fixed routers 107-1 through 107-n (referred to generally as nodes 107 or fixed routers 107) for routing data packets between other nodes 102, 106 or 107. It is noted that for purposes of this discussion, the nodes discussed above can be collectively referred to as'hodes 102, 106 and 107', or simply' odes".
  • the nodes 102, 106 and 107 are capable of communicating with each other directly, or via one or more other nodes 102, 106 or 107 operating as a router or routers for packets being sent between nodes, as described in U.S. Patent Application Serial No. 09/897,790 entitled' ⁇ d Hoc Peer- to-Peer Mobile Radio Access System Interfaced to the PSTN and Cellular Networks'', filed on June 29, 2001, and in U.S. Patent Application Serial No.
  • Each node 102, 106 and 107 shown in Figure 1 can communicate over plural data channels as well as a network reservation channel. These channels are not limited to any particular architecture or configuration, so long as each node has the ability to access the channels. Furthermore, these channels can exist over any communication medium, such as wire, optical fiber, or wireless (over-the-air), and may employ any suitable transmission protocol.
  • each node 102, 106 and 107 includes a transceiver 108 which is coupled to an antenna 110 and is capable of receiving and transmitting signals, such as packetized signals, to and from the node 102, 106 or 107, under the control of a controller 112.
  • the packetized data signals can include, for example, voice, data or multimedia information, and packetized control signals, including node update information.
  • Each node 102, 106 and 107 further includes a memory 114, such as a random access memory (RAM), that is capable of storing, among other things, routing information pertaining to itself and other nodes in the network 100.
  • the nodes 102, 106 and 107 exchange their respective routing information, referred to as routing advertisements or routing table information, with each other via a broadcasting mechanism periodically, for example, when a new node enters the network 100, or when existing nodes in the network 100 move.
  • certain nodes can include a host 116 which may consist of any number of devices, such as a notebook computer terminal, mobile telephone unit, mobile data unit, or any other suitable device.
  • the subscriber device host 108 can optionally include the appropriate hardware and software to perform transmission control protocol (TCP) and user datagram protocol (UDP).
  • TCP transmission control protocol
  • UDP user datagram protocol
  • the subscriber device host 116 includes a driver to provide an interface between the subscriber device host 116 and the transceiver 108, in addition to a display device for providing a user display.
  • Each node 102, 106 and 107 also includes the appropriate hardware and software to perform Internet Protocol (IP) and Address Resolution Protocol (ARP), the purposes of which can be readily appreciated by one skilled in the art.
  • IP Internet Protocol
  • ARP Address Resolution Protocol
  • TCP transmission control protocol
  • UDP user datagram protocol
  • each node 102, 106 and 107 is capable of preparing an illustrative display of its neighboring nodes in network 100.
  • each node 102, 106 and 107 collects information regarding network nodes within the network based upon network perception by the collecting node by exchanging routing table information.
  • the perceived network information for any single node may result from a number of different operations. For instance, during communication, nodes exchange their respective routing information, referred to as routing advertisements or routing table information, with one another via a broadcasting mechanism when a new node enters the network, or when existing nodes in the network move.
  • a node will broadcast its routing table updates, and nearby nodes will only receive the broadcast routing table updates if within broadcast range (e.g., radio frequency (RF) range) of the broadcasting node.
  • broadcast range e.g., radio frequency (RF) range
  • nodes 102-1, 102-2 and 102-7 are within the RF broadcast range of node 102-5
  • nodes 102-3, 102-4 and 102-6 are beyond broadcast range, none of those nodes will receive the broadcast routing table information from node 102-5.
  • nodes 102-1, 102-2 and 102-7 will have a different perspective of network 100 than nodes 102-3, 102-4 and 102-6, as the former will have received current table information from node 102-5.
  • This scenario may repeat as nodes move over time. At any given time, a single node may have only limited information regarding certain nodes and complete information regarding other nodes of the network. Therefore each of nodes 102, 106 and 107, can prepare a different display of network 100, depending upon the network information perceived by the node preparing the display. The selection of the node preparing the display then becomes a key tool in display preparation.
  • a user of a mobile node 102 can control the host associated with that node to display on its display screen a display representing the connectivity of the node 102 and its neighboring nodes 102, 106 and/or 107 from the perspective of the node 102.
  • a network administrator can select any of nodes 102, 106 or 107, as the node from which a network perspective is depicted, and any user of a node (e.g., a mobile node 102) can select any of the other nodes 102, 106 pr 107 as the node from which a network perspective is depicted.
  • the node whose perspective of the network 100 is displayed acts as a 'toot node", and serves as the node from which the network topology is perceived and presented. That is, the network topology will be displayed based upon information about network 100 as perceived by the root node chosen. As the root node collects information regarding network nodes, each node and node link in the root node's neighborhood may be identified and labeled, for use in the display.
  • the level of display refers to the first, second, third etc. levels of network nodes and node links, linked to the root node, which will be included in the display.
  • a first level represents the perceived network nodes displayed which are directly connected to the root node.
  • a second level represents perceived network nodes displayed which the root node can reach by routing through first level nodes, and so forth.
  • the display may also be configured to illustrate a complete transmission path, from a source node to a destination node, as perceived by the root node.
  • Root node 118 collects network data from other nodes and links of the network, such as node type, node location, node usage node links and node link usage by exchanging routing information with its neighboring nodes in the manner described above.
  • the collected network data is uniquely perceived by the root node 118, and presents a collective view of the network possessed only by root node 118.
  • Other nodes in the network will have a different view of the network, as each node will perceive the network differently.
  • the network data collected by root node 118 is used to identify nodes, node links and operations in the network. Based upon this collected data, a display is created showing the root node, network nodes, node links and operations perceived by the root node.
  • display 124 shows an embodiment of the present invention in which root node 118 is shown, in addition to nodes, node links and network operations as perceived by node 118.
  • the root node 118 has perceived the presence of nodes 120-1 through 120-5, nodes 122-1 through 122-14, which can be any of nodes 102, 106 or 107 as discussed above, and the links associated with each of those nodes.
  • Additional nodes and node links may exist in the network, however, they are not shown because they are not neighbors of the root node 118 and hence, the root node 118 has not detected their presence when collecting network data. Also, additional nodes may be perceived by root node 118. However, restricting the display to two levels, as in Figure 3, limits the display of perceived nodes and node links to those shown. The selection of a different root node will reveal a different array of nodes and node links, as a different root node will have a different perspective of the network. Likewise, choosing to display additional levels will reveal any additional nodes and node links perceived by the root node 118.
  • Figure 3 shows root node 118 as being linked directly to nodes of the first level, including nodes 120-1, 120-2, 120-3, 120-4 and 120-5 (referred to generally as nodes 120). Root node 118 is shown indirectly linked to nodes of the second level, including nodes 122-1 through 122-14 (referred to generally as nodes 122). Although only two levels are shown in Figure 3, additional levels or configurations may be shown as required.
  • the root node 118 and nodes 120 and 122 have been assigned icons depending upon the type of device represented by each node.
  • icons 120-5, 122-1, 122-4 and 122-14 use a "globe" shaped icon which represents intelligent access points (i.e. 106 of Figure 1).
  • Icons 120-1, 122-2, 122-3 and 122-5 through 122-13 use 'bidirectional arroW shaped icons which represent wireless routers (i.e. 107 of Figure 1). Standard protocols may be developed and applied for icon selection, or the user may configure icons that meet individual needs.
  • icons may be assigned a representation dynamically illustrating an operation.
  • an icon represents a person's mobile telephone
  • the icon may use a shape representing a mobile telephone.
  • the same icon may change from a figure representing a mobile telephone, to a figure displaying the calling person's likeness.
  • Each icon may also be defined based on a specific node or grouping of nodes (i.e. a buddy list) and various node data may be attached to each icon, such as the number of hops or packets sent to and from the node for a given period. Such displayed data may come from a remote machine or from a log file.
  • Node links in the embodiment of the present invention shown in Figure 3 are drawn as solid lines between icons, and an indicator of link quality, such as line thickness or color, may be attached.
  • Line thickness between icons, animation, or color may also be used to represent characteristics of a link or icon, such as link quality or active use of the connection by the root node.
  • Display 124 shown in Figure 3 gives the observer, such as the user of the root node 118, or a network administrator, a more accurate estimation of how node 118 is functioning in the network topology. Such information allows advanced debugging of the network through the use of node network perspectives.
  • the display presents the network as perceived by the node 118, therefore the observer is capable of analyzing the performance of node 118 and the network as viewed by node 118.
  • display 124 may be used to show the presence and location of other nodes and node links within a particular area as seen and recognized by the root node 118.
  • the display presented is user configurable and is automatically updated as network topology changes.
  • Such updates to display may include the revision of network data or the automatic update of information can be configured to use animation.
  • animation when the topology changes, the nodes of the display do not instantly display the new configuration. Rather, they appear to move across the display to their new assigned positions or operations.
  • one form of network display may be a directed acyclic graph (DAG) as illustrated.
  • DAG directed acyclic graph
  • a DAG is a set of nodes connected by directed links where no loops of links occur in the same direction. For example, if node A is connected to node B via a forward link, then node A is called a parent of node B, and node B is called a child of node A. Each node may have multiple parents and children.
  • the embodiment shown presents a display of the network as a directed acyclic graph, in which root node 118 is connected by direct links to nodes 120-1 through 120-5 (i.e. nodes 120). Nodes 120 therefore are the children of root node 118, and nodes 122-1 through 122-9 are the children of node 120-1. This may be repeated for each level of nodes as perceived by the root node 118.
  • Additional detailed information about each node and node link may be provided by clicking on the node icon or link, and appears as an option dialog box as shown in Figure 4.
  • the option dialog box 126 of Figure 4 can be configured to include information impractical to display within the DAC, such as media access control addresses (MAC) associated with the node represented by the icon.
  • MAC media access control addresses
  • a user definable action could be executed through manipulation of an icon. For instance, a phone call to a particular node could be made by double-clicking on the icon representing the node.
  • the network display created by the embodiment of the present invention may be configured to meet the needs of the user, and consist of a number of forms. Displays may be shown with connected nodes radiating out from the root node in a number of different configurations, such as in a star or burst configuration, or displayed in connection with a tabular form or a hierarchical data list.
  • the present invention may be used to display entire networks, or partial networks in a similar fashion, as perceived by a selected node.
  • the network administrator has the option of selecting a display mode in which a number of levels are displayed or, selecting a display mode in which an entire path between an originating node and destination node is shown.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Computer And Data Communications (AREA)
  • Small-Scale Networks (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un système et un procédé qui permettent de fournir une représentation graphique (124) d'un réseau de communication sur la base de la perspective d'un noeud sélectionné (120-2 à 120-4). Ces système et procédé sélectionnent un noeud qui collecte les données de réseau à partir de la seule perspective des noeuds sélectionnés (120-2 à 120-4) du réseau. Puis, à partir des données collectées, une représentation démonstrative de la topologie de réseau est créée. Cette représentation illustrant la représentation graphique (124) d'un réseau de communication tel qu'il est perçu par le noeud sélectionné. La représentation graphique (124) peut être configurée par l'utilisateur et elle est automatiquement mise à jour au fur et à mesure que la topologie du réseau change.
EP03724269A 2002-04-29 2003-04-28 Systeme et procede de creation d'une representation graphique d'un reseau sur la base de la perspective d'un noeud Ceased EP1499982A4 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US13342402A 2002-04-29 2002-04-29
US133424 2002-04-29
PCT/US2003/013045 WO2003098447A1 (fr) 2002-04-29 2003-04-28 Systeme et procede de creation d'une representation graphique d'un reseau sur la base de la perspective d'un noeud

Publications (2)

Publication Number Publication Date
EP1499982A1 true EP1499982A1 (fr) 2005-01-26
EP1499982A4 EP1499982A4 (fr) 2007-03-28

Family

ID=29548220

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03724269A Ceased EP1499982A4 (fr) 2002-04-29 2003-04-28 Systeme et procede de creation d'une representation graphique d'un reseau sur la base de la perspective d'un noeud

Country Status (6)

Country Link
EP (1) EP1499982A4 (fr)
JP (1) JP2005524368A (fr)
KR (1) KR20040102186A (fr)
AU (1) AU2003231139A1 (fr)
CA (1) CA2482194A1 (fr)
WO (1) WO2003098447A1 (fr)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1994776B1 (fr) * 2006-01-11 2018-08-29 Fisher-Rosemount Systems, Inc. Cartographie visuelle de trajectoires de messages de dispositif de terrain, dans un réseau maillé sans fil
US7659821B2 (en) * 2006-09-14 2010-02-09 International Business Machines Corporation Smart radio-frequency identification (RFID) infrastructure and method
JP2008072414A (ja) * 2006-09-14 2008-03-27 Hitachi Ltd センサネットシステム及びセンサノード
DE102007010545A1 (de) * 2007-03-05 2008-09-11 Rohde & Schwarz Gmbh & Co. Kg Verfahren zur Analyse eines Ad-hoc-Netzwerks und elektronisches Gerät
JP4586854B2 (ja) 2008-02-05 2010-11-24 ソニー株式会社 表示生成装置、表示生成方法、プログラム、および無線通信システム
CN103514310A (zh) * 2012-06-26 2014-01-15 上海宝信软件股份有限公司 一种it基础设施拓扑可视化编辑与展示方法
CN114448784A (zh) * 2021-12-27 2022-05-06 卡斯柯信号有限公司 一种信号监测系统的网络拓扑图逻辑状态显示方法及装置

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5870559A (en) * 1996-10-15 1999-02-09 Mercury Interactive Software system and associated methods for facilitating the analysis and management of web sites
US5926463A (en) * 1997-10-06 1999-07-20 3Com Corporation Method and apparatus for viewing and managing a configuration of a computer network

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5295244A (en) * 1990-09-17 1994-03-15 Cabletron Systems, Inc. Network management system using interconnected hierarchies to represent different network dimensions in multiple display views
US5909540A (en) * 1996-11-22 1999-06-01 Mangosoft Corporation System and method for providing highly available data storage using globally addressable memory

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5870559A (en) * 1996-10-15 1999-02-09 Mercury Interactive Software system and associated methods for facilitating the analysis and management of web sites
US5926463A (en) * 1997-10-06 1999-07-20 3Com Corporation Method and apparatus for viewing and managing a configuration of a computer network

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
[Online] 1995, XP000863932 Retrieved from the Internet: URL:http://ftp.vim.org/documents/published/unix-world/archives/95/feature/002.ps.gz> [retrieved on 2008-12-05] *
JOU Y.F. ET AL: 'Design and implementation of a scalable intrusion detection system for the protection of network infrastructure' DARPA INFORMATION SURVIVABILITY CONFERENCE AND EXPOSITION vol. 2, 25 January 2000, LAS ALAMITOS, CA, USA,IEEE COMPUT. SOC, US, pages 69 - 83, XP010371109 *
MANSFIELD G. ET AL: 'TECHNIQUES FOR AUTOMATED NETWORK MAP GENERATION USING SNMP' PROCEEDINGS OF IEEE INFOCOM 1996 vol. 2, 24 March 1996, LOS ALAMITOS, IEEE COMP. SOC. PRESS, US, pages 473 - 480, XP000621309 *
See also references of WO03098447A1 *

Also Published As

Publication number Publication date
AU2003231139A1 (en) 2003-12-02
JP2005524368A (ja) 2005-08-11
EP1499982A4 (fr) 2007-03-28
WO2003098447A1 (fr) 2003-11-27
KR20040102186A (ko) 2004-12-03
CA2482194A1 (fr) 2003-11-27

Similar Documents

Publication Publication Date Title
US7376087B2 (en) Method and apparatus for monitoring and displaying routing metrics of a network
Kim et al. On accurate measurement of link quality in multi-hop wireless mesh networks
US7962094B2 (en) Wireless viral mesh network and process for using the same
CN1622548B (zh) 多重无线电统一协议
US7916690B2 (en) Graphical display of status information in a wireless network management system
US6744739B2 (en) Method and system for determining network characteristics using routing protocols
US9426035B2 (en) Data reporting using reporting groups in a computer network
US5412654A (en) Highly dynamic destination-sequenced destination vector routing for mobile computers
US8009591B2 (en) Automatic overlapping areas that flood routing information
Stine et al. A paradigm for quality-of-service in wireless ad hoc networks using synchronous signaling and node states
US20130103739A1 (en) Obtaining Dynamic Connected-Network Topology Via any Node in Network
US20120117438A1 (en) Multicast Message Retransmission
US20140108643A1 (en) Maintaining and communicating nodal neighboring information
EP2070260A1 (fr) Procédé et appareil pour faire passer des informations de routage entre des routeurs mobiles
WO2003098447A1 (fr) Systeme et procede de creation d'une representation graphique d'un reseau sur la base de la perspective d'un noeud
Sivakumar et al. The clade vertebrata: Spines and routing in ad hoc networks
EP1524797A1 (fr) Procédé et système pour la collection centralisée des données du protocole de routage d'état à liaison
Allcock et al. GridMapper: a tool for visualizing the behavior of large-scale distributed systems
GB2540178B (en) Method, system and building control centre for connecting smart devices in a building
Marrogy Performance analysis of routing protocols and TCP variants under HTTP and FTP traffic in MANET's
Gui et al. Hierarchical multicast techniques and scalability in mobile ad hoc networks
Kacso et al. A simulation framework for energy-aware wireless sensor network protocols
CN116455759A (zh) 确定组织级网络拓扑
Steenstrup Self-organizing network control structures: Local algorithms for forming global hierarchies
bin Zen et al. Clustered Coordinator SABTS (CC-SABTS) for Beacon Transmission in IEEE802. 15.4 LR-WPAN

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: 20041015

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 IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

A4 Supplementary search report drawn up and despatched

Effective date: 20070222

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/24 20060101AFI20070219BHEP

17Q First examination report despatched

Effective date: 20070525

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

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20090430