Formularios e instructivos

Personal Networks are an increasingly promising area of research with practical network technologies and architectures, in which ad hoc networks have been received much attention. But due to their specific characteristics such as multi-hop and infrastructure-independent, they are more vulnerable than traditional networks. Various attacks especially those related to routing and forwarding are much easy to be launched by misbehaving nodes in ad hoc networks. Furthermore, a new type of misbehaving nodes called selfish nodes could exist in such networks. Routing information as well as data packets are more likely to be damaged or lost.

In this report, a new reputation-based solution designed for mobile ad hoc networks is presented. The detection mechanism and the prevention approach in this solution are specially introduced. The detection mechanism could be used to effectively detect misbehaving nodes by performing neighbor monitoring and information exchange in a local scope. But power constraint is a challenge for this local monitoring mechanism performed by each mobile node. The prevention scheme is fully operated in the route discovery phase without any specific test procedure. Depending on cooperation of all well-behaving nodes in the network, misbehaving nodes could be excluded from the discovered routes. And route selection is based on hop count as well as path quality to select the most reliable route to a specific destination. Simulation shows the different impacts on the network performance caused by misbehaving nodes which are divided into two types: malicious nodes and selfish nodes. The simulation shows that malicious nodes degrade the network performance considerably and selfish nodes increase other nodes’ burdens. The prevention mechanism is simulated to evaluate the network performance improvement. From the simulation results, it is obvious that the prevention mechanism can increase the network performance significantly if an effective detection technique is available.

Reference

