| 1. |
- Rohner, Christian, et al.
(författare)
-
Interactions between TCP, UDP and Routing Protocols in Wireless Multi-hop Ad hoc Networks
- 2005
-
Ingår i: Proceedings of the 1st IEEE ICPS Workshop on Multi-hop Ad hoc Networks: from theory to reality (REALMAN 2005).
-
Konferensbidrag (refereegranskat)abstract
- The achieved throughput in an ad hoc network is affected by many factors, including radio interference between hops, the ability of the routing protocol to react on topology changes and a complex interaction between the application and underlying protocols. This paper studies experimentally the impact of these factors on UDP and TCP throughput. Furthermore, when both TCP and UDP share some hops in an ad hoc network there is a complex interaction between the transport protocols as well as with the routing protocol. Our results show that this interaction results in significant UDP jitter, instable routes and significantly lower TCP throughput. We use a controlled real testbed for the experiments and a graphical tool that captures the interactions.
|
|
| 2. |
- Achtzehn, Andreas, et al.
(författare)
-
ARPD : Asynchronous random key predistribution in the LEAP framework for Wireless Sensor Networks
- 2007
-
Ingår i: 3rd IEEE International Workshop on Wireless and Sensor Networks Security (IEEE WSNS 2007).
-
Konferensbidrag (refereegranskat)abstract
- In the LEAP framework for wireless sensor networks a set of keys is used to secure communication. LEAP distinguishes between unicast (pairwise) communication, group (cluster) communication and global (broadcast) communication. The keys used in pairwise communication are derived from an initial key KI that nodes are equipped with prior to deployment and that is deleted after link setup. Further keys are distributed encrypted with these pairwise keys. If the initial key is ever disclosed, the whole network is compromised. To lower the threat of KI disclosure, we present a novel KI -less scheme for key predistribution. Our scheme is based on random key redistribution, and proves to perform better in medium sized networks than previous proposals. It is resilient against node capture attacks and allows node to node authentication. Attacks against overlying protocols in the network are more difficult with this scheme. We have conducted computations to show the feasibility of our scheme for networks up to a size of 1000 nodes. By introducing a key reuse system we are able to increase the probability of a successful link setup. We have included a security analysis that discusses our scheme’s resistance against commonly known attacks.
|
|
| 3. |
- Achtzehn, Andreas, et al.
(författare)
-
Implementing Agreement Protocols in Sensor
- 2006
-
Ingår i: The Second International Workshop on Wireless and Sensor Networks Security (WSNS'06).
-
Konferensbidrag (refereegranskat)abstract
- We investigate application of agreement protocols tolerating malicious failures in sensor networks. We identify several scenarios where agreement can be used, and report on our experience with implementing an agreement protocol.
|
|
| 4. |
|
|
| 5. |
- Beneson, Zinaida, et al.
(författare)
-
Verifiable Agreement: Limits of Non-Repudiation in Mobile Peer-to-Peer Ad Hoc Networks
- 2006
-
Ingår i: Third European Workshop on Security and Privacy in Ad hoc and Sensor Networks.
-
Konferensbidrag (refereegranskat)abstract
- We introduce verifiable agreement as a fundamental service for securing mobile peer-to-peer ad hoc networks, and investigate its solvability. Verifiability of a protocol result means that the participants can prove that the protocol reached a particular result to any third party (the verifier) which was not present in the network at the time of the protocol execution.
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
- Feeney, Laura Marie, et al.
(författare)
-
Leveraging a power save protocol to improve performance in ad hoc networks
- 2007
-
Ingår i: ACM SIGMOBILE Mobile Computing and Communications Review. - : Association for Computing Machinery (ACM). - 1559-1662 .- 1931-1222. ; 11:2, s. 51-52
-
Tidskriftsartikel (refereegranskat)abstract
- Power save protocols reduce energy consumption in ad hoc and sensor networks by allowing nodes to put their network interface into a low power consumption sleep state. The power save protocol must allow neighboring nodes to establish intervals during which they are mutually awake and available to exchange traffic. Many such protocols are based on a coordinated election of a covering set that is responsible for buffering traffic for sleeping nodes, but uncoordinated (i.e. asynchronous) protocols have also proven an attractive option.
|
|
| 10. |
- Feeney, Laura Marie, et al.
(författare)
-
Modeling Capacity in Ad Hoc Networks : Extended Poster Abstract
- 2006
-
Konferensbidrag (refereegranskat)abstract
- We describe a simple network model for efficiently simulating the CBR flow capacity of a multi-hop wireless network. The model is particularly intended for studying the behavior of asynchronous protocols, particularly power save protocols, where it is useful to examine many scheduling variations as well as many topologies and network configurations.We describe our experience using the model in some experiments in which we examine how the network performance is sensitive to the timing to scheduling variations induced by the operation of a simple power save protocol. We note that the model also seems seems suitable for combinatoric and probabilistic analysis, which is on-going work.
|
|
