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.
In multiple-relay cooperative wireless networks, opportunistic relaying is a promising scheme, where the most challenging problem is to choose the best relay efficiently. The traditional opportunistic relay selection scheme is based on the channel conditions of source-relay (S-R) and relay-destination (R-D) links. In comparison with conventional narrowband networks, an appealing merit of impulse radio...
In an ad hoc network, due to the absence of centralized infrastructure, the performance of the networks is seriously affected by selfish nodes refusing to forward packets for others. Because of the packet collisions and channel interference, it's not always possible to devise correctly if a given node forwarded a packet for another node or not. In this paper a repeated-game model of nodes cooperation...
Ad hoc networks (AHNs) include mobile nodes with limited communication resources on which the path selection is usually made according to a best effort strategy. Today, AHNs are facing a new challenge: a resources reservation mechanism oriented quality of service. The importance of this challenge makes this issue focused by several researchers. In this paper we propose a flexible QoS reservation mechanism...
In this paper we propose a new client puzzle approach to prevent Denial of Service (DoS) attacks in ad hoc networks. Each node in the network first solves a computational problem and with the solution has to create and solve a client puzzle. By combining computational problems with puzzles, we improve the efficiency and latency of the communicating nodes and resistance in DoS attacks. Experimental...
An identity-based threshold key management scheme without secure channel is proposed for ad hoc network. The master private key, which is shared among all nodes by the Shamir's secret sharing scheme, is produced by all nodes when network is formed. The nodes' public keys are derived from their identities. In order to get the private key, each node needs to prove their identity to distributed CAs using...
GCS-AODV (Game theory and Cryptology based Secure AODV), a lightweight secure AODV protocol based on game theory and cryptology is proposed. One-hop neighbor detection is integrated into route maintenance phase, without any communication overhead. Forward game and ring expanding search solve the scalability problem. Normandy game is utilized to select the secure route. Message authentication code...
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.