[1] X`Martin Jacobsson, Jeroen Hoebeke, Sonia M. Heemstra de Groot, Anthony Lo, Ingrid Moerman, Ignas G. M. M. niemegeers, “A network layer architecture for personal networks”, In the first MAGNET workshop, Shanghai, China, October 17,2004.

[2] Ignas G. M. M. Niemegeers, Sonia M. Heemstra de Groot, “Research issues in ad hoc distributed personal networking”, wireless personal communications: An international journal, Volume: 26, Issue:2-3, pages: 149-167, Kluwer Academic Publishers, August 2003.

[3] IEEE P802.15, IEEE 802.15 Working Group for WPAN http://grouper.ieee.org/groups/802/15/. [4] IEEE P802.11, IEEE 802.11 Working Group for WLAN, http://grouper.ieee.org/groups/802/11/. [5] Bluetooth SIG, Specification of the Bluetooth System, version 1.1 B, Http://www.bluetooth.com/,

2001.

[6] IEEE Std 802.15.4™-2003, 1 October 2003， IEEE 802.15 WPAN™ Task Group 4 (TG4). [7] IEEE Std 802.15.3™-2003, 29 September 2003，IEEE 802.15 WPAN™ Task Group 3 (TG3). [8] Jeroen Hoebeke, Ingrid Moerman, Bart Dhoedt and Peit Demeester, “An overview of mobile ad

hoc networks: applications and challenges”, MAGNET project.

[9] James M. Wilson, “Quadrupling Wi-Fi speeds with 802.11n”, http://www.deviceforge.com/articles/AT5096801417.html

[10] IST MAGNET project, http://www.ist-magnet.org/.

[11] D. B. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks”, Mobile Computing, PP. 153-181, 1996.

[12] Y. Xue and K. Nahrstedt, "Bypassing misbehaving nodes in ad hoc routing," Tech. Rep. UIUCDCS-R-2002-2306, UILU-ENG2002-1749, Department of Computer Science, University of Illinois at Urbana-Champaign, November 2002.

[13] Bluetooth Security White Paper, Bluetooth SIG security expert group.

[14] Bluetooth SIG, Bluetooth Security Architecture White Paper, version 1.0, July 15 1999, http://www.bluetooth.com.

[15] Bluetooth SIG, Specification of the Bluetooth system, Core, Part B "Baseband specification", Version 1.1, 22 February 2001, at http://www.bluetooth.com/.

[16] Wireless LAN Enhanced Security, IEEE, 802.11i/D3.0, November 2002. [17] Security Architecture for the Internet Protocol, RFC 2401.

[18] The Internet Key Exchange (IKE), RFC 2409.

[19] Sorin M. Schwartz, "IPSec basics“, ver.6, March 27, 2003

[20] Radia PerLMAN, Charlie Kaufman, “Key exchange in IPSec: analysis of IKE”, 1089-7801/00/s10.00, IEEE Internet Computing.

[21] HMAC algorithm, “HMAC: Keyed-Hashing for Message Authentication”, RFC-2104. [22] The MD5 Message-Digest Algorithm, RFC-1321, http://www.faqs.org/rfcs/rfc1321.html. [23] SECURE HASH STANDARD, FIPS-180-1, http://www.itl.nist.gov/fipspubs/fip180-1.htm. [24] IP Version 6 Working Group (ipv6), http://www.ietf.org/html.charters/ipv6-charter.html. [25] Internet Protocol, Version 6 (IPv6) Specification, RFC 2460, http://www.ietf.org/rfc/rfc2460.txt. [26] Network mobility (nemo), IETF official NEMO Working Group web page and charter,

http://www.ietf.org/html.charters/nemo-charter.html.

[27] Hridesh Rajan, “Mobile ad hoc networks”, Dept of Computer Science, University of Virginia, Sept 2001, http://www.cs.virginia.edu/~hr2j/MANET.html.

[28] Charles E. Perkins, Pravin Bhagwat, “Highly dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers”, 1994 ACM 0-89791-682-4/94/0008.

[29] Optimized Link State Routing Protocol (OLSR), RFC 3626.

[30] Thomas Clausen, Philippe Jacquet, Optimized Link State Routing Protocol(OLSR), IETF Internet Draft, July 3 2003.

[31] C. Perkins, E. Belding-Royer, S. Das, Ad hoc On-Demand Distance Vector (AODV) Routing, RFC 3561. July 2003.

[32] D. B. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks”, Mobile Computing, (Kluwer Academic, 1996) pp. 153-181.

[33] M. R. Perlman, Z. Z. Haas, "Determining the optimal configuration for the zone routing protocol", IEEE JSAC, Aug. 1999, vol. 17, no. 8, pp. 1395-1414.

[34] Vincent D. Park and M. Scott Corson, Temporally-Ordered Routing Algorithm (TORA) version 1: Functional specification. Internet Draft, draft-ietf-manet-tora-spec-00.txt, November 1997.

[35] I. Chakeres, E. Belding-Royer, C. Perkins, Dynamic MANET On-demand Routing Protocol (DYMO), Internet Draft, draft-ietf-manet-dymo-00.

[36] Yih-Chun Hu, Adrian Perrig and David B. Johnson, “Ariadne: a secure on-demand routing protocol for ad hoc networks”, in The 8th ACM International Conference on Mobile Computing and Networking, September 2002.

[37] Marina Petrova, Martin Jacobson, Simon Oosthoek, etc. Conceptual Secure PN Architecture, MAGNET D2.1.1, 17 January 2005.

[38] Jeroen Hoebeke (IMEC) ed., Ingrid Moerman (IMEC), Martin Jacobsson (DUT), etc, “Architectures and protocols for ad-hoc selfconfiguration, interworking, routing and mobility”, 22 December 2004, MAGNET D2.4.1.

[39] Thafer Sulaiman, Kumarendra Sivarajah, Hamed Al-Raweshidy, ” MANET IN PERSONAL AREA NETWORK (PAN)”, MAGNET project.

[40] Hao Yang, Haiyun Luo, Fan Ye, Songwu Lu, Lixia Zhang, ”Security in mobile ad hoc networks: challenges and solutions”, IEEE Wireless Communications, February 2004.

[41] S. Marti, T. J. Giuli, K. Lai, and M. Baker, “Mitigating routing misbehavior in mobile ad hoc networks,” Proceeding of MOBICOM, Aug 2000.

[42] Y. Xue and K. Nahrstedt, "Bypassing misbehaving nodes in ad hoc routing," Tech. Rep. UIUCDCS-R-2002-2306, UILU-ENG2002-1749, Department of Computer Science, University of Illinois at Urbana-Champaign, November 2002.

[43] S. Buchegger, "The CONFIDANT Protocol", NCCR MICS Kick-off Meeting, February 2002. [44] Po-Wah Yau and Chris J. Mitchell, “Reputation methods for routing security for mobile ad hoc

networks”, http://www.isg.rhul.ac.uk/~cjm/rmfrsf.pdf.

[45] Michiardi P,Molva R. “Core: a collaborative reputation mechanism to enforce node cooperation in Mobile Ad Hoc Networks”, In:Proc. of the sixth IFIP Conf. on Security Communications and Multimedia(CMS 2002), 2002

[46] P. Dewan, P. Dasgupta, “Trust routers and relays in ad hoc networks“, http://www.public.asu.edu/~dewan/docs/Dewan-Wispr.pdf

[47] P. Papadimitrators, Z. J. Haas, “Secure message transmission in mobile ad hoc networks”, Ad Hoc Networks (2003) 193-209.

[48] Q. He, D. Wu, P. Khosla, “SORI: A secure and objective reputation-based incentive scheme for ad hoc networks”, IEEE Wireless Communications and Networking Conference 2004

[49] P. Michiardi, R. Molva, “Simulation-based analysis of security exposures in mobile ad hoc networks”, European Wireless Conference, 2002.

[50] P. Papadimitratos, Z. J. Haas, “Secure routing for mobile ad hoc networks”, In SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), San Antonio, TX, January 2002.

[51] Y. Hu, A. Perrig, D. B. Johnson, “Ariadne: a secure On-Demand Routing Protocol for Ad Hoc Networks”, Technical Report TR01-383, Department of Computer Science, Rice University, December 2001.

[52] L. Zhou and Z.J. Haas, ‘Securing ad hoc networks’, IEEE Network Magazine, vol. 13, no.6, November-December 1999.

[53] A. Perrig, R. Canetti, D. Song and J.D. Tygar, “efficient and secure source authentication for multicast”, Network and Distributed System Security Symposium, NDSS ’01, pages 35-46, February 2001.

[54] Y. Hu, D. B. Johnson, A. Perrig, “SEAD: secure efficient distance vector routing for mobile wireless adhoc networks”, In Proceeding s of the 4th _{IEEE Workshop on Mobile Computing} Systems & Applications (WMCSA 2002), IEEE, calicoon, NY, to appear, June 2002.

[55] Manel Guerrero Zapata, “Secure ad hoc on-demand distance vector (SAODV) routing”, draft-querrero-manet-saodv-03, Mobile Ad Hoc Networking Working Group, 17 March 2005. [56] L. Buttyan and J. Hubaux, “Stimulating Cooperation in Self-organizing Mobile Ad hoc Networks”,

Mobile Networks and Applications, 8(5):579-592, October 2003.

[57] S. Zhong, J. Chen, and Y. Yang, “Spring: a simple, cheat-proof, credit-based system for mobile ad hoc networks”, IEEE INFOCOM 2003, San Francisco, CA, USA, April 2003.

[58] M. Jakobsson, J. Hubaux, and L. Buttyan, “A micro-payment scheme encouraging collaboration in multi-hop cellular networks”, Proceedings of Financial Crypto 2003, Gosier, Guadeloupe, Jan. 2003.

[59] Panagiotis Papadimitratos and Zygmunt J. Haas, “Secure routing for mobile ad hoc networks”, In Proceedings of the SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), San Antonio, TX, January 27-31, 2002

[60] Lidong Zhou and Zygmunt J. Haas, “Securing ad hoc networks”, IEEE network, special issue on network security, November/December, 1999.

[61] Jean-Pierre Hubau, Levente Buttyan and Srdan Capkun, “The quest for security in mobile ad hoc networks”, ACM Published in the Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC 2001).

[62] F. Talucci, M. Gerla, “MACA-BI (MACA By Invitation) a wireless MAC protocol for high speed ad hoc networking”,

http://www.ics.uci.edu/~atm/adhoc/paper-collection/gerla-macabi-icupc97.pdf

[63] V. Bharghavan, A. Demers, S. Shenker, L. Zhang, “MACAM: a media access protocol for wireless LAN”, http://nms.lcs.mit.edu/6829-papers/macaw.ps.gz.

[64] B. Lamparter, M. Plaggemeier, D. Westhoff, “Estimating the value of co-operation approaches for multi-hop ad hoc networks”, Ah Hoc Networks 3 (2005) 17-2

[65] H. Ellarg, “Improving TCP performance over mobile networks”, ACM Computing Surverys 34(3) (2002) 357 – 374.

[66] S. Sherry, G. Mey, “Protocol analysis for triggered RIP”, RFC 2092, January 1997 [67] OSPF protocol analysis, RFC 1245

[68] The Network Simulator - ns-2. http://www.isi.edu/nsnam/ns/index.html.

[69] J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva, “A performance comparison of multi-hop wireless ad hoc network routing protocols”, in Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM ‘98), October 1998.

[70] http://www.isi.edu/nsnam/vint/ Virtual Internetwork Testbed collaboration (Valid 26/04/04) [71] P. Meeneghan, D. Delaney, “An introduction to NS, Nam and OTcl scripting”,

NUIM-CS-TR-2004-05.

[72] CMU monarch project. http://www.monarch.cs.rice.edu/

[73] DSR in NS-2, http://www.winlab.rutgers.edu/~zhibinwu/html/DSR_ns2.html.

[74] R.Ogier, F. Templine, M. Lewis, “Topology dissemination based on reverse-path forwarding (TBTPG)”, RFC 3684, February 2004.

[75] M.Conti, E. Gregori, Gaia Maselli, “Reliable and efficient forwarding in ad hoc networks”, Ad Hoc Network. 22 October 204. Available online at www.sciencedirect.com.

[76] G. Campos and G. Elias, “Performance issues of ad hoc routing protocols in a network scenario used for videophone applications”.

Appendix A: Simulation Script

#Agent/UDP set packetSize_ 6000

# ====================================================================== # Define options

# ====================================================================== set val(ifqlen) 50 ;# max packet in ifq

set val(nn) 50 ;# number of mobilenodes set val(rp) DSR ;# routing protocol set val(chan) Channel/WirelessChannel

set val(prop) Propagation/TwoRayGround set val(netif) Phy/WirelessPhy

set val(mac) Mac/802_11 set val(ifq) CMUPriQueue set val(ll) LL

set val(ant) Antenna/OmniAntenna set val(stop) 200 set val(x) 1000 set val(y) 1000 # ====================================================================== # Main Program # ====================================================================== #ns-random 0

# Initialize Global Variables set ns_ [new Simulator]

set tracefd [open 10m-0p-20s.tr w] $ns_ trace-all $tracefd

set namtrace [open 10m-0p-20s.nam w] $ns_ namtrace-all-wireless $namtrace 1000 1000 # set up topography

set topo [new Topography] $topo load_flatgrid $val(x) $val(y) # Create God

#create-god $val(nn)

set god_ [create-god $val(nn)]

# Create the specified number of mobilenodes [$val(nn)] and "attach" them # to the channel.

# configure node

set channel [new $val(chan)] $channel set errorProbability_ 0.0

$ns_ node-config -adhocRouting $val(rp) \ -llType $val(ll) \ -macType $val(mac) \ -ifqType $val(ifq) \ -ifqLen $val(ifqlen) \ -antType $val(ant) \ -propType $val(prop) \ -phyType $val(netif) \ -channel $channel \ -topoInstance $topo \ -agentTrace ON \ -routerTrace ON\ -macTrace OFF \ -movementTrace OFF

for {set i 0} {$i < $val(nn) } {incr i} { set node_($i) [$ns_ node] $node_($i) random-motion 0; }

# network scenario

puts "Loading scenario file..." source "s-0p-20s"

# Define node initial position in nam for {set i 0} {$i < $val(nn)} {incr i} {

# 20 defines the node size in nam, must adjust it according to your scenario # The function must be called after mobility model is defined

$ns_ initial_node_pos $node_($i) 20 }

puts "Loading CBR file..." source "cbr"

# Tell nodes when the simulation ends for {set i 0} {$i < $val(nn) } {incr i} { $ns_ at $val(stop).0 "$node_($i) reset"; }

$ns_ at $val(stop).0 "stop"

$ns_ at $val(stop).01 "puts \"NS EXITING...\" ; $ns_ halt" proc stop {} {

global ns_ tracefd namtrace $ns_ flush-trace

close $tracefd close $namtrace }

puts "Starting Simulation..." $ns_ run