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.
Elastic Optical Networks (EONs) have the potential to improve the fiber spectrum utilization by allocating spectrum resources to multiple traffic requests proportionally to the amount of carried traffic. However, achieving high spectrum utilization in this elastic scenario is hindered by the resulting spectrum fragmentation. A number of studies have addressed and made attempts to mitigate spectrum...
The problem of choosing the route providing the best communication opportunities among the available routes is particularly challenging in self-organizing Cognitive Radio networks, since the communication opportunities are deeply affected by the primary-user (PU) activity. Furthermore, whenever the route selection exploits proactively acquired information on the PU activity, routing update packets...
Mathematically evaluating network performance before implementing real networks is very important in design of mobile ad-hoc wireless network because we can save time and effort. In this paper, we propose mathematical models to analyze route availability which is the probability that there exists a routing path between arbitrary source node and destination node during route discovery phase, and the...
In this paper we address the issue of the optimal candidate-set selection in the opportunistic routing paradigm. More specifically, although several algorithms for selecting the optimal candidate set have been proposed, to the best of our knowledge none of them has never considered the problem of selecting the optimal constrained candidate set, namely the optimal candidate set with a fixed maximum...
Based on the analysis of the existing utility-based forwarding mechanisms, for the inefficient forwarding of history encounter time based forwarding mechanism in the initial phase of the node movement, a Random and Encounter Time Based algorithm named RET is proposed in this paper. RET divides the nodes moving into two phases-random forwarding phase (initial phase) and utility-based forwarding phase...
Within a list of available candidate services offering the same functions, users lean to select the less time consuming ones under the time sensitive situation. Considering the features of the process-aware services, this paper provides a novel consuming time duration computing method that shows high accuracy of performance description. After that a service selection mechanism is proposed to leverage...
A new dynamic routing protocol (CSTR) for mobile networks is proposed in this paper. The rules for mapping between cell number and corresponding co-ordinates are discussed. The routing protocol has been formulated with the help of a tree structure generated inter-alia. All possible routing paths could also be enumerated in a simple manner. This method is simpler than other techniques reported so far...
This paper investigates the effect of introducing cognitive mechanisms in the routing module of a wireless network. Previous work on the introduction of cognition in the routing function is described, and a routing cost function that incorporates measurements of internal network status and instantaneous behavior of external world is proposed. The cost function is analyzed by simulation in a network...
In this paper a BISR architecture for embedded memories is presented. The proposed scheme utilises a multiple bank cache-like memory for repairs. Statistical analysis is used for minimisation of the total resources required to achieve a very high fault coverage. Simulation results show that the proposed BISR scheme is characterised by high efficiency and low area overhead, even for high defect densities...
A principal factor in sensor network design is energy efficiency. In this work, we propose to extend the lifetime of sensor networks using appropriate choice of sensor node distribution. The key idea of our scheme is to deploy more nodes in areas of extensive energy usage. Using this scheme of sensor node distribution, we use probabilistic angular routing to route data packets from the sensor nodes...
This paper presents a distributed fermat-point range estimation strategy, which is important in the moving sensor localization applications. The fermat-point is defined as a point which minimizes the sum of distances from three sensors inside a triangle. This point is indeed at the trianglepsilas center of gravity. We solve the problems of large errors and poor performance in the bounding box algorithm...
Sink mobility has become an increasingly important requirement of various sensor network applications. Handling such mobile sink conditions brings new challenges to large-scale sensor networking. This investigation proposed a hybrid-structure routing protocol (HSRP) that combines the benefits of grid-based and cluster-based structures. Grid-based structure is designed to solve the cluster head selection...
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.