Como visto, os resultados obtidos pelo P2MAN demandaram outros estudos mais profun- dos, tanto para avanço do protocolo quanto para uma melhor compreensão dos mecanismos
envolvidos. Além disso, há de se fazer comparativos do desempenho do P2MAN com outros protocolos, recém portados para MANETs. Nessa linha de ação, alguns trabalhos futuros
são propostos:
• Comparar o desempenho do P2MAN proposto com uma versão que utilize unicast e TCP;
• Analisar em profundidade o impacto do tamanho do conteúdo no tempo de entrega e propor mecanismos para redução desse impacto;
• Otimizar a implementação do P2MAN, de forma a torná-lo mais adaptativo às diversas situações propostas;
• Comparar o desempenho do P2MAN sobre outros protocolos de roteamento;
O funcionamento do P2MAN foi inspirado nas redes P2P. Entretanto, a busca da comu- nidade é pela sinergia entre as MANETs e redes P2P. Portanto, um outro passo a ser trilhado
é levar de volta às redes P2P o conhecimento adquirido e as soluções adotadas no P2MAN. Soma-se então mais uma pergunta a ser respondida em um trabalho futuro: "Que lições
Referências Bibliográficas
[1] Mehran Abolhasan, Tadeusz Wysocki, and Eryk Dutkiewicz. A review of routing protocols for mobile ad hoc networks. Ad Hoc Networks, 2:1–22, January 2004.
[2] Norman Abramson. The aloha system – another alternative for computer communi- cations. In Proceedings of the Fall Joint Computer Conference, volume 36, pages
177–186, Montvale, New Jersey, USA, 1970.
[3] Defense Advanced Research Projects Agency. Transmission control protocol. Dispo- nível em <http://www.ietf.org/rfc/rfc0793.txt.
[4] George Aggelou and Rahim Tafazolli. Rdmar: a bandwidth-efficient routing protocol for mobile ad hoc networks. In Proceedings of the 2nd ACM International Workshop on Wireless Mobile Multimedia, pages 26–33, 1999.
[5] Stephanos Androutsellis-Theotokis and Diomidis Spinellis. A survey of peer-to-peer content distribution technologies. ACM Computer Surveys, 36(4):335–371, 2004.
[6] Hari Balakrishnan, Venkata Padmanabhan, Srinivasan Seshan, and Randy Katz. A comparison of mechanisms for improving tcp performance over wireless links. In
Conference Proceedings on Applications, Technologies, Architectures, and Protocols for Computer Communications, pages 256–269, 1996.
[7] Stefano Basagni, Imrich Chlamtac, Violet Syrotiuk, and Barry Woodward. A distance routing effect algorithm for mobility (DREAM). In Proceedings of the 4th Annual
ACM/IEEE International Conference on Mobile Computing and Networking, pages 76–84, 1998.
[8] BigChampagne. Sítio bigchampagne. <http://www.bigchampagne.com>. 36
[9] Joseph Borg. A comparative study of ad hoc & peer to peer networks. Master’s thesis, University of London, University College London, Faculty of Engineering Depart-
ment of Electronic & Electrical Engineering, 2003.
[10] Imed Bouazizi. Ara - the ant-colony based routing algorithm for manets. In Proce- edings of the International Conference on Parallel Processing Workshops, page 79, 2002.
[11] Tracy Camp, Jeff Boleng, and Vanessa Davies. A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing (WCMC):
Special Issue on Mobile Ad Hoc Networking: Research, Trends, and Applications, 2(5):483–502, 2002.
[12] Tsu-Wei Chen and Mario Gerla. Global state routing: A new routing scheme for ad- hoc wireless networks. In IEEE International Conference on Communications, pages
171–175, 1998.
[13] Ching-Chuan Chiang, Hsiao-Kuang Wu, Winston Liu, and Mario Gerla. Routing in clustered multihop, mobile wireless networks. In IEEE Singapore International Conference on Networks, pages 197–211, April 1997.
[14] Ian Clarke, Scott Miller, Theodore Hong, Oskar Sandberg, and Brandon Wiley. Pro- tecting free expression online with freenet. IEEE Internet Computing, 6(1):40–49, 2002.
[15] Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore Hong. Freenet: A Distri- buted Anonymous Information Storage and Retrieval System, volume 2009, page 46.
Springer Berlin / Heidelberg, Berkeley, CA, USA, 2001.
[16] Thomas Clausen and Philippe Jacquet. RFC 3626. optimized link state routing proto- col (OLSR), 2003.
[17] Thomas Clausen, Philippe Jacquet, Anis Laouiti, Paul Mühlethaler, Amir Qayyum, and Laurent Viennot. Optimized link state routing protocol for ad hoc networks. In Proceedings of the 5th IEEE Multi Topic Conference, Pakistan, 2001.
BIBLIOGRAFIA 38
[18] Bram Cohen. Incentives build robustness in bittorrent. In Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, EUA, May 2003.
[19] Marco Conti, Enrico Gregori, and Giovanni Turi. Towards scalable p2p computing for mobile ad hoc networks. In Proceedings of the Second IEEE Annual Conference
on Pervasive Computing and Communications Workshops, page 109, 2004.
[20] Mathew Scott Corson and Anthony Ephremides. A distributed routing algorithm for mobile wireless networks. Wireless Networks, 1(1):61–81, 1995.
[21] Scott Corson and Joseph Macker. RFC 2501. mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations, 1999.
[22] Brian Crow, Indra Widjaja, Jeong Kim, and Prescott Sakai. IEEE 802.11 wireless local area networks. IEEE Communications Magazine, pages 116–126, 1997.
[23] Brian Crow, Indra Widjaja, Jeong Geun Kim, and Prescott Sakai. IEEE 802.11 wire- less local area networks. In Communications Magazine, volume 35, pages 116–126,
September 1997.
[24] Mayur Datar. Butterflies and peer-to-peer networks. In Proceedings of the 10th Annual European Symposium on Algorithms, pages 310–322, 2002.
[25] Gang Ding and Bharat Bhargava. Peer-to-peer file-sharing over mobile ad hoc networks. In Proceedings of the Second IEEE Annual Conference on Pervasive Com- puting and Communications Workshops, page 104, 2004.
[26] Rohit Dube, Cynthia Rais, Kuang-Yeh Wang, and Satish Tripathi. Signal stability based adaptive routing (SSA) for ad-hoc mobile networks. IEEE Personal Communi-
cations, pages 36–45, February 1997.
[27] Thomas D. Dyer and Rajendra V. Boppana. A comparison of tcp performance over three routing protocols for mobile ad hoc networks. In Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing, pages 56–66,
[28] Amos Fiat and Jared Saia. Censorship resistant peer-to-peer content addressable networks. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Dis-
crete Algorithms, pages 94–103, 2002.
[29] Gregory Finn. Routing and addressing problems in large metropolitan-scale inter- networks. Technical report, University of Southern California. Marina Del Rey Infor- mation Sciences Institute, 1987.
[30] James Freebersyser and Barry Leiner. A DoD Perspective on Mobile Ad Hoc Networks, pages 29–51. Addison-Wesley Longman Publishing Co., Inc., Boston, MA,
USA, 2001.
[31] Jose Joaquin Garcia-Luna-Aceves and Ewerton Madruga. The core assisted mesh protocol. IEEE Journal on Selected Areas in Communications, Special Issue on Ad- Hoc Networks, 17(8):1380–1394, 1999.
[32] Jose Joaquin Garcia-Luna-Aceves and Marcelo Spohn. Transmission-efficient routing in wireless networks using link-state information. Mobile Networks and Applications,
6(3):223–238, 2001.
[33] Mario Gerla, Xiaoyan Hong, and Guangyu Pei. Internet-Draft. fisheye state routing protocol (FSR) for ad hoc networks, 2002.
[34] Mario Gerla, Christoph Lindemann, and Ant Rowstron. P2P manet’s - new research issues. In Perspectives Workshop: Peer-to-Peer Mobile Ad Hoc Networks - New Re-
search Issues, number 05152 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2005.
[35] GNUTELLA. Sítio do protocolo gnutella. Disponível em <http:// rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html>, Aces-
sado em 01/01/2007.
[36] Zygmunt Haas. A new routing protocol for the reconfigurable wireless networks. In Proceedings of 6th IEEE International Conference on Universal Personal Communi- cations, volume 2, pages 562–566, San Diego, California, USA, October 1997.
BIBLIOGRAFIA 40
[37] Zygmunt Haas, Marc Pearlman, and Prince Samar. The zone routing protocol (ZRP) for ad hoc networks. Internet-draft, IETF MANET Working Group, July 2002.
[38] Charles Hedrick. RFC 1058. routing information protocol. Internet Engeneering Task Force - RFC Editor, 1988.
[39] Luc Hogie, Pascal Bouvry, and Frédéric Guinand. An overview of manets simulation. In Workshop on Methods and Tools for Coordinating Concurrent, Distributed and
Mobile Systems, LNCS, 2005.
[40] Gavin Holland and Nitin Vaidya. Analysis of tcp performance over mobile ad hoc networks. In Proceedings of the 5th Annual ACM/IEEE International Conference on
Mobile Computing and Networking, pages 219–230, 1999.
[41] Xiaoyan Hong, Kaixin Xu, and Mario Gerla. Scalable routing protocols for mobile ad hoc networks. IEEE Network, 16(4):11–21, July/August 2002.
[42] Lifei Huang and Ten-Hwang Lai. On the scalability of IEEE 802.11 ad hoc networks. In Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networ- king & Computing, pages 173–182, 2002.
[43] Mingliang Jiang, Jinyang Li, and Yong Tay. Cluster based routing protocol(CBRP) functional specification. Internet-draft, IETF MANET Working Group, August 1998.
[44] Mario Joa-Ng and I-Tai Lu. A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks. IEEE Journal on Selected Areas In Communication,
17(8):1415–1425, August 1999.
[45] David Johnson. Routing in ad hoc networks of mobile hosts. In Workshop on Mobile Computing Systems and Applications, Santa Cruz, CA, USA, 1994.
[46] David Johnson, Yih-Chun Hu, and David Maltz. RFC 4728. the dynamic source routing protocol (DSR), 2004.
[47] David Johnson and David Maltz. Dynamic source routing in ad hoc wireless networks. In Thomasz Imielinski and Hank Korth, editors, Mobile Computing, volume 353,
[48] John Jubin and Janet Tornow. The darpa packet radio network protocols. In Procee- dings of IEEE, volume 75, pages 21–32, 1987.
[49] Robert Kahn, Steven Gronemeyer, Jerry Burchfiel, and Ronald Kunzelman. Advances in packet radio technology. In Proceedings of IEEE, volume 66, pages 1468–1496,
1978.
[50] Alexander Klemm, Christoph Lindemann, and Oliver Waldhorst. A special-purpose peer-to-peer file sharing system for mobile ad hoc networks. IEEE 58th Vehicular Technology Conference, 4:2758–2763, 2003.
[51] Young-Bae Ko and Nitin Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. In Proceedings of the 4th Annual ACM/IEEE International Conference on
Mobile Computing and Networking, pages 66–75, 1998.
[52] Young-Bae Ko and Nitin Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. Wireless Networks, 6(4):307–321, 2000.
[53] Gerd Kortuem, Jay Schneider, Dustin Preuitt, Thaddeus Thompson, Stephen Fickas, and Zary Segall. When peer-to-peer comes face-to-face: Collaborative peer-to-peer
computing in mobile ad hoc networks. In Proceedings of the First International Con- ference on Peer-to-Peer Computing, page 75, 2001.
[54] Ulag Kozat, Iordanis Koutsopoulos, and Leandros Tassiulas. A framework for cross- layer design of energy-efficient communication with qos provisioning in multi-hop
wireless networks. In Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, volume 2, pages 1446–1456, 2004.
[55] US Naval Research Laboratory. Norm - negative-acknowledgment oriented relia- ble multicast. Disponível em <http://www.ietf.org/rfc/rfc3940.txt>,
Acessado em 01/04/2008.
[56] JangYeon Lee, GyeYoung Kim, and SungKwon Park. Optimum udp packet sizes in ad hoc networks. In Workshop on High Performance Switching and Routing. Merging Optical and IP Technologies, pages 214–218, Seoul, South Korea, 2002.
BIBLIOGRAFIA 42
[57] Sung-Ju Lee, Mario Gerla, and Ching-Chuan Chiang. On-demand multicast routing protocol. Wireless Communications and Networking Conference, 3:1298–1302, 1999.
[58] Yeng-Zhong Lee, Mario Gerla, Jason Chen, Jiwei Chen, Biao Zhou, and Antonio Caruso. Direction forward routing for highly mobile ad hoc networks. Ad Hoc &
Sensor Wireless Networks Journal, 2006.
[59] Marc Mosko. Routing in Mobile Ad Hoc Networks. PhD thesis, University of Califor- nia at Santa Cruz, 2004.
[60] John Moy. RFC 2328. ospf version 2, 1998.
[61] Shree Murthy and Jose Joaquin Garcia-Luna-Aceves. A routing protocol for packet radio networks. In Proceedings of the 1st Annual International Conference on Mobile
Computing and Networking, pages 86–95, 1995.
[62] NAPSTER. Sítio do napster. Disponível em <http://www.napster.com>, Acessado em 01/01/2007.
[63] Navid Nikaein, Houda Labiod, and Christian Bonnet. Ddr: Distributed dynamic rou- ting algorithm for mobile ad hoc networks. In Proceedings of the 1st ACM Internati-
onal Symposium on Mobile Ad Hoc Networking & Computing, pages 19–27, 2000.
[64] Guevara Noubir, Wei Qian, Bishal Thapa, and Yin Wang. Real-world experimentation-oriented platform for development and evaluation of manet cross- layer protocols. Technical report, College of Computer Science and Information Sci-
ence, Northeastern University, Boston, MA 02115, 2008.
[65] NS-2. The network simulator. <http://www.isi.edu/nsnam/ns>.
[66] Richard Ogier, Fred Templin, and Mark Lewis. RFC 3684. topology dissemination based on reverse-path forwarding (TBRPF), 2004.
[67] Leonardo Oliveira, Isabela Siqueira, and Antonio Loureiro. On the performance of ad hoc routing protocols under a peer-to-peer application. Journal on Parallel and
[68] Vincent Park and Mathew Scott Corson. A highly adaptive distributed routing algo- rithm for mobile wireless networks. INFOCOM, 00:1405, 1997.
[69] Guangyu Pei, Mario Gerla, and Tsu-Wei Chen. Fisheye state routing in mobile ad hoc networks. In ICDCS Workshop on Wireless Networks and Mobile Computing, pages D71–D78, 2000.
[70] Guangyu Pei, Mario Gerla, Xiaoyan Hong, and Ching-Chuan Chiang. A wireless hierarchical routing protocol with group mobility. IEEE Wireless Communications and Networking Conference, pages 1538–1542, 1999.
[71] Charles Perkins, Elisabeth Belding-Royer, and Samir Das. RFC 3561. ad hoc on- demand distance vector (AODV) routing, 1999.
[72] Charles Perkins and Pravin Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Proceedings of the Confe-
rence on Communications Architectures, Protocols and Applications, pages 234–244, 1994.
[73] Himabindu Pucha, Saumitra Das, and Ying Charlie Hu. Imposed route reuse in ad hoc network routing protocols using structured peer-to-peer overlay routing. IEEE Transactions on Parallel and Distributed Systems, 17(12):1452–1467, 2006.
[74] S. Radhakrishnan, Nageswara Rao, Gopal Racherla, Chandra Sekharan, and Steven Batsell. DST - a routing protocol for ad hoc networks using distributed spanning trees. IEEE Wireless Communications and Networking Conference, 3:1543–1547, 1999.
[75] Rajagopalan, Sundaram, Shen, and Chien-Chung. A cross-layer decentralized bittor- rent for mobile ad hoc networks. In Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services, pages 1–10, 2006.
[76] Jyoti Raju and Jose Joaquin Garcia-Luna-Aceves. A new approach to on-demand loop-free multipath routing. In IEEE Eight International Conference on Computer Communications and Networks, pages 522–527, Boston, Massachusetts, USA, 1999.
[77] Ram Ramanathan and Jason Redi. A brief overview of ad hoc networks: Challenges and directions. Communications Magazine, IEEE, 40(5):20–22, 2002.
BIBLIOGRAFIA 44
[78] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Schenker. A scalable content-addressable network. In Proceedings of the Conference on Appli-
cations, Technologies, Architectures, and Protocols for Computer Communications, pages 161–172, 2001.
[79] Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science,
2218:329, 2001.
[80] Elisabeth Royer and Charles Perkins. Internet-Draft. multicast ad hoc on-demand distance vector (MAODV) routing, 2000.
[81] Elizabeth Royer and Chai-Keong Toh. A review of current routing protocols for ad- hoc mobile wireless networks. IEEE Personal Communications, April 1999.
[82] Jared Saia, Amos Fiat, Steven Gribble, Anna Karlin, and Stefan Saroiu. Dynami- cally fault-tolerant content addressable networks. In Revised Papers from the First International Workshop on Peer-to-Peer Systems, pages 270–279, 2002.
[83] César Santiváñez, Ram Ramanathan, and Ioannis Stavrakakis. Making link-state rou- ting scale for ad hoc networks. In Proceedings of the 2nd ACM International Sympo-
sium on Mobile Ad Hoc Networking & Computing, pages 22–32, 2001.
[84] Mohamed Karim Sbai, Chadi Barakat, Jaeyoung Choi, Anwar Al Hamra, and Thierry Turletti. BitHoc: Bittorrent for wireless ad hoc networks. Technical report, inria- 00196313, France, 2008.
[85] Rüdiger Schollmeier. A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications. In Proceedings of IEEE First Inter-
national Conference on Peer-to-Peer Computing, page 101, Washington, DC, USA, 2001.
[86] Rüdiger Schollmeier, Ingo Gruber, and Michael Finkenzeller. Routing in mobile ad- hoc and peer-to-peer networks a comparison. In Revised Papers from the NETWOR-
KING Workshops on Web Engineering and Peer-to-Peer Computing, pages 172–186,
[87] Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Procee-
dings of the ACM SIGCOMM Conference, pages 149–160, 2001.
[88] Ivan Stojmenovi´c. Location Updates for Efficient Routing in Ad Hoc Networks, pages 451–471. John Wiley & Sons, Inc., New York, NY, USA, 2002.
[89] William Su and Mario Gerla. Ipv6 flow handoff in ad-hoc wireless networks using mobility prediction. In IEEE Global Communications Conference, pages 271–275, Rio de Janeiro, Brazil, 1999.
[90] Hideaki Takagi and Leonard Kleinrock. Optimal transmission ranges for ran- domly distributed packet radio terminals. IEEE Transactions on Communications, 32(3):246–257, 1984.
[91] Domenico Talia and Paolo Trunfio. Toward a synergy between p2p and grids. IEEE Internet Computing, 7(4):96–95, 2003.
[92] Fouad Tobagi. Random Access Techniques for Data Transmission Over Packet Swit- ched Radio Networks. PhD thesis, University of California Los Angeles. School of
Engineering and Applied Science, 1974.
[93] Fouad Tobagi and Leonard Kleinrock. Packet switching in radio channels: Part II - the hidden terminal problem in carrier sense multiple access modes and the busy-tone
solution. IEEE Transactions on Communication, 23(12):1417–1433, 1975.
[94] Chai-Keong Toh. A novel distributed routing protocol to support ad-hoc mobile com- puting. In Conference Proceedings of the IEEE Fifteenth Annual International Phoe-
nix Conference on Computers and Communications, pages 480–486, Scottsdale, AZ, USA, 1996.
[95] Ravindra Vaishampayan. Efficient and Robust Multicast Routing in Mobile Ad Hoc Networks. PhD thesis, University of California at Santa Cruz, 2006.
[96] Ravindra Vaishampayan and Jose Joaquin Garcia-Luna-Aceves. Efficient and robust multicast routing in mobile ad hoc networks. IEEE International Conference on Mo-
BIBLIOGRAFIA 46
[97] Chonggang Wang and Bo Li. Peer-to-peer overlay networks: A survey. Disponível em: <http://lumumba.uhasselt.be/ stofke/thesis/papers/15.pdf>, 2003.
[98] Feng Wang and Yongguang Zhang. Improving tcp performance over mobile ad hoc networks ith out-of-order detection and response. In Proceedings of the 3rd ACM
International Symposium on Mobile Ad Hoc Networking & Computing, pages 217– 225, 2002.
[99] Seung-Chul Woo and Suresh Singh. Scalable routing protocol for ad hoc networks. Wireless Networks, 7(5):513–529, 2001.
[100] Jie Wu. Handbook On Theoretical And Algorithmic Aspects Of Sensor, Ad Hoc Wi- reless, and Peer-to-Peer Networks, pages 857–874. Auerbach Publications, Boston,
MA, USA, 2005.
[101] Saumitra Das Y. Charlie Hu and Himabindu Pucha. Exploiting the synergy between peer-to-peer and mobile ad hoc networks. In 9th Workshop on Hot Topics in Operating Systems, pages 37–42, Lihue, HI, USA, 2003.
[102] Lu Yan. Performance evaluation and modeling of peer-to-peer systems over mobile ad hoc networks. Technical report, TUCS Technical Report No. 678, Turku, Finland, 2005.
[103] Ben Zhao, John Kubiatowicz, and Anthony Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical report, University of Califor-
nia, Berkeley, CA, USA, 2001.
[104] Ben Zhao, John Kubiatowicz, and Anthony Joseph. Peer-to-peer computing. Techni- cal report, HP Labs, 2002.
[105] Ben Zhao, John Kubiatowicz, and Anthony Joseph. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22:41–53, 2004.
Instalação do P2MAN no NS-2
O código do P2MAN, utilizado nos experimentos desta dissertação, já está disponível em
<http://sourceforge.net/projects/p2man>. Este anexo visa apresentar um tutorial com os passos para instalação do código do P2MAN no NS-2. O objetivo é permitir
que novos trabalhos possam aprimorar o P2MAN à partir do ponto atual de desenvolvimento.
Para os passos abaixo, deve-se considerar a pasta de instalação do NS-2. Para o pacote All-in-Onedo NS-2 na versão 2.33, a instalação ocorrerá em ns-allinone-2.33/ns-2.33.
Como é possível que o usuário não utilize um pacote All-in-One e instale os componentes de forma independente, denominou-se a pasta de instalação ns-2.33 como <raiz do NS-2>.
Por se tratar de um aplicativo, P2MAN não requer maiores intervenções no simulador.
Os passos para a instalação são:
1. obtenha o arquivo p2man.zip em <http://sourceforge.net/projects/p2man>;
2. descompacte o arquivo p2man.zip em <raiz do NS-2>/p2man;
3. edite o arquivo Makefile conforme detalhamento a seguir;
4. a partir da pasta <raiz do NS-2>/p2man, execute o script de comandos ./run
A.1
Alteração Necessária ao Arquivo Makefile
Edite o arquivo <raiz do NS-2>/Makefile e adicione a linha: