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.
Among the route optimization schemes in NEtwork MObility (NEMO), the prefix delegation-based schemes perform better than other schemes. Since the prefix delegation-based schemes are designed for communication between a mobile network and a wired network, they lack evaluation for the case of intra mobile network communication involving MIPv6 incapable hosts in a mobile network. We evaluate prefix delegation-based...
IETF has proposed mobile IPv6-based network mobility (NEMO) basic support protocol (BSP) to support network mobility. NEMO BSP inherits all the drawbacks of mobile IPv6, such as inefficient routing path, single point of failure, high handover latency and high packet overhead. To address these drawbacks, a new network mobility scheme, called seamless IP-diversity based network mobility (SINEMO), has...
A number of prefix delegation-based schemes have been proposed in the literature to solve the route optimization problem in mobile networks. The route optimization solutions generate overheads and affect the performance of mobile networks. However, currently there is no tool available to aid in the selection of an appropriate scheme for a given mobility scenario. The objective of this paper is to...
The delay-constrained capacitated minimum spanning tree (DC-CMST) problem of finding several broadcast trees from a source node is discussed. While the traditional CMST problem deals with only the traffic capacity constraint served by a port of the source node, and delay-constrained minimum spanning tree (DCMST) considers only the maximum end-end delay constraint, the DC-CMST problem deals with both...
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.