The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Wireless mesh networking technology has been extensively used in many practical applications, and the techniques that enhance networks reliability are always research focuses in this field. Wireless routing mechanisms are playing a more and more important role in determining wireless mesh networks reliability. A protection routing mechanism, Protection Ad Hoc On-demand Vector routing (P-AODV), is...
As a new networking topology, Wireless Mesh Networks (WMNs) have advantageous properties in terms of robustness, range extension and density, but also have significant potential disadvantages, which determines some classical load-balancing algorithms are not very suitable for WMNs. In this paper, we propose a novel load-balancing algorithm to improve the networks performance. The new scheme, which...
In order to better address the problems like the inefficiency and large expense of various Ad Hoc routing protocols, this paper using OPNET simulation tool for the performance of DSR routing protocol simulation, build a small-scale (30 nodes), medium size (50 nodes) and large-scale (100 nodes) the complexity of the mobile ad hoc network model, the DSR routing algorithm, the average route discovery...
In order to avoid routing overhead and reduce management fee for transmisson of routing information, we purposed two heuristic algorithms which are self-pruning algorithm and dominant pruning algorithm. This algorithm is more efficient than the aimless flooding in wireless networks, and redused unnecessary transmission of information and nodes switching by the movement between neighbourhoods. Result...
As a new networking topology, Wireless Mesh Networks (WMNs) have advantageous properties in terms of robustness, range extension and density, but also have significant potential disadvantages, which determines some classical routing algorithms are not very suitable for WMNs. In this paper, we propose a novel routing algorithm based on the WMNs access scheme design to improve the networks performance...
Aimed to the limitations of traditional routing algorithms and to perfect MPLS application in the domain of load balance, an algorithm of static load balance based on topology is designed in this dissertation. When the shortest path is congested in the network, the algorithm is used to find a low load sub-shortest path for the congestion path based on the bandwidth occupied situation and the topology...
xAd hoc networks are characterized by multi hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols, compare the performance of two prominent routing protocols for mobile ad hoc networks. xDSR (dynamic source routing) and AODV (ad hoc distance vector routing). A detailed simulation model with MAC and physical layer models is used to study...
For MPLS VPN (Multi-Protocol Label Switching Virtual Private Network) not suitable for the complex business logic and application with high security requirements because of its lack of providing encryption and certification, a scheme of enhancing MPLS VPN QoS is proposed. It uses the method based on "Log-infinitely Divisible Cascades", realizes fine-grained security service strategy by integrating...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.