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.
Traffic congestion, the main constituent of vehicular extrinsic flow resistance, has been an important factor in the design of routing algorithms. There are important intrinsic factors that can also aid these algorithms. This study proposes a new vehicular intrinsic flow resistance metric referred as sinuousness. To obtain this metric several scenarios are designed. Each scenario has a unique topology...
The paper deals with the contact center modeling with emphasis on the optimal number of agents. The contact center belongs to the queueing systems and its mathematical model can be described by various important parameters. The Erlang C formula tends to be suitable tool for the modeling of QoS parameters of contact centers. In our paper, we propose two parameters: downtime and administrative task...
Underwater Sensor Networks (USN) has a wide range of aquatic application that is totally different from terrestrial sensor network. The nodes of USN has a peculiar character tics like float mobility, limited bandwidth and energy, signal and link quality, routing challenges and its cost and high error probability. This nature if USN degrades the performance in terms of throughput and lifetime. This...
An opportunistic network (OPPNET) is an alternative to a mobile ad-hoc network (MANET) in which no complete path is needed. If a complete path is unavailable, the source node sends the message through relay nodes until the message arrives at its destination. Friendship-Based Routing (FBR) is routing scheme for an OPPNET which uses the inter-contact time of each node to find a good relay node. Unfortunately,...
In modern computer networks loading and bandwidth of communication links are optimized for providing high-quality service of network traffic, new services and technologies. As a rule, for this task the protocols of dynamic routing based on Dijkstra algorithm are used. Protocols of multipath routing for ensuring reliability and accuracy of the provided information allow to divide critical traffic and...
For some computer to find another in a network, there is a routing mechanism which describes how information is transferred between network nodes. The route is understood as sequence of network nodes through which it is possible to transmit information from source node to destination node. One of perspective methods of a computer network reliability increase is ensuring fast restoration of routes...
Determining an accurate and reliable prediction of the optimal routing paths between source and destination nodes in Mobile Adhoc Network (MANET) is always challenge due to dynamic nature of mobile nodes and the scarcity of network availability. The purpose of this work is to identify reliable optimal paths (ordered) from the set of possible random routing paths. The proposed model leverages fuzzy...
The general method available for comparison between the Distributed Hash Table (DHT) based structured overlay networks are average latency per successful lookup and percentage of successful lookups. For a DHT based lookup service with lookup retries for failed lookups, both average latency per successful lookup as well as percentage of successful lookups are key to evaluate the performance. Although,...
This paper presents a method of calculating the minimal required transmission period for control messages and power margin for MANET with constrained resources, namely for communication and control systems on-planet robotic systems. For a system with ten robotic devices, with velocities of 10 cm/s, the sufficient power margin for worst case scenario will be equal to dP = 1 dB, which gives a transmission...
The selfish routing problem is a mathematical model to represent the behavior of the selfish players who select a path in a congested network. In the selfish routing problem, Braess's paradox shows that there exists a case that more network resources may cause worse traffic performance contrary to expectations. In the previous studies of the selfish routing problem, the traffic network with a pair...
There are numerous environments and situations where network infrastructure is sparse, latent, or partially out of service. There is a growing body of research on protocols, security, information assurance and trust for use in such Resource Constrained Networks. A few examples of a Resource Constrained Network include Delay Tolerant, Wireless Sensor, and many mobile ad-hoc and ad-hoc mesh networks...
Since traffic load in mobile networks typically changes significantly over time, time-varying routing, where routing changes in certain time intervals, seems an obvious solution. Yet multiple researchers have claimed independently in the past, that time-varying routing does not lead to worthwhile benefits given its overhead. In this paper, we study this issue in a systematic way. We argue that previous...
Traditional routing metrics designed for wireless networks are application-agnostic. In this paper, we consider a wireless network where the application flows consist of video traffic. From a user perspective, reducing the level of video distortion is critical. We ask the question “Should the routing policies change if the end-to-end video distortion is to be minimized?” Popular link-quality-based...
This paper proposes and subsequently delineates quantification of network security metrics using software defined networking approach in real time using a progressive testbed. This comprehensive testbed implements computation of trust values which lend sentient decision making qualities to the participant nodes in a network and fortify it against threats like blackhole and flooding attacks. AODV and...
Due to intermittent connectivity and uncertain node mobility, opportunistic message forwarding algorithms have been widely adopted in delay tolerant networks (DTNs). While existing work proposes practical forwarding algorithms in terms of increasing the delivery rate and decreasing data overhead, little attention has been drawn to the control overhead induced by the algorithms. The control overhead...
With the rapid development of wireless networks, the solution for degradation of Transmission Control Protocol (TCP) over wireless networks becomes more and more significant because of the software reusability. In order to improve the performance of TCP protocol, several studies have been proposed in different directions. Some of them attempt to find a suitable path for TCP transmission. Expected...
Social networks have brought a whole new era of staying connected with family, friends and even strangers. This enables us in finding similar kind of people around us or locating who is important for us. Indirectly it measures the relations with whom we have connected through social metrics e.g. Centrality, similarity etc. The same concept can be applied for efficient routing in disconnected networks...
Most Internet routing protocols have one of two algorithms lurking at their core — either Dijkstra's algorithm in the case of link-state protocols or a distributed Bellman-Ford algorithm in the case of distance-vector or path-vector protocols. When computing simple shortest paths these protocols can be modified to utilize all best paths with a combination of next-hop sets and Equal Cost Multi-Path...
Transmission Control Protocol (TCP) suffers degradation in wireless networks because, among other factors, low quality links tend to interrup a TCP connection. Most of the routing protocols use the number of hops as path metric without considering the link condition. Expected Transmission Count (ETX) calculates the estimated number of transmissions to successfully transmit a packet, but it fails to...
The deployment of wireless ad-hoc networks compared to traditional infrastructure based networks offers several advantages such as fully distributed mobile operation, easy discovery of joining wireless devices and quick cheap network setup. The design of an effective routing protocol is one of the main challenges in the ad-hoc networking paradigm and the utilisation of an adequate link cost metric...
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.