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.
The mobility issue in grid environments has established new challenges to the research communities particularly in the areas of scheduling, adaptation, security and mobility. Especially, the resource allocation becomes more challenging when mobility is considered in grid environment. Hence it is necessary to consider the mobility of users along with the resource availability while scheduling the resources...
This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET that consists of ns multicast sessions. Each multicast session has one source and p destinations. Each source sends identical information to the p destinations in its multicast session, and the information is required to be delivered to all the p destinations within D time-slots...
This paper presents a novel priority queue scheduling algorithm named energy-efficient and load-balanced queue scheduling algorithm (ELQS) for Mobile Ad Hoc NETwork (MANET) considering both mobile nodes' congestion levels and the nodes' energy usage, which uses mixture of energy balance and traffic balance to solve the problem of "hot spots", some mobile nodes with heavy traffic load using...
In this work, we present, CaSMA, a packet scheduling mechanism for mobile ad hoc networks (MANETs) that takes into account both the congestion state and the end-to-end path duration. We show that CaSMA approximates an ideal scheduling mechanism in terms of maximizing the good put and sharing the throughput (losses) fairly among the contending flows. Further, the simulation results show that both average...
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.