Search results for "Node"
showing 10 items of 1701 documents
Resource sharing optimality in WiFi infrastructure networks
2009
In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios. Assuming that a contending node can dynamically change its strategy, by tuning its contention parameters to non-standard values on the basis of channel observations, we prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium condi…
Performance analysis of selfish access strategies on WiFi infrastructure networks
2009
In this paper we propose a game-theoretic approach for characterizing WiFi network performance in presence of intelligent nodes employing cognitive functionalities. We assume that a cognitive WiFi node is aware of its application requirements and is able to dynamically estimate the network status, in order to dynamically change its access strategy by tuning the contention window settings. We prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium conditions, which are also Pareto optimal. Indeed, we show that the station strategies converge toward values which maximize a per-node uti…
A convolutional neural network framework for blind mesh visual quality assessment
2017
In this paper, we propose a new method for blind mesh visual quality assessment using a deep learning approach. To do this, we first extract visual representative features by computing locally curvature and dihedral angles from each distorted mesh. Then, we determine from these features a set of 2D patches which are learned to a convolutional neural network (CNN). The network consists of two convolutional layers with two max-pooling layers. Then, a multilayer perceptron (MLP) with two fully connected layers is integrated to summarize the learned representation into an output node. With this network structure, feature learning and regression are used to predict the quality score of a given d…
A Scheme for Secure and Reliable Distributed Data Storage in Unattended WSNs
2010
Unattended Wireless Sensor Networks (UWSNs) operated in hostile environments face a risk on data security due to the absence of real-time communication between sensors and sinks, which imposes sensors to accumulate data till the next visit of a mobile sink to off-load the data. Thus, how to ensure forward secrecy, backward secrecy and reliability of the accumulated data is a great challenge. For example, if a sensor is compromised, pre-compromise data accumulated in the sensor is exposed to access. In addition, by holding key secrecy of the compromised sensor, attackers also can learn post-compromise data in the sensor. Furthermore, in practical UWSNs, once sensors stop working for accident…
Cooperative or non-cooperative transmission in synchronous DC WSNs: A DTMC-based approach
2017
Cooperative transmission (CT) enables balanced energy consumption among sensor nodes and mitigates the energy hole problem in wireless sensor networks (WSNs). In typical CT enabled medium access control (MAC) protocols, a source node decides to trigger CT or not based on a residual energy comparison between itself and its relay node. In this paper, we propose a receiver initiated CT MAC protocol, in which the receiving node makes the decision on initiating CT or not based on a tradeoff between performing CT and non-CT. In this way, nodes can avoid idle listening and achieve an extended lifetime. A discrete-time Markov chain (DTMC) model is developed to analyze the performance of CT associat…
Maximum Lifetime of the Wireless Sensor Network and the Gossip Problem
2018
In the gossip problem each node of the graph G possesses a unique piece of information - the gossip message. A sequence of one-way or two-way communications between pair of nodes is made to spread the messages so that any node of the graph knows all the gossips. The question is, what is the minimum number of calls between pairs of nodes needed to exchange all gossip messages? The solution to the two-way communication gossip problem is that \(2N-4\) calls (\(N\ge 4\)) suffice if and only if the graph contains a four cycle subgraph. For one-way communication problem the classical results states that in a strongly connected graph \(2N-2\) calls (\(N\ge 4\)) suffice. In this paper we consider t…
A new autonomous data transmission reduction method for wireless sensors networks
2018
International audience; The inherent limitation in energy resources and computational power for sensor nodes in a Wireless Sensor Network, poses the challenge of extending the lifetime of these networks. Since radio communication is the dominant energy consuming activity, most presented approaches focused on reducing the number of data transmitted to the central workstation. This can be achieved by deploying both on the workstation and the sensor node a synchronized prediction model capable of forecasting future values. Thus, enabling the sensor node to transmit only the values that surpasses a predefined error threshold. This mechanism offers a decrease in the cost of transmission energy f…
A continuous-space analytical approach for relay node placement in hybrid cellular and ad hoc networks
2009
A hybrid network is composed of a cellular component and an ad hoc component connected by a relay node, for the purpose of coverage extension and/or capacity improvement. In this paper, we analyze the capacity of such a hybrid network by employing a continuous-space analytical methodology based on circular geometry for uniformly distributed nodes. To achieve maximal overall capacity, the relay node needs to be placed in an optimum location between the base station and the mobile station located at the boundary of the hybrid network. Numerical results show that for obtaining the optimum overall capacity for the hybrid network, the placement of the relay node should be in a range which is nei…
Concilium prouinciale Valentinum, celebratu anno Domini M.D.LXV [Preside Martino Ayala, Archiepiscopo valentino ; Aranzel y tassa ... de los salarios…
1566
Esc. arquebisbal en la port.
Decreta condita in Concilio prouinciale Mediolanensi tertio sub ... Carolo cardinale Borrohomaeo ... : Adiunctae praeterea sunt Pontificiae aliquae c…
1574
Escut episcopal en la port. - Capll. orn.