Search Results for "opportunistic routing algorithm"

Showing 23 open source projects for "opportunistic routing algorithm"

View related business solutions
  • Our Free Plans just got better! | Auth0 by Okta Icon
    Our Free Plans just got better! | Auth0 by Okta

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
    Try free now
  • Top-Rated Free CRM Software Icon
    Top-Rated Free CRM Software

    216,000+ customers in over 135 countries grow their businesses with HubSpot

    HubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
    Get started free
  • 1
    miso

    miso

    A tasty Haskell front-end framework

    Miso is a small, production-ready, "isomorphic" Haskell front-end framework for quickly building highly interactive single-page web applications. It features a virtual-dom, recursive diffing / patching algorithm, attribute and property normalization, event delegation, event batching, SVG, Server-sent events, Websockets, type-safe servant-style routing and an extensible Subscription-based subsystem. Inspired by Elm, Redux and Bobril. Miso is pure by default, but side effects (like XHR) can...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2

    SYSU-OpenEdgeAI

    A public account displaying works from SYSU-OpenEdgeAI Club

    .... 3. rapidlayout.zip is an end-to-end hard block placement and routing flow for systolic accelerators on FPGA, RapidLayout. It is the sourcecode of our paper:https://ieeexplore.ieee.org/document/9221566 . If you have any question about our projects, please leave reviews and contact us!
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    LaPath

    Learning Automata algorithm for the shortest path problem.

    The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. Learning Automata (LA) are adaptive mechanisms requiring feedback from the executing environment to converge to certain states. In the context of network routing, LA residing at intermediate nodes along a path, exploit feedback from the destination node for reducing...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    Helpdezk

    Helpdezk

    HelpDEZk is a powerfull software that manages requests/incidents.

    HelpDEZk is a powerfull software that manages requests/incidents. It has all the needed requirements to an efficient workflow management of all processes involved in service execution. This control is done for internal demands and also for outsourced services. HelpDEZk can be used at any company’s area, serving as an support to the shared service center concept, beyond the ability to log all the processes and maintain the request’s history, it can pass it through many approval...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Secure remote access solution to your private network, in the cloud or on-prem. Icon
    Secure remote access solution to your private network, in the cloud or on-prem.

    Deliver secure remote access with OpenVPN.

    OpenVPN is here to bring simple, flexible, and cost-effective secure remote access to companies of all sizes, regardless of where their resources are located.
    Get started — no credit card required.
  • 5
    jsprit

    jsprit

    Open source toolkit for solving rich vehicle routing problems

    jsprit is a java based, open-source toolkit for solving rich Traveling Salesman Problems(TSP) and Vehicle Routing Problems(VRP). It is lightweight, flexible and easy-to-use, and based on a single all-purpose meta-heuristic. Setting up the problem, defining additional constraints, modifying the algorithms and visualizing the discovered solutions is as easy and handy as reading classical VRP instances to benchmark your algorithm. It is fit for change and extension due to its modular design...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 6

    Object Oriented Streetmap

    C# class library for processing OpenStreetMap data

    This is a class library written in C# for processing OpenStreetMap XML file extracts into a SQLite database for routing with different vehicle types and restrictions. Before rating or contributing please see the README file for a more complete summary and a list of todos.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    A P2P overlay construction toolkit, which supports routing algorithm researchers in addition to application developers. It provides multiple routing (DHT) algorithms such as Chord, Kademlia, Koorde, Pastry and Tapestry, and a distributed environment emu
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8

    SAORS

    OMNET++ implementation of framework for opportunistic protocols.

    Up to now, OMNET++ and the INET and INETMANET frameworks do not include an opportunistic routing protocol implementation. A careful examination reveals that there are three very distinctive stages in the decision procedure of every opportunistic routing protocol. SAORS takes advantage of this observation and incorporates it in the system architecture. It is based on the DYMO ad-hoc routing protocol. SAORS provides the necessary functions for the development of opportunistic schemes...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 9

    ECMM

    OMNET++ implementation of the Enhanced Community-based Mobility Model

    This project enables the introduction of community-based mobility models into the OMNET++ simulation environment. These models provide many desired characteristics, such as socially influenced mobility decisions and are quite realistic. One specific model, namely the Enhanced Community-based mobility model, is very suitable for opportunistic routing research comparing to the others, because of its advanced properties. These include a pause period, conformance to the existing social ties...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Payroll Services for Small Businesses | QuickBooks Icon
    Payroll Services for Small Businesses | QuickBooks

    Save 50% off for 3 months with QuickBooks Payroll when you Buy Now

    Easily pay your team and access powerful tools, employee benefits, and supportive experts with the #1 online payroll service provider. Manage payroll and access HR and employee services in one place. Pay your team automatically once your payroll setup is complete. We'll calculate, file, and pay your payroll taxes automatically.
    Learn More
  • 10

    KWANSO

    MANAGING ROAD TRAFFIC CONGESTION VIA TRANSPORT TELEMATICS AND MOBILE

    The developed application is useful in overcoming congestion challenge in Ghana which is a major drawback leading to over consumption of fuel, deployment of many traffic supervisors. We utilized vehicular routing algorithms and techniques modeled from the study of packet traffic decongestion on computer data networks. Our modeled algorithm is executed over the generated routes using real time traffic data stored in an oracle database as the routing metric of computation. The application...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11

    MITRE Common Layer 3

    Approach to choose MANET routing peers for existing protocols.

    Common Layer 3 presents an approach that allows an algorithm to choose IP routing peers intelligently among the nodes in a MANET but does not involve any modifications to existing IP routing protocols. In addition, our approach works as a pure interface between (any) MANET radio terminal and any IP router, so nodes using our interface interoperate with nodes that do not use this interface or with nodes using different algorithms to select routing peers. This software is a prototype...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12

    OppSim

    A simulation framework for opportunistic networks

    On the basis of MiXiM, OppSim is developed for opportunistic networks (ONs) in order to help the researchers in this domain focus on the design of protocols and result analysis instead of the development of simulation and analysis modules. The contributions of this work are: • An integrated solution for simulation and analysis • Separated routing and MAC layers • Symmetric and correlated channel modelling • Structured MAC design • Combination of multiple application traffic
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13

    rNetwork

    A C++ class that implements signal routing.

    The rNetwork class implements signal routing through a network of user-defined interconnected signal switch matrices. The routing algorithm assumes fan-out capability, and that the reuse of connections should be optimized for the most economic signal routing solution. The class allows multiple overlaying projects, and connections (unrouted or routed) with different levels of persistance. The code is still "in work".
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14

    SimuMANET

    SimuMANET is a tool for deployment and real-time monitoring of MANETs

    ... to determine the causes constraining the QoS accomplishment for a particular networktopology, scenario, routing algorithm, and so on. Due to a set of functionalities, such as GUI, network topology visualization, traffic and motion pattern configuration, and real-time network status analysis, the simulator here introduced becomes a valid tool for both research and education targets.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    OSM Explorer

    OSM Explorer

    Basic routing and spatial functions using OpenStreetMap data

    A mapping application for OpenStreetMap that renders OSM or MapQuest tiles and does basic routing from a built-in database. The main focus of this project is the development of a high-performance routing engine that can handle a variety of routing and vehicle constraints on demand without additional pre-processing of the road network. An additional goal is the development of a class library centered around a built-in, object-oriented database used for processing and storing OSM map data...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    Create the open-source algorithm for the EDA, it has released two products, GVeri- a code editor embeded compiler to design hardware, mini-router - a LEA algorithm for routing.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    Toothfairy is a Java midlet for chatting on mobile devices via a Bluetooth connection. It creates a network of devices using a simple but powerful ad-hoc routing algorithm.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    Orthogonal (a.k.a manhattan) line routing is a technique for rendering a human-readable hierarchical diagram. Manhattanlines implements an orthogonal line routing algorithm that minimizes line length and crossings.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    This educational software simulates an Ad-hoc network with AODV algorithm, it uses a high level view and only works in Routing layer. it has a user-friendly graphical user interface and has been written in java language.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    The Optimized Link State Routing (RFC 3626) is an optimization of the classical link state algorithm for wireless Mobile Ad-hoc Networks (MANETs). Quagga is a popular routing software suite. This project is about making an OLSR implementation for Quagga.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    Flying Ants implements a wireless ad-hoc routing algorithm based upon biologically inspired ant-like agents. The code is suitable for single board computer systems (e.g., soekris boards). It runs in userland and utilizes a threaded raw socket protocol.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22
    This folder is intended to provide a complete framework for wireless ad hoc networks implementing security and QoS specifications. The base routing algorithm to be used is choosen as DSR. A purpose specific ad hoc simulator (java) will also be developed d
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23
    Aim of the project is to develop a continious evolutionary algorithm for solving vehicle routing problems.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next