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.
Delay Tolerant Networks (DTNs) are intermittently connected mobile networks, in which a fully connected path from source to destination does not exist. Therefore in these networks, message delivery relies on opportunistic routing where nodes use store-carry-and-forward paradigm to route the messages. However, effective forwarding based on a limited knowledge of contact behavior of nodes is challenging...
This paper presents the study of an access point (AP) deployment strategy which aims to reduce the energy expenditure of ubiquitous motorway network coverage while ensuring Quality of Service (QoS) requirements are maintained at acceptable levels. For this reason, we, in this paper, study the consumption of energy in a scenario where three operational APs are deployed on a motorway with and without...
With the rapid growth of high data rate applications, significant amount of energy is consumed by base stations' equipment. In order to save energy, it is better to deploy fewer base stations (BSs) or switch off as many as possible. However, this is usually attained at the expense of quality of service (QoS). In this paper, we deploy fewer BSs to reduce energy consumption and study the performance...
A new scheme that serves to find a routing path for Wireless Sensor Networks (WSNs), with a view to facilitate an increase in the network life time is proposed in this paper. It envisages the network to be in the form of clusters and develops an algorithm for transfer of information within the nodes and to the remote Base Station (BS). The approach involves the use of Ad-hoc On Demand Distance Vector...
In order to construct the highway networks, the road tunnels become an inevitable deign to accommodate physical environment elements (e.g., mountains and rivers) in the world. For the recent constructed tunnels, the communication system within the tunnel is planed and designed ahead of time. However, the cost to build and maintain a complete communication system for existing tunnels may not be a cost...
In wireless sensor networks, many studies on data dissemination to individual mobile sinks traditionally rely on a strategy that consists of a virtual infrastructure to serve current location of the mobile sinks and a per-sink foot-print chaining mechanism to support local mobility after location update. To adapt the strategy for supporting mobile sink groups, it may be simply considered to exploit...
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,...
The big challenge of routing in opportunistic mobile networks, overlooked by most researchers, is to not only find any path to the destination, but a path that is stable and powerful enough to actually carry the message. Few attempts addressed this problem, all of them under controlled scenarios, avoiding the complexity of real-world connectivity. As a result of our comparison of selected networks...
In this paper, a novel secure routing protocol is proposed for wireless sensor networks in which sensor nodes as well as the base station are mobile. The protocol achieves security property through symmetric key cryptography and threshold key cryptography. An analysis of the security strengths of the protocol is presented. Simulation results show the throughput of the proposed protocol and a comparison...
Rumor Routing is one of the routing algorithm categories in wireless sensor networks which is well extended and optimized in the recent years. Common principal ideas in all rumor routing algorithms are conjunction of query-agents with the traversed path of event information propagator agents in the network. In this paper we propose a new method to reduce the number of routing agents to consequently...
This paper proposes the two extensive data delivery schemes of Query-based PMIPv6 (Q-PMIPv6) and Signalling Query-based PMIPv6 (SQ-PMIPv6) in wireless networks. In the proposed Q-PMIPv6 scheme, when a correspond node (CN) sends the data packet to mobile node (MN), the Mobile Access Gateway (MAG), which CN is attached to, will send the binding query messages to Local Mobility Anchor (LMA) to get the...
Social-based forwarding algorithms provide a new perspective on the study of routing in opportunistic mobile networks, and all of these schemes assume a uniform pattern for message generating rule. However, this is unconvincing due to the heterogeneity of contact rates in human communication patterns. In this paper we propose three social-based communication pattern models and utilize them to evaluate...
This paper presents a cross-platform solution of smartphone-based mobile sink for wireless sensor networks, named uSink. With a cross-platform SD card, named uSD card, any smartphone with SD interface can be empowered with the capability to communicate with wireless sensor nodes. Furthermore, a middleware on mobile phone, named uSinkWare, is also designed to provide a typical mobile sink's functionalities,...
With routing paths being modified after each sink movement, delivering data to a mobile sink in a wireless sensor network (WSN) can be a challenging issue. Updating the sink location with messages to maintain a route frequently could result in great energy consumption in the sensors. Moreover, the number of message collisions is proportional to the control overhead of the sink location update. This...
Delay tolerant networks (DTNs) are a kind of wireless mobile network which may lack continuous network connectivity. Multicast supports the distribution of data to a group of users, a service needed for many potential DTNs applications. While multicasting in the Internet and mobile ad hoc networks has been studied extensively, due to the unique characteristic of frequent partitioning in DTNs, multicasting...
In order to provide communication service in the Intermittently Connected Mobile Networks (ICMN) where there is only intermittent connectivity between mobile nodes, a variety of epidemic-style routing algorithms have been proposed to achieve high message delivery probability. However, current works do not address the realistic environment that a message is split into multi frames to be transmitted...
We propose and analyze a class of trust management protocols for encounter-based routing in delay tolerant networks (DTNs). The underlying idea is to incorporate trust evaluation in the routing protocol, considering not only quality-of-service (QoS) trust properties (connectivity) but also social trust properties (honesty and unselfishness) to evaluate other nodes encountered. Two versions of trust...
Route optimization for nested Mobile Network is an important issue of Network Mobility (NEMO), and prefix delegation is one of the promising optimization schemes. However, the policy of prefix delegation is seldom discussed when this technology is applied in nested NEMO. The problems that may be encountered when applying the basic prefix delegation to nested NEMO are analyzed and identified, and a...
In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by petrol and/or electricity, the total travel distance of the mobile sink should be bounded. To minimize the data loss during the transition of the mobile sink from its current location to its next location, its moving distance...
In this paper, we introduce the stable path topology control problem for link-state routing in mobile multi-hop networks. We formulate the topology control problem of selective link-state broadcast as a graph pruning problem with restricted local neighborhood information. We develop a multi-agent optimization framework where the decision policies of each agent are restricted to local policies on incident...
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.