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.
A hybrid wireless network combines a mobile ad-hoc network and an infrastructure network. Efficient and reliable data routing is important for high throughput in such networks. Existing routing schemes that simply combine ad-hoc and infrastructure routings inherit the drawbacks of ad-hoc routing and fail to take advantage of the infrastructure for high efficiency. Current reputation systems relying...
Beaconless position-based forwarding protocols have recently evolved as a promising solution for packet forwarding in wireless sensor networks. Quite a few variants of this class of forwarding protocols have been proposed over the years. One common observation is that they have all been evaluated from the perspective of a single node. Although useful, but a solid understanding of the end-to-end performance...
In this paper we examine opportunistic content distribution. We design and evaluate a caching strategy where a node will fetch and share contents on behalf of other nodes, although the contents are not of its own interest. We propose three caching options for improving the use of network resources: relay request on demand, hop-limit, and greedy relay request. The proposed strategies are implemented...
In order to overcome the phenomenon that the existence of end-to-end path is no longer guaranteed because of intermittent connection in the opportunistic network, it is desirable to employ a special node called ferry, which moves in a specific trace and forwards data for disconnected nodes, to provide communication opportunities. In this paper, Global Ferry Scheme (GFS), which exploits multiple local...
In this paper, we study the multicast capacity-delay tradeoff of a wireless network consisting of mobile wireless nodes and base stations. base stations are regularly placed in a square region and is the number of mobile nodes in the network. We assume that mobile nodes move according to an independent and identical distributed (i.i.d.) pattern and each desires to send packets to ...
In this paper, we study the capacity and delay scaling laws for cognitive radio networks (CRN). The primary network consists of static, randomly and evenly distributed primary users (PUs), which require high throughput with low delay. The secondary network consists of $m=O(n^{1+\delta})$ randomly and evenly distributed cognitive secondary users (SUs) with $\delta>0$, which move in different area...
Incremental relaying (IR) is known to improve the spectral efficiency of cooperative communication by using the destination feedback. In IR, the relay nodes are employed to assist the source transmission only if it is failed. When the relay nodes perform demodulate-and-forward (DmF), all of them are eligible to forward the source information. This is different from decode-and-forward (DF), where only...
We propose in [1] a collaborative broadcast scheme for wireless networks, which applies the Uncoordinated Frequency Hopping (UFH) technique to counteract jamming and exploits node cooperation to enhance broadcast efficiency. In this scheme, some nodes that already obtain the broadcast message are selected to relay the message to other nodes. In this paper, we extend the study to the generalized multihop...
With the tremendous increase in mobile data traffic, system capacity considerations are no longer the primary and only concern to optimize for in cellular networks. The step increase in utilization of cellular networks not only has shorten the recharging cycle of mobile terminals but has further caused a considerable rise in the operators' energy bill. It has therefore become imperative for the sustainable...
We consider the problem of energy-efficient transmission in multi-flow multihop cooperative wireless networks. Although the performance gains of cooperative approaches are well known, the combinatorial nature of these schemes makes it difficult to design efficient polynomial-time algorithms for joint routing, scheduling and power control. This becomes more so when there is more than one flow in the...
This work is motivated by network applications that require nodes to disseminate their state to others. In particular, vehicular nodes will host applications that periodically disseminate time-critical state across the network to help improve on-road safety. In this work, we want to minimize the average age of state information that a node observes from any other node in networks with hundreds to...
The reliability of traffic flows is a serious challenge to cognitive radio networks due to the interruptions from primary users. A backup path scheme is proposed to protect the secondary user traffic flows against the interruptions from primary users. In such a scheme, the traffic flow can be switched to a backup path if the working path is interrupted by primary users. When primary users leave, the...
Among the "store-carry-forward" kind of protocols, the two-hop relay and its variants have become a class of attractive routing protocols for the mobile ad hoc networks (MANETs) due to its efficiency and simplicity. This paper focuses on the performance modeling for two-hop relay with erasure coding, a promising technique for improving the delay performance of conventional two-hop relay...
Delay tolerant networks (DTNs) characterise a class of emerging networks that suffer from frequent and long-duration partitions. As the storage-carry-forward paradigm is adopted to transfer messages in DTNs, buffer management schemes greatly influence the performance of routing protocols when nodes have limited buffer space. From a network-wide viewpoint, the excessive increase of a single message's...
Landmark-based routing (LR) provides a promising approach for scalable point-to-point routing in wireless sensor networks (WSNs). Though various approaches have been proposed for landmark-based routing, they either introduce significant computational complexity or are inefficient in realistic, dynamic environments. In this paper, we identify three design principles that could form the basis of efficiency:...
In this paper, we consider a wireless cellular network capable of supporting Machine-to-Machine (M2M) applications. According to the recent IEEE 802.16p proposals, a wireless M2M device may act as an aggregation point and communicate data packets on behalf of the other M2M devices, which may lack a cellular interface or have a poor communication link to the network. We propose a client relay scheme...
Delay/Disruption Tolerant Network (DTN) differs from the conventional networks in that it has no continuous or contemporaneous connections among wireless nodes. Its inherent characteristic of intermittent connections makes existing routing solutions hardly to be applied directly. Epidemic routing using random linear network coding has been studied and proved as an efficient way for light data delivery...
When designing routing protocols for space-based networks, we must take into consideration the unique characteristics of such networks. Since space-based networks are inherently sparse with constrained resources, one needs to design smart routing algorithms that use the resources efficiently to maximize network performance. In Space Exploration Missions, the trajectories and orbits of spacecraft are...
In this paper, we present a cooperative transmission approach to reduce the end-to-end delay in the context of AODV based multi hop wireless networks. The underneath idea is to effectively increase the average reach of each hop so that data packets can arrive at the destination in less number of hops with lower end-to-end delay. The existing approaches of increasing transmitted power are not effective...
We show that the performance of relay selection can be improved by employing relays with buffers. Under the idealized assumption that no buffer is full or empty, the best source-relay and the best relay-destination channels can be simultaneously exploited by selecting the corresponding relays for reception and transmission, respectively. The resulting relay selection scheme is referred to as max-max...
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.