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.
Caching of popular content on wireless nodes is recently proposed as a means to reduce congestion in the backbone of cellular networks and to improve Quality of Service. From a network point of view, the goal is to offload as many users as possible from the backbone network to the wireless caches while at the same time offering good service to cache-unrelated users. Aggressive offloading can lead...
In geographical network systems, face routing is the unique recovery solution for local minimum problem. A node in local minimum could not choose its neighbor node closer to the destination. Since the face routing is based on novel graph named planar graph, the nodes search a link between adjacent nodes in the graph and send their data via the link. During the planarization of the topology, many links...
Adhoc wireless networks are defined as the category of wireless networks that utilize multihop radio relaying and are capable of operating without the support of any fixed infrastructure and hence they are also called infrastructureless networks. This type of network allows for spontaneous communication without previous planning between mobile devices. A variety of routing protocols for adhoc wireless...
In this paper, we define a collision area in a heterogeneous cellular network for the purpose of interference management between Device-to-Device (D2D) and conventional cellular (CC) communications. Currently, most D2D routing algorithms assume synchronized accurate location knowledge among users and the base stations. In reality, this level of location accuracy is difficult and power consuming in...
One of the dominant approaches in coping with the intermittent connectivity of opportunistic networks is packet replication. However, the need for a distributed operation forces the nodes carrying a message copy to make replication decisions without taking into account the replication state of other nodes. This strategy can lead to the creation of an excessive number of replicas thus exhausting the...
In this paper, we discuss the cross-layer network resource allocation scheme for video services in multi-radio multichannel (MRMC) networks. Since video services include a large amount of traffic to transmit, compared with single-radio singlechannel (SRSC) networks, MRMC networks could provide more network resource to support the large video traffic. However, MRMC networks also require more delicate...
This paper analyses two techniques that mitigate the routing misbehavior in wireless ad hoc network, watchdog & pathrater. By reconstructing the watchdog, we eliminate the collision problem which tends to be the weakness of this mechanism and make this algorithm have an better performance in mitigating routing misbehavior in wireless ad hoc network.
We consider the network with two kinds of traffic: inelastic and elastic traffic. The inelastic traffic requires fixed throughput, high priority while the elastic traffic has controllable rate and low priority. Giving the fixed rate of inelastic traffic, how to inject the elastic traffic into the network to achieve the maximum utility of elastic traffic is solved in this paper. The Lagrangian Duality...
We derive asymptotic expressions for the probability mass function (PMF) of the number of hops (a.k.a hop-count distribution) required to reach a designated distance D in random, connected and uniformly distributed one- and two-dimensional ad hoc networks. The elegance of the result is owned to the application of Renewal Theory, a generalization of Poisson processes. The method is general, requiring...
A key issue impacting wireless network performance is network information. In wireless networks, a significant amount of bandwidth and power resource is consumed to disseminate and maintain routing information. Previous work has presented different methods to broadcast and store such routing information so as to reduce the overhead. However, the amount of information required for a routing algorithm...
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.