US20040157557A1 - System for a dynamic ad-hoc wireless network - Google Patents

System for a dynamic ad-hoc wireless network Download PDF

Info

Publication number
US20040157557A1
US20040157557A1 US10771026 US77102604A US2004157557A1 US 20040157557 A1 US20040157557 A1 US 20040157557A1 US 10771026 US10771026 US 10771026 US 77102604 A US77102604 A US 77102604A US 2004157557 A1 US2004157557 A1 US 2004157557A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
nodes
plurality
system
network
packets
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
Application number
US10771026
Inventor
Bruce Barnett
Stephen Bush
Scott Evans
Amit Kulkarni
Richard Spackmann
Harold Tomlinson
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.)
Lockheed Martin Corp
Original Assignee
Lockheed Martin Corp
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

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W36/00Handoff or reselection arrangements
    • H04W36/24Reselection being triggered by specific parameters used to improve the performance of a single terminal
    • H04W36/30Reselection being triggered by specific parameters used to improve the performance of a single terminal by measured or perceived connection quality data
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A system operates a wireless ad hoc network. The system includes a plurality of nodes and a plurality of packets for transmission between the plurality of nodes. The packets contain code for routing the packets between the plurality of nodes. The code adapts to a changing configuration of the plurality of nodes.

Description

    RELATED APPLICATION
  • This application claims the benefit of U.S. Provisional Application No. 60/445,579, filed Feb. 7, 2003.[0001]
  • FIELD OF INVENTION
  • The present invention relates to a system for a wireless network and, more specifically, a system for a dynamic ad-hoc wireless network architecture. [0002]
  • BACKGROUND OF THE INVENTION
  • A wireless ad hoc network is a collection of autonomous nodes or terminals that communicate with each other by forming a multi-hop radio network and maintaining connectivity in a decentralized manner. Since the nodes communicate over wireless links, the nodes have to contend with the effects of radio communication, such as noise, fading, and interference. In addition, the links typically have less bandwidth than in a wired network. Each node in a wireless ad hoc network functions as both a host and a router, and the control of the network is distributed among the nodes. The network topology is generally dynamic because the connectivity among the nodes may vary with time due to node departures, new node arrivals, and the possibility of having mobile nodes. Hence, there is a need for efficient routing protocols to allow the nodes to communicate over multi-hop paths consisting of possibly several links in a way that does not use any more of the network “resources” than necessary. Some of these features are characteristic of the type of packet radio networks that were studied extensively in the 1970s and 1980s. Yet, research in the area of ad hoc networking is receiving much attention from academia, industry, and government. Since these networks pose many complex issues, there are many open problems for research and opportunities for making significant contributions. [0003]
  • There are two major conventional types of wireless ad hoc networks: mobile ad hoc networks (MANET's) and smart sensor networks. Conventional MANET's are the next generation of wireless communication systems. MANET's provide rapid deployment of independent mobile users. Significant examples include establishing survivable, efficient, dynamic communication for emergency/rescue operations, disaster relief efforts, military networks, etc. Such deployment scenarios cannot rely on centralized and organized connectivity, but may be conceived as applications of MANETs. [0004]
  • Specifically, a MANET is an autonomous collection of mobile users that communicate over wireless links with relatively constrained bandwidths. Since the nodes are mobile, the network topology may change rapidly and unpredictably over time. The MANAT is decentralized with all network activity being executed by the nodes themselves, i.e., discovering topology, delivering messages, routing functionality incorporated into mobile nodes, etc. [0005]
  • The applications of MANET's are extremely diverse ranging from small, static networks that are constrained by power sources to large-scale, mobile, highly dynamic networks. Thus, the design of network protocols for MANET's is a complex issue. Regardless of the application, MANET's need efficient algorithms to determine network organization, link scheduling, and routing. However, determining viable routing paths and delivering messages where network topology fluctuates is not a well-defined problem. While the shortest path (based on a given cost function) from a source to a destination in a static network is usually the optimal route, this idea is not easily extended to MANET's. Factors such as variable wireless link quality, propagation path loss, fading, multi-user interference, power expended, and topological changes may become relevant issues. [0006]
  • Moreover, in a military environment, preservation of security, latency, reliability, intentional jamming, and recovery from failure are significant concerns. Military networks are designed to maintain a low probability of intercept and/or a low probability of detection. Hence, MANET's should radiate as little power as necessary and transmit as infrequently as possible, thus decreasing the probability of detection or interception. A lapse in any of these requirements may degrade the performance and dependability of a MANET. A MANET should ideally be able to adaptively alter routing paths to alleviate any of these effects and adapt to any of these requirements. [0007]
  • A conventional smart sensor network consists of a number of sensors spread across a geographical area. Each sensor has wireless communication capability and sufficient intelligence for signal processing and networking of the data. [0008]
  • An example of smart sensor network is a military sensor network for detecting enemy movements, the presence of hazardous material (such as poison gases or radiation), explosions, etc. Another example is an environmental sensor network (such as in plains, in deserts, on mountains, or on ocean surfaces) for detecting and monitoring environmental changes. Still another example is a wireless traffic sensor network for monitoring vehicle traffic on a highway or in a congested part of a city. Yet another example is a wireless surveillance sensor network for providing security in a shopping mall, parking garage, or other facility. Still another example is a wireless parking lot sensor network for determining occupied spots and free spots. Besides offering certain capabilities and enhancements in operational efficiency in these conventional applications, smart sensor networks may assist in the national effort to increase alertness to potential terrorist threats. [0009]
  • Two conventional ways to classify smart sensor networks are whether the nodes are individually addressable and whether the data in the network is aggregated. The sensor nodes in a parking lot network, for example, should be individually addressable, so that one may determine the location of each free space. Thus, it may be necessary to broadcast a message simultaneously to all the nodes in the network. [0010]
  • However, if one wants to determine the temperature in a corner of a room, then addressability may not be so important. Any node in the given corner region may respond. The ability of the smart sensor network to aggregate the data collected (“data fusion”) may greatly reduce the number of messages that are transmitted across the network. [0011]
  • The basic goals of a smart sensor network generally depend upon the application. One goal is to determine the value of some parameter at a given location. In an environmental network, the parameter may be the temperature, atmospheric pressure, amount of sunlight, and the relative humidity at a number of locations. A node at this location may be connected to a number of different types of sensors, each with a different sampling rate and range of allowed values. [0012]
  • Another goal of a smart sensor network may be to detect the occurrence of events of interest and estimate parameters of the detected event(s). In a traffic sensor network, this event may be a vehicle moving through an intersection and the resulting estimate of the speed and direction of the vehicle. [0013]
  • Another goal of a smart sensor network may be to classify a detected object. In a vehicle in a traffic sensor network, the detected object may be a car, a minivan, a light truck, a bus, SUV, etc. [0014]
  • Another goal of a smart sensor network may be to track an object. In a military sensor network, the object may be an enemy tank moving through the area occupied by the network. [0015]
  • With these four goals, an important requirement of the sensor network is that the required data be disseminated to the proper end users. In some cases, there are fairly strict time requirements on this communication. For example, the detection of an intruder in a surveillance network should be immediately communicated to the police so that action may be taken. [0016]
  • In accordance with these goals, a conventional smart sensor network may require a large number of mostly stationary sensors. Aside from the deployment of sensors on the ocean surface or the use of mobile, unmanned, robotic sensors in military operations, most nodes in a smart sensor network are stationary. Smart sensor networks of 10,000 or even 100,000 nodes are envisioned, so scalability is also a major issue. [0017]
  • A smart sensor network may also require a low energy use. Since in many applications the sensor nodes will be placed in a remote area, maintenance of a node may not be possible. In this case, the lifetime of a node may be determined by the battery life, thereby requiring the minimization of energy expenditure. [0018]
  • A smart sensor network may further require network self-organization. Given the large number of nodes and their potential placement in hostile locations, it may be essential that the network self-organize since manual configuration may not be feasible. Moreover, nodes may fail (either from lack of energy or from physical destruction), and new nodes may join the smart sensor network. Therefore, the smart sensor network must be able to periodically reconfigure itself so that it can continue to function. Individual nodes may become disconnected from the rest of the network, but a high degree of connectivity should ideally be maintained. [0019]
  • A smart sensor network may still further require collaborative signal processing. A factor that distinguishes smart sensor networks from MANETs is the end goal of detection/estimation of some event(s) of interest, and not just communication. To improve detection performance and efficiency, it may be quite useful to “fuse” data from multiple sensors. This data fusion requires the transmission of data and control messages, and thus puts constraints on the network architecture. [0020]
  • A smart sensor network may also require querying ability. A user may want to query an individual node or a group of nodes for information collected in a region. Depending upon the amount of data fusion performed, it may not be feasible to transmit a large amount of data across the network. Instead, various local “sink” nodes may collect data from a given region and create summary messages. A query will be directed to the sink node nearest to the desired region. [0021]
  • With the coming availability of low cost, short range radios, along with advances in wireless networking, smart sensor networks may become commonly deployed. In these networks, each node may be equipped with a variety of sensors such as acoustic, seismic, infrared, still/motion, video camera, etc. These nodes may be organized in clusters such that a locally occurring event can be detected by most of, if not all, the nodes in a cluster. Each node will have sufficient processing power to make a decision, and that node will be able to broadcast this decision to the other nodes in the cluster. One node may act as the cluster master with a long range radio using a conventional protocol. [0022]
  • The design and construction of today's legacy tactical battlefield networks are centered on well-defined, pre-configured, and fixed infrastructures. Such network infrastructures are often characterized by reliable and high-capacity links and the availability of well-identified and pre-established network services. Over the years, various communication protocols and application layer services have been developed and fielded to support end-user applications under the assumption of fixed infrastructures. However, as discussed above, emerging tactical battlefield networks are characterized by nodes that are mobile, often unpredictably so, moving into and out of communication range with each other, and that cannot, in general, rely on a pre-defined fixed infrastructure within their environment. In other words, the network environment is mobile, wireless, dynamically changing, and is “infrastructure-less”. Therefore, there is a strong need in military and other environments to consider and apply Dynamic Ad-Hoc Wireless Networking (DAHWN) concepts and technologies. [0023]
  • Conventional ad hoc wireless networks have addressed active network intelligent packet routing capability. However, these conventional approaches assume incremental changes to the Internet Protocol (IP) and do not consider packets carrying code as an inherent part of the network, thereby resulting in inefficient implementations. [0024]
  • Complexity-based intrusion detection networks are currently based upon detecting physical anomalies and abnormal events. There have been suggestions of entropy based techniques, but complexity-based techniques have never been proposed. Further, trust-based routing as an integral part of routing has not been attempted. Active publish/subscribe servers (PSS) are common, but none has been implemented using active network technology. Service migration of dynamically moving network services has also never been attempted. Moving applications from node to node in a network has been done semi-manually, but not as a fully integrated and dynamic mechanism to maintain quality of service (QoS) in an ad hoc network. While the use of routing metrics may be common, the ability to dynamically integrate new routing metrics has not been attempted. Complexity-based intrusion detection, using Kolmogorov Complexity estimation to support information assurance, has not been attempted. [0025]
  • SUMMARY OF THE INVENTION
  • In accordance with the present invention, a system operates a wireless ad hoc network. The system includes a plurality of nodes and a plurality of packets for transmission between the plurality of nodes. The packets contain code for routing the packets between the plurality of nodes. The code adapts to a changing configuration of the plurality of nodes. [0026]
  • In accordance with another aspect of the present invention, a system operates a wireless ad hoc network. The system includes a plurality of nodes and a plurality of packets for transmission between the plurality of nodes. The plurality of nodes utilizes a complexity metric for determining the route of at least one of the plurality of packets from one of the plurality of nodes to another of the plurality of nodes. [0027]
  • In accordance with still another aspect of the present invention, a computer program product operates a wireless ad hoc network. The computer program product includes a first instruction for transmitting a plurality of packets between a plurality of nodes, a second instruction for routing code integral to the packets between the plurality of nodes, and a third instruction for adapting the code to a changing configuration of the plurality of nodes.[0028]
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The foregoing and other features of the present invention will become apparent to one skilled in the art to which the present invention relates upon consideration of the following description of the invention with reference to the accompanying drawings, wherein: [0029]
  • FIG. 1 is a schematic view of an example system for use with the present invention; [0030]
  • FIG. 2 is a schematic view of an example system in accordance with the present invention; [0031]
  • FIG. 3 is a detailed schematic view of part of the system of FIG. 2; [0032]
  • FIG. 4 is a detailed schematic view of part of the system of FIG. 3; [0033]
  • FIG. 5 is a detailed schematic view of another part of the system of FIG. 3; [0034]
  • FIG. 6 is a detailed schematic view of still another part of the system of FIG. 3; and [0035]
  • FIG. 7 is a schematic view of another example system in accordance with the present invention. [0036]
  • DESCRIPTION OF AN EXAMPLE EMBODIMENT
  • A dynamic wireless ad hoc network (DAHWN) in accordance with the present invention encompasses multiple disciplines including not only the conventional aspects of networking technology per se, but also the theory and technology of signal processing at the application layer, statistical communication theory, and technology at the physical/hardware level. In seeking to advance the performance of wireless ad hoc networks, the DAHWN network uses analysis, simulation, and hardware testbeds to characterize and assess the performance of new network designs and protocols. Each of these tools provides a reference by which to measure the DAHWN network's performance, and each may be used as a means for validating the other. [0037]
  • One goal of the DAHWN network is the investigation of the performance of routing protocols for MANETs that have been submitted for possible standardization. Another goal is the investigation of schemes for implementing user and traffic-type priority in a distributed ad hoc network. A further goal of the DAHWN network is the carrying out of a comparative study of wireless network simulation tools with an emphasis on scalability of these tools to large networks, increased traffic loads, increased mobility, etc. A still further goal is the development of efficient distributed detection and estimation algorithms for smart sensor networks. Other goals may be the investigation of methods of network self-organization and clustering in smart sensor networks, development of sensor networks capable of transmitting video information at very low bit rates in a multi-hop ad-hoc manner, and the development of kinetic spanning tree concepts for wireless network routing and collaboration. [0038]
  • The DAHWN network in accordance with the present invention develops analytical methods for predicting the outcomes of particular simulations as a means for validating the simulations. The result may be in dynamic source routing (DSR) protocol and ad hoc on-demand distance vector (AODV) protocol. [0039]
  • The DAHWN network thus allows the dynamic injection of network algorithms, such as various types of routing protocols (i.e., DSR, AODV, etc.). The intended use of this capability is to provide more flexible and optimized behavior than that found in conventional networks. [0040]
  • The DAHWN network may predict the distribution of link distances in a network of randomly deployed radio terminals and measurements of the probability of n-hop routing paths. The DAHWN network may thereby provide intermediate results for assessing network performance based on the underlying connectivity at a given time. [0041]
  • The DAHWN network [0042] 10 may provide an extension to an nth root, parley distributed detection algorithm. Instead of making a single “hard” decision at each sensor node 11, a two bit quantizer may be used to choose the hypothesis and also to provide a confidence measure of this decision (FIG. 1). The DAHWN network 10 may broadcast these “soft” decisions to all nodes 11, thus creating a stopping rule that reduces the number of parleys.
  • For a Bayesian criterion, the probability of error may be unchanged. The probability may be equal to that of a central processor. For a Neyman-Pearson criterion, the receiver operating curve may be essentially the same as that of a central processor. The performance may also be compared to that obtained using one-bit decision makers and the majority fusion rule. Simulation results may be provided for a Gaussian shift in means problem assuming an ideal channel and the binary symmetric channel. [0043]
  • As a first step in studying self-organization algorithms for wireless sensor networks, a C++ implementation of the Linked Cluster Algorithm (LCA) of Baker and Ephremides may be created. Given a set of sensor nodes [0044] 11, the LCA may use a fixed TDMA frame structure to form clusters so that all the nodes of the cluster are within one hop of a distinguished node called the cluster head. If the cluster heads of two adjacent clusters are not within transmission range of each other, gateway nodes 11s may be designated to connect them. The set of cluster heads and gateways form a backbone network. The interaction of the LCA and the parley distributed detection algorithm may then be studied.
  • A primary goal may be the determination of the parameters that are responsible for performance and the drawing of conclusions about how to optimize the parameters. One of the primary performance metrics of a smart sensor network may be the ability to detect events of interest. [0045]
  • The self-configuration architecture of the DAHWN network may produce a hierarchical network with address auto-configuration and various other properties. Consequently, a set of distributed algorithms and message formats may also allow an actual implementation. Specifically, protocols may organize the sensor nodes [0046] 11 into clusters and then merge the clusters to form groups. Groups may merge to form larger groups, in a hierarchical process that dynamically assigns a unique address to each sensor node 11. Additionally, a broadcast tree may be constructed to reduce the maximum number of hops along the tree. A number of important parameters may be identified and their effects on the overall system performance may be studied.
  • An unstructured mobile network ideally may support emergency responses to natural disasters, surveillance and information gathering in hostile territories, and robotic search and rescue operations where existing communication infrastructures are not available. Rapid deployment of this unstructured mobile network, where each unit is capable of transmitting video information and sensor data, would be highly desirable. The requirements may include some or all of the following: a higher upstream bandwidth (for transmitting video data), geographic mobility, sufficient area coverage, communications beyond line of sight, and low energy consumption. [0047]
  • The functionality required in the DAHWN network may be abstracted into four areas: (1) discovery of resources in the network; (2) operational routing and services information establishment; (3) continuous measurement of key performance metrics such as available bandwidth, latency and trust, etc.; and (4) adaptation of network protocols and services to changing topology and environmental parameters. The DAHWN network architecture may be able to discover and configure new nodes [0048] 11, measure and monitor network operations, and adapt network services to the Dynamic Ad-Hoc Wireless Networking environment.
  • The DAHWN network in accordance with the present invention may provide Active Network Encapsulation Packets (ANEP) for carrying code and data thus distributing the intelligence throughout the network and adapting to network topology changes. The Complexity-Based Intrusion Detection of abnormal changes in the estimation of complexity along a key control channels by the DAHWN network may also indicate suspicious behavior in the electromagnetic environment. The DAHWN network may also allow Link Quality Tables and Metric Routing Decisions to be more finely tuned to match network topology changes to application requirements. The DAHWN network may allow the movement of network services to optimal locations within the network in order to maintain a high QoS, particularly as the network topology changes. [0049]
  • A network [0050] 10 may further create trust-based routing patterns of behavior learned via intermediate nodes 11. These routing patterns may be used to establish a measure of trust in those intermediate nodes 11. As the behavior is consistently and successfully verified, the trust level increases. Trust of intermediate nodes 11 may be integrated into the routing mechanism as a Link Property Table entry.
  • The left side of FIG. 2 illustrates a high-level diagram of a DAHWN system [0051] 100 in accordance with the present invention. Packets enter from the bottom of the stacks on the left and flow to the top. Packet payload is processed at the top of the stack. Packets are transmitted downward through the bottom of the stack.
  • The right side of FIG. 2 is a detailed view of the DAHWN layer [0052] 101. The left most stack of FIG. 2 is a conventional legacy TCP/IP stack 111 that resides in parallel with the DAHWN protocol stack 121. Packets enter and exit via the “Active Network Encapsulation Protocol” box 131. This protocol may reside on top of a conventional protocol. Packets pass through the routing protocol box 141. Packets then pass through any one of the four middle boxes 151 depending upon their function. These four boxes 151 operate within the Active Network Environment box 161 (i.e., a Java thread execution control mechanism, etc.).
  • FIG. 3 detailed view the DAHWN block in FIG. 2. Packets arrive at the Port Manager [0053] 201. Packets are demultiplexed at the Demultiplexer box 211. Packet payloads are extracted in the Active Network Encapsulation Protocol box 221.
  • Legacy (UDP/IP) Simple Network Management Protocol (SNMP) packets are executed in parallel via the left side stacks [0054] 309 of FIG. 2. SNMP payload is extracted upon reception (or wrapped upon transmission) in the SNMP Wrapper 231. Returning to the DAHWN layer, Internet Protocol to Active Network node name translation occurs in the Name Resolution box 241.
  • Packets containing routing information are processed in the Zone Routing Protocol box [0055] 251. FIG. 4 is a detailed flow diagram of an example operation algorithm for the Zone Routing Protocol box 251. Packets controlling operation of the ad hoc network 100 continue through one of the following boxes: Node Properties (Discovery Module) 261, Adapt (Adaptation Module) 271, Link Property Tables (Routing) 281, or Measure 291 Modules. Each of the code threads that implements one of the above stated modules 261, 271, 281, 291 is maintained within the Active Network Environment box 301. The Adaptation Module 271 includes a service template 273 for generating new services via a programming technique.
  • The Scheduler [0056] 303 (FIG. 3) controls when packet code may be executed. The Small State Manager 305 contains memory where information from a packet may be retained for use by other packets. The Execution Manager 307 runs and controls the code. The SNMP 309 gathers and sets general management information within the system 100.
  • FIG. 5 is a detailed view of the Link Property Tables box [0057] 281 of FIG. 3. General metrics regarding link state are propagated along with routing information and maintained along with typical topological information.
  • FIG. 6 is a detailed view of the Measure box [0058] 291 of FIG. 3 related to security in the example case of an FTP protocol. A user at terminal may connect through the ad hoc network 100 to the NPRnet, a specific military network. AOC and MC2 are example nodes in this network (unrelated to technical implementation).
  • FTP is a conventional protocol and is executed in the FTP Server Proxy [0059] 601, FTP Client Proxy 611, and Client 621 boxes. The FTP Server Proxy 601 and Client Proxy 611 interface with the DAHWN wireless ad hoc network 100 and packetize the legacy FTP packets appropriately for transmission over the DAHWN wireless ad hoc network. FTPcSmartPackets 631 may be FTP control data packets. FTPdSmartPackets 641 may be FTP data packets. These packets 631, 641 flow within the DAHWN wireless ad hoc network 100 wrapped in active packets. The complexity of the FTPcSmartPacket 631 contents is monitored via the Kolmogorov Complexity Operations Policer (KCOP) 651. Any deviation from normal complexity indicates suspicious activity.
  • In accordance with the present invention, a computer program product [0060] 700 operates a wireless ad hoc network (FIG. 7). The computer program product 700 includes a first instruction 701 for transmitting a plurality of packets between a plurality of nodes, a second instruction 702 for routing code integral to the packets between the plurality of nodes, and a third instruction 703 for adapting the code to a changing configuration of the plurality of nodes.
  • In order to provide a context for the various aspects of the present invention, the following discussion is intended to provide a brief, general description of a suitable computing environment in which the various aspects of the present invention may be implemented. While the invention has been described above in the general context of computer-executable instructions of a computer program that runs on a computer, those skilled in the art will recognize that the invention also may be implemented in combination with other program modules. [0061]
  • Generally, program modules include routines, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the inventive methods may be practiced with other computer system configurations, including single-processor or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, hand-held computing devices, microprocessor-based or programmable consumer electronics, and the like. The illustrated aspects of the invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications argument model. However, some, if not all aspects of the invention can be practiced on stand-alone computers. In a distributed computing environment, program modules may be located in both local and remote memory storage devices. [0062]
  • An exemplary system for implementing the various aspects of the invention includes a conventional server computer, including a processing unit, a system memory, and a system bus that couples various system components including the system memory to the processing unit. The processing unit may be any of various commercially available processors. Dual microprocessors and other multi-processor architectures also can be used as the processing unit. The system bus may be any of several types of bus structure including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of conventional bus architectures. The system memory includes read only memory (ROM) and random access memory (RAM). A basic input/output system (BIOS), containing the basic routines that help to transfer information between elements within the server computer, such as during start-up, is stored in ROM. [0063]
  • The server computer further includes a hard disk drive, a magnetic disk drive, e.g., to read from or write to a removable disk, and an optical disk drive, e.g., for reading a CD-ROM disk or to read from or write to other optical media. The hard disk drive, magnetic disk drive, and optical disk drive are connected to the system bus by a hard disk drive interface, a magnetic disk drive interface, and an optical drive interface, respectively. The drives and their associated computer-readable media provide nonvolatile storage of data, data structures, computer-executable instructions, etc., for the server computer. Although the description of computer-readable media above refers to a hard disk, a removable magnetic disk and a CD, it should be appreciated by those skilled in the art that other types of media which are readable by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, and the like, may also be used in the exemplary operating environment, and further that any such media may contain computer-executable instructions for performing the methods of the present invention. [0064]
  • A number of program modules may be stored in the drives and RAM, including an operating system, one or more application programs, other program modules, and program data. A user may enter commands and information into the server computer through a keyboard and a pointing device, such as a mouse. Other input devices (not shown) may include a microphone, a joystick, a game pad, a satellite dish, a scanner, or the like. These and other input devices are often connected to the processing unit through a serial port interface that is coupled to the system bus, but may be connected by other interfaces, such as a parallel port, a game port or a universal serial bus (USB). A monitor or other type of display device is also connected to the system bus via an interface, such as a video adapter. In addition to the monitor, computers typically include other peripheral output devices (not shown), such as speaker and printers. [0065]
  • The server computer may operate in a networked environment using logical connections to one or more remote computers, such as a remote client computer. The remote computer may be a workstation, a server computer, a router, a peer device or other common network node, and typically includes many or all of the elements described relative to the server computer. The logical connections include a local area network (LAN) and a wide area network (WAN). Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the internet. [0066]
  • When used in a LAN networking environment, the server computer is connected to the local network through a network interface or adapter. When used in a WAN networking environment, the server computer typically includes a modem, or is connected to a communications server on the LAN, or has other means for establishing communications over the wide area network, such as the internet. The modem, which may be internal or external, is connected to the system bus via the serial port interface. In a networked environment, program modules depicted relative to the server computer, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used. [0067]
  • In accordance with the practices of persons skilled in the art of computer programming, the present invention has been described with reference to acts and symbolic representations of operations that are performed by a computer, such as the server computer, unless otherwise indicated. Such acts and operations are sometimes referred to as being computer-executed. It will be appreciated that the acts and symbolically represented operations include the manipulation by the processing unit of electrical signals representing data bits which causes a resulting transformation or reduction of the electrical signal representation, and the maintenance of data bits at memory locations in the memory system (including the system memory, hard drive, floppy disks, and CD-ROM) to thereby reconfigure or otherwise alter the computer system's operation, as well as other processing of signals. The memory locations where such data bits are maintained are physical locations that have particular electrical, magnetic, or optical properties corresponding to the data bits. [0068]
  • It will be understood that the above description of the present invention is susceptible to various modifications, changes and adaptations, and the same are intended to be comprehended within the meaning and range of equivalents of the appended claims. The presently disclosed embodiments are considered in all respects to be illustrative, and not restrictive. The scope of the invention is indicated by the appended claims, rather than the foregoing description, and all changes that come within the meaning and range of equivalence thereof are intended to be embraced therein. [0069]

Claims (15)

    Having described the invention, we claim:
  1. 1. A system for operating a wireless ad hoc network, said system comprising:
    a plurality of nodes; and
    a plurality of packets for transmission between said plurality of nodes, said packets containing code for routing of said packets between said plurality of nodes, said code adapting to a changing configuration of said plurality of nodes.
  2. 2. The system as set forth in claim 1 wherein said plurality of nodes utilizes a complexity metric for determining the route of at least one of said plurality of packets from one of said plurality of nodes to another of said plurality of nodes.
  3. 3. The system as set forth in claim 2 wherein said complexity metric is a Kolmogorov complexity metric.
  4. 4. The system as set forth in claim 1 wherein a service template module generates services for said plurality of nodes.
  5. 5. The system as set forth in claim 1 wherein a complexity operations policer monitors said plurality of nodes for high complexity and determines whether to shut down particular nodes.
  6. 6. A system for operating a wireless ad hoc network, said system comprising:
    a plurality of nodes; and
    a plurality of packets for transmission between said plurality of nodes, said plurality of nodes utilizing a complexity metric for determining the route of at least one of said plurality of packets from one of said plurality of nodes to another of said plurality of nodes.
  7. 7. The system as set forth in claim 6 wherein said packets contain code for routing of said packets between said plurality of nodes, said code adapting to a changing configuration of said plurality of nodes.
  8. 8. The system as set forth in claim 6 wherein said complexity metric is a Kolmogorov complexity metric.
  9. 9. The system as set forth in claim 6 wherein a complexity operations policer monitors said plurality of nodes for high complexity and determines whether to shut down particular nodes.
  10. 10. The system as set forth in claim 6 wherein a service template module generates services for said plurality of nodes.
  11. 11. A computer program product for operating a wireless ad hoc network, said computer program product comprising:
    a first instruction for transmitting a plurality of packets between a plurality of nodes;
    a second instruction for routing code integral to the packets between the plurality of nodes; and
    a third instruction for adapting the code to a changing configuration of the plurality of nodes.
  12. 12. The computer program product as set forth in claim 11 further including a fourth instruction for utilizing a complexity metric for determining the route of at least one of the plurality of packets from one of the plurality of nodes to another of the plurality of nodes.
  13. 13. The computer program product as set forth in claim 12 wherein the complexity metric is a Kolmogorov complexity metric.
  14. 14. The computer program product as set forth in claim 11 further including a fourth instruction for generating services for the plurality of nodes.
  15. 15. The computer program product as set forth in claim 11 further including a fourth instruction for monitoring the plurality of nodes for high complexity and determining whether to shut down particular nodes.
US10771026 2003-02-07 2004-02-03 System for a dynamic ad-hoc wireless network Abandoned US20040157557A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US44557903 true 2003-02-07 2003-02-07
US10771026 US20040157557A1 (en) 2003-02-07 2004-02-03 System for a dynamic ad-hoc wireless network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US10771026 US20040157557A1 (en) 2003-02-07 2004-02-03 System for a dynamic ad-hoc wireless network

Publications (1)

Publication Number Publication Date
US20040157557A1 true true US20040157557A1 (en) 2004-08-12

Family

ID=32829912

Family Applications (5)

Application Number Title Priority Date Filing Date
US10771027 Abandoned US20040156388A1 (en) 2003-02-07 2004-02-03 System for maintaining quality of service
US10770665 Active 2026-08-06 US7409716B2 (en) 2003-02-07 2004-02-03 System for intrusion detection
US10771026 Abandoned US20040157557A1 (en) 2003-02-07 2004-02-03 System for a dynamic ad-hoc wireless network
US10771021 Abandoned US20040156370A1 (en) 2003-02-07 2004-02-03 System for evolutionary adaptation
US10770694 Active 2026-01-08 US7366185B2 (en) 2003-02-07 2004-02-03 System for evolutionary service migration

Family Applications Before (2)

Application Number Title Priority Date Filing Date
US10771027 Abandoned US20040156388A1 (en) 2003-02-07 2004-02-03 System for maintaining quality of service
US10770665 Active 2026-08-06 US7409716B2 (en) 2003-02-07 2004-02-03 System for intrusion detection

Family Applications After (2)

Application Number Title Priority Date Filing Date
US10771021 Abandoned US20040156370A1 (en) 2003-02-07 2004-02-03 System for evolutionary adaptation
US10770694 Active 2026-01-08 US7366185B2 (en) 2003-02-07 2004-02-03 System for evolutionary service migration

Country Status (1)

Country Link
US (5) US20040156388A1 (en)

Cited By (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030195005A1 (en) * 2002-04-12 2003-10-16 Nec Corporation Radio transmission apparatus, routing method, and routing program of radio network
US20050053004A1 (en) * 2003-09-09 2005-03-10 Harris Corporation Mobile ad hoc network (MANET) providing interference reduction features and related methods
US20050157698A1 (en) * 2003-07-14 2005-07-21 Samsung Electronics Co., Ltd. Efficient route update protocol for wireless sensor network
US20050176401A1 (en) * 2004-02-09 2005-08-11 Sanjiv Nanda Multi-hop communications in a wireless network
US20060015596A1 (en) * 2004-07-14 2006-01-19 Dell Products L.P. Method to configure a cluster via automatic address generation
US20060068702A1 (en) * 2004-05-07 2006-03-30 Yasutaka Miwa Application execution method, file data download method, file data upload method, communication method, network identifier setting method and wireless communication terminal
US20060092939A1 (en) * 2004-10-29 2006-05-04 Samsung Electronics Co., Ltd. Apparatus and method for extending mobility in a mobile ad hoc network
US20060109787A1 (en) * 2004-11-05 2006-05-25 Strutt Guenael T System and method for providing a congestion-aware routing metric for selecting a route between nodes in a multihopping communication network
US20060171346A1 (en) * 2005-01-28 2006-08-03 Honeywell International Inc. Wireless routing systems and methods
US20070010199A1 (en) * 2003-09-24 2007-01-11 Halfmann Ruediger Method for communication in an ad-hoc radio communication system
US20070076600A1 (en) * 2005-09-30 2007-04-05 Ekl Randy L Method and system for priority based routing
US7500014B1 (en) * 2003-05-07 2009-03-03 Packeteer, Inc. Network link state mirroring
US20090089410A1 (en) * 2007-09-28 2009-04-02 John Vicente Entropy-based (self-organizing) stability management
US20090089300A1 (en) * 2007-09-28 2009-04-02 John Vicente Virtual clustering for scalable network control and management
US20090103452A1 (en) * 2007-10-19 2009-04-23 Honeywell International Inc. Ad-hoc secure communication networking based on formation flight technology
US20090197595A1 (en) * 2008-02-04 2009-08-06 Honeywell International Inc. Use of alternate communication networks to complement an ad-hoc mobile node to mobile node communication network
US20100107253A1 (en) * 2008-10-29 2010-04-29 Eiland Edward E Mdl compress system and method for signature inference and masquerade intrusion detection
US20120005349A1 (en) * 2004-05-27 2012-01-05 George Shin Communication in multiprocessor using proxy sockets
CN102448139A (en) * 2011-12-28 2012-05-09 南昌大学 Hierarchical routing method for wireless sensor network
US20120300632A1 (en) * 2011-04-13 2012-11-29 Renesas Mobile Corporation Sensor network information collection via mobile gateway
WO2013086073A1 (en) * 2011-12-06 2013-06-13 Telcordia Technologies , Inc. Security method for mobile ad hoc networks with efficient flooding mechanism using layer independent passive clustering (lipc)
US20140036728A1 (en) * 2011-04-25 2014-02-06 Korea University Research And Business Foundation Apparatus and method for controlling a backbone network for a sensor network
US20140047108A1 (en) * 2012-08-10 2014-02-13 Telefonaktiebolaget L M Ericsson (Publ) Self organizing network event reporting
US20160044281A1 (en) * 2014-08-07 2016-02-11 Smart Digital LLC Portable Surveillance Device
US9264126B2 (en) 2007-10-19 2016-02-16 Honeywell International Inc. Method to establish and maintain an aircraft ad-hoc communication network

Families Citing this family (46)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030217135A1 (en) 2002-05-17 2003-11-20 Masayuki Chatani Dynamic player management
US20040156388A1 (en) * 2003-02-07 2004-08-12 Lockheed Martin Corporation System for maintaining quality of service
US7075890B2 (en) * 2003-06-06 2006-07-11 Meshnetworks, Inc. System and method to provide fairness and service differentation in ad-hoc networks
US7394826B2 (en) * 2003-09-09 2008-07-01 Harris Corporation Mobile ad hoc network (MANET) providing quality-of-service (QoS) based unicast and multicast features
US20050208949A1 (en) * 2004-02-12 2005-09-22 Chiueh Tzi-Cker Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
US7912973B2 (en) * 2004-12-03 2011-03-22 Microsoft Corporation Message exchange protocol extension negotiation
US20060159024A1 (en) * 2005-01-18 2006-07-20 Hester Lance E Method and apparatus for responding to node anormalities within an ad-hoc network
EP1715654A1 (en) * 2005-04-22 2006-10-25 Create-Net Communication network performing service functions
US8249028B2 (en) * 2005-07-22 2012-08-21 Sri International Method and apparatus for identifying wireless transmitters
US7724717B2 (en) * 2005-07-22 2010-05-25 Sri International Method and apparatus for wireless network security
US20070226375A1 (en) * 2006-03-23 2007-09-27 Chu Hsiao-Keng J Plug-in architecture for a network stack in an operating system
US8045976B2 (en) 2006-04-04 2011-10-25 Aegis Mobility, Inc. Mobility call management
US20070239871A1 (en) * 2006-04-11 2007-10-11 Mike Kaskie System and method for transitioning to new data services
JP4816323B2 (en) * 2006-08-16 2011-11-16 ソニー株式会社 COMMUNICATION APPARATUS, COMMUNICATION METHOD, AND PROGRAM
US8532667B2 (en) 2007-03-02 2013-09-10 Aegis Mobility, Inc. System and methods for monitoring the geospatial context associated with a mobile communication device
KR20090011481A (en) * 2007-07-26 2009-02-02 삼성전자주식회사 Method for intrusion detecting in a terminal device and apparatus therefor
US8224353B2 (en) * 2007-09-20 2012-07-17 Aegis Mobility, Inc. Disseminating targeted location-based content to mobile device users
US8131802B2 (en) * 2007-10-05 2012-03-06 Sony Computer Entertainment America Llc Systems and methods for seamless host migration
US8614996B1 (en) * 2007-12-12 2013-12-24 Sprint Spectrum L.P. Predictive personality negotiation during session negotiation
US9288224B2 (en) 2010-09-01 2016-03-15 Quantar Solutions Limited Assessing threat to at least one computer network
WO2009083036A1 (en) * 2007-12-31 2009-07-09 Ip-Tap Uk Assessing threat to at least one computer network
WO2010025562A1 (en) * 2008-09-05 2010-03-11 Aegis Mobility, Inc. Bypassing enhanced services
US8059615B1 (en) 2008-09-08 2011-11-15 Sprint Spectrum L.P. Selective personality negotiation during session negotiation
US8312542B2 (en) * 2008-10-29 2012-11-13 Lockheed Martin Corporation Network intrusion detection using MDL compress for deep packet inspection
KR20120013968A (en) * 2009-04-09 2012-02-15 에이지스 모빌리티, 아이엔씨. Context based data mediation
GB0909079D0 (en) * 2009-05-27 2009-07-01 Quantar Llp Assessing threat to at least one computer network
US9615213B2 (en) 2009-07-21 2017-04-04 Katasi Llc Method and system for controlling and modifying driving behaviors
US8787936B2 (en) 2009-07-21 2014-07-22 Katasi Llc Method and system for controlling a mobile communication device in a moving vehicle
US9386447B2 (en) 2009-07-21 2016-07-05 Scott Ferrill Tibbitts Method and system for controlling a mobile communication device
US8245302B2 (en) * 2009-09-15 2012-08-14 Lockheed Martin Corporation Network attack visualization and response through intelligent icons
US8245301B2 (en) * 2009-09-15 2012-08-14 Lockheed Martin Corporation Network intrusion detection visualization
US8138918B2 (en) * 2009-09-17 2012-03-20 Raytheon Company Intrusion detection and tracking system
US20110158111A1 (en) * 2009-12-28 2011-06-30 Alcatel-Lucent Canada Inc. Bulk service provisioning on live network
US8533319B2 (en) 2010-06-02 2013-09-10 Lockheed Martin Corporation Methods and systems for prioritizing network assets
EP2599063A2 (en) 2010-07-27 2013-06-05 Raytheon Company An intrusion detection and tracking system
US8621629B2 (en) 2010-08-31 2013-12-31 General Electric Company System, method, and computer software code for detecting a computer network intrusion in an infrastructure element of a high value target
US8874763B2 (en) * 2010-11-05 2014-10-28 At&T Intellectual Property I, L.P. Methods, devices and computer program products for actionable alerting of malevolent network addresses based on generalized traffic anomaly analysis of IP address aggregates
US9106689B2 (en) 2011-05-06 2015-08-11 Lockheed Martin Corporation Intrusion detection using MDL clustering
US9762605B2 (en) * 2011-12-22 2017-09-12 Phillip King-Wilson Apparatus and method for assessing financial loss from cyber threats capable of affecting at least one computer network
US9245116B2 (en) 2013-03-21 2016-01-26 General Electric Company Systems and methods for remote monitoring, security, diagnostics, and prognostics
US9282008B2 (en) 2013-06-11 2016-03-08 General Electric Company Systems and methods for monitoring system performance and availability
US9351130B2 (en) * 2013-06-28 2016-05-24 Aruba Networks, Inc. System and method for efficient state synchronization among neighboring network devices
US9667528B2 (en) * 2014-03-31 2017-05-30 Vmware, Inc. Fast lookup and update of current hop limit
US9699301B1 (en) 2015-05-31 2017-07-04 Emma Michaela Siritzky Methods, devices and systems supporting driving and studying without distraction
WO2017111915A1 (en) * 2015-12-21 2017-06-29 Hewlett Packard Enterprise Development Lp Identifying signatures for data sets
WO2017111912A1 (en) * 2015-12-21 2017-06-29 Hewlett Packard Enterprise Development Lp Identifying a signature for a data set

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6535498B1 (en) * 1999-12-06 2003-03-18 Telefonaktiebolaget Lm Ericsson (Publ) Route updating in ad-hoc networks
US6754188B1 (en) * 2001-09-28 2004-06-22 Meshnetworks, Inc. System and method for enabling a node in an ad-hoc packet-switched wireless communications network to route packets based on packet content
US6870846B2 (en) * 2002-04-29 2005-03-22 Harris Corporation Hierarchical mobile ad-hoc network and methods for performing reactive routing therein using dynamic source routing (DSR)
US6954435B2 (en) * 2002-04-29 2005-10-11 Harris Corporation Determining quality of service (QoS) routing for mobile ad hoc networks
US6961310B2 (en) * 2002-08-08 2005-11-01 Joseph Bibb Cain Multiple path reactive routing in a mobile ad hoc network
US7068600B2 (en) * 2002-04-29 2006-06-27 Harris Corporation Traffic policing in a mobile ad hoc network
US7177295B1 (en) * 2002-03-08 2007-02-13 Scientific Research Corporation Wireless routing protocol for ad-hoc networks

Family Cites Families (65)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4780821A (en) * 1986-07-29 1988-10-25 International Business Machines Corp. Method for multiple programs management within a network having a server computer and a plurality of remote computers
US5517618A (en) 1992-02-10 1996-05-14 Matsushita Electric Industrial Co., Ltd. Mobile migration communications control device
US5412654A (en) * 1994-01-10 1995-05-02 International Business Machines Corporation Highly dynamic destination-sequenced destination vector routing for mobile computers
DE69527948T2 (en) * 1994-03-15 2003-01-02 Digi Int Inc System and method for communicating with a remote network apparatus
GB2299729B (en) 1995-04-01 1999-11-17 Northern Telecom Ltd Traffic routing in a telecommunications network
US5623495A (en) * 1995-06-15 1997-04-22 Lucent Technologies Inc. Portable base station architecture for an AD-HOC ATM lan
US5717689A (en) * 1995-10-10 1998-02-10 Lucent Technologies Inc. Data link layer protocol for transport of ATM cells over a wireless link
US6122759A (en) * 1995-10-10 2000-09-19 Lucent Technologies Inc. Method and apparatus for restoration of an ATM network
US6046988A (en) * 1995-11-16 2000-04-04 Loran Network Systems Llc Method of determining the topology of a network of objects
EP0861543B1 (en) * 1995-11-16 2002-07-31 Loran Network Systems, L.L.C. Method of determining the topology of a network of objects
US6088452A (en) * 1996-03-07 2000-07-11 Northern Telecom Limited Encoding technique for software and hardware
US5943322A (en) * 1996-04-24 1999-08-24 Itt Defense, Inc. Communications method for a code division multiple access system without a base station
GB9617632D0 (en) * 1996-08-22 1996-10-02 Ibm Distributed genetic programming
US5987011A (en) * 1996-08-30 1999-11-16 Chai-Keong Toh Routing method for Ad-Hoc mobile networks
JP3254393B2 (en) * 1996-11-19 2002-02-04 三菱電機株式会社 Running the manufacturing method and the genetic algorithm of the genetic algorithm machine and genetic algorithm machine
JP3097581B2 (en) * 1996-12-27 2000-10-10 日本電気株式会社 Configuring ad-hoc local area network, a communication method and a terminal
US6130892A (en) * 1997-03-12 2000-10-10 Nomadix, Inc. Nomadic translator or router
US5987024A (en) * 1997-05-09 1999-11-16 Motorola, Inc. Self synchronizing network protocol
JP3141820B2 (en) * 1997-07-18 2001-03-07 日本電気株式会社 Ad-hoc local area network
DE69724947T2 (en) * 1997-07-31 2004-05-19 Siemens Ag Computer system and method for securing a file
JP3905959B2 (en) * 1997-10-24 2007-04-18 富士通株式会社 Placement optimization problem processing method and layout optimization problem processing apparatus and layout optimization problem processing program and computer readable recording medium
US6324654B1 (en) * 1998-03-30 2001-11-27 Legato Systems, Inc. Computer network remote data mirroring system
US6130881A (en) 1998-04-20 2000-10-10 Sarnoff Corporation Traffic routing in small wireless data networks
US6266577B1 (en) * 1998-07-13 2001-07-24 Gte Internetworking Incorporated System for dynamically reconfigure wireless robot network
US6304556B1 (en) * 1998-08-24 2001-10-16 Cornell Research Foundation, Inc. Routing and mobility management protocols for ad-hoc networks
US6321338B1 (en) * 1998-11-09 2001-11-20 Sri International Network surveillance
US6104712A (en) 1999-02-22 2000-08-15 Robert; Bruno G. Wireless communication network including plural migratory access nodes
US6446200B1 (en) * 1999-03-25 2002-09-03 Nortel Networks Limited Service management
US6195697B1 (en) * 1999-06-02 2001-02-27 Ac Properties B.V. System, method and article of manufacture for providing a customer interface in a hybrid network
US6501995B1 (en) * 1999-06-30 2002-12-31 The Foxboro Company Process control system and method with improved distribution, installation and validation of components
US6529515B1 (en) * 1999-09-30 2003-03-04 Lucent Technologies, Inc. Method and apparatus for efficient network management using an active network mechanism
US6754699B2 (en) * 2000-07-19 2004-06-22 Speedera Networks, Inc. Content delivery and global traffic management network system
US20020029287A1 (en) 2000-02-02 2002-03-07 Yechiam Yemini Method and apparatus for dynamically addressing a circuits based network
WO2001080033A3 (en) * 2000-04-17 2002-10-03 Circadence Corp System and method for implementing application -independent functionality within a network infrastructure
US20020099816A1 (en) * 2000-04-20 2002-07-25 Quarterman John S. Internet performance system
US7000015B2 (en) 2000-04-24 2006-02-14 Microsoft Corporation System and methods for providing physical location information and a location method used in discovering the physical location information to an application on a computing device
FI110736B (en) * 2000-08-01 2003-03-14 Nokia Corp A data transmission method, a subscriber terminal and GPRS / EDGE radio access network
US7702806B2 (en) 2000-09-07 2010-04-20 Riverbed Technology, Inc. Statistics collection for network traffic
US7278159B2 (en) * 2000-09-07 2007-10-02 Mazu Networks, Inc. Coordinated thwarting of denial of service attacks
US7124440B2 (en) * 2000-09-07 2006-10-17 Mazu Networks, Inc. Monitoring network traffic denial of service attacks
US7398317B2 (en) * 2000-09-07 2008-07-08 Mazu Networks, Inc. Thwarting connection-based denial of service attacks
US6894991B2 (en) 2000-11-30 2005-05-17 Verizon Laboratories Inc. Integrated method for performing scheduling, routing and access control in a computer network
CA2327211A1 (en) * 2000-12-01 2002-06-01 Nortel Networks Limited Management of log archival and reporting for data network security systems
US7937470B2 (en) * 2000-12-21 2011-05-03 Oracle International Corp. Methods of determining communications protocol latency
US7155518B2 (en) 2001-01-08 2006-12-26 Interactive People Unplugged Ab Extranet workgroup formation across multiple mobile virtual private networks
WO2002057917A3 (en) 2001-01-22 2003-04-24 Sun Microsystems Inc Peer-to-peer network computing platform
US7197565B2 (en) 2001-01-22 2007-03-27 Sun Microsystems, Inc. System and method of using a pipe advertisement for a peer-to-peer network entity in peer-to-peer presence detection
US7165107B2 (en) 2001-01-22 2007-01-16 Sun Microsystems, Inc. System and method for dynamic, transparent migration of services
US20020122410A1 (en) 2001-02-13 2002-09-05 Cybiko Inc. Method of wireless data exchange amongst devices of limited range
US7266085B2 (en) 2001-03-21 2007-09-04 Stine John A Access and routing protocol for ad hoc network using synchronous collision resolution and node state dissemination
US7035937B2 (en) 2001-04-25 2006-04-25 Cornell Research Foundation, Inc. Independent-tree ad hoc multicast routing
US7124173B2 (en) * 2001-04-30 2006-10-17 Moriarty Kathleen M Method and apparatus for intercepting performance metric packets for improved security and intrusion detection
US7116661B2 (en) 2001-05-15 2006-10-03 Sri International Combining multi-hop and multicast wireless networking in classroom-like settings
US20020198994A1 (en) 2001-05-15 2002-12-26 Charles Patton Method and system for enabling and controlling communication topology, access to resources, and document flow in a distributed networking environment
US20020188656A1 (en) 2001-05-15 2002-12-12 Charles Patton Combining specialized, spatially distinguished, point to point communications with other wireless networking communications to provide networking configuration in classroom-like settings
US7308715B2 (en) * 2001-06-13 2007-12-11 Mcafee, Inc. Protocol-parsing state machine and method of using same
JP2004531971A (en) 2001-06-14 2004-10-14 メッシュネットワークス インコーポレーティッドMeshNetworks,Inc. Routing protocol embedded below the Internet Protocol routing layer of software architecture protocol stack in the mobile ad hoc network
US7743126B2 (en) 2001-06-28 2010-06-22 Hewlett-Packard Development Company, L.P. Migrating recovery modules in a distributed computing environment
US7161926B2 (en) 2001-07-03 2007-01-09 Sensoria Corporation Low-latency multi-hop ad hoc wireless network
US20030041042A1 (en) 2001-08-22 2003-02-27 Insyst Ltd Method and apparatus for knowledge-driven data mining used for predictions
DE60219932D1 (en) 2001-09-25 2007-06-14 Meshnetworks Inc Ssystgem and methods of use of algorithms and protocols for optimizing CSMA protocols (Carrier Sense Multiple Access) wireless networks
US7451205B2 (en) 2001-10-01 2008-11-11 Hewlett-Packard Development Company, L.P. Multimedia stream pre-fetching and redistribution in servers to accommodate mobile clients
US6917811B2 (en) * 2001-12-27 2005-07-12 Kt Corporation Method for dynamically assigning channel in real time based on genetic algorithm
US6904335B2 (en) * 2002-08-21 2005-06-07 Neal Solomon System, method and apparatus for organizing groups of self-configurable mobile robotic agents in a multi-robotic system
US20040156388A1 (en) * 2003-02-07 2004-08-12 Lockheed Martin Corporation System for maintaining quality of service

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6535498B1 (en) * 1999-12-06 2003-03-18 Telefonaktiebolaget Lm Ericsson (Publ) Route updating in ad-hoc networks
US6754188B1 (en) * 2001-09-28 2004-06-22 Meshnetworks, Inc. System and method for enabling a node in an ad-hoc packet-switched wireless communications network to route packets based on packet content
US7177295B1 (en) * 2002-03-08 2007-02-13 Scientific Research Corporation Wireless routing protocol for ad-hoc networks
US6870846B2 (en) * 2002-04-29 2005-03-22 Harris Corporation Hierarchical mobile ad-hoc network and methods for performing reactive routing therein using dynamic source routing (DSR)
US6954435B2 (en) * 2002-04-29 2005-10-11 Harris Corporation Determining quality of service (QoS) routing for mobile ad hoc networks
US7068600B2 (en) * 2002-04-29 2006-06-27 Harris Corporation Traffic policing in a mobile ad hoc network
US6961310B2 (en) * 2002-08-08 2005-11-01 Joseph Bibb Cain Multiple path reactive routing in a mobile ad hoc network

Cited By (49)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030195005A1 (en) * 2002-04-12 2003-10-16 Nec Corporation Radio transmission apparatus, routing method, and routing program of radio network
US7515911B2 (en) * 2002-04-12 2009-04-07 Nec Corporation Radio transmission apparatus, routing method, and routing program of radio network
US7500014B1 (en) * 2003-05-07 2009-03-03 Packeteer, Inc. Network link state mirroring
US20050157698A1 (en) * 2003-07-14 2005-07-21 Samsung Electronics Co., Ltd. Efficient route update protocol for wireless sensor network
US20050053004A1 (en) * 2003-09-09 2005-03-10 Harris Corporation Mobile ad hoc network (MANET) providing interference reduction features and related methods
US7068605B2 (en) * 2003-09-09 2006-06-27 Harris Corporation Mobile ad hoc network (MANET) providing interference reduction features and related methods
US8260307B2 (en) * 2003-09-24 2012-09-04 Siemens Aktiengesellschaft Method for communicating in an ad-hoc radio communication system
US20070010199A1 (en) * 2003-09-24 2007-01-11 Halfmann Ruediger Method for communication in an ad-hoc radio communication system
US20050176401A1 (en) * 2004-02-09 2005-08-11 Sanjiv Nanda Multi-hop communications in a wireless network
US8019351B2 (en) * 2004-02-09 2011-09-13 Qualcomm, Incorporated Multi-hop communications in a wireless network
US20090201907A1 (en) * 2004-02-09 2009-08-13 Qualcomm Incorporated Multi-hop communications in a wireless network
US7519371B2 (en) * 2004-02-09 2009-04-14 Qualcomm Incorporated Multi-hop communications in a wireless network
US8041374B2 (en) * 2004-05-07 2011-10-18 Sony Computer Entertainment Inc. Application execution method, file data download method, file data upload method, communication method, network identifier setting method and wireless communication terminal
US20060068702A1 (en) * 2004-05-07 2006-03-30 Yasutaka Miwa Application execution method, file data download method, file data upload method, communication method, network identifier setting method and wireless communication terminal
US8650302B2 (en) * 2004-05-27 2014-02-11 Hewlett-Packard Development Company, L.P. Communication in multiprocessor using proxy sockets
US8484357B2 (en) 2004-05-27 2013-07-09 Hewlett-Packard Development Company, L.P. Communication in multiprocessor using proxy sockets
US20120005349A1 (en) * 2004-05-27 2012-01-05 George Shin Communication in multiprocessor using proxy sockets
US20060015596A1 (en) * 2004-07-14 2006-01-19 Dell Products L.P. Method to configure a cluster via automatic address generation
US20060092939A1 (en) * 2004-10-29 2006-05-04 Samsung Electronics Co., Ltd. Apparatus and method for extending mobility in a mobile ad hoc network
US7848757B2 (en) * 2004-10-29 2010-12-07 Samsung Electronics Co., Ltd. Apparatus and method for extending mobility in a mobile ad hoc network
US7609641B2 (en) 2004-11-05 2009-10-27 Meshnetworks, Inc. System and method for providing a congestion-aware routing metric for selecting a route between nodes in a multihopping communication network
US20060109787A1 (en) * 2004-11-05 2006-05-25 Strutt Guenael T System and method for providing a congestion-aware routing metric for selecting a route between nodes in a multihopping communication network
WO2006052758A3 (en) * 2004-11-05 2006-10-26 Avinash Joshi System and method for providing a congestion-aware routing metric for selecting a route between nodes in a multihopping communication network
US20060171346A1 (en) * 2005-01-28 2006-08-03 Honeywell International Inc. Wireless routing systems and methods
US7826373B2 (en) * 2005-01-28 2010-11-02 Honeywell International Inc. Wireless routing systems and methods
US20070076600A1 (en) * 2005-09-30 2007-04-05 Ekl Randy L Method and system for priority based routing
US8014404B2 (en) * 2005-09-30 2011-09-06 Motorola Solutions, Inc. Method and system for priority based routing
US7996510B2 (en) 2007-09-28 2011-08-09 Intel Corporation Virtual clustering for scalable network control and management
US20090089410A1 (en) * 2007-09-28 2009-04-02 John Vicente Entropy-based (self-organizing) stability management
US8954562B2 (en) * 2007-09-28 2015-02-10 Intel Corporation Entropy-based (self-organizing) stability management
US20090089300A1 (en) * 2007-09-28 2009-04-02 John Vicente Virtual clustering for scalable network control and management
US20090103452A1 (en) * 2007-10-19 2009-04-23 Honeywell International Inc. Ad-hoc secure communication networking based on formation flight technology
US9264126B2 (en) 2007-10-19 2016-02-16 Honeywell International Inc. Method to establish and maintain an aircraft ad-hoc communication network
US8811265B2 (en) * 2007-10-19 2014-08-19 Honeywell International Inc. Ad-hoc secure communication networking based on formation flight technology
US9467221B2 (en) 2008-02-04 2016-10-11 Honeywell International Inc. Use of alternate communication networks to complement an ad-hoc mobile node to mobile node communication network
US20090197595A1 (en) * 2008-02-04 2009-08-06 Honeywell International Inc. Use of alternate communication networks to complement an ad-hoc mobile node to mobile node communication network
US8327443B2 (en) * 2008-10-29 2012-12-04 Lockheed Martin Corporation MDL compress system and method for signature inference and masquerade intrusion detection
US8375446B2 (en) * 2008-10-29 2013-02-12 Lockheed Martin Corporation Intrusion detection using MDL compression
US20100107253A1 (en) * 2008-10-29 2010-04-29 Eiland Edward E Mdl compress system and method for signature inference and masquerade intrusion detection
US20100107255A1 (en) * 2008-10-29 2010-04-29 Eiland Edward E Intrusion Detection Using MDL Compression
US9936439B2 (en) 2011-04-13 2018-04-03 Avago Technologies General Ip (Singapore) Pte. Ltd. Sensor network information collection via mobile gateway
US20120300632A1 (en) * 2011-04-13 2012-11-29 Renesas Mobile Corporation Sensor network information collection via mobile gateway
US9313828B2 (en) 2011-04-13 2016-04-12 Broadcom Corporation Sensor network information collection via mobile gateway
US9380402B2 (en) * 2011-04-25 2016-06-28 Korea University Research and Business Machines Apparatus and method for controlling a backbone network for a sensor network
US20140036728A1 (en) * 2011-04-25 2014-02-06 Korea University Research And Business Foundation Apparatus and method for controlling a backbone network for a sensor network
WO2013086073A1 (en) * 2011-12-06 2013-06-13 Telcordia Technologies , Inc. Security method for mobile ad hoc networks with efficient flooding mechanism using layer independent passive clustering (lipc)
CN102448139A (en) * 2011-12-28 2012-05-09 南昌大学 Hierarchical routing method for wireless sensor network
US20140047108A1 (en) * 2012-08-10 2014-02-13 Telefonaktiebolaget L M Ericsson (Publ) Self organizing network event reporting
US20160044281A1 (en) * 2014-08-07 2016-02-11 Smart Digital LLC Portable Surveillance Device

Also Published As

Publication number Publication date Type
US20040156388A1 (en) 2004-08-12 application
US20040156333A1 (en) 2004-08-12 application
US7366185B2 (en) 2008-04-29 grant
US7409716B2 (en) 2008-08-05 grant
US20040156370A1 (en) 2004-08-12 application
US20040157556A1 (en) 2004-08-12 application

Similar Documents

Publication Publication Date Title
Chlamtac et al. Mobile ad hoc networking: imperatives and challenges
Anantvalee et al. A survey on intrusion detection in mobile ad hoc networks
Gupta et al. Performance evaluation of load-balanced clustering of wireless sensor networks
Eik Loo et al. Intrusion detection for routing attacks in sensor networks
Winter et al. CrossTalk: cross-layer decision support based on global knowledge
Haenggi Opportunities and challenges in wireless sensor networks
Ilyas et al. Handbook of sensor networks: compact wireless and wired sensing systems
Sharma et al. Hybrid sensor networks: a small world
Sarangapani Wireless ad hoc and sensor networks: protocols, performance, and control
Brutch et al. Challenges in intrusion detection for wireless ad-hoc networks
Nadeem et al. A survey of MANET intrusion detection & prevention approaches for network layer attacks
Akkaya et al. Energy and QoS aware routing in wireless sensor networks
Christin et al. Survey on wireless sensor network technologies for industrial automation: The security and quality of service perspectives
Şen et al. Intrusion detection in mobile ad hoc networks
Abduvaliyev et al. On the vital areas of intrusion detection systems in wireless sensor networks
Alrajeh et al. Intrusion detection systems in wireless sensor networks: a review
Hammoodi et al. A comprehensive performance study of OPNET modeler for ZigBee wireless sensor networks
Ilyas et al. Smart Dust: Sensor network applications, architecture and design
Wang et al. Requirements of quality of service in wireless sensor network
Zhao et al. The interplay between signal processing and networking in sensor networks
Hai et al. A lightweight intrusion detection framework for wireless sensor networks
Sharma et al. A case for hybrid sensor networks
Tiwari et al. Designing intrusion detection to detect black hole and selective forwarding attack in WSN based on local information
Verma et al. Machine-to-Machine (M2M) communications: A survey
Chen et al. Efficient coverage and connectivity preservation with load balance for wireless sensor networks

Legal Events

Date Code Title Description
AS Assignment

Owner name: GENERAL ELECTRIC COMPANY, NEW YORK

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BARNETT, BRUCE;BUSH, STEPHEN F.;EVANS, SCOTT;AND OTHERS;REEL/FRAME:014961/0641;SIGNING DATES FROM 20040122 TO 20040127

Owner name: LOCKHEED MARTIN CORPORATION, NEW YORK

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:GENERAL ELECTRIC COMPANY;REEL/FRAME:014960/0919

Effective date: 20040128