Problems in Ad Hoc Networks

While building up Ad-Hoc Networks, several problems can be addressed, some as a

consequence of other problems:
* When a node [A] inside an Ad-Hoc Network wants to send data to a second no
de [B], that he is not able to see, because this one is out of his transmission-
rage, how can the data be transfered from [A] to [B] anyway?
* How can the destination [B] be identified?
* How can the way from [A] to [B] be determined?
* Can a technique to determine the way be found, that is scalable for small
networks (1-100 nodes) medium-large networks (100-10.000 nodes) and large networ
ks (10.000-several million nodes)?
* How can a way from [A] to [B] be determined without flooding the network w
ith inquiries? How can the number of inquiries been kept small?
* How can a way from [A] to [B] be determined without knowing each node of t
he network? How can the information a node has to know about the network been ke
pt small? How much does a node realy has to know about the network?
* Can a technique to determine the way be found that is scalable (under cond
ititions) for networks with high changerate and low changrate?
* How can a node [A] establish coperation relationships with the nodes that
it needs to transfer data to [B]?
* Is it nessessary to identify malicious or unfair nodes or is there a way t
o accept this conditions?
* Can the network be kept resistant against malicious nodes?
* How can redundance been introduced to be resistant?

site:http://wiki.uni.lu/secan-lab/Problems+in+Ad-Hoc+Networks.html