A number of routing algorithms based on the ant-colony metaphor have been proposed for communication netwroks. However, there has been little work on the performance analysis of ant-routing algorithms. In this paer, we compare the performance of AntNet, an ant-routing algorithm, with Dijkstra's shortest path algorithm. Our simulations show that the performance of AntNet is comparable to Dijkstra's shortest path algorithm. Moerover, under varying traffic loads, AntNet adapts to the changin traffic and performs better than shortest routing paths.@en

Personal Networks (PNs) are future communication systems that combine wireless and infrastructure based networks to provide users a variety of services anywhere and anytime. PNs introduce new design challenges due to the heterogeneity of the involved technologies, the need for self-organization, the dynamics of the PN composition, the application-driven nature, the co-operation with infrastructure-based netwirks, and the security hazards. This paper discusses the challenges of security, service discovery and QoS provisioning in designing self-organized PNs and combines them all into an integrated architectural framework.@en