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.
Software Defined Networks split the data plane from the control plane. They can be used in wireless networks and will bring flexibility, less interference, simple management, less energy consumption and load balancing. They can also improve service quality, handover and mobility between different service providers. In previous methods, when link states were changed the controller deleted the stored...
Real-time video services are usually delay sensitive and have strict constraints on the transmission reliability, which poses challenges to live video streaming over multi-hop wireless networks, since the unpredictable packet losses and network congestions caused by time-varying wireless channels greatly degrade the received video quality. To address this, in this paper, we propose a reinforcement...
The route recovery algorithm is a crucial part of an ad hoc routing protocol. Designing an efficient and fast route recovery mechanism scheme without incurring extra overheads or delays to repair the broken link is a desirable goal for any routing protocol. The route recovery algorithm in reactive routing protocols like AODV occurs only after a link failure is detected. However, we propose a new route...
We present two geometric routing algorithms that reliably deliver messages to all devices in a geocast region. One algorithm is based on flooding, the other on concurrent geometric routing. They are the fist known stateless geocasting algorithms. We formally prove the algorithms correct, evaluate their performance through abstract and concrete simulation and estimate their message complexity.
In this work we investigate the performance of Ad-hoc on-demand distance vector routing (AODV), Dynamic source routing (DSR), Temporary ordered routing (TORA), Optimized link state routing (OLSR) and Geographic routing (GRP) protocols in wireless ad-hoc networks by using OPNET simulation program. In ad-hoc networks consisting of fixed and mobile stations, routing protocols are compared for different...
Development of wireless network technology to support various types of information services continues to increase especially in video streaming services. Video transmission especially in Mobile Ad Hoc Network (MANET) environment used in this research, particularly in the Combined Scalable Video Coding (CSVC) scheme which is a development of H.264 / MPEG-4. The contribution of this research focuses...
The individual applications of network coded opportunistic routing and successive interference cancellation have been proven with significant improvement on throughput performance of wireless multi-hop networks, but there lacks practical optimization on their combination application. Based on a TDMA system, this paper models the throughput maximization as network utility function maximization problem...
By decoupling the control plane from the data plane and providing programmability for network applications, software-defined network (SDN) is positioned to offer more efficient management, higher flexibility and better performance. Routing and resource allocation are two closely related applications in wireless networks. With close cooperation, better performance and lower complexity can be achieved...
The loose coupling and the inherent scalability make publish/subscribe systems an ideal candidate for event-driven services for wireless networks using low power protocols such as IEEE 802.15.4. This work introduces a distributed algorithm to build and maintain a routing structure for such networks. The algorithm dynamically maintains a multicast tree for each node. While previous work focused on...
We consider the problem of throughput-optimal packet dissemination, in the presence of an arbitrary mix of unicast, broadcast, multicast and anycast traffic, in a general wireless network. We propose an online dynamic policy, called Universal Max-Weight (UMW), which solves the above problem efficiently. To the best of our knowledge, UMW is the first throughput-optimal algorithm of such versatility...
Wireless networks can be categorized into infrastructure and infrastructure-less based on the network formation and architecture. Mobile Ad-hoc Networks are infrastructure-less networks with self-configuring property having a dynamic topology where nodes are free to move in any direction, due to this topological changes there are increased chances of link breaks in the network giving rise to path...
We analyze topological entropy in wireless networks that are subject to local scattering and macroscopic shadowing effects. To this end, we model a network as a random geometric graph with probabilistic pair connections (due to channel randomness) and define uncertainty as the Shannon entropy of the underlying graph ensemble. We present new bounds on topological entropy that are functionals of the...
This paper is concerned with the design of routing protocol capable of congestion mitigation for drone-cells communication networks where drone-cells remain stationary in the sky as relays. All of the (distance or hop-count based) existing routing protocols can perform well when the network is lightly loaded. Once the network is heavily loaded, a large number of packets might be backlogged in queues...
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...
We introduce a model of Poisson patterns of fixed and mobile nodes on lines designed for urban wireless networks. The pattern obeys to "Hyperfractal" rules of dimension larger than 2. The hyperfractal pattern is best suitable for capturing the traffic over the streets and highways in a city. We show that the network capacity under ad hoc routing algorithms scales much better than with the...
With the vision of the internet of things (IoT), it is expected that wireless networks will grow, concentrate and traffic carried will increase in the future. In wireless networks, multi-hop communication can be used instead of single-hop communication that we are accustomed today. Multi-hop communication is known to provide enhanced goodput performance for large and dense wireless networks under...
Wireless sensor network(WSN) contains a number of sensor nodes distributed in the sensor field. Sensor nodes gather information from the environment, process them and then transmit data to the sink node. To send data from the source node to sink node require efficient routing algorithm. This routing algorithm plays important role in WSN is to finding a reliable path for a data transmission in the...
In this paper, we propose an interference-aware multicast routing scheme for a single-radio Wireless Mesh Networks carrying multiple multicast flows. We focus on multicast routing over WMNs with stationary nodes, such as community wireless networks. We present a new metric that is based on three components: Path Interference Cost (Ip), Broadcast Benefit Factor (BF), and Hop Count (HC). We proposed...
In this paper, we study the problem of jointly routing and scheduling traffic in an energy harvesting network. To this end, we leverage stochastic dual descent methods to propose a generalization of the well-known backpressure algorithm to energy harvesting networks. We name this policy energy harvesting backpressure (EH-BP) and show that it satisfies the fundamental property of backpressure-type...
The opportunistic networks are the variants of Delay Tolerant Networks (DTNs). These networks can be useful for routing in places where there are few base stations and connected routes for long distances. In an opportunistic network, when nodes move away or turn off their power to conserve energy, links may be disrupted or shut down periodically. These events result in intermittent connectivity. When...
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.