A Scheme Encouraging Mobile Nodes to Forward Packets via Multiple Wireless Links Aggregating System Between the Internet and Mobile Ad Hoc Networks

  • Yosuke Ito
  • Hiroshi Mineno
  • Susumu Ishihara
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3544)


We have proposed a system that achieves high-speed and high-quality communication between mobile nodes and the Internet by using multiple network interfaces of multiple mobile nodes. In this system, adjacent mobile nodes connect to each other with short-range high-speed links and establish temporary networks. A mobile node in a temporary network simultaneously uses multiple links owned by the nodes in the network when it communicates with nodes outside the network. In this system, a part of data packets for one node have to be relayed by the other nodes in the temporary network. However, other nodes might not relay data packets unless they receive some profit from their contribution. In this report, we introduce credits as an incentive to network nodes to relay packets. We propose a method that provides secure credit exchanges between nodes relaying packets and a node requesting the relays, and the method provides a trusted third party that assists those nodes exchanging credits.


mobile computing multiple paths mobile IP cooperation incentive of forwarding accounting fairness SHAKE ad hoc network 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Koyama, K., Ito, Y., Ishihara, S., Mineno, H.: Performance evaluation of TCP on Mobile IP SHAKE. IPSJ journal 45(10), 2270–2278 (2004)Google Scholar
  2. 2.
    Mineno, H., Konishi, Y., Ishihara, S., Mizuno, T.: Implementation of cluster control manager for multiple wireless links sharing system. In: Proc. of PACRIM (2003)Google Scholar
  3. 3.
    Buttyan, L., Hubaux, J.-P.: Enforcing Service availability in mobile ad-hoc WANs. In: Proc. of MobiHoc (2000)Google Scholar
  4. 4.
    Zhong, S., Yang, Y.R., Chen, J.: Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad Hoc Netoworks. In: Proc. of INFOCOM. IEEE (2003)Google Scholar
  5. 5.
    Marti, S., Giuli, T., Lai, K., Baker, M.: Mitigating routing misbehavior in mobile ad hoc networks. In: Proc. of MobiCom (2000)Google Scholar
  6. 6.
    Buttyan, L., Hubaux, J.-P.: Stimulating cooperation in self-organizing mobile ad hoc networks. Mobile Networks and Applications 8(5), 579–592 (2003)CrossRefGoogle Scholar
  7. 7.
    Buchegger, S., Boudec, J.-Y.L.: Performance analysis of the CONFIDANT protocol. In: Proc. of MobiHoc (2002)Google Scholar
  8. 8.
    Ben Salem, N., Buttyan, L., Hubaux, J.P., Jakobsson, M.: A Charging and Rewarding Scheme for Packet Forwarding in Multi-hop Cellular Networks. In: Proc. of MobiHoc (2003)Google Scholar
  9. 9.
    Golle, P., Leyton-Brown, K., Mironov, I.: Incentives in peer-topeer file sharing. In: Proc. of the ACM Symposium on Electronic Commerce, EC 2001 (2001)Google Scholar
  10. 10.
    Anderegg, L., Eidenbenz, S.: Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In: Proc. of MobiCom (2003)Google Scholar
  11. 11.
    Lamparter, B., Paul, K., Westhoff, D.: Charging Support for Ad Hoc Stub Networks. Journal of Computer Communication, Technology and Applications (2003)Google Scholar
  12. 12.
    Pottie, G.J., Kaiser, W.J.: Wireless Integrated Network Sensors. Communications of the ACM (May 2000)Google Scholar
  13. 13.
    Speed Comparison of Popular Crypto Algorithms,
  14. 14.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yosuke Ito
    • 1
  • Hiroshi Mineno
    • 2
  • Susumu Ishihara
    • 3
  1. 1.Graduate School of Science and TechnologyShizuoka UniversityShizuokaJapan
  2. 2.Faculty of InformationShizuoka University 
  3. 3.Faculty of EngineeringShizuoka University 

Personalised recommendations