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.
Recently, wireless mesh networks have been proposed as a mechanism to provide alternative broadband wireless internet access. The usage of multiple radios transmitting at diverse frequency bands allows a significant increase in the capacity of such networks. However, popular Hybrid Channel Assignment strategies, which use a fixed interface for receiving and a switchable interface for transmitting...
In wireless sensor networks, it is important to minimize energy consumption of the sensor nodes. Energy consumption of sensor nodes can be reduced explicitly by making sensors sleep when they are idle. In this paper, we consider a single wake-up periodic schedule in that the sensor wakes up in one slot out of k slots. This results in every sensor node having a duty cycle of 1/k on an average. However,...
Increasing the capacity of wireless mesh networks has motivated numerous studies. In this context, link scheduling has been one of the most investigated mechanisms. However, the isolated use of scheduling mechanisms does not guarantee a significant increase in capacity independently of the routes followed by traffic. For this reason, the use of cross-layer optimization techniques involving joint use...
The maintenance of communication systems is a critical operation which monopolizes human and network resources. The management of multiple, parallel maintenance jobs is a complex task that can generate faults and undesirable service interruption. In the context of IP/MPLS networks, Graceful Restart mechanisms allow, under strict conditions, the maintenance of a single router without impacting its...
The success of wireless mesh networks hinges on their ability to support bandwidth intensive, multi-media applications. A key approach to increasing network capacity is to equip wireless routers with smart antennas. These routers, therefore, are capable of focusing their transmission on specific neighbors whilst causing little interference to other nodes. This, however, assumes there is a link scheduling...
Energy conservation is drawing increasing attention in data networking. One school of thought believes that a dominant amount of energy saving comes from turning off network elements. The difficulty is that transitioning between the active and sleeping modes consumes considerable energy and time. This results in an obvious trade-off between saving energy and provisioning performance guarantees such...
This paper proposes a topology-based hierarchical scheduling scheme using deficit round robin (DRR). The main idea of the topology-based hierarchical scheduling is to map the topology of the connected network into the logical structure of the scheduler, and combine several token schedulers according to the topology. The mapping process could be completed through the network management plane or by...
We present a distributed algorithm for identifying the location of data centers and their relative sizes. This topology information can be used in P2P systems to improve the routing performance, replica placement, or job scheduling. The algorithm uses gossiping with local agglomerative clustering. It is robust to failures and it correctly identifies outliers that are caused, e.g., by temporarily overloaded...
This paper addresses offline virtual topology design in transparent optical networks under given periodic traffic. We call this planning problem ldquoScheduled Virtual Topology Designrdquo. Two problem variants are considered: for a network based on non-reconfigurable equipment and for a network based on reconfigurable equipment. Two MILP (Mixed Integer Linear Program) formulations are proposed, one...
In a wireless sensor network, given a routing tree for data gathering from individual nodes to the sink node, this paper presents a simple, distributed algorithm for assigning time slot to each node for conflict-free communication, such that the maximum latency in data gathering at the sink is minimized. It requires just a one-time computation during the initialisation of the network provided the...
Opportunistic routing is a new design trend of wireless routing, which can dramatically improve the end-to-end throughput over traditional routing by judiciously utilizing the broadcasting nature of wireless network. However, the global scheduling scheme it adopts restricts its application in large-scale wireless network, due to the big waste of the end-to-end transmission latency and the computation...
Energy conservation is a critical issue regarding wireless mobile ad hoc networks, since the nodes are battery restrained and the depletion of their power defines the lifetime of the network. This paper presents the PAST-EnDRoP: position aided spatial TDMA (PA-STDMA) MAC protocol with Energy and delay constrained routing for mobile ad hoc networks. It is a novel approach designed for optimized channel...
In wireless mesh networks (WMNs), TDMA based link schedulingcan allow multiple concurrent transmissions, resulting in throughput improvements. In this paper, we identify certain link characteristics which reduce achieved spatial reuse and increase schedule length. It is shown that certain links (called loners) based on their length and position, introduce inherent difficulty in scheduling them with...
In Peer-to-Peer (P2P) networks if adversaries such as Sybil attackers have got most identities in the network, they will control routing table or traffic. In this paper, we propose a framework based on two complementary techniques to defense malicious node after they transmit data to other malicious peers instead of honest peers. The first approach, based on behaviors of destination nodes, is used...
In multi-hop infrastructure wireless mesh networks (WMNs), the association mechanism, by which a client station (STA) affiliates with a mesh access point (MAP), and the routing algorithm, through which MAPs form a multi-hop backhaul for relaying STAs' traffic, determine a two-tier logical topology. Apparently the STA-MAP association mechanism and the backhaul routing impact the available bandwidth...
In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a major impact on the capacity provided to the clients. A cross-layer optimization of these problems allows the routing to take into account contentions due to radio interferences. We develop exact linear programs and provide an...
We consider the problem of exchanging packets from the individual queues at multiple wireless terminals with the assistance of a single relay node. In an earlier paper, we studied this for a backlogged traffic model, where each node always had packets to transmit. Here, we consider stochastically varying packet traffic and compare the stable operation under plain routing, and digital and analog network...
In wireless multihop networks communication between two end-nodes is carried out by hopping over multiple short wireless links. Traditional CSMA/CA based media access control does not work satisfactory in a multihop scenario, since an intended target of a communication may be subject to mutual interference imposed by concurrent transmissions from nodes which cannot directly sense each other, causing...
Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorithms for networks with primary- or secondary-interference constraints have been developed. Due to their distributed operation, these algorithms can achieve only a guaranteed fraction of the maximum possible throughput. It was also recently...
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.