Position-based routing was originally developed for packet radio networks in the 1980s [6]. It received renewed interest during the last few years as a method for routing in mobile wireless ad hoc and sensor networks [1, 2, 4]. The general idea of is to select the next hop based on position information such that the packet is forwarded in the geographical direction of the destination. Position-based routing can be divided into two main components: the location service and position-based forwarding. The location service [5, 13] is used for mapping the unique identifier (for example an IP address) of a node to its geographical position. In mobile ad hoc networks, providing accurate location service for position based routing, with low communication overhead, appears to be more difficult task than routing itself [13]. In case of sensor networks, however, destination is a sink or base station whose position is made available to source sensors by flooding. Position-based forwarding is performed by a node to select one of its neighbors as the next hop the packet should be forwarded to. Usually, the following information is required for the forwarding decision: the node's own geographical position, the position of all neighbors within transmission range and the position of the destination. Based on this information, the forwarding node selects one of its neighbors as the next hop such that the packet makes progress toward the geographical position of the destination.

Mobile Ad hoc NETworks (MANETs) has attracted great research interest in recent years. A Mobile Ad Hoc Network is a self-organizing multi-hop wireless network where all hosts (often called nodes) participate in the routing and data forwarding process. The dependence on nodes to relay data packets for others makes mobile ad hoc networks extremely susceptible to various malicious and selfish behaviors. This point is largely overlooked during the early stage of MANET research. Many works simply assume nodes are inherently cooperative and benign. However, experiences from the wired world manifest that the reverse is usually true; and many works [3] [10] [9] [8] [12] [19] have pointed out that the impact of malicious and selfish users must be carefully investigated. The goal of this research is to address the cooperation problem and related security issues in wireless ad hoc networks. As a rule of thumb, it is more desirable to include security mechanisms in the design phase rather than continually patching the system for security breaches. As pointed out in [2] [1], there can be both selfish and malicious nodes in a mobile ad hoc network. Selfish nodes are most concerned about their energy consumption and intentionally drop packets to save power. The purpose of malicious nodes, on the other hand, is to attack the network using various intrusive techniques. In general, nodes in an ad hoc network can exhibit Byzantine behaviors.

The Home Networking Conference 2007 provided an international technical forum for experts from industry and academia everywhere in the world to exchange ideas and present results of ongoing researches in home networking. The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. Proceedings and post-proceedings of referred international conferences in computer science and interdisciplinary fields are featured.

The Home Networking Conference 2007 provided an international technical forum for experts from industry and academia everywhere in the world to exchange ideas and present results of ongoing researches in home networking.

The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. The scope of the series includes: foundations of computer science; software theory and practice; education; computer applications in technology; communication systems; systems modeling and optimization; information systems; computers and society; computer systems technology; security and protection in information processing systems; artificial intelligence; and human-computer interaction. Proceedings and post-proceedings of referred international conferences in computer science and interdisciplinary fields are featured. These results often precede journal publication and represent the most current research. The principal aim of the IFIP series is to encourage education and the dissemination and exchange of information about all aspects of computing.

For more information about the 300 other books in the IFIP series, please visit www.springer.com.

For more information about IFIP, please visit www.ifip.org.

Position-based routing was originally developed for packet radio networks in the 1980s [6]. It received renewed interest during the last few years as a method for routing in mobile wireless ad hoc and sensor networks [1, 2, 4]. The general idea of is to select the next hop based on position information such that the packet is forwarded in the geographical direction of the destination. Position-based routing can be divided into two main components: the location service and position-based forwarding. The location service [5, 13] is used for mapping the unique identifier (for example an IP address) of a node to its geographical position. In mobile ad hoc networks, providing accurate location service for position based routing, with low communication overhead, appears to be more difficult task than routing itself [13]. In case of sensor networks, however, destination is a sink or base station whose position is made available to source sensors by flooding. Position-based forwarding is performed by a node to select one of its neighbors as the next hop the packet should be forwarded to. Usually, the following information is required for the forwarding decision: the node's own geographical position, the position of all neighbors within transmission range and the position of the destination. Based on this information, the forwarding node selects one of its neighbors as the next hop such that the packet makes progress toward the geographical position of the destination.

Mobile Ad hoc NETworks (MANETs) has attracted great research interest in recent years. A Mobile Ad Hoc Network is a self-organizing multi-hop wireless network where all hosts (often called nodes) participate in the routing and data forwarding process. The dependence on nodes to relay data packets for others makes mobile ad hoc networks extremely susceptible to various malicious and selfish behaviors. This point is largely overlooked during the early stage of MANET research. Many works simply assume nodes are inherently cooperative and benign. However, experiences from the wired world manifest that the reverse is usually true; and many works [3] [10] [9] [8] [12] [19] have pointed out that the impact of malicious and selfish users must be carefully investigated. The goal of this research is to address the cooperation problem and related security issues in wireless ad hoc networks. As a rule of thumb, it is more desirable to include security mechanisms in the design phase rather than continually patching the system for security breaches. As pointed out in [2] [1], there can be both selfish and malicious nodes in a mobile ad hoc network. Selfish nodes are most concerned about their energy consumption and intentionally drop packets to save power. The purpose of malicious nodes, on the other hand, is to attack the network using various intrusive techniques. In general, nodes in an ad hoc network can exhibit Byzantine behaviors.