Search results for "ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS"
showing 10 items of 449 documents
Location of high speed rail stations in French medium-size city and their mobility and territorial implications
2009
International audience; In France, the extension of High Speed Rail network has come with the creation of new stations and a diversification of territorial configurations in which the stations fit. If the reduction in travel time allowed by high speed train increases mobility and contributes to the economic development of metropolitan areas, the implications of these stations on local mobility and territorial development depend on the station's location. The example of midsized cities allows us to analyze the part played by the location of stations in spatial organization. The impact of HST on local mobility and territorial development differed depending on whether the metropolitan area is …
Inventer et errer au XVIIIe siècle
2014
os nat; National audience; no abstract
Improving IEEE 802.11 Performance in Chain Topologies through Distributed Polling and Network Coding
2009
Wireless multi-hop networks often rely on the use of IEEE 802.11 technology. Despite of the robustness of the IEEE 802.11 Distributed Coordination Function (DCF) for working in various network scenarios, it has been proven that critical inefficiencies can arise in the case of multi-hop packet forwarding. In this paper, we propose a MAC scheme, based on the virtualization of the Point Coordination Function, optimized for working on chain topologies with bidirectional traffic flows. Our scheme is based on a token-like access mechanism coupled with network coding. The basic idea is the use of multiple Point Coordinators (PCs) along the node chain, which are elected by passing special token fra…
Medium access in WiFi networks: strategies of selfish nodes [Applications Corner]
2009
This article provides a game theoretical analysis of the WiFi MAC protocol to understand the risks or the advantages offered by possible modifications of MAC functionalities implemented at the driver level.
Optimization of the Relay Selection Scheme in Cooperative Retransmission Networks
2011
Cooperative MAC protocol design has attracted much attention recently thanks to the development of relaying techniques. In single-relay C-ARQ, the relay selection scheme cannot work efficiently in a dense network, due to high collision probability among different contending relays. In this paper, the throughput performance impairment from the collision is analysed in a typical network scenario. Thereby, we propose an optimized relay selection scheme aiming at maximizing system throughput by reducing collision probability. The throughput performance enhancement by the proposed optimal relay selection scheme is verified by simulations.
Lightweight Relay Selection in Multi-Hop Wake-Up Radio Enabled IoT Networks
2018
Wake-up Radios (WuRs) are becoming more popular in Internet of Things (IoT) networks owing to their overwhelming advantages such as low latency, high energy saving, and on-demand communication. In a multi-hop WuR-IoT network, route establishment between source and destination prior to actual data communications consumes a significant portion of energy. To reduce energy consumption and protocol overhead for route establishment, we propose a lightweight relay (LR) selection scheme, referred to as LR-WuR, where a lookup table and acknowledgment are used for next hop relay selection. We develop an analytical model to evaluate the performance of LR-WuR. Extensive simulations are performed to val…
Performance Analysis of M-Ary PSK Modulation Schemes over Multiple Double Rayleigh Fading Channels with EGC in Cooperative Networks
2010
This article studies the performance of M-ary phase shift keying (PSK) modulation schemes over mobile-to-mobile (M2M) fading channels with equal gain combining (EGC) in cooperative networks. The frequency-nonselective M2M fading channels are modeled assuming non-line-of-sight (NLOS) propagation conditions. Furthermore, a dual-hop amplify-and-forward relay type cooperative network is taken into consideration here. It is assumed that K diversity branches are present between the source mobile station and the destination mobile station via K mobile relays. The performance of M-ary PSK modulation schemes is analyzed by evaluating the average bit error probability (BEP). We have derived a simple …
Multi-Antenna Covert Communication With Jamming in the Presence of a Mobile Warden
2021
Covert communication can hide the information transmission process from the warden to prevent adversarial eavesdropping. However, it becomes challenging when the warden can move. In this paper, we propose a covert communication scheme against a mobile warden, which maximizes the connectivity throughput between a multi-antenna transmitter and a full-duplex jamming receiver with the covert outage probability (COP) limit. First, we analyze the monotonicity of the COP to obtain the optimal location the warden can move. Then, under this worst situation, we optimize the transmission rate, the transmit power and the jamming power of covert communication to maximize the connection throughput. This …
Improving Chord Lookup Protocol for P2PSIP-Based Communication Systems
2009
Chord has been suggested as mandatory overlay technology in the future P2PSIP-based communication systems. Chord allows for the available peer/resource lookup in no more than hops, where N is the total number of the peers in the overlay network. However, as a protocol originally designed for background downloading applications, Chord has a few drawbacks when supporting P2PSIP real-time communication systems. These drawbacks are related to ID assignment, the relation between ID and physical location, the routing styles and lack of cache, etc. In this paper, we investigate several approaches that can improve the efficiency of the peer/resource lookup algorithm. After that, we simulate two sys…
Joint routing and per-flow fairness in wireless multihop networks
2008
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 unfair throughput allocation. Although TDMA seems to be a more promising solution, careful transmission scheduling is needed in order to achieve error-free communication and fairness. In our previous work, a TDMA scheduling algorithm has been proposed that schedules the transmissions in a fair m…