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 design of routing protocol in mobile social delay tolerant networks is a tricky issue due to lack of stable end-to-end path, frequent link disconnection and changeable network topology. This paper proposes a novel routing algorithm based on dynamic topological potential and social relationship (DTPSR) between nodes for mobile social delay tolerant networks. In DTPSR, we define three metrics to...
Mobile social network (MSN) is a type of delay tolerant network explicitly considering social characteristics of the terminal nodes. The existing Ad Hoc routing protocols assume that there is at least one complete communication path between the source node and the target node. So they cannot be applied to MSN directly. The key to solve the problem of content distribution in mobile social network is...
This survey paper basically going to represent AODV algorithm to examined or explained ant colony optimization (ACO) in mobile AdHoc networks (MANETs). Here, in network routing we widely used two optimization techniques i.e. ACO and a swarm intelligence based optimization techniques. On-demand routing protocol is very highly potential, adaptive and scalable. These ant colony optimization and swarm...
Maximizing the network lifetime in wireless sensor networks using minimum spanning tree proves to be efficient in case of mobile sink. Sensor nodes route their data to root nodes through intermediate nodes. In Power Efficient Data Gathering and Aggregation lifetime is improved by taking minimum weight edge from root to leaf nodes while Energy conserving routing tree algorithm maximizes the life span...
Mobile multicast has been deployed in telecommunication networks for information dissemination applications such as IPTV and video conferencing. Recent studies of mobile multicast focused on fast handover protocols, and algorithms for multicast tree management have witnessed little improvement over the years. Shortest path trees represent the status quo of multicast topology in real-world systems...
Typically, wireless sensor network (WSN) uses static sinks to gather sensor data. However, it brings not only excessive sink installation cost but also energy-hole problem. In this paper, we consider data acquisition with guaranteeing latency in WSN by multiple mobile sinks. In particular, we optimize the number of sinks as well as the itinerary of each sink for this problem such that the total cost,...
Targeting for providing communication services in the Intermittently Connected Vehicular Networks (ICVN) where there are no end-to-end communication and routing paths between vehicles, many relaying algorithms and routing protocol have been proposed under the assumption that vehicular nodes in the network are homogeneously distributed in the network with the same contact rate and delivery cost. However,...
A Wireless Sensor Network (WSN) is composed by many tiny embedded systems with sensing, processing and communication capabilities. These sensors use limited power sources, such as batteries, making energy a key resource that needs management. One of the main contributors to energy consumption in WSN nodes is data transmission through a radio device, and the parameter that most influences energy consumption...
Though Dynamic Source Routing (DSR) is a popular on-demand algorithm designed to restrict the bandwidth consumed by control packets, the flooding of Route Request (RREQ) packets to find paths to a destination makes it difficult to apply DSR to wireless sensor networks (WSNs), which have tiny sensor nodes of limited memory and power. In this study, an angle-based multi-hop routing algorithm for mobile...
In this paper, we consider a network of stationary nodes that rely on mobile nodes to transport data between them. We assume the mobile nodes can control their mobility pattern to respond to traffic loads, as well as satisfy some other secondary objectives, such as surveillance requirements. We study this problem in the framework of cost minimization, where we derive a dual iterative algorithm that...
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.
The patterns of movement used by Mobile Ad-Hoc networks are application specific, in the sense that networks use nodes which travel in different paths. When these nodes are used in experiments involving social patterns, such as wildlife tracking, algorithms which detect and use these patterns can be used to improve routing efficiency. The intent of this paper is to introduce a routing algorithm which...
In this paper we propose a novel routing algorithm called Bees_Ants algorithm. This algorithm is a combination of ant colony based routing algorithm (ARA) and BeeHive based routing algorithm. The proposed routing algorithm depends on splitting the network into two parts; one is a fixed network and the other is a mobile ad hoc network (MANET), then applying the ant colony based routing algorithm on...
The problem, such as low efficiency in discovering resource, high usage of network bandwidth, is caused by the frequent mobility of nodes in peer-to-peer network. A self-organizing routing model in mobile peer-to-peer base on dynamic region management is proposed by dint of our improved Meridian model. According to the mobility strength of nodes and introduction of dynamic management, the proposed...
One of the major goals of on-demand routing protocols is to minimize control traffic overhead. In this paper, we perform a simulation and performance study on some routing protocols for ad hoc networks. Distributed Bellman-Ford, a traditional table-driven routing algorithm, is simulated to evaluate its performance in multihop wireless networks. In addition, two on-demand routing protocols (dynamic...
An ad hoc network is a local network that is built spontaneously as devices connect. Instead of relying on a base station or the centralized device, to coordinate the flow of messages to each node in the network, the individual network nodes forward packets to and from each other. So finding a route to a destination can be complexe. The clustering problem consists to partition the network into groups...
Currently available asset tracking systems are not cost effective in mobile and wireless computing infrastructures, and they do not learn the asset's route to act accordingly. Hence our main goal is to not only to track mobile assets by using an efficient geographical tracking approach, but also adapt their routes by means of intelligent route learning techniques. We thus designed and implemented...
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...
This paper presents a novel Virtual Circle Combined Straight Routing (VCCSR) algorithm for a mobile sink to collect data in wireless sensor networks. Tree-based routing is a common scheme to collect data from sensors to a sink. Most of the previous proposed tree-like aggregation approaches are not suitable for mobile sink, because the routes between sink and sensors have to be reconstructed when a...
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.