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.
To realize information system for reducing the traffic congestion, it is important to analyze the relationship between traffic congestion and route choice decision of each mobile object. In this paper, we show the characteristics of density clusters including percolation threshold in connection with route choice decision from analysis of simulation results on 100 × 100 non-diluted periodical square...
Delay-Tolerant Networks (DTNs) are wireless mobile networks, where the nodes are sparse and end-to- end connectivity is rare. Since DTN nodes are mostly energy-limited devices, there is an immediate need to have energy-efficient routing protocols, allowing the network to perform better and function longer. Besides, in the real world, people carrying the nodes form a lot of communities because of similar...
In this paper, the forwarding objective and the mobility law of nodes in opportunistic networks are investigated to establish a mathematical model for further analysis, and then a new data forwarding algorithm is proposed. In this algorithm, according to the distance between the data holders and the destination, some intermediate nodes are selected to relay the data. Especially, the forwarding copies...
Although many efforts have been made to study the reputation evaluation of node performance in Mobile Peer-to-Peer Networks (MP2P), the existing methodology of node reputation evaluation are not applicable to the scenarios in dynamic networks. To improve the performance of MP2P, in this study, we develop a new evaluation of node reputation by combining an analytic hierarchy process with a fuzzy comprehensive...
On the basis of the research on the Ad hoc network routing protocol, this paper emphatically describes the LANMAR routing protocol. According to the realization of wireless Ad Hoc network routing protocol under the environment of OPNET 14.5 and the introduction of network simulation software OPNET and wireless protocol LANMAR-FSR principle, the paper explains in detail the process simulation modeling...
Mobile opportunistic networks can realize self organizing communications for complicated and dynamic scenarios, which makes them expected to support various applications. In this paper, we investigate how far the data can reach within time t (i.e. The dissemination distance), which reveal the tempo-spatial data dissemination properties of mobile opportunistic networks. Our investigations are taken...
Research towards securing ad hoc networks has focused on numerous algorithms for detecting intrusions in specific kinds of attacks like black hole, sequence number, neighbor and packet forwarding attacks. In this attempt, impact of malicious node in ad hoc environment is discussed and implemented using ns2 in case of packet dropping attack. In this paper, MNI-AODV algorithm is proposed by incorporating...
Mobile social networks (MSNs) are a kind of delay tolerant network that consists of lots of mobile nodes with social characteristics. Recently, many social-aware algorithms have been proposed to address routing problems in MSNs. Because of the social properties introduced to routing, this results in node privacy disclosure. In this paper, analyzing social-based routing strategies, we propose a privacy...
Probabilistic forwarding methods have been exploited in opportunistic networks to reduce the overhead of epidemic routing. However, most existing methods make all the nodes forward messages with the same probability (i.e., equal scheme), which causes the energy unbalance of nodes. To guarantee the energy balance of nodes and prolong the network lifetime, we design a differentiated scheme, i.e., different...
A lot of research is ongoing throughout the world aiming to optimize communications in one of the special types of ad hoc networks well know as sensor networks. The utility and application domain of sensor networks ranges from commercial, public safety applications and military sector to be the most important ones. Some important challenges to various routing algorithms employed in such networks are...
Delay tolerant networks are intermittently connected. In this paper, we propose a DTN routing scheme EBR. The scheme is based on the idea of exploiting inter-contact time between mobile nodes to predict the number of nodes with no copy a node will encounter within the expected delay. In EBR, every node with message copies dynamically chooses the number of copies by itself. We evaluate the performance...
It is challenging to react to dynamically changing of network topology for routing schemes in Delay Tolerant Networks (DTNs). The main concern about routing in DTNs is to minimize delivery delay while maintaining low overhead. In this paper, we propose a DTN routing scheme Density-Aware Message Spraying (DAMS). The scheme is based on the idea of exploiting spatial node distribution and encounter history...
The Delay Tolerant Mobile Sensor Network (DTMSN) is a new type of sensor network for pervasive information acquisition, mainly motivated by the Delay-Tolerant Network (DTN) and its applications. Direct transmission is one of the basic schemes for data delivery with low complexity and less transmission overhead, which is considered to be suitable for DTMSN applications. In this paper, we inspect the...
Content sharing, dissemination and collaboration in open environments require the ability to send and combine data packets across network even in the absence of an end-to-end connected path [1]. User mobility plays a fundamental role in selection of intermediate relays for multi-hop communication [2]. Current schemes do not take into account the effect of power law distribution of inter-contact times,...
In delay tolerant network, message delivery can be inspired by biological communication models in realizing encountering and delivering. One way of communications can be through "thrown box" where the messages can be left and collected by different nodes in mimicking pheromone-based communications. In thrown box based model, the box is viewed as message relay and the delivery rate is enhanced...
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...
In Delay and Disruption Tolerant Networking (DTN), Epidemic, PRoPHET and Spray and Wait protocols work by distributing one or more message copies (Bundles). They can naturally adapt to the mobile situation where the destination node moves from an old connection endpoint to a new connection endpoint because any Bundle copy may luckily be able to reach the new connection endpoint where the mobile node...
The handoff-based deterministic routing protocol (HDRP) gives better performance than the already existing delay and disruption tolerant networking (DTN) protocols in terms of delivery ratio and end-to-end latency by making use of the location information of the MH and applying the back propagation of the route update information technique efficiently. The protocol shows superior performance even...
Mobile ad hoc network is a hotspot in the wireless networks researching domain, and the routing protocol, which is as the core technology on network layers, is particularly important. By analyzing the working mechanism and key techniques of the Ad Hoc routing models, this paper puts forward a routing protocol based on network radius analysis. First, this paper sets up a LEACH model to analyze the...
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...
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.