Results 1 - 10
of
136
CORE: A Collaborative Reputation mechanism to enforce node cooperation
- in Mobile Ad Hoc Networks. Communication and Multimedia Security
, 2002
"... hoc Networks. ..."
A Survey on Position-Based Routing in Mobile Ad-Hoc Networks
- IEEE Network
, 2001
"... We present an overview of ad-hoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. Other than the destination 's position, each node needs to know only its own position and the position of its one-hop neighbors in order to forwar ..."
Abstract
-
Cited by 496 (16 self)
- Add to MetaCart
We present an overview of ad-hoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. Other than the destination 's position, each node needs to know only its own position and the position of its one-hop neighbors in order to forward packets. Since it is not necessary to maintain explicit routes, position-based routing does scale well even if the network is highly dynamic. This is a major advantage in a mobile ad-hoc network where the topology may change frequently. The main prerequisite for position-based routing is that a sender can obtain the current position of the destination. Therefore, recently proposed location services are discussed in addition to position-based packet forwarding strategies. We provide a qualitative comparison of the approaches in both areas and investigate opportunities for future research.
Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks
- ACM/Kluwer Mobile Networks and Applications (MONET
, 2001
"... In military and rescue applications of mobile ad hoc networks, all the nodes belong to the same authority; therefore, they are motivated to cooperate in order to support the basic functions of the network. In this paper, we consider the case when each node is its own authority and tries to maximi ..."
Abstract
-
Cited by 402 (26 self)
- Add to MetaCart
(Show Context)
In military and rescue applications of mobile ad hoc networks, all the nodes belong to the same authority; therefore, they are motivated to cooperate in order to support the basic functions of the network. In this paper, we consider the case when each node is its own authority and tries to maximize the benefits it gets from the network. More precisely, we assume that the nodes are not willing to forward packets for the benefit of other nodes.
The Quest for Security in Mobile Ad Hoc Networks
, 2001
"... So far, research on mobile ad hoc networks has been focused primarily on routing issues. Security, on the other hand, has been given a lower priority. This paper provides an overview of security problems for mobile ad hoc networks, distinguishing the threats on basic mechanisms and on security mecha ..."
Abstract
-
Cited by 348 (12 self)
- Add to MetaCart
So far, research on mobile ad hoc networks has been focused primarily on routing issues. Security, on the other hand, has been given a lower priority. This paper provides an overview of security problems for mobile ad hoc networks, distinguishing the threats on basic mechanisms and on security mechanisms. It then describes our solution to protect the security mechanisms. The original features of this solution include that (i) it is fully decentralized and (ii) all nodes are assigned equivalent roles.
Self-Organized Public-Key Management for Mobile Ad Hoc Networks
- IEEE TRANSACTIONS ON MOBILE COMPUTING
, 2003
"... In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that requ ..."
Abstract
-
Cited by 257 (11 self)
- Add to MetaCart
In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories are not well-suited for securing ad hoc networks. In this paper, we propose a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services. Furthermore, our approach does not require any trusted authority, not even in the system initialization phase.
A Charging and Rewarding Scheme for Packet Forwarding in Multi-hop Cellular Networks
, 2003
"... In multi-hop cellular networks, data packets have to be relayed hop by hop from a given mobile station to a base station and vice-versa. This means that the mobile stations must accept to forward information for the benefit of other stations. In this paper, we propose an incentive mechanism that is ..."
Abstract
-
Cited by 148 (13 self)
- Add to MetaCart
In multi-hop cellular networks, data packets have to be relayed hop by hop from a given mobile station to a base station and vice-versa. This means that the mobile stations must accept to forward information for the benefit of other stations. In this paper, we propose an incentive mechanism that is based on a charging/rewarding scheme and that makes collaboration rational for selfish nodes. We base our solution on symmetric cryptography to cope with the limited resources of the mobile stations. We provide a set of protocols and study their robustness with respect to various attacks. By leveraging on the relative stability of the routes, our solution leads to a very moderate overhead.
Sensor network security: A survey
- IEEE Commun. Surveys Tutorials
, 2009
"... Abstract—Wireless sensor networks (WSNs) use small nodes with constrained capabilities to sense, collect, and disseminate information in many types of applications. As sensor networks become wide-spread, security issues become a central concern, especially in mission-critical tasks. In this paper, w ..."
Abstract
-
Cited by 65 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Wireless sensor networks (WSNs) use small nodes with constrained capabilities to sense, collect, and disseminate information in many types of applications. As sensor networks become wide-spread, security issues become a central concern, especially in mission-critical tasks. In this paper, we identify the threats and vulnerabilities to WSNs and summarize the defense methods based on the networking protocol layer analysis first. Then we give a holistic overview of security issues. These issues are divided into seven categories: cryptography, key manage-ment, attack detections and preventions, secure routing, secure location security, secure data fusion, and other security issues. Along the way we analyze the advantages and disadvantages of
Location Information Services in Mobile Ad Hoc Networks
- In Proceedings of the IEEE International Conference on Communications (ICC
, 2003
"... In recent years, several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume a location service is available that provides location information on the nodes in the network. In this chapter, we survey all the proposed location information ..."
Abstract
-
Cited by 61 (7 self)
- Add to MetaCart
(Show Context)
In recent years, several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume a location service is available that provides location information on the nodes in the network. In this chapter, we survey all the proposed location information services that exist in the literature to date. We classify these location information services into three categories: proactive location database systems, proactive location dissemination systems, and reactive location systems.
Vanet routing on city roads using real-time vehicular traffic information
, 2008
"... This article presents a class of routing protocols called RBVT, Road-Based using Vehicular Traffic information ..."
Abstract
-
Cited by 51 (4 self)
- Add to MetaCart
(Show Context)
This article presents a class of routing protocols called RBVT, Road-Based using Vehicular Traffic information
Home Agent Based Location Update and Destination Search Schemes in Ad Hoc Wireless Networks
, 1999
"... All previously proposed position based routing algorithms for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located (except our previous report [SV]). In [SV], we proposed to reduce significantly the communicat ..."
Abstract
-
Cited by 49 (7 self)
- Add to MetaCart
All previously proposed position based routing algorithms for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located (except our previous report [SV]). In [SV], we proposed to reduce significantly the communication overhead by changing the routing strategy. The source node issues several search 'tickets' (each ticket is a 'short' message containing sender's id and location, destination's best known location and time that location is reported, and constant amount of additional information) that will look for the exact position of destination node. When the first ticket arrives at the destination node D, D will report back to source with brief message containing its exact location, and possibly creating a route for the source. The source node then sends full data message ('long' message) toward exact location of destination. In this paper, we propose to use a home agent based strategy for location u...
