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.
A society is typically driven by an economic model to manage demand, debt and distribution that is virtually analogous to the management of data, resources and routing in WSNs. In this paper, the application of such a socio-economic model is formalised as a framework to optimise resource utilisation and collaboration among sensor nodes. A specifically designed simulation platform (WSNSim) has been...
Due to the wide application fields, many people research Wireless Sensor Networks(WSNs). Currently, more and more researchers focus on the existence of selfish nodes which do not cooperate in routing and forwarding. Traditional methods need too much resource or do not adapt to menace from inner of network. In this paper, we propose a reliable routing model against selfish nodes. Game theory is used...
Live monitoring of athletes during sporting events can help maximise performance while preventing injury, and enable new applications such as referee-assist and enhanced television broadcast services. A major challenge is the extraction of athlete physiological data in real-time, since the radio range of body-worn sensor devices is limited, necessitating multi-hop routing mechanisms. However, little...
In this paper, a "Game Theory" approach for finding an optimal path in a "Wireless Sensor Network" is discussed. WSN is one of the most interesting research fields in the communication networks, and is the center of attention in recent years. In our model, a pricing and payment technique is presented to obtain an optimal path in a WSN by considering reliability, energy and traffic...
Wireless multimedia sensor networks (WMSNs) models emphasize QoS guarantee. We provide QoS guarantee to measure the qualitative performance of QoS routing model, such as bandwidth, delay and delay jitter. A path that satisfies with the QoS is found by the Directed Diffusion (DD) algorithm in this paper, and an incomplete information game routing model is presented under this condition. We show that...
Wireless multimedia sensor networks are often used to transfer large amount of data such as audio, video and image, and to process complicated tasks. In recent years, the interest in WMSNs are growing dramatically. An algorithm of multicast routing based on genetic algorithm(GA) is presented in this paper. This algorithm provides multiple QoS guarantee, such as bandwidth, delay and delay jitter. The...
In this paper, a distributed algorithm for the construction of load balanced routing trees in wireless sensor networks is proposed with the goal of prolonging network lifetime. The proposed method, called UDBC, achieves load balancing by adjusting the number of children among parents as much as possible. Child adjustment is considered as a game between parents and child nodes by defining their utility...
In this paper, we formulate multi-channel assignment in Wireless Sensor Networks (WSNs) as an optimization problem and show it is NP-hard. We then propose a distributed Game Based Channel Assignment algorithm (GBCA) to solve the problem. GBCA takes into account both the network topology information and transmission routing information. We prove that there exists at least one Nash Equilibrium in the...
In this paper, we propose an efficient bottleneck throughput maximizing routing framework for correlated data gathering in wireless sensor networks. Our proposed routing metric exploits the the data correlation present in sensor networks. For throughput-maximizing correlation aware routing, a game theoretic framework is developed for a local solution of the NP-complete optimization problem. The proposed...
We consider the problem of incentive compatible topology control for selfish all-to-one (reverse multicast) routing as modeled by a locally minimum cost forwarding game, with new focus in this work on efficient local implementability in the absence of complete global information for realistic scenarios. In this work we consider a new locally computable heuristic ??recommendation algorithm??, which...
In this paper, we propose an efficient routing solution for correlated data collection in wireless sensor networks. Our proposed routing metric considers both the interference distribution as well as the data correlation when establishing routes. An iterative, distributed solution based on local information is proposed using a game theoretic framework. Routes are chosen to minimize both the interference...
The QoS routing problem of wireless multimedia sensor networks has great challenging. A notion using routing game and ant colony algorithm to solve this problem is proposed in this paper. A mixed strategy routing game model is proposed too, and proves the routing game has Nash equilibrium. In the routing game, we used the probabilities which are calculated on the basis of the pheromone trails left...
The multi-constrained QoS-based routing problem of wireless multimedia sensor networks is an NP hard problem. Genetic algorithms (GAs) have been used to handle these NP hard problems in wireless networks. Because the crossover probability is a key factor of GAs' action and performance, and affects the convergence of GAs, and the selection of crossover probability is very difficult, so we propose a...
Traditional networks are built on the assumption that network entities cooperate based on a mandatory network communication semantic to achieve desirable qualities such as efficiency and scalability. Over the years, this assumption has been eroded by the emergence of users that alter network behavior in a way to benefit themselves at the expense of others. At one extreme, a malicious user/node may...
This contribution proposes and investigates a random access Medium Access Control (MAC) - Relay Selection Mechanism - for cluster-based geographic routing in Multi-hop Wireless Sensor Networks (WSNs). The intertwined MAC and network routing solution is derived in a cross-layer approach. The game-theoretical relay selection strategy (random multiple access) relies on well-known descending pricing auctions...
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.