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 availability of accurate location information (for airborne purposes) in unmanned aeronautical ad-hoc networks (UAANETs) makes it possible to deploy geographic routing mechanisms as the main communication protocol in such networks. However, the performance of geographic routing is not obvious, especially for sparse networks (i.e., networks with low connectivity levels). In this paper, the main...
The paper presents the comparative study and analysis of buffering in Goback2 network. The performance at the destination node by applying different buffering capacities at the routers is demonstrated. The results using NS2 simulator are produced. It can be concluded that the selection of appropriate type of buffering helps in controlling the congestion and the packet drops at the link node.
This paper proposes a simple path diversity algorithm (SPDA) for Interdomain routing. The SPDA uses source routing to find an alternate path from a source to a destination, and allows flexible division of traffic over the best and alternate path. The SPDA comprises three steps. First, the BGP protocol is extended to allow the BGP routing table to save the multiple paths for any destination. Second,...
We study the load balancing aspect of routing algorithms in wireless ad hoc networks. We define a statistical measure called local coefficient of variance (lcv) to study the smoothness of the load distribution in the network. The importance of keeping lcv as low as possible in designing load balanced routing algorithms is demonstrated. We analyze how number of nodes, transmission range, network area...
The operation of Ad-hoc networks depends on the cooperation among nodes to provide connectivity and communication routes. However, such an ideal situation may not always be achievable in practice. Some nodes may behave maliciously, resulting in degradation of the performance of the network or even disruption of its operation altogether. To mitigate the effect of such nodes and to achieve higher levels...
The number of elderly in industrialized countries is increasing, and the home healthcare applications are widespread. The routing of healthcare traffic is important with no doubt. This study investigates the problem of unfairness when QoS routing does not consider the mix of traffic classes. Unfairness is mainly caused by routing different traffic flows of the same class through paths with extremely...
The following topics are dealt with: vehicular networking; beaconing and broadcast; data collection and management; simulation and modelling; transport protocols; mobility management in VANETs; telecommunication security; smart antennas and radio; reliability and routing; cellular networks; physical layer; and MAC.
Due to the limited energy-source and mostly unattended nature of the wireless sensor networks, efficient use of energy has a critical importance on the lifetime of the applications accomplished by such networks. Although in most of the cases sensor nodes are battery-powered, there are application scenarios in which battery- and mains-powered nodes coexist. In this paper, we present an approach and...
In multi-hop wireless networks, if we know the packet reception rates of all links in the network, we can find the path with the minimum energy consumption. However, to obtain the packet reception rates with high accuracy, we need a number of exchanges of probe packets. Also, the energy consumption along a path depends on a routing method. In this paper, we consider three routing methods and evaluate...
The combination of deflection routing and burst retransmission is an attractive scheme for resolving the burst contention problem in Optical Burst Switching (OBS) networks. Most of previous works on hybrid schemes use simulation approach to prove the efficicency. In this paper, we develop an analytical model for obtaining the overall burst loss ratio of an OBS network that take into account deflection...
The paper presents the effect of packet size on the delay in Manhattan Street Network (MSN). The delay behavior of Manhattan Street Network for packets of different size is demonstrated. The results are produced in the NS2 simulator. It is concluded that the increase in the packet size increases delay and as a result degrades the performance in multipath, multihop networks like MSN .The performance...
Routing problems based on cooperative transmission for multi-hop wireless Ad hoc network have been studied in this paper. Inspired by Multipoint Relay computation, a cooperative routing algorithm is proposed in Ad hoc network, which select cooperative neighbors for cooperative transmission by checking whether the links between the node and its neighbors are symmetric or not. The performances of the...
Various information delivery schemes based on store-carry-forward routing with extensions have been studied as part of efforts to support non-real-time communications in sparse or intermittent networks. However, communication service schemes that cover large areas based solely on store-carry-forward technology have previously been considered impractical because the delay time for message delivery...
Understanding the energy consumption of individual tasks in wireless sensor networks (WSN) is an important aspect for a network deployment. The fundamental task of WSNs is to gather data in the long-term manner. All additive processes such as routing and localization should not significantly affect the life time of the WSN. It was already proved that concurrent anchor free localization algorithms...
In this paper, we propose a method to reduce the routing overhead in DSDV (Destination-Sequenced Distance-Vector) networks. The proposed method benefits from the nature of DSDV, such as loop-free and shortest routing path, but alleviates the problem of control message flooding when the network topology changes. Given a destination node in a DSDV network, there exists a spanning tree using the destination...
In the near future vehicular networks based on wireless technology will be part of our lives. Efficient and robust routing algorithms will play a key role in the success of such technology. In this paper we present TrafRoute, an efficient and robust routing scheme for vehicular networks, suitable for both Vehicle-to-Vehicle and Vehicle-to-Infrastructure communications. TrafRoute introduces a novel...
We consider the problem of backbone formation in ad hoc wireless networks composed of heterogeneous nodes. A virtual backbone in an ad hoc wireless network provides a hierarchical infrastructure that can be used to address important challenges such as efficient routing, multicasting/broadcasting, activity-scheduling, and energy efficiency. We model a wireless network in which nodes have different...
Opportunistic routing has gained much attention in recent years as a means of leveraging the broadcast nature of wireless medium. Most of the previous studies focused only on improving throughput, assuming that Best Effort traffic which is delay insensitive is delivered through opportunistic routing. However, when the delay sensitive traffic is involved, it is necessary to consider both the opportunistic...
Dynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should...
In this paper, we proposed a long-life, shortest path routing method for interval-vehicle communication. Firstly, we form the inter-vehicle network into the layered network to construct the shortest path. Next, we deduce the link with maximal lifetime between two directly linked vehicles according to their velocities and moving directions. Furthermore, the lifetime of one hop neighbors is propagated...
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.