![](bga.png)
system in a “self-certifiable” manner. In this context, we achieve a canonical formula-
tion of the authentication problem in wireless ad hoc networks and as such derive an
alternative solution technique devoid of explicit certificate passing.
The contributions of this paper is the design of a new authentication protocol that
relies on a collision-avoidance protocol to guarantee the detection of unauthorized at-
tempts to compromise a wireless ad hoc network of trusted nodes. The protocol creates
a random, yet deterministic sequence of coupled time-slots and associated frequency
channels that are unique to each node in the network. For each communication period,
the order of the sequence of time-slots may remain unaltered or the order can be re-
arranged deterministically without coordination via inter-node communication. If an
analogy can be made between frequency channels to colors in the visual range, the
communication in an APEC system would appear to be a coordinated light show.
References
1. D. Balfanz, D. K. Smetters, P. Stewart and H. Chi. Wong, “Talking to Strangers: Authen-
tication in Ad-Hoc Wireless Networks,” Symposium on Network and Distributed Systems
Security (NDSS ’02).
2. Chih-Peng Chang, Jen-Chiun Lin, Feipei Lai, “Trust-group-based authentication services for
mobile ad-hoc networks,” 1st International Symposium on Wireless Pervasive Computing,
16-18 Jan. 2006,
3. Srdjan Capkun, Levente Buttyan, Jean-Pierre Hubaux, “Self-Organized Public-Key Manage-
ment for Mobile Ad-hoc Networks,” in ACM International Workshop on Wireless Security,
WiSe 2002.
4. Chiu, T. W. “Shift-register sequence random number generators on the hypercube concurrent
computers,” in G. C. Fox, editor, The Third Conference on Hypercube Concurrent Computers
and Applications, Volume 2, pages 1421-1429 (1988).
5. Paul D. Coddington and Sung-Hoon Ko, “Techniques for empirical testing of parallel random
number generators,” Proceedings of the 12th international conference on Supercomputing,
pp. 282 - 288 (1998).
6. H. Deng, A. Mukherjee, D. P. Agrawal, “Threshold and Identity-Based Key Management and
Authentication for Wireless Ad Hoc Networks,” International Conference on Information
Technology: Coding and Computing (ITCC’04) (2004).
7. W. Diffie, P.C. van Oorschot, and M.J. Wiener, “Authentication and authenticated key ex-
changes,” Designs, Codes and Cryptography 2 (1992).
8. J. Hope Forsmann, Robert E. Hiromoto, and John Svoboda, “A Time-Slotted On-Demand
Routing Protocol for Mobile Ad Hoc Unmanned Vehicle Systems,” SPIE 2007, Orlando
Florida, April 9-12 2007.
9. P. Frederickson, R. Hiromoto, T. Jordan, B. Smith, and T. Warnock, “Pseudo-Random Trees
in Monte Carlo,” Parallel Computing, Vol. 1, No. 2, pp. 175-180, (December 1984).
10. S. Hahm, Y. Jung, S. Yi, Y. Song, I. Chong, and K. Lim, “Self-organized Authentication
Architecture in Mobile Ad-hoc Networks,” International Conference on Information Net-
working (ICOIN) (2005).
11. D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,”
Mobile Computing, vol. 353, Kluwer Academic Publishers (1996).
12. Sylvain Lefebvre and Hugues Hoppe, “Perfect Spatial Hashing,” ACM Trans. Graph. 25, 3,
579588 (2006).
89