Conference Papers
http://hdl.handle.net/10453/109
20150602T17:47:56Z

On the Asymptotic Connectivity of Random Networks under the Random Connection Model
http://hdl.handle.net/10453/32920
On the Asymptotic Connectivity of Random Networks under the Random Connection Model
Mao, G; Anderson, BDO
Consider a network where all nodes are distributed on a unit square following a Poisson distribution with known density $\rho$ and a pair of nodes separated by an Euclidean distance $x$ are directly connected with probability $g(\frac{x}{r_{\rho}})$, where $g:[0,\infty)\rightarrow[0,1]$ satisfies three conditions: rotational invariance, nonincreasing monotonicity and integral boundedness, $r_{\rho}=\sqrt{\frac{\log\rho+b}{C\rho}}$, $C=\int_{\Re^{2}}g(\Vert \boldsymbol{x}\Vert)d\boldsymbol{x}$ and $b$ is a constant, independent of the event that another pair of nodes are directly connected. In this paper, we analyze the asymptotic distribution of the number of isolated nodes in the above network using the ChenStein technique and the impact of the boundary effect on the number of isolated nodes as $\rho\rightarrow\infty$. On that basis we derive a necessary condition for the above network to be asymptotically almost surely connected. These results form an important link in expanding recent results on the connectivity of the random geometric graphs from the commonly used unit disk model to the more generic and more practical random connection model.
20101228T00:00:00Z

Activity recognition from the interactions between an assistive robotic walker and human users
http://hdl.handle.net/10453/32355
Activity recognition from the interactions between an assistive robotic walker and human users
Patel, M; Miro, JV; Dissanayake, G
Detection of individuals' intention from a sequence of actions is an open and complex problem. In this paper we present a smart walker as mobility aid which can interpret the users' behaviour patterns to recognize their intentions and consequently act as an intelligent assistant. The result of the experiments performed in this paper demonstrates the potential of dynamic bayesian networks (DBN), in relation to their dynamic and unsupervised nature, for realistic humanrobot interaction modelling.
20110101T00:00:00Z

On optimising route discovery for multiinterface and poweraware nodes in heterogeneous MANETs
http://hdl.handle.net/10453/31945
On optimising route discovery for multiinterface and poweraware nodes in heterogeneous MANETs
AlAamri, H; Abolhasan, M; Wysocki, T; Lipman, J
This paper presents a new routing discovery strategy for heterogeneous MANETs. Node heterogeneity is modeled in terms of: types and number of different interfaces, power, and transmission ranges. Our proposed route discovery algorithm is implemented on the top of Ondemand Treebased Routing Protocol (OTRP) and hence it is called OTRP HeterogeneityAware (OTRPHA). OTRPHA utilizes node heterogeneity and optimizes route discovery to reduce overheads and ensures connectivities between different types of nodes with different interfaces. Each node makes its own decision to participate in the route discovery process according to its location, local density, and available resources. Simulation results show that OTRPHA outperforms OTRP and AODV and it reduces overheads as a number of nodes and traffic increase, while it also further prolongs the lifetime of batterypowered singleinterface nodes when compared to AODV. © 2010 IEEE.
20100101T00:00:00Z

Digital signaturebased authentication framework in cognitive radio networks
http://hdl.handle.net/10453/31751
Digital signaturebased authentication framework in cognitive radio networks
Parvin, S; Hussain, FK; Hussain, O
NA
Due to the rapid growth of wireless applications, Cognitive Radio (CR) has been considered as a technology to solve spectrum source deficiency by improving effective utilization of limited radio spectrum resources for future wireless communications and mobile computing. However, the unique characteristics of CRNs make security a greater challenge. Moreover, due to the dynamic characteristics of CRNs, a member of CRNs, may join or leave the network at any time. The issue of supporting secure communication in CRNs therefore becomes more serious than for conventional wireless networks. Public key encryption and signature techniques have been adopted here to ensure the security of message transmission in CRNs. This work proposes a digital signaturebased trustoriented scheme to ensure communication by identifying efficient trustworthy users in CRNs. The security analysis is analyzed to guarantee that the proposed approach achieves security proof.
20120101T00:00:00Z