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.
Routing is one of the most important issues to be addressed and desires deep investigation when dealing with mobile cognitive radio ad hoc networks. Previously proposed routing protocols assume the presence of a connected path from the source to the destination. In some scenarios, due to the characteristics of ad hoc networks and the features of the used cognitive radios, this assumption is likely...
Path planning is the art of deciding which route to take, based on and expressed in terms of the current internal representation of the terrain. Path finding also involves the execution of this theoretical route, by translating the plan from the internal representation in terms of physical movement in the environment. During combat, transfers of military units in the shortest period and with least...
Dynamic path planning problem, which is defined by finding the shortest distance movement from a starting point to a target destination in an environment that contains dynamic moveable obstacles, is a problem that is encountered in different forms in many fields. In military field, the safest transition of military units in shortest time is one of these forms. Transition problem is a very general...
This work investigates the utilization of a new pheromone distribution model for ANCOR. ANCOR is a novel routing algorithm for sensor networks. The main idea behind the algorithm is imitating the real acts of ants for finding new food resources and bringing them to their nests. A new pheromone distribution model for ANCOR, i.e. optimal pheromone distribution model will be presented, and its performance...
In this paper a novel contention resolution scheme, namely expanded priority vector (EPV) approach is proposed to support differentiated Grid service over OBS networks. EPV is an enhancement to a previously proposed application-aware contention resolution scheme for the OBS-based-grid services in the literature. By using the EPV, we keep all the advantages of the application-aware contention resolution...
The nature of military operations introduces additional requirements on sensor and ad-hoc networks such as reliability and operating in real-time. Although there has been many techniques providing reliability and real-time data communication in the literature, their implementations challenge with resource limitations peculiar to Wireless Sensor Networks (WSN). Real-time data demand and reliability...
Integrating mobile devices into Grid technologies and server applications can give ability to command power of supercomputers with a mobile device on one hand and can allow big applications to reach important data anywhere, anytime, on the other. IMOGA is planned to be an example to gather and share data that can be collected by ubiquitous mobile devices which can employ different kind of sensors...
In this paper, we propose a void avoidance algorithm for the stateless weight routing (SWR) algorithm which was developed stateless geographical routing protocol for wireless sensor and ad hoc networks. In order to demonstrate the efficiency of the method we started with the illustration of transmission coverage of relay nodes during the course of routing in the SWR protocol. The threshold value to...
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.