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.
Much work has been done on routing in Ad-Hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an...
In this paper we present a Stochastic Shortest Path (SSP) formulation of routing in DTN networks where all the nodes are potentially mobile and where only an aggregate mobility information is available. We present a solution to the optimal case and present two heuristics to solve the problem. Extensive simulations assess the performance of the proposed schemes.
Geographic forwarding has been widely studied as a routing strategy for mobile ad hoc networks, mainly due to the low complexity, scalability of the routing algorithm. However, in a network with routing holes, existing geographic routing schemes such as GPSR, GOAFR could cause the throughput capacity to drop significantly due to concentration of traffic on the face of the holes. The slope-based stateless...
The routing behavior of Mobile Ad Hoc Network is a kind of cooperation model in multi mobile nodes. The traditional routing methods cannot solve the problem of malicious behavior and build the trusted transfers route between nodes. Based on the character of trust routing, the subjective confidence for the routing behavior has transform into trust evaluation with the probability model to solve the...
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points, we utilize vehicle-to-vehicle communication to propagate data in the network. Vehicular networks are highly dynamic, and hence routing algorithms that require global network state information or centralized coordination...
Vehicular communications is an important research area. Unfortunately, the proposed Vehicular Ad-Hoc Networks (VANET) solutions are either extremely complex, making them impractical for implementation, or they focus on a limited service scenario only. In this paper, we are defining a new, “clean-slate” framework for Next Generation Vehicular Networks (NGVN), which is able to cope with multiple service...
In this study, the fastest path algorithm which is known as a routing method from source to destination and Ant colony method which is known to be adaptable to the dynamic changes in the network are compared for average hop counts, power consumption and packet arrival delays by implementing a mobile network simulation. Even the average hop counts for both algorithms reach to almost same value at the...
An energy efficient multi hop sensor network cannot avoid the energy hole problem, which is the rapid decrease in the energy of nodes around the sink. Also as a sensor network has a limited node resources and unexpected changes of external environment, its nodes should show energy efficiency, reliable data transmission, and topological adaptation to the change of external environment. This study proposes...
In this paper, we propose a novel application problem in wireless sensor networks. It is the real-time data forwarding for mobile target tracking problem. It mainly focuses on routing the sensing data from multiple sources to multiple sinks with the consideration both of energy conservation and latency limitation. This problem is proved to be NP-complete. We propose three different heuristic methods...
Wireless links are often asymmetric due to heterogeneity in the transmission power of devices, non-uniform environmental noise, and other signal propagation phenomenon. Because of the variable and unpredictable capacity of wireless links, packet loses may happen frequently. Several routing protocols have been proposed for Mobile Adhoc networks, yet there is no one for all schemes that works well in...
This paper presents a new adaptive and dynamic routing algorithm called AAODV for mobile ad hoc networks inspired by Ant Colony Optimization algorithms. This algorithm is proposed by maintaining the nature of the Ad hoc On-demand Distance Vector (AODV) routing through the use of Ant Colony Optimization. AAODV maintains the on-demand nature of AODV but works in an adaptive manner. It does not send...
It is a challenge to thwart both the passive attacks and active attacks in mobile ad hoc networks for their unique characteristics. The improvement of security often sacrifices the delivery rate or other QoS. We propose secure multipath routing scheme based on modified secret sharing as an effective mechanism to protect data confidentiality and simultaneously enhance data delivery rate in mobile ad...
The topology control for guaranteeing QoS requirements of nodes might not have any solution because of the limited resources of nodes, e.g., the maximum transmitting power. In this case, the mobility of nodes can compensate for the shortage of resources and then makes a topology feasible. We propose the energy efficient mobility control algorithms for the QoS topology control with the least movement...
We consider the problem of data dissemination in vehicular networks. Our main goal is to compare the application-level performance of fully distributed and centralized data dissemination approaches in the context of traffic advisory systems. Vehicular networks are emerging as a new distributed system environment with myriad promising applications. Wirelessly-connected, GPS-equipped vehicles can be...
Quality of service support for MANETs is a challenging task due to dynamic topology and limited resources. The main purpose of QoS routing is to find a feasible path that has sufficient resources to satisfy the constraints. In this paper a novel QoS routing algorithm based on ant colony optimization is proposed. The proposed algorithm uses Ant-like agents to discover and maintain paths, that satisfy...
In this paper we focus on how the heterogeneous contact dynamics of mobile nodes impact the performance of forwarding/routing algorithms in delay/disruption-tolerant networks (DTNs). To this end, we consider two representative heterogeneous network models, each of which captures heterogeneity among node pairs (individual) and heterogeneity in underlying environment (spatial), respectively, and examine...
Because of restricted resources, wireless sensor networks need to consider synthetically the price of networks, and costs of communication and computing and so on. Aiming at the localization problem for mobile beacon node in wireless sensor network, this paper uses the ant colony algorithmpsilas characteristics which is self-organized, adaptive, dynamic optimization, integrating the hop number into...
Mobile ad hoc networks (MANETs) are characterised by the absence of a centralised infrastructure and are formed by heterogeneous mobile nodes. Power consumption and bandwidth are basic limitations for these systems. Dependability solutions and their underlying services, such as group membership can have a very large impact on both performance and power consumption in such an environment. Nevertheless,...
Mobile ad-hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. Recently a new family of algorithms emerged inspired by Swarm Intelligence, which provides a novel approach to...
Supporting multimedia for Mobile ad hoc networks (MANETs) is an important issue. This paper presents two routing algorithms in MANETs inspired by the ant colony optimization routing algorithms. The first algorithm is a Hybrid Multi-Ant (HMAnt) routing algorithm. It is a hybrid since it combines reactive path establishment with proactive path maintenance. It supports multi-path while maintaining an...
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.